{"$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":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"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":"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 235): main has cyclomatic complexity 235 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad0e82a51815c47991c7dca7bf1a3307ca55bb3113a00a04e437e3d4ee64aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline-view.PipelineView (cyclomatic 187): pipeline-view.PipelineView has cyclomatic complexity 187 (threshold 15). Of this number, 61 points are the body\u0027s own statements and 126 belong to 38 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/pipeline-view.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab419abf10ef2d2751364a5bcf8462a23500084884b3a703cc51e4cd3b6401"}},{"ruleId":"D1","level":"warning","message":{"text":"explore-provider.ExploreProvider (cyclomatic 147): explore-provider.ExploreProvider has cyclomatic complexity 147 (threshold 15). Most of this is not in the body itself: 1 of the 147 points is its own statement and the rest belongs to 19 function literals inside it that branch (lines 175, 213, 471, \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 146): merge-tracker.mergeTracker::mergeUnderLock has cyclomatic complexity 146 (threshold 15). To reduce it, separate the cases: extract each independent 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":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ec53f17a807799ba799375e76113b0195c91622d4717cde40031c172183479"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.validateRegistry (cyclomatic 126): employers-validate.validateRegistry has cyclomatic complexity 126 (threshold 15). Of this number, 123 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6814bcd55a05b8fe5b4536c569d34028b5a8a973201083e360683e51ef7bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.main (cyclomatic 125): scan-ats-full.main has cyclomatic complexity 125 (threshold 15). To reduce it, separate the cases: extract each independent 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":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3a1db034d165d1f40b581e0e2faf6e81063e08c35a677656d337c4363b5d41"}},{"ruleId":"D1","level":"warning","message":{"text":"runSelfTest (cyclomatic 124): runSelfTest has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59605726c3b3998745223d0059900f7fe9371dac72351ee7d18c21f3a3ece2"}},{"ruleId":"D1","level":"warning","message":{"text":"inbox-triage.InboxTriage (cyclomatic 120): inbox-triage.InboxTriage has cyclomatic complexity 120 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 93 belong to 34 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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d463415d0ac64e812a76e8289ff9a77bf40ffd1b9a1b37c89f366cb58fbe5"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 112): route.POST has cyclomatic complexity 112 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 57 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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"36876f0db7abfc94000bdb8c4468445afb73acf527d333ede7aacdbf5a5f2167"}},{"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":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b756f9ca866a7ef70b1c7885922a5777ffa6ca8394bed7c448db5d718235ae8"}},{"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":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"08131e93f67b56470f464d04f326b4f4ebb89b1b6bb137ff6acfb8acc5df1285"}},{"ruleId":"D1","level":"warning","message":{"text":"data.NormalizeStatus (cyclomatic 101): data.NormalizeStatus has cyclomatic complexity 101 (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":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d1716df7318468b8e4eaf1dc79e21a7f906a9beb3bb6576b96a9a1541d32dc"}},{"ruleId":"D1","level":"warning","message":{"text":"buildWorkplacePolicy (cyclomatic 97): buildWorkplacePolicy has cyclomatic complexity 97 (threshold 15). Most of this is not in the body itself: 13 of the 97 points are its own statements and the rest belongs to 35 function items inside it that branch (a function literal at line 372, geographyTarget, a function literal at line 431, \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/_country.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bd077f4fd826811ea5ed6216a6c69a5e0d10a740206735f56c89ec71ec81ce"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-provider.ApplyProvider (cyclomatic 95): apply-provider.ApplyProvider has cyclomatic complexity 95 (threshold 15). Most of this is not in the body itself: 1 of the 95 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 247, 115, 384, \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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b50e109fe711af16da1ba151baaea70a9699da8d221accc07c584d99cb884bd"}},{"ruleId":"D1","level":"warning","message":{"text":"scanHtml (cyclomatic 87): scanHtml has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b35a14ac789c95464e7fe4b687faa62fc286b88d2182c5cc16f022765adb58d"}},{"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":1199}}}],"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":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5854fa55f03269d758109fdb70c0f9775e1246f13665af5365b7fc4d7a4b9ce"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.locallyModifiedSystemFiles (cyclomatic 81): update-system.locallyModifiedSystemFiles has cyclomatic complexity 81 (threshold 15). Of this number, 70 points are the body\u0027s own statements and 11 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":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c54b2df2106fe40e64d27fb0f0dae2ef7424a1ad9ecf6fd8b6f84feafd34fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-portals.validatePortalsConfig (cyclomatic 80): validate-portals.validatePortalsConfig has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent 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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a104742b4060bbccac3a9e06c105f546328ba33cd898d0541d5db78c2d5599d"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-ingest.CvIngest (cyclomatic 76): cv-ingest.CvIngest has cyclomatic complexity 76 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 53 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/cv/cv-ingest.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058daa99d2b887b41bbcce02f804ee097f222e423c32ce89caa89aafa6c4283"}},{"ruleId":"D1","level":"warning","message":{"text":"_country.buildWorkplacePolicy.\u003Creturned closure\u003E (cyclomatic 71): _country.buildWorkplacePolicy.\u003Creturned closure\u003E has cyclomatic complexity 71 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 3 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":"providers/_country.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1517d45a87124ae1b3bef8b2196e1a0fb35059da2804a9ba5bdd657f6fce0e"}},{"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 66): explorer-view.ExplorerView has cyclomatic complexity 66 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 13 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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a54f919e4e8e63579e440a5def48161a7a4f8e82f28edc5f48e584459f68f4"}},{"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe3cf67738fe82459bab0bca5e99973cc4cd393de823a55b0842bf57b5f8ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"main::(anonymous)::(anonymous)::processJobs (cyclomatic 65): main::(anonymous)::(anonymous)::processJobs has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb033c906e490824826544e59c82545cc608e98a3ef6a62994ecb4659012b4f4"}},{"ruleId":"D1","level":"warning","message":{"text":"status-select.StatusEditor (cyclomatic 64): status-select.StatusEditor has cyclomatic complexity 64 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 34 belong to 9 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/status-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33f6cbbd65cd48f57ee3567cd592289e6ebfd07f96352355a37a372ba40276a"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.handleKey (cyclomatic 64): PipelineModel.handleKey has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f8d508d49dd66b4b5c55c93a5d83a17a4a7d4134d9325a911da9a33a23505d"}},{"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":"today-dashboard.TodayDashboard (cyclomatic 61): today-dashboard.TodayDashboard has cyclomatic complexity 61 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 27 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/home/today-dashboard.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c3f8c9c1a110be1d77c2a2d2740b23fafe025497ef01a22a659638643a4cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 61): main has cyclomatic complexity 61 (threshold 15). Of this number, 56 points are the body\u0027s own statements and 5 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":"check-liveness.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e46c0c71562359d588cc2a599e58b26f1890e87c917df72cf266b786e8182"}},{"ruleId":"D1","level":"warning","message":{"text":"normalizeAnswers (cyclomatic 59): normalizeAnswers has cyclomatic complexity 59 (threshold 15). Of this number, 54 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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8bb06766fab03c083f17336f7ae11eac7c6b036e3ebceb00b94b4f055f511c"}},{"ruleId":"D1","level":"warning","message":{"text":"followups-view.FollowupsView (cyclomatic 57): followups-view.FollowupsView has cyclomatic complexity 57 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 30 belong to 12 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":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0473ceb696a91fd60128f34704da459691e3abdfe7cf0175f90e3a72cfc753b5"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnose (cyclomatic 56): diagnose has cyclomatic complexity 56 (threshold 15). Of this number, 54 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":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff251b9cf6aa3bda987b36de7972e44271e3439d93f1ca950f1227513aed9117"}},{"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":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7790539f3cae709ee824ce204f2e1de65654bd432bf147e59f3a2a731b2184d9"}},{"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":"parseCompensation (cyclomatic 53): parseCompensation has cyclomatic complexity 53 (threshold 15). Of this number, 34 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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9b1b410c81ddbe2aee2f804aab357c5cb7c63cece0909a0d4aedfbad21585"}},{"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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de62eebb332ba3d4a692f15c40e29a413acda5b2e123e939f8325317f5c6dff"}},{"ruleId":"D1","level":"warning","message":{"text":"checkUrlLiveness (cyclomatic 51): checkUrlLiveness has cyclomatic complexity 51 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 28 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":"liveness-browser.mjs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc435c07bc9f2d04ca13799338217da6637f5efd09002555b8b7fde4c4549c8f"}},{"ruleId":"D1","level":"warning","message":{"text":"classifyReply (cyclomatic 51): classifyReply has cyclomatic complexity 51 (threshold 15). Of this number, 49 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":"reply-matcher.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d10f10107f912a86cd8dcee6b987c355d924f222614a132dc2bf853b55f9c2"}},{"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":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9ed79b1531421e40c9aa548f308440fcdf8dc3546e01bce289c7dd04d6a728"}},{"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":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c4de3c6ecf5c6e0dee1f23e8d015bf63e8e44c145cf7d9d7ad9bb21f592359"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-pdf.generatePDF (cyclomatic 50): generate-pdf.generatePDF has cyclomatic complexity 50 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7a1d7baf1e440592d218d28449ab8b377300870cb81819c848dd31b16dac36"}},{"ruleId":"D1","level":"warning","message":{"text":"reply-watch.main (cyclomatic 50): reply-watch.main has cyclomatic complexity 50 (threshold 15). Of this number, 26 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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"39955b256a146804097a71312fa526f85b070c278d55153ecde3b29cadf242d4"}},{"ruleId":"D1","level":"warning","message":{"text":"session.openSession (cyclomatic 50): session.openSession has cyclomatic complexity 50 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f7648bbb5e175baac64b4431c5053e437b78dcec738b56cb39279938031f1f"}},{"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":541}}}],"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":1546}}}],"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":"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a96548b56a856cf44aacf598a983ac32736cac23c4dc8fabc7b5c52b45919"}},{"ruleId":"D1","level":"warning","message":{"text":"analytics-metrics.canonicalizeArchetype (cyclomatic 49): analytics-metrics.canonicalizeArchetype has cyclomatic complexity 49 (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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"501f77de886af9d69ddc74e99b43cbadfbfaa6ccb0a571cb69a61b92e9c0cc97"}},{"ruleId":"D1","level":"warning","message":{"text":"cssRequestUrls (cyclomatic 49): cssRequestUrls has cyclomatic complexity 49 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 7 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":"cv-templates.mjs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306e8042e10db17ffca14dc1e81d26babd6438f741792b213b659485f0fab50"}},{"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":"lookupSponsor (cyclomatic 48): lookupSponsor has cyclomatic complexity 48 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 7 belong to 15 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":"sponsor-check.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"312014fc77c091b19c7ba20e0a1b95d88b00beafb20b513ab56c73bb672e5616"}},{"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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b94bdf3caf426b1633faba4fde95b8c9b509006d9d325ed3dde900770b9638"}},{"ruleId":"D1","level":"warning","message":{"text":"fetchedUrls (cyclomatic 47): fetchedUrls has cyclomatic complexity 47 (threshold 15). Of this number, 45 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":"cv-templates.mjs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77751696e5ca8f754a027e3a0b3b6b75a53c924077efdbb7487c49031543042"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-latex.main (cyclomatic 46): build-cv-latex.main has cyclomatic complexity 46 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf83b6e904a6fa501f204c027edc518474565ea6a772f508662b586711e04f"}},{"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":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce61304cbf15152dad4faceec872f91f5a9d2f14d6c6c00b8f86ec41a9d11848"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 46): route.POST has cyclomatic complexity 46 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 13 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e474d71723ccbddfe226c692e59f9dddb3c33ea84d23d131ab5da8f9facfeac"}},{"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":5787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e091f30f4fd201d829c051d0ff1cd5020562a52a75168b44bb0ce728c86b4dd2"}},{"ruleId":"D1","level":"warning","message":{"text":"invite-evidence.inviteEvidence (cyclomatic 45): invite-evidence.inviteEvidence has cyclomatic complexity 45 (threshold 15). Of this number, 42 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":"lib/invite-evidence.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf0afcbc83aa81f16a8fdee6afec073eb2f6be3e1be2c9e2a4c2598b58d248c"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-editor.CvEditor (cyclomatic 45): cv-editor.CvEditor has cyclomatic complexity 45 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 23 belong to 10 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-editor.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9905b2c124b14a230c024a2f03f7002349b46d1bf68fb62738276302e05fa83a"}},{"ruleId":"D1","level":"warning","message":{"text":"computePortalRecommendations (cyclomatic 45): computePortalRecommendations has cyclomatic complexity 45 (threshold 15). Of this number, 40 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":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd2c57a7b0382d5c1b13ebc5bca206a779eb0b9dbc083c3179909614f709c97"}},{"ruleId":"D1","level":"warning","message":{"text":"career-profile.doImport (cyclomatic 44): career-profile.doImport has cyclomatic complexity 44 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 19 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":"career-profile.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3708cb3e7039480c34c2e5d0fd736f7125735c0d2367b73d601d0df7b7fe2c22"}},{"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":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65c7ce162d34d18afc751747477e00ed74f557f30da3c1caba714f68f11aab7"}},{"ruleId":"D1","level":"warning","message":{"text":"report-view.ReportView (cyclomatic 44): report-view.ReportView has cyclomatic complexity 44 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 25 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":"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":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9ebdbd40816ee3b22d073673f451ea370a899e08924545710ebae7b562ba57"}},{"ruleId":"D1","level":"warning","message":{"text":"collectDocuments (cyclomatic 44): collectDocuments has cyclomatic complexity 44 (threshold 15). Of this number, 37 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":"github-evidence.mjs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d36ed4f0416c0761d41170529426fdf6e0201f2e3caede1e56aa36b9f5a7f5"}},{"ruleId":"D1","level":"warning","message":{"text":"parseIcs (cyclomatic 44): parseIcs has cyclomatic complexity 44 (threshold 15). Of this number, 41 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":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bf2e0eddeaa66d3703830d2b9274f91915ef2681073145f01fc5737621514c"}},{"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":"verify-cv-facts.structuredAssociationClaims (cyclomatic 43): verify-cv-facts.structuredAssociationClaims has cyclomatic complexity 43 (threshold 15). Of this number, 41 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":"verify-cv-facts.mjs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bebfb18e26cc6daaaada03f37aeb30e0314c4cc859d00f12a9cc32ad76e761"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-view.ApplyView (cyclomatic 43): apply-view.ApplyView has cyclomatic complexity 43 (threshold 15). Of this number, 39 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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bd062db77c07891d33d3f8c331052289e4ec6571c0d7af6c05f2c07d1812a9"}},{"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":"fetch (cyclomatic 43): fetch has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eac34e7306e597781cdfddca2065fafd728063053e1e142b6777cb57cf1c93"}},{"ruleId":"D1","level":"warning","message":{"text":"sitemap.createSitemapProvider.fetch (cyclomatic 42): sitemap.createSitemapProvider.fetch has cyclomatic complexity 42 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 7 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/sitemap.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58582a5c12403eeb1da0aeedb17967e016c7d9c0da5f55e3e933dc91bd151da"}},{"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":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa921a9030caf0209d39bf9a973cd6e3c36d5ec9e7b9b050506386161f6da05"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-ats.cssDeclarations (cyclomatic 42): verify-ats.cssDeclarations 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":"verify-ats.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce092dbd47924039dfb55891c79d928206b56c975a33ec610d09ed4858498b73"}},{"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":"appModel.Update (cyclomatic 42): appModel.Update has cyclomatic complexity 42 (threshold 15). 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, separate the cases: extract each independent branch into its own 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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"768486a7afb563f75471b4b33bc9af80f2e5954e7f7f5b0919adec2cd4499b47"}},{"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":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cfe4c391a80648d827351a38faa1ee444ea71c18fa4c1bca4028abd496a648"}},{"ruleId":"D1","level":"warning","message":{"text":"createSitemapProvider.fetch (cyclomatic 42): createSitemapProvider.fetch has cyclomatic complexity 42 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 7 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/sitemap.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67080628094b4d6bfe8f6d02b9d1613ffcdde4db05c0af94fab79667ca054da"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.readRegistry (cyclomatic 41): employers-validate.readRegistry has cyclomatic complexity 41 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a60b9e808220b811ec5973d2a4b42cdac66d0d645540c4b9ee7a434ce76c14"}},{"ruleId":"D1","level":"warning","message":{"text":"harvest-buildlist.main (cyclomatic 41): harvest-buildlist.main has cyclomatic complexity 41 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 9 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":"harvest-buildlist.mjs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c572882dfff3b41188ef0c5124571ae7e6bc046258821048549cacc16b0b0"}},{"ruleId":"D1","level":"warning","message":{"text":"successfactors.fetchCsb (cyclomatic 41): successfactors.fetchCsb 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":"providers/successfactors.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcd427a63405dcffc54bf7a2ba9a89afb2185d7a91d941eb72cd52cc9b164e0"}},{"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":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a74831fd3aedf2bc5d274c0d9549f3fc15c700090787a901689913351933ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-studio.Studio (cyclomatic 41): cv-studio.Studio has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 11 of the 41 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 195, 239, 145, \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/cv-studio/cv-studio.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"799cd6397325ae3112720568b0c96d3b436a10793981813a6c59bf353e2e76a5"}},{"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 321, 317, 322). 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":316}}}],"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":"templates-section.TemplatesSection (cyclomatic 40): templates-section.TemplatesSection has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 7 of the 40 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 156, manage, a function literal at line 59, \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/templates/templates-section.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20fb7b9906048679ece2ae89ab86ad99bff9e683c5b4e3f764116da29f91bec"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.checkMainChannel (cyclomatic 39): update-system.checkMainChannel 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":"update-system.mjs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"20365628c6d9c3f724bc6e86d54d339fff111584074cf4c04b6f447c0f598dbf"}},{"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":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc150e789050978c73ab17aea18ad28cd2ac8714fb4e159c8e4d40bec668f87"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.manifestProblems (cyclomatic 39): employers-validate.manifestProblems 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":"seeds/employers-validate.mjs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"80843c76a158b3bd7f1fcea4f9b2d90224744a6a7225b3239bbcc769a96698d0"}},{"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":2200}}}],"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":"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":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbb40107ac1c3278a951c1fd2b09c4a387bf33f2f509939cff86612f937bdb4"}},{"ruleId":"D1","level":"warning","message":{"text":"telegram-channel.employerName (cyclomatic 38): telegram-channel.employerName 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, separate the cases: extract each independent branch into its own 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":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b04ee91f15651f8b0dcffc31f4f67e9fe4e926abe0a30d3ae6391c7df9ba3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"cmdRun (cyclomatic 38): cmdRun has cyclomatic complexity 38 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 1 belongs 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":"plugins.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f834e8a65948dbd311c6a33ca84a36a09423ff277f3876c000b3e28dd64a3f28"}},{"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":418}}}],"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":"cadence-settings.CadenceSettings (cyclomatic 37): cadence-settings.CadenceSettings has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 11 of the 37 points are its own statements and the rest belongs to 6 function items inside it that branch (save, toggle, a function literal at line 44, \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":"getOmpEffectivePlaywright (cyclomatic 37): getOmpEffectivePlaywright has cyclomatic complexity 37 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"002f0d578987d813af7dc6768cf86c144f9ff8064ad4aa618ae016b481c71af2"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-templates.tokenizeTag (cyclomatic 36): cv-templates.tokenizeTag 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":"cv-templates.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce9183557262e10727b3eea41adee80fd7b856b6131981bcd19935901e93346"}},{"ruleId":"D1","level":"warning","message":{"text":"job-store.JobsProvider (cyclomatic 36): job-store.JobsProvider has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 2 of the 36 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 184, 153, 226, \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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d87b964c0fb1ccefb11266c2992be9d4c4e18bcd32545fd83a8e76256d184"}},{"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":361}}}],"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":"smartrecruiters.parseSmartRecruitersResponse (cyclomatic 35): smartrecruiters.parseSmartRecruitersResponse has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 7 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 303). 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":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09656f2da9f8a015ed5567ec5dedc5d1befef9f0a51b5f787a5df26ade75e0"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-import.readCoords (cyclomatic 35): employers-import.readCoords 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":"seeds/employers-import.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2819aff395431ee8bbc3419c4f861731b105ea1cf198e168a4ca93612772220"}},{"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":221}}}],"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":"scanBoard (cyclomatic 35): scanBoard has cyclomatic complexity 35 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 1 belongs 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":"scan-dayforce.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d8db250f320cd7f31366a77e934ca174455f69a186f7f4450772da8bdb6515"}},{"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":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a123210b6c3b715bd89b6881536b04751a9669df644ddf8a45419cacb0709470"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 35): fetch has cyclomatic complexity 35 (threshold 15). Of this number, 31 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":"providers/talentlink.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd0e90d224720490a20e7629ab9fdfe70b385c6527723031d6b817fd5471796"}},{"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":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8287e712bae83ae9baf9bd766b91411e7da68c045b56c3d42cd322d7dce8b5"}},{"ruleId":"D1","level":"warning","message":{"text":"session.fillSession (cyclomatic 34): session.fillSession has cyclomatic complexity 34 (threshold 15). Of this number, 30 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":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"95847bd4efb862e82008096ef3f45919e961a7da0a722d3840a0d1afa640b7e9"}},{"ruleId":"D1","level":"warning","message":{"text":"assistant-chat-store.saveChat (cyclomatic 34): assistant-chat-store.saveChat has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 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":"backup.runBackup (cyclomatic 33): backup.runBackup has cyclomatic complexity 33 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 7 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":"backup.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b53a1a257d164087c194c61be2a7401749eacdf9e7458dbbd153ea7e849027"}},{"ruleId":"D1","level":"warning","message":{"text":"himalayas-posting.classifyHimalayasPosting (cyclomatic 33): himalayas-posting.classifyHimalayasPosting 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":"himalayas-posting.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deb8487f00e8bcb584e15d4f071a51a49510722b4464d75299ab99409b0f8db"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.collectSeenUrls (cyclomatic 33): scan.collectSeenUrls has cyclomatic complexity 33 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c534ff10b2b4486d7beada9a6c65d83a789f97078fc614f85688bdd04167023d"}},{"ruleId":"D1","level":"warning","message":{"text":"worker-card.WorkerCard (cyclomatic 33): worker-card.WorkerCard 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":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e17b33cb4453608173952d6bd23b19deb3e439f5a919b1a6c41db2d07421675"}},{"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":600}}}],"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":"browser-extract.readDom (cyclomatic 32): browser-extract.readDom 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 6 function literals inside it that branch (lines 1272, 1284, 1308, \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":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31646a6f63bd9bfe0aed9c9b9698d9231e129be4b87890057ccc6f4ff7e2e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin-mail-drop.importUnlocked (cyclomatic 32): linkedin-mail-drop.importUnlocked 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/linkedin-mail-drop.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75845c2571ba8610406334fe9b918bb1007db1bfc518a4eb83e2a6cf59bc41"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-topdev.main (cyclomatic 32): scan-topdev.main 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":"scan-topdev.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a42738bd40f52ab966640f2c989de857093ac7e178cdf74a7e33218189d508d"}},{"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":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1bcdb69a7c324233a29e5ae2bd3071f6624a540d9efb573adefaecd74599de"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-view.FieldRow (cyclomatic 32): apply-view.FieldRow has cyclomatic complexity 32 (threshold 15). Of this number, 29 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":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d5009b4205f4ba0f2e24269d17b955bf66f1bef4a47fe1c1a67d1f7361f36e"}},{"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":"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 284, 260, 347, \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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffb1ccde8f26ae6cd7c819e25aa83cb8ad178db5e6916c0c39eda427af920ef"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-editor-state.editorReducer (cyclomatic 32): cv-editor-state.editorReducer 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":"web/src/lib/cv-editor-state.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a85956ca797d7102e7d974622c24b2cb8b3f35fad19d54b02a0bb7cc3d8f9"}},{"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":1140}}}],"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":"normalizeTextForATS (cyclomatic 32): normalizeTextForATS has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 26 function items inside it that branch (a function literal at line 344, a function literal at line 386, 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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"47abb3557654ada468eb81b809c81392b39769432711b1508df02044317054d8"}},{"ruleId":"D1","level":"warning","message":{"text":"callOpenRouter (cyclomatic 32): callOpenRouter 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":"openrouter-runner.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889a3ef4698877b4884606b22c8a7d58df8c40405c27054285368322055142b"}},{"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":"parseJobsResponse (cyclomatic 32): parseJobsResponse 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/talentlink.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8749152e002c4bd3427c16a24f47b12cf7e0349cb611376a6ea394b202d9f441"}},{"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":"cv-templates.scanHtml::closeOpen (cyclomatic 31): cv-templates.scanHtml::closeOpen has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This shape REPEATS in the file: one other method here (cv-templates.scanHtml::htmlEnd) 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":"cv-templates.mjs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"507c5e4fef81d6e199e4b9959de98a1f17335ef81be171e161ee6c4aac16d886"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-extract.normalizeUltiproJob (cyclomatic 31): browser-extract.normalizeUltiproJob has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8521604a52a8eb39756bceeb89ae40644916ee0be567f86fc986689e4514034"}},{"ruleId":"D1","level":"warning","message":{"text":"career-profile.parseCv (cyclomatic 31): career-profile.parseCv has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 88, addFact, a function literal at line 130). 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":"9b218b31c33a4487df9946810af8f61dd9c4d22be579c01e054f07f3d8ba5ce6"}},{"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":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ae98178885b7def5f61c1fbab0812f6a9e2e865ca14bddffda3b14ddcccb15"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.inboxLineProblems (cyclomatic 31): employers-validate.inboxLineProblems has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f595ad44b90ba80a7a1b3c99a1010c998e4d45f213c629915fa2ecd772a689"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery-card.DiscoveryCard (cyclomatic 31): discovery-card.DiscoveryCard has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f7567f4bebf3971514444ac3677a9d51984c21f7e073967a97d76a84c14d1d"}},{"ruleId":"D1","level":"warning","message":{"text":"renderInPage (cyclomatic 31): renderInPage has cyclomatic complexity 31 (threshold 15). Of this number, 28 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":"generate-pdf.mjs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8b72be0f6f7f7379fd8f2568781610970a7cf5fb6f8f3d99bb13a30457c78f"}},{"ruleId":"D1","level":"warning","message":{"text":"scanRequests (cyclomatic 31): scanRequests has cyclomatic complexity 31 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 10 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":"cv-templates.mjs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d848d88d3fe04c3033eb0e7f266c9dd4ecfc8e731e8d86807af60776c1445d74"}},{"ruleId":"D1","level":"warning","message":{"text":"computePortalStats (cyclomatic 31): computePortalStats has cyclomatic complexity 31 (threshold 15). Of this number, 30 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":"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":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e0138cffa8638aaa293a300f3d45bd0cff1748781cc753c345ca8136bdc508"}},{"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":4450}}}],"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":"employers-fold.planFold (cyclomatic 30): employers-fold.planFold has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"seeds/employers-fold.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b618438925f7dba8f370b5bba2f77120130d9bf899ba0a11ce8e067405afbd3e"}},{"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":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5a0ab16fcf2e921b8f92cb2d395f77fce47e5f88b54ed8f490579e0478c223"}},{"ruleId":"D1","level":"warning","message":{"text":"data.ParseApplications (cyclomatic 30): data.ParseApplications has cyclomatic complexity 30 (threshold 15). Of this number, 26 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":"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 1409, 1390, 1399, \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":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec82e7bd5cd061cbdb8a4978bbe4527df6335715569ba463a22118007a706f53"}},{"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":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a4f663bf7eaee4f6114d1cbe57e1f3b863ddec0e8f66f46a12699aac297e32"}},{"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":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf3cf717a53a295254e9ad464e62209753d5ad274b3e4db4618a73d53f51c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"readCheckpoint (cyclomatic 30): readCheckpoint has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 9 of the 30 points are its own statements and the rest belongs to 8 function items inside it that branch (boardHolds, isEntry, clean, \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":"harvest-buildlist.mjs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"2986315a9c0614a98720a12e469dd7a5e96bb4dbe4a36ba6551821dfbd10696f"}},{"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":"fetchInContext (cyclomatic 30): fetchInContext has cyclomatic complexity 30 (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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c53ccc9c6a6a50479d1e75c105615103621009eb64d7dd976dcdb2963a65b"}},{"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":"readPrivacyConfig (cyclomatic 30): readPrivacyConfig has cyclomatic complexity 30 (threshold 15). Of this number, 23 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":"lib/privacy-guard.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"566d72973bd599aaf96c62a76c45747fc8d0620658c4ab6a7b85982542b9ce35"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.runCli (cyclomatic 29): verify-cv-facts.runCli 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":"verify-cv-facts.mjs"},"region":{"startLine":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9680e39085b3a5a95ea4ac96b728c3bfe1dcc29a744a4c8612499d12d8416d10"}},{"ruleId":"D1","level":"warning","message":{"text":"role-matcher.roleFuzzyMatch (cyclomatic 29): role-matcher.roleFuzzyMatch has cyclomatic complexity 29 (threshold 15). Of this number, 26 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":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7954fb144cd86ac46b1a836303938b872eed93f0629c0ceba07ef9b90f2e53"}},{"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":1899}}}],"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":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b61b773edcae9da17eb6c3797ac7d0e05b2dee9ae870b4eac6b12db4766473"}},{"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":"query (cyclomatic 29): query has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 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":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ca352584e927463ae8698e39579d51d7c3d74e21789c261bdb5598179c0d32"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeFromContent (cyclomatic 29): analyzeFromContent has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 9 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"887b17e250c666d32902e062cfdf3c78983ae4b1dfb46d5cf1fdf60310e2b238"}},{"ruleId":"D1","level":"warning","message":{"text":"archiveUrl (cyclomatic 29): archiveUrl has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, 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":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdcdc81e30689b1703de7b9b4fd11539796adbf98f8d12c2e910e669b39e266"}},{"ruleId":"D1","level":"warning","message":{"text":"status-hooks.archiveJdOnInterview (cyclomatic 28): status-hooks.archiveJdOnInterview 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":"lib/status-hooks.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf7abaf3184938691d89bc154e401ef9ab0c897de2ef6d08a91055614c3834f"}},{"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":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27678b6df62a1e2306b2e653fe421022c49439506e1f0408262e91184395f83"}},{"ruleId":"D1","level":"warning","message":{"text":"i18n-drift.main (cyclomatic 28): i18n-drift.main has cyclomatic complexity 28 (threshold 15). Of this number, 27 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":"i18n-drift.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f763e30622e16e8bd3217c74ce6940685df7ba3ea2a2b755f14d177af9f0fef"}},{"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":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"7559a3a81b861b3e2c0fe94aac6f9e484bc4db925d745784b1e55483bd02034e"}},{"ruleId":"D1","level":"warning","message":{"text":"openrouter-runner.validateEvaluationResponse (cyclomatic 28): openrouter-runner.validateEvaluationResponse 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":"openrouter-runner.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"af90fa965d75f6c43f0ef5904c087d4c4281fe2f2a8a40ffdfac037bd3bb2974"}},{"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":"scan-seek.main (cyclomatic 28): scan-seek.main 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":"scan-seek.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd30d6e791f8c7bf11ba85727642955d5b272b5a877655b7796484248325778"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 28): route.POST has cyclomatic complexity 28 (threshold 15). Of this number, 24 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":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"303fcb225c4e5e979496f43289451980787303969fac3e266b5c9ce6861086c0"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 28): route.POST has cyclomatic complexity 28 (threshold 15). Of this number, 27 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":"web/src/app/api/runs/save/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5717553b3bdc4c2058de9e73475c807ad7187eaa8afac69a65c5d0cfc63d78"}},{"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":"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":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11bd51867d5fdea4ea59acf963aedf91b61c123b4005b019610a9ce4c83a570"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch::runQuery (cyclomatic 28): fetch::runQuery 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":"providers/workday.mjs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b15f17a736c98f9efafaf37d4f308815009961cab1fe1870623e149746e91e"}},{"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":368}}}],"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":"_html-entities.decodeEntities (cyclomatic 27): _html-entities.decodeEntities has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 141, 161). 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/_html-entities.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d04a3a7839b04f1ca8b44ab403e808171b98322ddb3533b413a6c4d1710c8c1"}},{"ruleId":"D1","level":"warning","message":{"text":"liveness-api.checkLivenessViaApi (cyclomatic 27): liveness-api.checkLivenessViaApi 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":"liveness-api.mjs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eb8e03ca54c0cf2273407e79d5ef4cdfae493378602a913cf083d0e3dd331a"}},{"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":352}}}],"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":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"70feb2b6a117e9b3436c84892914e5e54c88db8d814ae62e23237922c9ecfe22"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.main (cyclomatic 27): doctor.main has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cbc4cf061e0c5d0d7050897d3b85014105eaf8b6e85779ce153e73e8639e09"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.checkInbox (cyclomatic 27): employers-validate.checkInbox 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":"seeds/employers-validate.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"885f8a2cae23ba39dc043839c37555dbb5fa04b084c7b8603d422804f38526af"}},{"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 47, 144, 88, \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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"421e6aae0be40594d0914c5d5363a918a55d0f016d05be49f36f81192e8241ff"}},{"ruleId":"D1","level":"warning","message":{"text":"job-card.JobCard (cyclomatic 27): job-card.JobCard has cyclomatic complexity 27 (threshold 15). Of this number, 18 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":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3568c03e9390734e68e3b9545e7050280cece0ef0f60d53bc5a8a4cefa910285"}},{"ruleId":"D1","level":"warning","message":{"text":"fill-stream.readFillResult (cyclomatic 27): fill-stream.readFillResult has cyclomatic complexity 27 (threshold 15). 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, separate the cases: extract each independent branch into its own 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":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"50118c49138096820223491dff811d7abfe22dfaa345e410e7e48601bbf055af"}},{"ruleId":"D1","level":"warning","message":{"text":"zhMentionsIn (cyclomatic 27): zhMentionsIn 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":"jd-years.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"897812d864aa2c0de4811994f205289748f68269aa59679e100442ec6c21d9eb"}},{"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":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1d496b815105ccd2b262b51829f1b5ec1dd37de653885bcd51d1082eea07b"}},{"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":"planImport (cyclomatic 27): planImport has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 225, lookup, notes, \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":"import-tracker.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9720ce18ba67d59db3ec63e337017533cd324e93a69a333babfb1c8b2e32cb18"}},{"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":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c687b7e61b54285f847e78f68cacc512e37770e89fb988a4df654fd8fbf2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"history-ats-seeds.atsBoardUrlOf (cyclomatic 26): history-ats-seeds.atsBoardUrlOf 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":"history-ats-seeds.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9998a4e73805a899a6e751fcf5f3c6cd66dbb5d6d999e98c6640c354d3b64b8d"}},{"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":703}}}],"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":683}}}],"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":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"085df6c1b1c831d0602b2569f70908f5f048249e5349a38ee30a0a68dd595611"}},{"ruleId":"D1","level":"warning","message":{"text":"platsbanken.parsePlatsbankenResponse (cyclomatic 26): platsbanken.parsePlatsbankenResponse 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/platsbanken.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b303518e8ae6f00823329f4cad618cc4f3a02878d9216a6202fb5af91241eca2"}},{"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":"scan-interamt.main (cyclomatic 26): scan-interamt.main 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":"scan-interamt.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33fc7f4dd2fca8f7c9de71fad530a62321b15e28a8133e829dd107d029e69a9"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduled-jobs-runner.executeJob (cyclomatic 26): scheduled-jobs-runner.executeJob 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":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc1dff723f4f430aa4e7a8ec5231881f1233ac6b2ae3a82345c33414de09df"}},{"ruleId":"D1","level":"warning","message":{"text":"page.JobPage (cyclomatic 26): page.JobPage has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 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":"web/src/app/jobs/[id]/page.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1642b6bdb26201b47106c54c41d60bd65b0f8302a5e6df3e43467fd5bf603d"}},{"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":"PipelineModel.renderTabs (cyclomatic 26): PipelineModel.renderTabs has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9441ae6c0c2cb4f48fe037910c62ef8069197657407d2a9066dda425edc2849c"}},{"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":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"29098dd35edb6c2685c35bbaac34d9e08fa9cb20dd724819dca4c38a3b0345a0"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 26): main 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":"sponsor-check.mjs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4cce427337e7e0835b8ae45863e9244f12edec50d3b71021538054179c756b"}},{"ruleId":"D1","level":"warning","message":{"text":"renderPortalsYaml (cyclomatic 26): renderPortalsYaml 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":"harvest-buildlist.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddbec201a4f6c2d2c0d10c5f3f2a9866947f359a78521420b0cb18520a52006"}},{"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":"loadPolicy (cyclomatic 26): loadPolicy has cyclomatic complexity 26 (threshold 15). Of this number, 21 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":"robots-check.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13c2d04622e033335674855d9b41f9880a3f37c43d1e7639aa3b62a7fb38a3"}},{"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 155, a function literal at line 128, a function literal at line 122, \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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a53e32d70568274d86733a0b9a8e55a7ac5a51f39b3a48faa7ad53697be57d"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.factClaims (cyclomatic 25): verify-cv-facts.factClaims 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":"verify-cv-facts.mjs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6879cf0bbf1b1ca272393c92d342e05f71c333e8eebde3b3b4865c68a5624ec"}},{"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":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ecfc0b95b315e0e3b11615d86440aa9775d6ab01e62cc9965faecf53c0e996"}},{"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":"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 267, \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":212}}}],"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":"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":"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":"claude-usage-scan.createUsageScanner.scan (cyclomatic 25): claude-usage-scan.createUsageScanner.scan has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own 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/claude-usage-scan.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ff0550a686b411d5a0c169d8fac7a9e1dcbb75e4d72f825e73d335f33cb214"}},{"ruleId":"D1","level":"warning","message":{"text":"job-stream.readJobStream::consume (cyclomatic 25): job-stream.readJobStream::consume 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":"web/src/lib/job-stream.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94de03e55f64a4f4ee5af0de7d36dfdea8cb7678257d44ec39f14f610fb96eb"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline-views.viewsForMutation (cyclomatic 25): pipeline-views.viewsForMutation has cyclomatic complexity 25 (threshold 15). Of this number, 20 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":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"489a564f4df4b017550d6a79a4d19eca0ff550fbec5557b415d0ce8421baad2e"}},{"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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053029dbec60ac68fdb7d84b2410fc6e59daaec93780b77e1fcd44ce1d0aedb"}},{"ruleId":"D1","level":"warning","message":{"text":"add-entry.main (cyclomatic 24): add-entry.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":"add-entry.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a43c620bc7027078d4fe33ccbad5f1376053bd0609f7d5c151f8cbb62d26382"}},{"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":"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":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aee627d5c2067c0f9b655acd6d50461d81276ce2d45437f30b25e5a8745302"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.main (cyclomatic 24): build-cv-html.main has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c292e02de7d28f711e6b96a3b729f2cdbe41910faf51964c137725b6dbbe46"}},{"ruleId":"D1","level":"warning","message":{"text":"community-asks.main (cyclomatic 24): community-asks.main 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":"community-asks.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5249cb132ba9f9fe093f1b2fdfca30248105464c69eaf2c9ef188133f9bfc2"}},{"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":"github-evidence.runCli (cyclomatic 24): github-evidence.runCli 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, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb5128229013cdffba2a9b681d0c76064e314a030ffdb4abcd75db192c73de3"}},{"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":"inbox-rank.fitTargetsFromProfile (cyclomatic 24): inbox-rank.fitTargetsFromProfile has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd783d085e29a561493b3756a58a2b46f8d8691a0e52341de8c3c5bdb838a20"}},{"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":"scan-hn.main (cyclomatic 24): scan-hn.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":"scan-hn.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e15204d78988d6f345b8f2c7988447890a9ea946b178c9a69e68bbdb1aa1f7"}},{"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":"inbox-rank.fitTargetsFromProfile (cyclomatic 24): inbox-rank.fitTargetsFromProfile has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048aac2d9f7c98f91bbb79198bb80c49ea22c28f0849791f860616f9b787915"}},{"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":26}}}],"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":395}}}],"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":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccae93388245896a38b9d7187d67c7210054d32e8a9be514a7ce0eedfe876f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeTracker::parseTsvContent (cyclomatic 24): mergeTracker::parseTsvContent 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":"merge-tracker.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dbce63bb9eb3534dbd9121e8e30eb9fd0bb8788fc087c44092e11e9d8077ba"}},{"ruleId":"D1","level":"warning","message":{"text":"workableFeedCache.stream (cyclomatic 24): workableFeedCache.stream has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 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":"scan-ats-full.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77829bbc00488e97d527ec634db2426ada19e5c586d0735749dff7bebc467ee"}},{"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":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"56482558ac9247115f34bf1cb7585a32ba93e5c2d3089fae6c4b6e49269e1b1b"}},{"ruleId":"D1","level":"warning","message":{"text":"scanJd (cyclomatic 24): scanJd 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":"jd-skill-gap.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b0866946d7c184b4cd9752d076ecfcae2a90a633109ff41b03c3c3eeb71bea"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 24): 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":"scan-dayforce.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f8dc350863817a55fd5bab3a9f4e99c1b65f57c347d3ba18315999c41be92"}},{"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":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac98dc4679b102599ca3746f01487aaf189f9def964ca1c66eea85e92d807d"}},{"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":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7388f72d3d41c55a12e76042b7890771881126bcdc71dad3ecc33c4548e372"}},{"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":"audit-portals.auditCompanies::worker (cyclomatic 23): audit-portals.auditCompanies::worker 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":"audit-portals.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"326cf4a28e24e28df665defe7b41acd3e8ba049104658ce1894515310fd1aa34"}},{"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 546, 520). 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":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90f7a7c9d4827d76a277e17b0f9ddeba0e9af96228d2eed1afeec8cd11f9bb7"}},{"ruleId":"D1","level":"warning","message":{"text":"_country.uspsStateCodesBeatingIso (cyclomatic 23): _country.uspsStateCodesBeatingIso 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/_country.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d23835595835a040bb37e31e197c20554cc19de64422a993b71ec0434cf384"}},{"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":"invite-evidence.parseProposedTime (cyclomatic 23): invite-evidence.parseProposedTime 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":"lib/invite-evidence.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d5c5f9280c59a79e188a598559d21c5ef876c4bc43e7847895cf8f639b4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.parallelFetch (cyclomatic 23): scan.parallelFetch 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 7 function items inside it that branch (a function literal at line 4416, takeReady, a function literal at line 4394, \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":"scan.mjs"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"422a585300b0890521e7abdf031ad781cb61f97f96eebdebc98007ff3ca2350f"}},{"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":787}}}],"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":1192}}}],"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":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3a79d2e50aa6e807c04bf9e0afa22de7d8dca28251e014c78f1e4955f2691f"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-import.main (cyclomatic 23): employers-import.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":"seeds/employers-import.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1b5ff895bef3b0d989a415478b74abe3f8493ae09fedd19cd507cec066bff3"}},{"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":"import-tracker.printPreview (cyclomatic 23): import-tracker.printPreview 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":"import-tracker.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fdad9345eb59a6a50c65c9a71d5dfaffe97c509949b96fc4a9e702d9320d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"intake.diffLines (cyclomatic 23): intake.diffLines has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e9eb2f680e8724687d11dbbe581f03efadbaf3214eb980aa69597b63764ebc"}},{"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":2105}}}],"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":"route.POST (cyclomatic 23): route.POST 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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cfb27f106b70bd3374a9f5419a38378c9f9af77d6063a8af6e58a472c6c44b"}},{"ruleId":"D1","level":"warning","message":{"text":"page.ApplyPage (cyclomatic 23): page.ApplyPage 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":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a2bda1ce69a09809a82720afba00a491761ab542cb1c53526f1c581b31164e"}},{"ruleId":"D1","level":"warning","message":{"text":"portals-view.PortalsView (cyclomatic 23): portals-view.PortalsView has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or 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":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6404c3ef8ea7cabb9815cd0c7e3f087e21afbaf1bc324c8392f16a9d515e36d1"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluation-gate.classifyEvaluationGate (cyclomatic 23): evaluation-gate.classifyEvaluationGate 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":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e4e5a3ba9c383d870fd502d52ef97a9cf9d43bb8d931d82a4b54f759067b03"}},{"ruleId":"D1","level":"warning","message":{"text":"studio.studioReducer (cyclomatic 23): studio.studioReducer 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":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e928e584b95d655adb5f82bd9dadb9016a798e489cdd56b0bb7ca0aeb6dbb9f2"}},{"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":"PipelineModel.Update (cyclomatic 23): PipelineModel.Update 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3748fdf398f96bea5d11fc9be0542d9a4e5fc41504a2b933fa6ef090807203bc"}},{"ruleId":"D1","level":"warning","message":{"text":"parseArgs (cyclomatic 23): parseArgs has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 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":"scan-ats-full.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ec967cb8188f11ea309f5e672f4df91513d311b0ac8060fffc3cb73a2ff29b"}},{"ruleId":"D1","level":"warning","message":{"text":"mentionsIn (cyclomatic 23): mentionsIn 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":"jd-years.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c226507232ead78102587b491905c86fd0c42f67aa2853fc41eb63a69617c"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 23): main has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f72959e9232a042ead89de6c0b16727ccb159e4a268d81f64893a275f8b40"}},{"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":356}}}],"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":541}}}],"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":"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":506}}}],"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":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"640afef7c0593c140d93af451d152f29b8b402de53ee4da5c3d01aa3fb813e42"}},{"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":"scan.main::resolveEntries (cyclomatic 22): scan.main::resolveEntries 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":"scan.mjs"},"region":{"startLine":4859}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097d13efa1cd05d60629b73b8385786d280ada9aee6d20bb6bc30ee3ceaa852"}},{"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":"harvest-buildlist.harvest (cyclomatic 22): harvest-buildlist.harvest 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 one function item inside it that branches (worker). 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":"harvest-buildlist.mjs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"47339d20a9687af9ebded1c191786463d302750a7f405154a3d69be92cf08880"}},{"ruleId":"D1","level":"warning","message":{"text":"inbox-rank.titleClause (cyclomatic 22): inbox-rank.titleClause 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":"lib/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6d3e4c96512ed93a2af27e79472dbe47d0f2c8ace9bed605e7e83e67bb900"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize-statuses.normalizeStatus (cyclomatic 22): normalize-statuses.normalizeStatus has cyclomatic complexity 22 (threshold 15). Of this number, 21 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":"normalize-statuses.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cb3ed87acf7ef088d9b513bbac37394dfa3bbd5130ef76a0d7f7e38af9d0fe"}},{"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":"thehub.normalizeHubJob (cyclomatic 22): thehub.normalizeHubJob 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/thehub.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261dd948704393b2fde81eca731b7412a1f677fc51587a8253225dde23e30ff"}},{"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":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9460b734d0aaa1551df5530883aece45edcf9ced8e22f0603cd8cd08d69e88"}},{"ruleId":"D1","level":"warning","message":{"text":"decision-card.DecisionCard (cyclomatic 22): decision-card.DecisionCard has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or 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":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07c59d0e2d2cfa723644abddabb303adb89aa0f7ec9ba481ac693d4443d53da"}},{"ruleId":"D1","level":"warning","message":{"text":"onboarding-progress.OnboardingProgress (cyclomatic 22): onboarding-progress.OnboardingProgress has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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/home/onboarding-progress.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e6528fb61af3bca0889e307db8d67acdf60048b2a7d398d932e83393eb5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"analytics-metrics.computeStatsMetrics (cyclomatic 22): analytics-metrics.computeStatsMetrics 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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"42017f15a9b81967763e70c277805f093125f592e4b0462232e8a9caf066caea"}},{"ruleId":"D1","level":"warning","message":{"text":"inbox-rank.titleClause (cyclomatic 22): inbox-rank.titleClause 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/core/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75355ba03044d94267252f60a889d979187388842fb923ebfbce52a1445a633"}},{"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":"foldDriftKeys (cyclomatic 22): foldDriftKeys 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":"verify-cv-facts.mjs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a52271d928720c83c783fdf58b27d153257d004b99ece0477073794590c5d7"}},{"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":669}}}],"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":"fetchHtml (cyclomatic 22): fetchHtml has cyclomatic complexity 22 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 11 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":"lib/jd-page-fetch.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28a82e452b96eec71b543dab88b5a74c7f99f812036cdd15be5aed3848d70d9"}},{"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":1363}}}],"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":"verify-cv-facts.predicateWords (cyclomatic 21): verify-cv-facts.predicateWords 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 3 function items inside it that branch (a function literal at line 2492, takesObject, isVerbal). 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":"verify-cv-facts.mjs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3ef2bc9df14236b8fa167288a28255609c88c2d9d8596811dc492f706d1a68"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cv-html.runMarkdown (cyclomatic 21): build-cv-html.runMarkdown has cyclomatic complexity 21 (threshold 15). 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, 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-html.mjs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c82f12bce7fa5f054ff50b1837837039ade69d683ab36e5994c934d0f996581"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-portals.verifyOne (cyclomatic 21): verify-portals.verifyOne 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":"verify-portals.mjs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62632bc892211fdd187e844d5ab62ffac254da07769369a545a4d0efbc81d53"}},{"ruleId":"D1","level":"warning","message":{"text":"validate-profile.checkKnownValues (cyclomatic 21): validate-profile.checkKnownValues 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":"validate-profile.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9668a3fc9b1c277a4cd5c4c7bd9fb4921acac69cdf8ba70591b892d8d381637"}},{"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 514, 550). 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":511}}}],"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":"workable.parseWorkableWidget (cyclomatic 21): workable.parseWorkableWidget 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/workable.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"762c67789004044286dc8375403f2ba29c8d6d013a0e22234837f4889dbb308a"}},{"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":"pinpoint.parsePinpointResponse (cyclomatic 21): pinpoint.parsePinpointResponse has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 134). 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":"employers-validate.main (cyclomatic 21): employers-validate.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":"seeds/employers-validate.mjs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec68dc5e45e79976e629771de2e5ab7b6e1e013d88c7b06f492fc52e3ee6d25f"}},{"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":"telegram-channel.classifyLink (cyclomatic 21): telegram-channel.classifyLink 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/telegram-channel.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd561acac955e65ba49db6781a67bb1abd4fdecad3142e0f96d9fa2496edab5"}},{"ruleId":"D1","level":"warning","message":{"text":"trakstar.parseTrakstarPage (cyclomatic 21): trakstar.parseTrakstarPage has cyclomatic complexity 21 (threshold 15). Of this number, 19 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/trakstar.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79b1c10462333041ead3fb4742f2107a3fc33660279194c60da9631414248d7"}},{"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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da2bf8018eb096d372b511e03a3aab00be57eb328d56dadc20d63890c9351aa"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.workableFeedCache.fetchStream (cyclomatic 21): scan-ats-full.workableFeedCache.fetchStream has cyclomatic complexity 21 (threshold 15). Of this number, 12 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-ats-full.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba4f817fffad32fcf6d30112a8719fa8c2612f75dff0967a4c6091d5e26529f"}},{"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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8417bb19fdac6dbf42855bb8cb99fe722b7ba7547bcbbbbdcd52e3cf3e98d32"}},{"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 43, 63). 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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac15a42e011c4672b39b91f1c8ce3502d862a17e7628bf8fce3d2334e759fc28"}},{"ruleId":"D1","level":"warning","message":{"text":"mark-pdf-ready-button.MarkPdfReadyButton (cyclomatic 21): mark-pdf-ready-button.MarkPdfReadyButton has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/mark-pdf-ready-button.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c071ef5fb17dd2e9331c50c1556475634caa75ae5153b6b7f7b20c88712accda"}},{"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 57, a function literal at line 167, 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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9cd0a6747fa83b91041601c15d9db4d862654f5104e2668157a3902bb392b2"}},{"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":433}}}],"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":579}}}],"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":"PipelineModel.renderPreview (cyclomatic 21): PipelineModel.renderPreview 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/pipeline.go"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"de024f7e10144ed2eb4a8ed8d55d5cb00096963a49d8431dbcccca6a2f14fd47"}},{"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":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b629a06e71d222049745640d87a128a9eccf541edbf00cb9a563e80eeb7b8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"waitForJobText (cyclomatic 21): waitForJobText has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 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":"openrouter-runner.mjs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad1673208fd7d1faeb76cd72d1568cc327e3829c87d17f7d0ef5ffbfa515091"}},{"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":"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":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae7957221763107155b96c6fe7ebe178e8a897b83995efe7c13414301fdf578"}},{"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":"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":"consumeEvent (cyclomatic 21): consumeEvent 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":"openai-eval.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6879375b8d5e8587d166f2c3bb2396efc9ebed610e2f876b4bfc274ef2bf0f2d"}},{"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":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b74e10d4942740e36a61e56d1ab55df4bfd69a87e4634cde0dfadfaa54242a"}},{"ruleId":"D1","level":"warning","message":{"text":"_salary-text.parseChineseAmount (cyclomatic 20): _salary-text.parseChineseAmount has cyclomatic complexity 20 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/_salary-text.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8768734207fc9ff9cc123730ad3e7e044be8fa8a5f7024ca65ea3590ffbd0a86"}},{"ruleId":"D1","level":"warning","message":{"text":"browser-extract.normalizeHibobJob (cyclomatic 20): browser-extract.normalizeHibobJob has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 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":"browser-extract.mjs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"57530ae34efafac23a884110eedbfafc65b5e994f6e97fccabbfc73d5c6fbe1d"}},{"ruleId":"D1","level":"warning","message":{"text":"talentlink.parseCriteria (cyclomatic 20): talentlink.parseCriteria has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/talentlink.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb9b880253924c3d640c2ee2f1ebc3fe26be98b47a69fabfc7ee4754a565bd"}},{"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":289}}}],"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":1666}}}],"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":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd5cbd795282d9a26296e47dbb71ec6fe1a3f0e6366ac6ef921afd57c17d363"}},{"ruleId":"D1","level":"warning","message":{"text":"breezy.parseBreezyResponse (cyclomatic 20): breezy.parseBreezyResponse 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/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c61ba51470e0bdc71912c0773f66fc4e3bdf55c72c52edf381ceb4ab372a55"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-cover-letter.main (cyclomatic 20): generate-cover-letter.main 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":"generate-cover-letter.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d20a656de30a964856ec0351af9a04222c5b9a1d0f9b25ece3c2b125edf4d6"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.parseArgs (cyclomatic 20): employers-validate.parseArgs 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/employers-validate.mjs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b279f62b735c61dde6a2a79058e8b27c12bba2f6fc73d3fc82c3030a874682e"}},{"ruleId":"D1","level":"warning","message":{"text":"harvest-buildlist.boardFromUrl (cyclomatic 20): harvest-buildlist.boardFromUrl 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":"harvest-buildlist.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b39463a8bd12b206f5c180ef7a35629744e4ce850de230cce43e8a748ce5f"}},{"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":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67ef44bb2d32abcdd0017108f3d6e1b8e9ea4ae205488a2c3c8df485d1fd5cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ics-interview.parseVtimezones (cyclomatic 20): ics-interview.parseVtimezones 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":"ics-interview.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df6e68d9b9ed663270b8a61bfe61a86aade273e632a75f94ac258f75ff5422d"}},{"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":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d153c5206a35a664d088ff52bd8a61391832e87877c6c4506715b0149b3eafe"}},{"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":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb023f3de5531631025aa128bc82ae6b4f1648fe5e8ed29c152fabecefaa3229"}},{"ruleId":"D1","level":"warning","message":{"text":"arbeitnow.normalizeArbeitnowJob (cyclomatic 20): arbeitnow.normalizeArbeitnowJob 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":"providers/arbeitnow.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f75a435f0d5ff805332ce1e38e0be52cfb4b99926ac3bca7e3fff40ea7ce32"}},{"ruleId":"D1","level":"warning","message":{"text":"bulldogjob.parseBulldogjobPage (cyclomatic 20): bulldogjob.parseBulldogjobPage 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/bulldogjob.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcdedc040e9956acc4665749b6be930e6ceeb2daddb4c8f2de35e81f84e3c50"}},{"ruleId":"D1","level":"warning","message":{"text":"comeet.parseComeetResponse (cyclomatic 20): comeet.parseComeetResponse has cyclomatic complexity 20 (threshold 15). 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 literals inside it that branch (lines 125, 159). 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":"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":"factorial.parseFactorialBoard (cyclomatic 20): factorial.parseFactorialBoard 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/factorial.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74bf22128167d341db961e3519a16ae45b66a8e7bf2c7fa37b8d98a63037cc4"}},{"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":124}}}],"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":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919d29929e3ad2dbdda77cd9889d8c08e4b8a057931b228d226b88955405fc0"}},{"ruleId":"D1","level":"warning","message":{"text":"scan-ats-full.runSeedScan (cyclomatic 20): scan-ats-full.runSeedScan has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1400, fetchBoard, a function literal at line 1380). 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":"scan-ats-full.mjs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec205845845eb836c36fa153e19203f0c8b24eb40d36f284df59dfd76adf88"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-pipeline.checkPortalsCoverage (cyclomatic 20): verify-pipeline.checkPortalsCoverage 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 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":"verify-pipeline.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"addb4fd4a7bf6ef5b4e29630fcdd7d114a8c09ef850df213c4da14944e5c4e87"}},{"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":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd55a59f86db0b7f04de8f43b3270d0714665aa5491394e1fe8498c7bea5bf"}},{"ruleId":"D1","level":"warning","message":{"text":"command-palette.CommandPalette (cyclomatic 20): command-palette.CommandPalette has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (onInputKeyDown, a function literal at line 49, a function literal at line 27, \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/command-palette.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4248daa80c4f4e7b7f2d8824984d9e01ac2da324b5c51b32df68e01f6806c8"}},{"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":"pipeline-views.normalizeView (cyclomatic 20): pipeline-views.normalizeView 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":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8ccaca68d7b9284aebe26f2706e658d001760f17b774b856e1afc11f3dc67f"}},{"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":134}}}],"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":"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":1934}}}],"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":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"521734fb4448a4b1efc92e2428628671c89c9bbe208f7db20becdba0b5907eb9"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch::split (cyclomatic 20): fetch::split 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/workday.mjs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bacb5bf8d120160aaa01a001f46dfc703aa05068be1841d7ce369d9121a24f"}},{"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":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c161ad839dfe20719d3fbdd69d6ee6bd328f675f4bf1e6043d023fb8bf62e0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"fetchJobPage (cyclomatic 20): fetchJobPage has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 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":"openrouter-runner.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aab08c8a4e45a63d7a32a2ed67b7d755127eeea234a10e1dedf6e24d5ef003"}},{"ruleId":"D1","level":"warning","message":{"text":"cmdEvaluate (cyclomatic 20): cmdEvaluate 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":"openrouter-runner.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4cd43dd077ef4417ac5d28c7c976a22dc10d9c220ef7af41adacd3feca1581"}},{"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":"latinHeadingKind (cyclomatic 20): latinHeadingKind 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":"jd-years.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c35fc863e076b861bff68e7f4e648fb0ddecb41443b349480a8360961e7ad7"}},{"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":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca64fdb5909fbfa4bff99e2e1756c7cead2ea5d2bdf4da89a7884a9662d4f97f"}},{"ruleId":"D1","level":"warning","message":{"text":"loadWorkableFeed (cyclomatic 20): loadWorkableFeed has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 627, 680, 655, \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":"providers/workable.mjs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab22bc7503e40093414a6bfb09e25dd29621d4162220f9abcd5998a6cad5079"}},{"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":"buildPrompt (cyclomatic 20): buildPrompt 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":"web/src/lib/run-prompts.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6268783a02bcbb5081f7c3d48234023847ddd96aba4453b857ac71aebe4f4aec"}},{"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":"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":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"819c2a44d943d31f4bd1a00e7866817b00d4c5ec492b35fff2481231e32031f8"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-parse.fromLdJson (cyclomatic 19): jd-parse.fromLdJson 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":"lib/jd-parse.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9163478021b8119cbca1431691e8c1f7771215e4b362444b0dad27b5e792935"}},{"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":"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":1086}}}],"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":937}}}],"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":275}}}],"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":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc9e7c3f10ee35790ecc3fe3772b092044f73586486003720ec945abc0b12f0"}},{"ruleId":"D1","level":"warning","message":{"text":"privacy-filter.buildRules (cyclomatic 19): privacy-filter.buildRules 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":"utils/privacy-filter.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"573bf1cf51803a68fde6a91cb841f5a4314c82303cb8618bb1e92ffa3f1f1d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.readInbox (cyclomatic 19): employers-validate.readInbox has cyclomatic complexity 19 (threshold 15). 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, separate the cases: extract each independent branch into its own 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/employers-validate.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"802665093768c7c713317b315b62fffec29820187cdad3373286eacea92a098d"}},{"ruleId":"D1","level":"warning","message":{"text":"ics-interview.firstEvent (cyclomatic 19): ics-interview.firstEvent 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":"ics-interview.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2af70001d2a50d0a2d0c6dc9d5e728e1654721f99246c325f2b30cae6c7ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"a16z-speedrun-talent.normalizeSpeedrunJob (cyclomatic 19): a16z-speedrun-talent.normalizeSpeedrunJob 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/a16z-speedrun-talent.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"66667b32a9e857b40389e917069308d47029a6d754fc676c50b281ea794637c6"}},{"ruleId":"D1","level":"warning","message":{"text":"applicantpro.parseListResponse (cyclomatic 19): applicantpro.parseListResponse 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/applicantpro.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f4be01d1e06ad1113b50208b66ccffa162330ff955bf433b1365f5a2a7c6ea"}},{"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":"jobicy.parseJobicyResponse (cyclomatic 19): jobicy.parseJobicyResponse has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 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 249, 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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe9d1fb257b396212ce73e834c758c2777fc191083a2396ae35d959016aecac"}},{"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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c66b476eb3f67a2b85f389af54d0e599556b6edccd982b17ccc788613dec0c1"}},{"ruleId":"D1","level":"warning","message":{"text":"polymer.parsePolymerPage (cyclomatic 19): polymer.parsePolymerPage 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/polymer.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169133ccd58d66cdbd7ea09c65db7988d40a93d4894a90e8bd35d227acd7fd6"}},{"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":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"82200a796285164bdae6924a303afa10c01bc5352526980cbb5c1148cb92301e"}},{"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":1160}}}],"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":"triage-row.TriageRow (cyclomatic 19): triage-row.TriageRow 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":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e11b2651823bd0bb44870000509f2a9cf8c670a1af0fe8a448240403e45e923"}},{"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 32, 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":12}}}],"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":264}}}],"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":"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":"job-gate.evaluationGateForJob (cyclomatic 19): job-gate.evaluationGateForJob 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/job-gate.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7763f1e42676888c52271d6f1762b0ed189dec18347ae8e5b6d877b93293b200"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.handlePendingKey (cyclomatic 19): PipelineModel.handlePendingKey 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_pending.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e7d0687690a84a29cfaca89fc71aec39f5e9c1b4c44d41824263bb7dcfc710"}},{"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":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"994512fd290bdfa9d100038184ab410f65ca9a6ab1319e1b723118152a759e51"}},{"ruleId":"D1","level":"warning","message":{"text":"syncIndex (cyclomatic 19): syncIndex 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":"tracker.mjs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bacd1c9de755f60d5b1321e09e91933cbab1faea2f582367275e25942dfc9f"}},{"ruleId":"D1","level":"warning","message":{"text":"planScanHistoryPrune (cyclomatic 19): planScanHistoryPrune 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":"detect-reposts.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8816ca050b944abbf51996248e90cf19e711202561360ef0c07784d11f380f"}},{"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":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"075f47e1ce53b66aa936fee4cac59632235dd8ff6fa375e7bb9b6db7d893e70d"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect (cyclomatic 19): inspect 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":"lib/privacy-guard.mjs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6287dfd5ee905a45526fdf397c1cdbcf839c34d3a9758db2dd7654b1112a5ac1"}},{"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":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fca81d775985aeaf081ae0dac6f325db287e5a9b0563e602712888e8111c46e"}},{"ruleId":"D1","level":"warning","message":{"text":"parseObservance (cyclomatic 19): parseObservance 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":"ics-interview.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2dca2a391bcc59a005b1a0e2074db1c68325c9d60a73a0167f2a0db6e8891f"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 19): fetch has cyclomatic complexity 19 (threshold 15). 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, separate the cases: extract each independent branch into its own 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":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a6a3573d4ac8b93c0efa53fe5c0e7218bda2bd14846063c45acfe34e0b9ca"}},{"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":"liveness-browser.extractApplyControls (cyclomatic 18): liveness-browser.extractApplyControls has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 4 function items inside it that branch (linksToPosting, a function literal at line 540, isOwnApplyAnchor, \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":"liveness-browser.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c914c86f04a466459257e6e5c189a6efca29bd1a7992d8d7c7206ccd8779a695"}},{"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":480}}}],"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":"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":1407}}}],"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":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5040fd068b8d75f97d084c2fb3e40bbc8bee3fb6c788475a8526b16e239081"}},{"ruleId":"D1","level":"warning","message":{"text":"batch-evaluate-gemini.processOffer (cyclomatic 18): batch-evaluate-gemini.processOffer has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"240c48e81d33c5195cf0aac28043d8ecddb8fd27dfcff92e41d951b97bab5739"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-page-fetch.withoutExpiryViews (cyclomatic 18): jd-page-fetch.withoutExpiryViews 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/jd-page-fetch.mjs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"640149b4434ecfa7799727e2289a2d69b11e1d0d5244291a6bf58dac25d92803"}},{"ruleId":"D1","level":"warning","message":{"text":"hibob.parseHibobJobAds (cyclomatic 18): hibob.parseHibobJobAds 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 cases: extract each independent branch into its own 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/hibob.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c76500589ee5c5617e7dd94de4c052b71c2dcc94c2b6f5c48e3603b0746493"}},{"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":170}}}],"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 498, 474). 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":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9332c9f5345d4e42bb395c70fc67e08c34100cc3b9891142084c319ad40acf0d"}},{"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":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a287a9caf9a6a7b674bc1b38f18dd327f86cf905fce4b19fa54b1f4ed0b979"}},{"ruleId":"D1","level":"warning","message":{"text":"clean-markers.processFile (cyclomatic 18): clean-markers.processFile 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":"clean-markers.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"507f54680ab8c975fef77efde59db11eabb986374e33304e1f19c07e05890748"}},{"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":628}}}],"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":826}}}],"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":58}}}],"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":180}}}],"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":271}}}],"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":280}}}],"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":"aldi-nord.parseQueryResponse (cyclomatic 18): aldi-nord.parseQueryResponse 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/aldi-nord.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efa0d7bf47a2faf3f4a554f652745d2bdfa531b467ad7ac204753e0e1bd14da"}},{"ruleId":"D1","level":"warning","message":{"text":"jobvite.parseJobviteXml (cyclomatic 18): jobvite.parseJobviteXml 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/jobvite.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b44a9ee067affff2a2f953ab1b255c2d4820ace1b13bb8e459a724bc1b5e2a"}},{"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":"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":"template-editor.TemplateEditor (cyclomatic 18): template-editor.TemplateEditor has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 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/templates/template-editor.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"36003977e6d8684b49a641afbf72b8be4707801a9d72fe37f9cc60d87d36acfa"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef747355785ba11b5ba06904dd02337489462676321df14a56db87b530b94fa"}},{"ruleId":"D1","level":"warning","message":{"text":"handoff-gate.handoffDecision (cyclomatic 18): handoff-gate.handoffDecision 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":"web/src/lib/apply/handoff-gate.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"faee881a44d50a12490ec9bca7f2a6cd503626f310f9e03a14a7a6b893203f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"inbox-keys.inboxCommand (cyclomatic 18): inbox-keys.inboxCommand 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/inbox-keys.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3088ebaab81d99b45a161cf0d7ecf2816d1cf8052c76caacc833dac94061175d"}},{"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":118}}}],"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":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"b151d87439e4c366c34fd03bea419e133a51617d173aa15aee1c2880bfbb43d0"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.View (cyclomatic 18): PipelineModel.View 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/pipeline.go"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8576e21e37c47f0c5ee2f67ef352fc7cf26f954990df163f49806c7ab1933a"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineModel.renderAppLine (cyclomatic 18): PipelineModel.renderAppLine 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ecaa52b2f7619392c7febe93750aecfe7e57dd92016828126ac923b04e9b3a"}},{"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":345}}}],"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":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f104fb480c723cef58f9a06a6be47fd12976417ab1170e323a7ea670a1ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"buildContentFilter (cyclomatic 18): buildContentFilter has cyclomatic complexity 18 (threshold 15). 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, separate the cases: extract each independent branch into its own 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":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1e2a321ed8909ba665dff0a05ae2e6dd9510a81bd5c3960fd80d307cf04166"}},{"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":3254}}}],"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":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3755d4e344770db5b3fbed31467125482b7e7b85905ae78ed4781e71e73e5a"}},{"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":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f6bb9a624bc6b14523539c863e7c7a6516722aa3e2783618c545a9662ab0b7"}},{"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":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efbc1ca5463c78d0beb12742f6dc3b6cceabb60a6a34c2d8fbf66eae1a34bff"}},{"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":484}}}],"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":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0c05677ecec597f54facd911f7e182bb304840236c89821b914795a25b3d19"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveTemplate (cyclomatic 18): resolveTemplate has cyclomatic complexity 18 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff13787cc05039d0c4b9582a2f722de98c75910ee03e708b3baea92d01d08dd"}},{"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":1109}}}],"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":348}}}],"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":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca83b37f3a7262bc68809922a9079ee8ee20fe28b79fd2e890e870291ecc09"}},{"ruleId":"D1","level":"warning","message":{"text":"resolveDestination (cyclomatic 18): resolveDestination has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909e38bb1b743d51af90fbde2c71d17e1f7cd8c4fce51efa3bf1affe2450527"}},{"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":"inspectPage (cyclomatic 18): inspectPage has cyclomatic complexity 18 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b01a6ad96ae644a87f7b5981516078dc214abc502c4167ee11e83238f66e0d5"}},{"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":"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":"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":"dir-lock.createRelease.release (cyclomatic 17): dir-lock.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":"cb9af92b123ee686dbe4b17c22499c077b1b743714fa6deb3fdee58c5c8da03c"}},{"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":"cv-templates.scanHtml::htmlEnd (cyclomatic 17): cv-templates.scanHtml::htmlEnd has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (cv-templates.scanHtml::closeOpen) 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":"cv-templates.mjs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43363c3c9c367915ef20e215c4f52c2c12a56095b96b4a24b8fde08a9f92106"}},{"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":778}}}],"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":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a900d6f4b911252120f9de95dc5ea77574342886be5147995faef4ab4fd5582"}},{"ruleId":"D1","level":"warning","message":{"text":"update-system.checkStatus (cyclomatic 17): update-system.checkStatus 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":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd0d6bb0fe20d8a41ef99306fbeae87ddf2ecb1b247fa35ecab03344841f7a9"}},{"ruleId":"D1","level":"warning","message":{"text":"backup.templateUserFiles (cyclomatic 17): backup.templateUserFiles has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"857c3fcb4e9da0e74396804c19fc9da3c32e910ec6381be668213c67563924bb"}},{"ruleId":"D1","level":"warning","message":{"text":"jd-rescue.main (cyclomatic 17): jd-rescue.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":"batch/jd-rescue.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1f7f31046a3fdb2578980237887d1340517584c1307ebd110dc01ab65a6308"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.bulletDriftClaims (cyclomatic 17): verify-cv-facts.bulletDriftClaims 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":"verify-cv-facts.mjs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2429b054ce1d093ca591d1ece0485f6ef189c28749a12fde520f3ff8cdf40e83"}},{"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":"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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc0fe21d768d3fe0a46f6eeb0c508e8026230b9c694294f9f68a2149b1ad00"}},{"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.buildLocationFilter::filter (cyclomatic 17): scan.buildLocationFilter::filter 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":"scan.mjs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b0415022015686d7849248403e732eda5f94359b673df8c96bd1ba0a366056"}},{"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":290}}}],"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":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4878fa358a24897dc2fb40da8d0b2380344ed2e5b81876a8d15a7201eb0d9f"}},{"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":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea691304ce550e34b099b0ad793c090026fb1ae19b8802833dacd34f1642d0"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-import.parseCsv (cyclomatic 17): employers-import.parseCsv 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":"seeds/employers-import.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a03940245538286b59856d831e1f484cbbbe32dc576dcf0ae0c89545b56175"}},{"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":"adp-myjobs.parseListPage (cyclomatic 17): adp-myjobs.parseListPage 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":"providers/adp-myjobs.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b702fcc187c31dc705a785a8338d02be3fe4950ca6e26926d2211b3e371ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"aldi-nord.resolveConfig (cyclomatic 17): aldi-nord.resolveConfig 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":"providers/aldi-nord.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a8e68f7cc5bc2b6d7d3a6c1dc2a1fb027957c5bbfda764b7fcd0cdb93496af"}},{"ruleId":"D1","level":"warning","message":{"text":"applicantpro.parseDetail (cyclomatic 17): applicantpro.parseDetail 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":"providers/applicantpro.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"102dd653eaf552722b56a7e1033c88ee4bd0512460ec7559fe6307f63e903025"}},{"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":"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":"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":"germantechjobs.parseGermantechjobsFeed (cyclomatic 17): germantechjobs.parseGermantechjobsFeed 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/germantechjobs.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb43a6daf4deee3ab5576b74022748e9d6d63af2286ae0b9abe2396d5594a3f0"}},{"ruleId":"D1","level":"warning","message":{"text":"gupy.normalizeGupyApiJob (cyclomatic 17): gupy.normalizeGupyApiJob 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/gupy.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25f9546c6362b3e37d4d904d074b2789ebc3ee6ef36e2aa35c5bca1b19374ea"}},{"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":199}}}],"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":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f9b9cfed90cfa3e87e6762aee8bf6ef4bac92f151ff5e86f028461ee39df1"}},{"ruleId":"D1","level":"warning","message":{"text":"remote-com.parseRemoteJobs (cyclomatic 17): remote-com.parseRemoteJobs 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/remote-com.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2419af5ecd02875691d0cd018bf65a79db2587fda71aab68eb0d5323a2fb3012"}},{"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.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":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0dd0c0f165cfaf252b3bebe76e5def20aa80c3ebd0dcbbda3d966a0b0b87c"}},{"ruleId":"D1","level":"warning","message":{"text":"telegram-channel.postToJob (cyclomatic 17): telegram-channel.postToJob has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7718e603840321e3cc27ca73d100b191b0bd5294d6c3851e46a6299b8ea744b"}},{"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":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6b310ad8fc577a4382b1f79b879665df3434e444780fff2c6ebf370580445f"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-tracker-url-match.runCheck (cyclomatic 17): verify-tracker-url-match.runCheck 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":"verify-tracker-url-match.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f51e6dd78219cc25383fe32835a0418a9dae5daaa0d36adb8dcae455801be0"}},{"ruleId":"D1","level":"warning","message":{"text":"dir-lock.createRelease.release (cyclomatic 17): dir-lock.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":"3f5954afd753430849201d69bcf99c99a1f95522a66930e91bee2bbf3b0bbc68"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-checklist.AppliedButton (cyclomatic 17): apply-checklist.AppliedButton has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 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":"web/src/components/apply-checklist.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77548199c873362b4d48c08b99ea4688ff340c59661c4ff2a0bf6043ed8c6d1"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin-paste.LinkedInPaste (cyclomatic 17): linkedin-paste.LinkedInPaste has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, a function literal at line 37, a function literal at line 81). 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/linkedin-paste.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff86d5938d7ab4602a47bf04cc55ce7ed9cf4f7a1f8e0151705fd89a26c6ea2"}},{"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":804}}}],"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":"cv-pdf-file.locateTailoredPdf (cyclomatic 17): cv-pdf-file.locateTailoredPdf 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-pdf-file.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12486b12baf43972a6194e9c373d243a5cff54781250ebd69fef2226cae8d27"}},{"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 158, 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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"279ce1ec5a743244058d20432621c74a6f18de78afd45b8965995aeba4ac8e50"}},{"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":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400f0644c1ce0c0d0a3b1bc03a1b67ebdd019b4f32d02ccf9d654c2911f021d"}},{"ruleId":"D1","level":"warning","message":{"text":"buildCooldownFilter (cyclomatic 17): 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 5 function literals inside it that branch (lines 1701, 1732, 1730, \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":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb621c4c52c46760912bd0e82d2f8a6ec56f9ac30d343ed4623b8f9c26e6559"}},{"ruleId":"D1","level":"warning","message":{"text":"verifyFacts (cyclomatic 17): verifyFacts has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 19 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":"verify-cv-facts.mjs"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12fd874e8f8a9974a151cf9a7aefd38b36e63de992b252fa45ff87b25ebdbc6"}},{"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":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"014db3151bd454da767d60a960343fa2858a64cf12144b122eeb3f9209d8d249"}},{"ruleId":"D1","level":"warning","message":{"text":"renderDocumentsMarkdown (cyclomatic 17): renderDocumentsMarkdown 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":"github-evidence.mjs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"02658cd8f058e0c932399f32bb8ae5e21bafd5a7e66146c4a50f771f20c966f0"}},{"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 301, a function literal at line 286, 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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"8815af5cb36b0394839e1eaf7d3deb278eb420aa23b9062d2d2d0c1f3824dc65"}},{"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":"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":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6213afbee3cc19d58459fd9af58f4247439a066ac4496ac63bec30382aa99c81"}},{"ruleId":"D1","level":"warning","message":{"text":"makeGuardedFetch (cyclomatic 17): makeGuardedFetch has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 7 function items inside it that branch (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":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9592317bcfead1773cc874b0343ed1dbfcffed90f5a42879588ca6775f3c044c"}},{"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":"parseA16zPayload (cyclomatic 17): parseA16zPayload 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":"seeds/vc-portfolios.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b402b3f2e674724f2a368842820ba32ce00c0c2e63cdd7d1b2d11e82c0e1f6fa"}},{"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 353). 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":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fe7084620a8a18f67a7705a569db2e038f9b87fb83dbed0939645d6e76eb15"}},{"ruleId":"D1","level":"warning","message":{"text":"url-key.canonicalJobKey (cyclomatic 16): url-key.canonicalJobKey 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":"url-key.mjs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff258a9eb6666bb91050a4da36823434d15953956c3e2152b3b302c16ba8c37e"}},{"ruleId":"D1","level":"warning","message":{"text":"_net.resolveAndValidate (cyclomatic 16): _net.resolveAndValidate 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/_net.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8c3895cc7767f45d520f379f3b81646a5f18d1156437307e46700aa080fc2b"}},{"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":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bca8740565d86424a5a8a0db56f4febc3ba6e23bf9580961f9652885b2aca1c"}},{"ruleId":"D1","level":"warning","message":{"text":"cv-templates.srcsetUrls (cyclomatic 16): cv-templates.srcsetUrls 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":"cv-templates.mjs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b42e3487616ee0a68d9379d7f8155f18fc79289aacbda58cd6720e7c4210ca6"}},{"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":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"085a5334edecdcff7a97bfa510b6b95607428d08aa4db6176215c0d70b59509d"}},{"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":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfdd504f1dab92d14e2ea2b392ff34f7f560d9279146be5dc9ac520559ef239"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-cv-facts.scopeInflationClaims (cyclomatic 16): verify-cv-facts.scopeInflationClaims has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 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":"verify-cv-facts.mjs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"051e0b1e825310edb16a034d43f8da7f43b173cc1d32362d9b2af4dd01e44164"}},{"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 608, 588). 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":585}}}],"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.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":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a89537203ec0215577836980bab03428c14f29df2ad357cd2421db468ffd02c"}},{"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":"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":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d95ec4b73898e067ccb887c6834f30de0581f5ad16348264075e66a59ef82"}},{"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":468}}}],"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":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4048d61097da9ca22d29ce602bd62883ddbabd90edb8af3f4556c80f55b87f"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluation-cache.machineSummary (cyclomatic 16): evaluation-cache.machineSummary 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":"evaluation-cache.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f368bdecf812815e3dd1e8f6f702044379334ab3b479f511ed2bc28c2c003f"}},{"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":602}}}],"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":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd3c89febbd8a17cf355de59086dc04107bdabe624093111366f6759b53136"}},{"ruleId":"D1","level":"warning","message":{"text":"generate-latex.compileLatexFile (cyclomatic 16): generate-latex.compileLatexFile 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":"generate-latex.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdd1f0ea2361417af84c8695c6451d2ea213403a2b654ac9caca8d3c9b129e8"}},{"ruleId":"D1","level":"warning","message":{"text":"employers-validate.slugProblem (cyclomatic 16): employers-validate.slugProblem 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":"seeds/employers-validate.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e2379b7f5154733f6b8ec493b62b1f82ee4ab1d01876ee4ede2baf127ac0f"}},{"ruleId":"D1","level":"warning","message":{"text":"harvest-buildlist.renderSummary (cyclomatic 16): harvest-buildlist.renderSummary has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"a712d95dff04c5616386a5ff193fa9de1378fd1e17b4218a38cfdafb2c901ed5"}},{"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":110}}}],"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":"prepare-application.readProfile (cyclomatic 16): prepare-application.readProfile has cyclomatic complexity 16 (threshold 15). Of this number, 9 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":"prepare-application.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e9ab3fe66b3425d67e18979594118c74c0a0a3607340916c6feb1d40250f8"}},{"ruleId":"D1","level":"warning","message":{"text":"adp-workforcenow.resolveTenant (cyclomatic 16): adp-workforcenow.resolveTenant 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/adp-workforcenow.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aae1ba44f15def293288588b92b6045ce2b321e0cf4faddd6f0c1ec336bea30"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1153d41735bfada175d7c133a04f6367b402d8518a7e7e479d92817ddd766be"}},{"ruleId":"D1","level":"warning","message":{"text":"darwinbox.parseDarwinboxResponse (cyclomatic 16): darwinbox.parseDarwinboxResponse 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/darwinbox.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6194c1c8a2352a9dbe266668f03b4ec2eb1875f711b3d08fb620e7e7ac7da"}},{"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":"ibm.parseIbmResponse (cyclomatic 16): ibm.parseIbmResponse 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/ibm.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d9c8da10ec5a75ffa6d995155cf231a8e49a2f8a4e4a3f641f52c34fd1d85b"}},{"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 78). 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":66}}}],"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":562}}}],"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":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"330af16322e1e0e277c45a2f47c60d393b5e4be557402e33a4e9d4a32df1c26f"}},{"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, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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/fill/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06b8dfdb1d75b1a4f63836413b5ad8ae76c21984f6759a0b73a5785f18dea7b"}},{"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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444b47ef80f3e0d18551877ada23a2bc831c14fbc2c20c524e436943fe5ca07"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET::toOffer (cyclomatic 16): route.GET::toOffer 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":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b1ae0473839b11ac719630e0698efe5075cdc3dba2e975c205f397a67a1005"}},{"ruleId":"D1","level":"warning","message":{"text":"apply-view.ApplyExitBar (cyclomatic 16): apply-view.ApplyExitBar has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 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/components/apply-view.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59e6dda281cd5f4d16dd1ba0d71337e0c1f1ce569fc98133aaaabcdeed16685"}},{"ruleId":"D1","level":"warning","message":{"text":"analytics-metrics.computeProgressMetrics (cyclomatic 16): analytics-metrics.computeProgressMetrics 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/analytics-metrics.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0876a6d46844d851aac1304294cff89a55f4b74d000a46f02b7904e886ca8a56"}},{"ruleId":"D1","level":"warning","message":{"text":"discover.assembleDedupContext (cyclomatic 16): discover.assembleDedupContext has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/discover.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d11d6bc886c0dfbc866a6e56f43c65571a490e46d94718bcca53b4ad77ea786"}},{"ruleId":"D1","level":"warning","message":{"text":"url-key.canonicalJobKey (cyclomatic 16): url-key.canonicalJobKey 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/core/url-key.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9804c0f0304684a8fbf28c3c41f403d572d276193d61435eb78a5a2b40fde062"}},{"ruleId":"D1","level":"warning","message":{"text":"preview-html.mapText (cyclomatic 16): preview-html.mapText 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/cv-studio/preview-html.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23dc26c7d58e82258540114f195e496f7a137412adb562fdc985170a66b5ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"report-persist.evaluateRunOutcome (cyclomatic 16): report-persist.evaluateRunOutcome 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":"web/src/lib/report-persist.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17f1df80a39355607b5cff36c8b99038d11bae8ad8a20af8f7ee7657730107d"}},{"ruleId":"D1","level":"warning","message":{"text":"schedule-label.scheduleCadenceLabel (cyclomatic 16): schedule-label.scheduleCadenceLabel 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/schedule-label.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc6e1ccc8d00e9d63a061925211ef6ad562b946d538d943d0405c1487ca6fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"main.runGeneratePDF (cyclomatic 16): main.runGeneratePDF has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 331). 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":"dashboard/main.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e27476a07fba9f10e5c4fb6cdbd6f4af171793046f4a62e0d252ca09a5958"}},{"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":508}}}],"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":2628}}}],"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":4034}}}],"partialFingerprints":{"codehealthFindingId/v1":"086fe9aedc238144c244d3923cd2990ccd29a445648246073ca8df87c666f50b"}},{"ruleId":"D1","level":"warning","message":{"text":"zhCountClaims (cyclomatic 16): zhCountClaims 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-cv-facts.mjs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6db300bbb5bbeac59b80e9ff923dd55883633aa95b811df1355a0040550da8"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeTracker::buildRow (cyclomatic 16): mergeTracker::buildRow 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":"merge-tracker.mjs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a887ea2fda9f3f0287c00644a4c8aadc80c4803ccd61d5a9a716fbd324c99bce"}},{"ruleId":"D1","level":"warning","message":{"text":"parseRegister (cyclomatic 16): parseRegister has cyclomatic complexity 16 (threshold 15). Of this number, 13 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":"sponsor-check.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f25f55dfc4949f545c3986db8181f6a5a916a6be573b49240fadae78b11cad8"}},{"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":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"75714e1953df579802b69c58f13df45f586c69a72a379a91c867eb9590804255"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 16): main has cyclomatic complexity 16 (threshold 15). 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: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named 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":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55abfbf4148f745148135bb90b85eaddce957ebb019196f88cf14f4f64cc2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"harvest::worker (cyclomatic 16): harvest::worker 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":"harvest-buildlist.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12b5e514f0c21fa08eb093ecb2b72635ca2909bb52d6467ff08695e57c0e492"}},{"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":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4096b1893d35ca3c3ab444c5027e123af2b3f01ecc5249a3ba607fef1a7c08ae"}},{"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":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0208d19b68241516f235ab0ac4e899fa9263e4f6825c8b42a8429212c379cc13"}},{"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":"crawlDelaySeconds (cyclomatic 16): crawlDelaySeconds 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":"robots-check.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a15f1b9bea65e9f3eb2b49314dfa94ae9a1f1160f703e958919d96c76883a4"}},{"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":"D2","level":"warning","message":{"text":"main (cognitive 346): main has cognitive complexity 346 (threshold 15). Drivers by points: if/else 179 (322 pts), boolean chains 97, loops 39 (70 pts), ternaries 31 (64 pts), other 10, error handling 5 (7 pts) (nesting depth added 209). To reduce it, split the body into named stages: move each independent step or branch into 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":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0500d244fac858fb209bf4724bb2b453581a013ffa9b67f7ada02c4d6512a007"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-validate.validateRegistry (cognitive 255): employers-validate.validateRegistry has cognitive complexity 255 (threshold 15). Drivers by points: if/else 73 (167 pts), boolean chains 33, ternaries 10 (27 pts), loops 14 (24 pts), error handling 1 (4 pts) (nesting depth added 124). Of this number, 251 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":"seeds/employers-validate.mjs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1608f1ceca58255b22662fe1d1a79869305ed2f4f985e7baaa2e786e8f4f1119"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::mergeUnderLock (cognitive 252): mergeTracker::mergeUnderLock has cognitive complexity 252 (threshold 15). Drivers by points: if/else 82 (151 pts), ternaries 19 (51 pts), boolean chains 31, loops 7 (14 pts), error handling 2 (4 pts), other 1 (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into 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":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3908d91f1b3fc176a7c3c68842e0abae6f65f16ac218eb6376c99e094479a578"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.locallyModifiedSystemFiles (cognitive 215): update-system.locallyModifiedSystemFiles has cognitive complexity 215 (threshold 15). Drivers by points: if/else 29 (106 pts), loops 17 (54 pts), error handling 11 (25 pts), boolean chains 16, ternaries 5 (14 pts) (nesting depth added 137). Of this number, 190 points are the body\u0027s own statements and 25 belong to 5 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":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50256795ccaa80282e6a8fb75eae0a064a244628c14a4b6d971718d66663f60"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-portals.validatePortalsConfig (cognitive 198): validate-portals.validatePortalsConfig has cognitive complexity 198 (threshold 15). Drivers by points: if/else 79 (180 pts), loops 10 (33 pts), boolean chains 27, ternaries 6 (23 pts), error handling 1 (5 pts) (nesting depth added 145). 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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"369a6570cb8aa0c9aca48cfda03031639fdcbda651c96bf09a9c41ab39528591"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-view.PipelineView (cognitive 187): pipeline-view.PipelineView has cognitive complexity 187 (threshold 15). Drivers by points: boolean chains 61, if/else 55 (61 pts), ternaries 36 (57 pts), loops 3 (5 pts), error handling 3 (nesting depth added 29). Of this number, 53 points are the body\u0027s own statements and 134 belong to 38 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/pipeline-view.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"df96b7c97bb46760dbcd85ad0ee31db9d971d5f452fe95b41ff909ab43c97bec"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 185): main has cognitive complexity 185 (threshold 15). Drivers by points: if/else 92 (191 pts), ternaries 39 (74 pts), boolean chains 51, error handling 7 (19 pts), loops 6 (9 pts), other 2 (nesting depth added 149). 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":"scan-ats-full.mjs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c13e49421156f3637b3cea90353bce40622e94a7c8e6ca85fa2db36d2210b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"explore-provider.ExploreProvider (cognitive 178): explore-provider.ExploreProvider has cognitive complexity 178 (threshold 15). Drivers by points: if/else 64 (90 pts), ternaries 22 (39 pts), boolean chains 25, 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 178 points belong to 19 function literals inside it that branch (lines 175, 471, 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":"scanHtml (cognitive 168): scanHtml has cognitive complexity 168 (threshold 15). Drivers by points: if/else 47 (124 pts), boolean chains 56, ternaries 17 (46 pts), loops 7 (13 pts), other 6 (nesting depth added 112). 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-templates.mjs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c7a7dc3cb7abc752bda265fac77548a326ef1a5f797596ddab2d3468cd5619"}},{"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":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ec3a5ab3af1b8b6c2b5a411f95128bdf069da62ccf63b51b384a38a97b8c4"}},{"ruleId":"D2","level":"warning","message":{"text":"runSelfTest (cognitive 151): runSelfTest has cognitive complexity 151 (threshold 15). Drivers by points: if/else 79 (106 pts), boolean chains 16, loops 13, ternaries 4 (8 pts), error handling 2 (4 pts), other 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"796c67000c378758d061829036571243f424e14f7022c114e431aa2a2b2bf22e"}},{"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":"apply-provider.ApplyProvider (cognitive 135): apply-provider.ApplyProvider has cognitive complexity 135 (threshold 15). Drivers by points: if/else 55 (81 pts), ternaries 10 (20 pts), boolean chains 16, error handling 7 (11 pts), loops 5 (7 pts) (nesting depth added 42). None of this is in the body itself: all 135 points belong to 13 function literals inside it that branch (lines 247, 115, 384, \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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"084492e09555a50a8329ee0838d03fa4844e5fac15da1e1c44dea13d9d30e9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"main::(anonymous)::(anonymous)::processJobs (cognitive 135): main::(anonymous)::(anonymous)::processJobs has cognitive complexity 135 (threshold 15). Drivers by points: if/else 41 (101 pts), ternaries 6 (16 pts), boolean chains 11, loops 4 (7 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into 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":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5efd114b7babf937dbd4ade8a7e152ad81a3a989d97b7c65a4dc84c60bb520"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 134): route.POST has cognitive complexity 134 (threshold 15). Drivers by points: if/else 69 (85 pts), ternaries 20 (24 pts), boolean chains 13, error handling 7 (9 pts), loops 3 (nesting depth added 22). Of this number, 59 points are the body\u0027s own statements and 75 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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76e97ef3908eeccf333beefe5a68c55c57f64328c5526e9b586a8d44a2cb569"}},{"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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb48cbc333f7dfdcd3abecdd810a0b8f6dced21e22ec4dee03f02859136d254d"}},{"ruleId":"D2","level":"warning","message":{"text":"inbox-triage.InboxTriage (cognitive 125): inbox-triage.InboxTriage has cognitive complexity 125 (threshold 15). Drivers by points: if/else 36 (43 pts), ternaries 25 (35 pts), boolean chains 34, error handling 5 (7 pts), loops 6 (nesting depth added 19). Of this number, 21 points are the body\u0027s own statements and 104 belong to 34 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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e37aacaca9951ebc7c42aaef63df607eaba0bc40debe87a030f41933e73767"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchCsb (cognitive 111): fetchCsb has cognitive complexity 111 (threshold 15). Drivers by points: if/else 16 (64 pts), ternaries 7 (23 pts), loops 5 (15 pts), boolean chains 8, error handling 1 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into 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":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"546cfc7a30fb074d823879a66f5102c6582b5f39afba51d00ca11fa6da9c44b2"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 107): main has cognitive complexity 107 (threshold 15). Drivers by points: if/else 30 (48 pts), ternaries 16 (36 pts), loops 4 (9 pts), boolean chains 7, error handling 3 (6 pts), other 1 (nesting depth added 46). Of this number, 101 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":"check-liveness.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35de2190a86e5ea3d1ef8489baf06c8b25c0a868dde34f4a236b22ddfe8d354"}},{"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":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"32624891d5345a2d0e741596815aa7fa119a3549b47ba478ee19466c94c2a1fb"}},{"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":"PipelineModel.handleKey (cognitive 94): PipelineModel.handleKey has cognitive complexity 94 (threshold 15). Drivers by points: if/else 35 (83 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into 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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef477095ca35aa8e4391c642c4c6e732bc41525d017fa48b176551cf10a91f50"}},{"ruleId":"D2","level":"warning","message":{"text":"readRegistry (cognitive 94): readRegistry has cognitive complexity 94 (threshold 15). Drivers by points: if/else 25 (65 pts), loops 6 (10 pts), error handling 2 (7 pts), boolean chains 6, ternaries 2 (6 pts) (nesting depth added 53). Of this number, 76 points are the body\u0027s own statements and 18 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":"seeds/employers-validate.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"634b97e7a8d61a598955e8617d11ba5082e967d128a1d53732ecaae8fe977319"}},{"ruleId":"D2","level":"warning","message":{"text":"career-profile.doImport (cognitive 92): career-profile.doImport has cognitive complexity 92 (threshold 15). Drivers by points: if/else 23 (44 pts), ternaries 6 (23 pts), loops 9 (17 pts), boolean chains 5, error handling 2 (3 pts) (nesting depth added 47). Of this number, 43 points are the body\u0027s own statements and 49 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":"career-profile.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"752811f94ebcd5d7c0c15549089c5539b93f7e8c090c87e31d5c81f67e83cd4c"}},{"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":1199}}}],"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":1561}}}],"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":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"283538a900a977f45724386f39953bc7e48f0414b0d8a27af16072fad084d176"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage-check.diagnose (cognitive 88): coverage-check.diagnose has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (38 pts), ternaries 15 (33 pts), boolean chains 17 (nesting depth added 36). 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":"coverage-check.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d6c8ec458ab0bc9d7ce9c3a71af8a478dd6d065f9130b2411a9d6ca9903087"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-ingest.CvIngest (cognitive 87): cv-ingest.CvIngest has cognitive complexity 87 (threshold 15). Drivers by points: if/else 33 (45 pts), boolean chains 19, ternaries 13 (19 pts), error handling 3, loops 1 (nesting depth added 18). Of this number, 20 points are the body\u0027s own statements and 67 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/cv/cv-ingest.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3cdcfaf24dab17f5a3d562678e9a6c69e07aab586fbbc7b16666d14978e5c2"}},{"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":"cssRequestUrls (cognitive 86): cssRequestUrls has cognitive complexity 86 (threshold 15). Drivers by points: if/else 16 (40 pts), ternaries 6 (19 pts), boolean chains 14, loops 4 (12 pts), other 1 (nesting depth added 45). Of this number, 82 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e14fc0d10bf9f2bff6d8c9ac34fd23e4371c2d1879cec3a0153cf4442ebd5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-topdev.main (cognitive 84): scan-topdev.main has cognitive complexity 84 (threshold 15). Drivers by points: if/else 16 (52 pts), loops 6 (14 pts), ternaries 4 (10 pts), boolean chains 4, error handling 1 (4 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-topdev.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57a3537fcd9a6adc723784391c4a73da45c49c92e6e0be160b9ca4c3aeebcb8"}},{"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af8edae4a1e04da391e68c4fa97ce33f73b62dd678d29c8bdc22eb6e4018f2"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 79): fetch has cognitive complexity 79 (threshold 15). Drivers by points: if/else 39 (82 pts), ternaries 23 (52 pts), boolean chains 19, loops 5 (11 pts), error handling 4 (10 pts), other 2 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into 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":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd279b5f8772a62fb1018518154baa76c748f72cd03f22786d50cfc78841227"}},{"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":"sitemap.createSitemapProvider.fetch (cognitive 77): sitemap.createSitemapProvider.fetch has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (46 pts), ternaries 5 (11 pts), error handling 3 (8 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 36). Of this number, 63 points are the body\u0027s own statements and 14 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":"providers/sitemap.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0521c3011d06dd7a1e707a823af811963c357fc5b231241a24c27d2d0f62ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"today-dashboard.TodayDashboard (cognitive 77): today-dashboard.TodayDashboard has cognitive complexity 77 (threshold 15). Drivers by points: ternaries 20 (50 pts), boolean chains 16, if/else 10, error handling 1 (nesting depth added 30). Of this number, 40 points are the body\u0027s own statements and 37 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/home/today-dashboard.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7effab6a1d1427332916ea1c2542d2fa84d2e94441de6f2cf1cf7bf580207"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.structuredAssociationClaims (cognitive 75): verify-cv-facts.structuredAssociationClaims has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (45 pts), boolean chains 15, loops 5 (8 pts), ternaries 3 (7 pts) (nesting depth added 33). Of this number, 73 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-cv-facts.mjs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91081a515707e0d6bcef0f072fc16d0f526cb0539f376b47a9d474131cc0be6"}},{"ruleId":"D2","level":"warning","message":{"text":"followups-view.FollowupsView (cognitive 75): followups-view.FollowupsView has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 23 (45 pts), boolean chains 15, if/else 14, error handling 1 (nesting depth added 22). Of this number, 29 points are the body\u0027s own statements and 46 belong to 12 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":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb72280c009a399fd0c195ebb22a0eaa64e4c43475ae678ef1190a00b07e46a"}},{"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":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"128ec6099faa5dc427a14b1dc70c59def635a93ff4e5819412e35b71803b434f"}},{"ruleId":"D2","level":"warning","message":{"text":"createSitemapProvider.fetch (cognitive 75): createSitemapProvider.fetch has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (46 pts), ternaries 5 (10 pts), error handling 3 (8 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 35). Of this number, 61 points are the body\u0027s own statements and 14 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/sitemap.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e669aa7aa9de05045494a1657e7aba5c9f45ff03c1f3350fd47529786334f82"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 73): route.POST has cognitive complexity 73 (threshold 15). Drivers by points: if/else 28 (45 pts), ternaries 5 (12 pts), error handling 6 (9 pts), boolean chains 7 (nesting depth added 27). Of this number, 57 points are the body\u0027s own statements and 16 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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"366a3c19d52d07dc3124c001bc388c633ad76473bd6cd005d3d1fff9a14cd8f4"}},{"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":5787}}}],"partialFingerprints":{"codehealthFindingId/v1":"172b8286945bd1308dddf00a3f284381f1a1ba78d4805597c73fdb224621bd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 73): main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 11 (23 pts), boolean chains 11, loops 5 (9 pts), error handling 2 (4 pts) (nesting depth added 28). Of this number, 47 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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdbeea17e49f8569c2001d26210d56767206f507c97847fececa35854736eec"}},{"ruleId":"D2","level":"warning","message":{"text":"session.fillSession (cognitive 72): session.fillSession has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (40 pts), error handling 7 (17 pts), boolean chains 7, ternaries 1 (5 pts), loops 2 (3 pts) (nesting depth added 34). Of this number, 65 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":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4d797ae1a2ac6e69f610c846d3bd47fe6d2f1f3a42e16757272d01289ca005"}},{"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":765}}}],"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":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7c181a4fa0de07daf0dd627209e8363127fd5738b1f7ac6631b8e45a891807"}},{"ruleId":"D2","level":"warning","message":{"text":"collectDocuments (cognitive 71): collectDocuments has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 16 (34 pts), if/else 11 (21 pts), boolean chains 8, loops 3 (4 pts), other 3, error handling 1 (nesting depth added 29). Of this number, 66 points are the body\u0027s own statements and 5 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":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"926c515a22e92705e3d932c0a3bb42340f4cf0dd8e0440315bdf9c41be62440f"}},{"ruleId":"D2","level":"warning","message":{"text":"sponsor-check.lookupSponsor (cognitive 70): sponsor-check.lookupSponsor has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 9 (17 pts), loops 7 (15 pts), boolean chains 14 (nesting depth added 25). Of this number, 60 points are the body\u0027s own statements and 10 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":"sponsor-check.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc8b5faf1cb9f8476fcef82f31ec1089248027f072eb84bbfd241b6842d0a1"}},{"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":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaffec15cdf28221589586f02a41248fdbab2884c0791938de29a76b69b72ab"}},{"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":418}}}],"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":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc21582149a5780e7f43a3df02590b1464d134cecff45ae48adad9de2f6cb191"}},{"ruleId":"D2","level":"warning","message":{"text":"session.openSession (cognitive 68): session.openSession has cognitive complexity 68 (threshold 15). Drivers by points: if/else 29 (47 pts), boolean chains 10, ternaries 5 (9 pts), error handling 2 (nesting depth added 22). Of this number, 65 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aa6889aa0bdf1e83791497c1e1e79ecedaad2ba0b8492b29bac97a2aa32f70"}},{"ruleId":"D2","level":"warning","message":{"text":"cssDeclarations (cognitive 68): cssDeclarations has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 12, ternaries 3 (11 pts), loops 3 (8 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84cd56884f0e2fcf06df2d158d5d653a4ea562f54d725a891a3aa0b4791818b"}},{"ruleId":"D2","level":"warning","message":{"text":"checkUrlLiveness (cognitive 68): checkUrlLiveness has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 14, error handling 7 (14 pts), ternaries 4 (6 pts), loops 4 (5 pts), other 5 (nesting depth added 18). Of this number, 29 points are the body\u0027s own statements and 39 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":"liveness-browser.mjs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1a31abd6381099dadc20d691719ca5295f0fb42b955b0fe82a33221485510"}},{"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":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb3431aca15175368e3ed7e2defab39882cb1a6676f23eb005966d8a4e9fcd"}},{"ruleId":"D2","level":"warning","message":{"text":"templates-section.TemplatesSection (cognitive 67): templates-section.TemplatesSection has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 16 (49 pts), boolean chains 10, if/else 7, error handling 1 (nesting depth added 33). Most of this is not in the body itself: 6 of the 67 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 156, manage, a function literal at line 59, \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/templates/templates-section.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cd9a5f8c95c154740234b04c8a29a022e9c08dba3c75fae2d31c1af484e39c"}},{"ruleId":"D2","level":"warning","message":{"text":"_country.buildWorkplacePolicy.\u003Creturned closure\u003E (cognitive 66): _country.buildWorkplacePolicy.\u003Creturned closure\u003E has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 22, loops 4 (6 pts), ternaries 3 (6 pts) (nesting depth added 18). Of this number, 64 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/_country.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fb9e425f61c495e148486cda4b1c539ebfb024381b3d1437df30352585af30"}},{"ruleId":"D2","level":"warning","message":{"text":"status-select.StatusEditor (cognitive 65): status-select.StatusEditor has cognitive complexity 65 (threshold 15). Drivers by points: boolean chains 24, ternaries 15 (21 pts), if/else 18 (19 pts), error handling 1 (nesting depth added 7). Of this number, 28 points are the body\u0027s own statements and 37 belong to 9 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/status-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ae2b9b5f5f8fc5935edfbd0d6f41230a4b596270d4fe0ed4af46df12c1327f"}},{"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":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f1d195ade778d721c763ad01c67c2403e66bfcab4389e91b809fe4d567a317"}},{"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":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2863b850c51581547050cb78442a3b6785dbdad83c67ed6f914dd3e6c136fe"}},{"ruleId":"D2","level":"warning","message":{"text":"cmdRun (cognitive 63): cmdRun has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (39 pts), loops 4 (10 pts), ternaries 5 (8 pts), boolean chains 5, other 1 (nesting depth added 23). Of this number, 62 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":"plugins.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d948b6aab7226a49042d8f88564ce177119975c3557d9a9cea5a15ec7295f7"}},{"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":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22c43fc4869a9a24e78230853d160916da425b06e562cf788b46747263be8e0"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduled-jobs-runner.executeJob (cognitive 61): scheduled-jobs-runner.executeJob has cognitive complexity 61 (threshold 15). Drivers by points: if/else 9 (27 pts), ternaries 5 (20 pts), boolean chains 8, error handling 2 (5 pts), loops 1 (nesting depth added 36). 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/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"48122fa44b58010c2d683753019fc8e80cf14afdf9e19d6566c111116ce9aecf"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.factClaims (cognitive 60): verify-cv-facts.factClaims has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 8 (31 pts), loops 6 (12 pts), if/else 2 (9 pts), boolean chains 8 (nesting depth added 36). Of this number, 59 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into 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":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"163ec05f95c31f30a3b647efbeb99374e3c7f587058bcac512bd0dd14bf79399"}},{"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":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6de19f75326d8b0074ad0de11d977b701f44673f2e1a429a7908529bf835f6"}},{"ruleId":"D2","level":"warning","message":{"text":"getOmpEffectivePlaywright (cognitive 59): getOmpEffectivePlaywright has cognitive complexity 59 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 6 (13 pts), boolean chains 12, ternaries 8 (9 pts), other 1 (nesting depth added 23). Of this number, 58 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":"doctor.mjs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa3da65438fc5f76547ba6c25454719fc8eb843e61c07a32b92a17cf9e65b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchedUrls (cognitive 59): fetchedUrls has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 13, other 9, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 17). Of this number, 57 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":"cv-templates.mjs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3014d77b4ee5955f8aa25b7890cb7af0dde1d78ebab4338f67d67aae62a3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeAnswers (cognitive 59): normalizeAnswers has cognitive complexity 59 (threshold 15). Drivers by points: boolean chains 26, if/else 13 (17 pts), ternaries 7 (8 pts), other 7, loops 1 (nesting depth added 5). Of this number, 54 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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f8cb11938b210d1c1d165588f9a9a31d17c61097bc5c45ed574e7ac1572b92"}},{"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":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e9b0c73375efd84d87c8e0422b97ca239e916f2d36e18919803d0afbb4644f"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.tokenizeTag (cognitive 58): cv-templates.tokenizeTag has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 7 (15 pts), boolean chains 7 (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":"cv-templates.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"274869cadf17ea353feab91072f5e9d619b3433990b3eede620f0e0a4a2e5736"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-pdf.generatePDF (cognitive 58): generate-pdf.generatePDF has cognitive complexity 58 (threshold 15). Drivers by points: if/else 37 (45 pts), boolean chains 7, error handling 3, ternaries 2, loops 1 (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":"generate-pdf.mjs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bc3e1ce185a3bd8cfec8763c830432fde4fcfb87bea40e30cf1019898317a0"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-view.FieldRow (cognitive 58): apply-view.FieldRow has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 17 (46 pts), boolean chains 11, if/else 1 (nesting depth added 29). Of this number, 51 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":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49ddb2d1010d258531ccd05e33d6fd0fa6bf84943356e4c7869c19a6e9fd129"}},{"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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3208b961f8e3262c0576e82c2aac67dacdc9734b606eb0046f1d7823271fcac"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.collectSeenUrls (cognitive 57): scan.collectSeenUrls has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 10, loops 6 (9 pts), ternaries 1 (nesting depth added 23). Of this number, 54 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":"scan.mjs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7810f19817f385953a3b2dfd132abf6143f7b3d18ace4cef0ef144e4114752"}},{"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":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"db177d6810d997948cb64fd16b6c9aca358fa880b866e442635cfa5e8cececd2"}},{"ruleId":"D2","level":"warning","message":{"text":"checkMainChannel (cognitive 57): checkMainChannel has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 9 (20 pts), if/else 12 (18 pts), boolean chains 12, error handling 4 (7 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":"update-system.mjs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bf79fce7976518d125581888274e37540c90ddad9ea2794628cc8f59a768fc"}},{"ruleId":"D2","level":"warning","message":{"text":"callOpenRouter (cognitive 57): callOpenRouter has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (45 pts), error handling 3 (6 pts), other 3, boolean chains 2, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ba50cad4da8d44e00e6dee29bf17aef85719dbbbbb8ee7efbcdd8072a8986"}},{"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":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77905dd35600ee7b423d4ed840d43b5652fdbe9ace9f69cdc27c044f4c06ca9"}},{"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":"build-cv-latex.main (cognitive 55): build-cv-latex.main has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 19, if/else 14 (19 pts), ternaries 6 (8 pts), error handling 3 (5 pts), loops 3 (4 pts) (nesting depth added 10). Of this number, 49 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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"978137f970d08946a30778d7db80115e31e0f87c5769bdec07065bb42eedc2bd"}},{"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":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3cfa8c86ffdc7e4e5f68bfbf1d578a63ddf7c7a9ec504082c719a4b8f1b72"}},{"ruleId":"D2","level":"warning","message":{"text":"career-profile.parseCv (cognitive 53): career-profile.parseCv has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (32 pts), loops 8 (18 pts), boolean chains 3 (nesting depth added 22). Of this number, 30 points are the body\u0027s own statements and 23 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":"career-profile.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"272abba56886f5e84105224828f54a1e3773075a722d1db18ec65e7762146935"}},{"ruleId":"D2","level":"warning","message":{"text":"explorer-view.ExplorerView (cognitive 53): explorer-view.ExplorerView has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 33, 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 16 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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc6febd678abdd9131450e2ea8644947a08ccb49ba609bdd0a9434eb6a2ccc"}},{"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":"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":966}}}],"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":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"843eb6a5c1dd080614dac12c83a999f4f93df429386d4a8c22623c2a63e68999"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 52): main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 13, ternaries 5 (8 pts), error handling 1 (3 pts) (nesting depth added 10). Of this number, 43 points are the body\u0027s own statements and 9 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, 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":"harvest-buildlist.mjs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"216ac037c61de70f0f041f8c129a9090e3f54f8d0df50e090f117d63ff538cad"}},{"ruleId":"D2","level":"warning","message":{"text":"runBackup (cognitive 52): runBackup has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (22 pts), error handling 7 (15 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (5 pts) (nesting depth added 18). Of this number, 43 points are the body\u0027s own statements and 9 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":"backup.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea135a41413e2c6392fe77994e05ca865dfea125d8979322ba42b48e77d719e"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 51): fetch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 8, ternaries 5 (8 pts), error handling 4 (6 pts), loops 2 (3 pts) (nesting depth added 19). Of this number, 47 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":"providers/talentlink.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d956eb5269cfd01e685a1e7edc6601c92e332e896789827ab2d1608a4dfc9b6"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-fold.planFold (cognitive 50): employers-fold.planFold has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 11 (17 pts), ternaries 3 (8 pts), boolean chains 6 (nesting depth added 20). 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":"seeds/employers-fold.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25c1aa707466080843a74dd76fe38cd58d0298bb7062f7bd40b2ed41bb9e47f"}},{"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":"discovery-card.DiscoveryCard (cognitive 50): discovery-card.DiscoveryCard has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 11 (33 pts), boolean chains 17 (nesting depth added 22). 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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"636112d0ca117fab189b56d045f65490185b113ff4785115f854e3d7719ff26a"}},{"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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b766fa40fce6b3521cad2e93b27a958b61705e61f609b5123c179beab967fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"manifestProblems (cognitive 50): manifestProblems has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 12, loops 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":"seeds/employers-validate.mjs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb57dc1b7c46c6cbb4df8cca4418f45fe111c03665c46def42c87e22af0c614"}},{"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":"_html-entities.decodeEntities (cognitive 49): _html-entities.decodeEntities has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 9 (21 pts), if/else 8 (18 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 24). Most of this is not in the body itself: 1 of the 49 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 141, 161). 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/_html-entities.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c65f87806e8332d9b19b01a892572e45395e3bf129feeb82d5adc496604b928"}},{"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":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"839964b61435a02b6c62722818b4631f707276b7d7197fbe9427933c0a0073a5"}},{"ruleId":"D2","level":"warning","message":{"text":"checkInbox (cognitive 49): checkInbox has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (23 pts), ternaries 4 (11 pts), loops 6 (10 pts), boolean chains 5 (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":"seeds/employers-validate.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac7fa14ea861862b68101be34ded01e0982a1ae5fdf80fdb36c4764fe84013"}},{"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":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420e4ffa729162589fb265c97216b0b707eefa3327628f98d88e4d8b5449d49"}},{"ruleId":"D2","level":"warning","message":{"text":"scanBoard (cognitive 49): scanBoard has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 7, ternaries 4 (7 pts), error handling 2 (3 pts), loops 3, other 2 (nesting depth added 16). Of this number, 48 points are the body\u0027s own statements and 1 belongs 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":"scan-dayforce.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ed900f8d85c26f56202ef00c90db9df6c6dad41f1524e57a04902a4c1b0afe"}},{"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":"linkedin-mail-drop.importUnlocked (cognitive 48): linkedin-mail-drop.importUnlocked has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 5 (9 pts), boolean chains 7, error handling 2 (5 pts), loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-mail-drop.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbf7cfe9dd2ac25124652444c16a084a34b50c9e3f4a50d5e22885341c80ae2"}},{"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":"data.ParseApplications (cognitive 48): data.ParseApplications has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 21). Of this number, 44 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":"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":332}}}],"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":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1537b81fab3402ce8015b2fae4b076731de6741e0fd5433c45c4e171fb57ca78"}},{"ruleId":"D2","level":"warning","message":{"text":"parseCompensation (cognitive 48): parseCompensation has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 11 (12 pts), boolean chains 9, other 8 (nesting depth added 5). Of this number, 35 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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0372a0d702b4a032ad3b7c6e5745809d23cbaa64ce57c2a0c73cb097191c639e"}},{"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 321, 317, 322). 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":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"421d65a23c0e3da187cf94b8274f841e6bf41f854fcbabd701acf318fe33ef4e"}},{"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":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe193fff58cab66012092e5f361988ad482e1c530ce3dade5f0cf019ad75834"}},{"ruleId":"D2","level":"warning","message":{"text":"parseIcs (cognitive 47): parseIcs has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 16, ternaries 7 (9 pts), other 1 (nesting depth added 6). Of this number, 44 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":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b282cccdb5ef54fa29c23db50b306cc3b775df43674f8fd32d961762e930285"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-extract.normalizeUltiproJob (cognitive 46): browser-extract.normalizeUltiproJob has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 10 (20 pts), if/else 13 (16 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (nesting depth added 16). Of this number, 43 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":"browser-extract.mjs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba4912a5f3ec6d145e3384b3124f94419b618b662954088be0ed01fd986839e"}},{"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":"employers-validate.inboxLineProblems (cognitive 46): employers-validate.inboxLineProblems has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 5, ternaries 2 (5 pts), loops 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":"seeds/employers-validate.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"734320b564f089e4091a72ec862f787faf3de290811103d13993b5472917ce9b"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-hn.main (cognitive 46): scan-hn.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 5, loops 2 (4 pts), error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-hn.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4af3485c73c8736c75ab696991041c34262f33b703074dcc30edbff664e9f4"}},{"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":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"725507426992689ddce471c22ac3955d0f373f5b72a481028d0792f14fa8cf77"}},{"ruleId":"D2","level":"warning","message":{"text":"scanRequests (cognitive 46): scanRequests has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, loops 4 (5 pts), error handling 2 (3 pts), other 1, ternaries 1 (nesting depth added 16). Of this number, 36 points are the body\u0027s own statements and 10 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":"cv-templates.mjs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc7e58f81f6ec6ece6b67c17bd0cbeccf3652cc0623126f54b50ed7d6a802de"}},{"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":385}}}],"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":"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":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac5267ea32d6fec7c2474ecc6d48e0ea3c0eb531a20e235abbaef1f2cf89288"}},{"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":"scan-interamt.main (cognitive 45): scan-interamt.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 4 (7 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 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":"scan-interamt.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577108e4ceefb2a51819d825793447e375af8c77494b576c315ede6dee671e1"}},{"ruleId":"D2","level":"warning","message":{"text":"analytics-metrics.computeStatsMetrics (cognitive 45): analytics-metrics.computeStatsMetrics has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 8 (22 pts), if/else 9 (19 pts), boolean chains 3, loops 1 (nesting depth added 24). Of this number, 44 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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/analytics-metrics.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e9f04c06cf0651ff081a4b91dedf5ce650eb3fd957916d3b6d453531179df7"}},{"ruleId":"D2","level":"warning","message":{"text":"readDom (cognitive 45): readDom has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 7 (12 pts), boolean chains 11, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 16). None of this is in the body itself: all 45 points belong to 8 function items inside it that branch (a function literal at line 1272, (anonymous)::strippedText, a function literal at line 1308, \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":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"393eea75f1f67b4854a84a589b3be2e3ffc528b8f1d9be9287715bcd725d933f"}},{"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":"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":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f6962e5348124db8789c9dd91023a43d80fe7d507d56367df7c06b0a67304"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-parse.fromLdJson (cognitive 44): jd-parse.fromLdJson has cognitive complexity 44 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 5 (13 pts), loops 4 (11 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 26). Of this number, 41 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":"lib/jd-parse.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d055e120052b0b02914ca294ad72397978814529354bf95a21b555ecabd78b95"}},{"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":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb13bb577d79e7e5b690e7d151427bff8d4a1342f581ae794415aa4a8f6b0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.main (cognitive 44): doctor.main has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 11 (19 pts), if/else 12 (15 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db29f8419e5ee819ac4879a56f21897c9c29b45aa98ba1d9e4e7f14f04624c4"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-import.readCoords (cognitive 44): employers-import.readCoords has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 10, 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":"seeds/employers-import.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"29333c7f8caa5fc57df71ff86ed4d076018731f966653aa653034ab2538e965d"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderTabs (cognitive 44): PipelineModel.renderTabs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 19). Of this number, 42 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/pipeline.go"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dc11b4546466f8d4a429e654507eb88546182639bdba27a9de6ad016f00830"}},{"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":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93ecd076b0dd42a1c8826eab1f4be7fc8bf6ebc7e09ab3baa0ba66fa76ac0b"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.runCli (cognitive 43): verify-cv-facts.runCli has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 4 (9 pts), loops 3 (6 pts), boolean chains 4, error handling 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":"verify-cv-facts.mjs"},"region":{"startLine":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd45d2a9cd4747dbdd07822da32432adf7acef04e9d47d632f13ce4ceb6cf037"}},{"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":49}}}],"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":"classifyReply (cognitive 43): classifyReply has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 17, ternaries 3 (5 pts), loops 1, other 1 (nesting depth added 7). Of this number, 40 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5312d43197688047dd9471c08b26e549ed61512e136d930e49acb6b5fc78b1f2"}},{"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":676}}}],"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":26}}}],"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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"59879cbc37e90d62b205ed64b4275549e0e0f88181d482f0e7819a501f27301c"}},{"ruleId":"D2","level":"warning","message":{"text":"scanJd (cognitive 42): scanJd has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 5, loops 2 (5 pts), ternaries 2 (5 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":"jd-skill-gap.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e884bd7ebb25fb086a6af004ef97a634696e93ab9da10adadb1304bed0454c"}},{"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":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea8a57375fe2a3f3accda60fa814d2d51e8e7e09e790388c03bebfbc46d54bc"}},{"ruleId":"D2","level":"warning","message":{"text":"loadPolicy (cognitive 42): loadPolicy has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, error handling 2 (5 pts), ternaries 2 (4 pts), loops 1, other 1 (nesting depth added 18). Of this number, 36 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":"robots-check.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5347a7c6e9e7962f4c35334b7c47863791022069f0c3b059e95a7ecf0a5fb875"}},{"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":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc84e1465c33f90441b4b9ba99c1cd95f7155a0c0888fbb48af21aefdb570bd"}},{"ruleId":"D2","level":"warning","message":{"text":"telegram-channel.employerName (cognitive 41): telegram-channel.employerName has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 15, loops 2 (nesting depth added 9). Of this number, 39 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":"providers/telegram-channel.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9951e842ca3407cd80ff38cb889d972a25dec21477176e488e4c680386a87b62"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-editor.CvEditor (cognitive 41): cv-editor.CvEditor has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 12, ternaries 8 (12 pts), error handling 1 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 22 belong to 10 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":"web/src/components/cv-editor.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced370c697f1d0399d007ea34df52b89ac1b11e095047b10f74187534f6e0c2"}},{"ruleId":"D2","level":"warning","message":{"text":"renderInPage (cognitive 41): renderInPage has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 8 (10 pts), error handling 5 (9 pts), boolean chains 7, other 3 (nesting depth added 11). Of this number, 36 points are the body\u0027s own statements and 5 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":"generate-pdf.mjs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2585f05f4b085b0b2c5dac87ceeb5f28b6e9a34284633bda86c7f4520b4f6"}},{"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":"main (cognitive 41): main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 9 (17 pts), ternaries 2 (5 pts), boolean chains 1, other 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":"scan-dayforce.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcce7e15050748282cab2450c247ad03d1006287eb48795533e87796840093a"}},{"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":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"11805a1bb97c7a3e40a95bdb0c482c6ed86c8923102ef1987431e69c37dd2f56"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-page-fetch.withoutExpiryViews (cognitive 40): jd-page-fetch.withoutExpiryViews has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 4, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8264089f7a803d329e7155e14a5c0e6c84bbcf36831a7f2c3573d9d10c8d0bac"}},{"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":"apply-view.ApplyView (cognitive 40): apply-view.ApplyView has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 25, ternaries 6 (14 pts), if/else 1 (nesting depth added 8). Of this number, 39 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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0e5502363e21389139c58a9d70f499ec1d09ea0c1dacb4d92886bd5acb2e68"}},{"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":"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":"invite-evidence.inviteEvidence (cognitive 39): invite-evidence.inviteEvidence has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 21, if/else 13, ternaries 5. Of this number, 37 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":"lib/invite-evidence.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"698525c6156ef59721824b994b07f98447cc40e70835ae502807ff207c7f22ae"}},{"ruleId":"D2","level":"warning","message":{"text":"smartrecruiters.parseSmartRecruitersResponse (cognitive 39): smartrecruiters.parseSmartRecruitersResponse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 12, ternaries 9 (12 pts), error handling 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 9 of the 39 points are its own statements and the rest belongs to one function literal inside it that branches (line 303). 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":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d00741cc720afa8821a5666c53b3db7c17d90b5bce1bb9c1aa2b83572ef289"}},{"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":"platsbanken.parsePlatsbankenResponse (cognitive 39): platsbanken.parsePlatsbankenResponse has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (23 pts), boolean chains 8, if/else 4 (7 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":"providers/platsbanken.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad045921147588160bb94143e3f595922788d1e0264460c91f7a3f3d5697f61"}},{"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":"cv-studio.Studio (cognitive 39): cv-studio.Studio has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 13, ternaries 5 (6 pts), error handling 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 39 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 195, 145, 239, \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/cv-studio/cv-studio.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3e885a6179cee06746419de17e44f778986a70b211e6ac47744af5e2245ab"}},{"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":"fill-stream.readFillResult (cognitive 39): fill-stream.readFillResult has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, ternaries 2 (4 pts), error handling 2 (3 pts), loops 2 (3 pts) (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 13 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":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b118e893b1ba265a33d5a940dcddf180a5a7f26687ba4a6641c20f918c2e46"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 39): main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (24 pts), ternaries 5 (8 pts), boolean chains 3, other 3, 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":"sponsor-check.mjs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d937d1dba5852bc2a3f28a6306d83022332d2b98ccea278fddf4c4bcd4fdf0"}},{"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":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001ea4c063274a79fd3cc68eb1ba7843c0745ffeb0274a30ebbcc537c345849"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeFromContent (cognitive 39): analyzeFromContent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 6 (12 pts), boolean chains 5, other 3, loops 2 (nesting depth added 14). Of this number, 32 points are the body\u0027s own statements and 7 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":"followup-cadence.mjs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"b318b95e2e7d8190b09fc2296b1a41892105256192baddc481f27b171b5689dd"}},{"ruleId":"D2","level":"warning","message":{"text":"parseJobsResponse (cognitive 39): parseJobsResponse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 12, ternaries 6 (8 pts), loops 1, 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":"providers/talentlink.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0848068c27f9591074060b292f6ea87b9e9b4bc42d6154e011d59fcc33f1a8de"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.parallelFetch (cognitive 38): scan.parallelFetch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, loops 3 (4 pts), error handling 2 (3 pts), ternaries 1 (nesting depth added 14). Most of this is not in the body itself: 3 of the 38 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 4416, a function literal at line 4394, takeReady, \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":"scan.mjs"},"region":{"startLine":4343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d580bf0b6f8de6aa15ebf73322ef0d498156682c2de228e497a532bd1b59529"}},{"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.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":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1ca16b41870b57131f775166a2b6b3fcc35fbbc9a068b0a985df048d424532"}},{"ruleId":"D2","level":"warning","message":{"text":"github-evidence.hiddenRepoFailure (cognitive 38): github-evidence.hiddenRepoFailure has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (37 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"e680ead77c6b9da521f6e3664c08a2ba8c99d41d8aea0a7bfdbc6b5fb3ae587a"}},{"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":"factorial.parseFactorialBoard (cognitive 38): factorial.parseFactorialBoard has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 7, ternaries 2 (5 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/factorial.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef377959aa614f8363721a27d1ccb703e2cd0b4eb190273071fedb226abe591"}},{"ruleId":"D2","level":"warning","message":{"text":"report-view.ReportView (cognitive 38): report-view.ReportView has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 27, ternaries 5 (7 pts), if/else 2 (4 pts) (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 22 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":"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":"cv-editor-state.editorReducer (cognitive 38): cv-editor-state.editorReducer has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 6 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 16). 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-editor-state.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43e70a5586a8f54d23c41dd51f00cd80639ca3d3b110ee4d710837421401da1"}},{"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":134}}}],"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":221}}}],"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":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5697d924eb79dbcfd1c5cc9fd556a21459b4d49aa49aed081210d242aa53749c"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch::runQuery (cognitive 38): fetch::runQuery has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 7 (12 pts), boolean chains 6, error handling 1 (3 pts), loops 1 (2 pts), other 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/workday.mjs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd00ed4a860e0a2bc065f9db8e771d0fad591c51e085b6a8c1300473853e6966"}},{"ruleId":"D2","level":"warning","message":{"text":"query (cognitive 38): query has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 6, loops 2 (4 pts), ternaries 2 (3 pts), other 2 (nesting depth added 9). Of this number, 33 points are the body\u0027s own statements and 5 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":"tracker.mjs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"757c5f793e62f2fd0caac95895e1f4b312e6f60827aab2999430b8ed6557c7da"}},{"ruleId":"D2","level":"warning","message":{"text":"renderPortalsYaml (cognitive 38): renderPortalsYaml has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 6 (10 pts), boolean chains 5, ternaries 3 (5 pts), other 1 (nesting depth added 13). Of this number, 35 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":"harvest-buildlist.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89049d7faa57cdd8f2e13f877efcaebfee93143d3397b78b9364e4ae8c93b65"}},{"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":"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":798}}}],"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":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7e2be72fe80102599b6afab6dbf4d7030939482505625a8543d52f0a0788c0"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchHtml (cognitive 37): fetchHtml has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 4 (10 pts), ternaries 2 (5 pts), boolean chains 4, loops 1, other 1 (nesting depth added 16). Most of this is not in the body itself: 14 of the 37 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 105, 94, 113, \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":"lib/jd-page-fetch.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd02baf3d1c2ca521aa6410bb677ecbafd41a1f0a322645c962d5afdc46a725"}},{"ruleId":"D2","level":"warning","message":{"text":"add-entry.applyAdd (cognitive 36): add-entry.applyAdd has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 4, ternaries 1 (2 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":"add-entry.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1688f7ea041ef5798735245c6e014d18a00945f4a53900dfae514116bae968d"}},{"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":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e08c6d41eb2b961e4f51a91d6e76bd0dcdc1fc955451417d8d367c8d5b47bc"}},{"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":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed17c12bc7af1f325af107a75b23862747b351d32617695c5b8a31616cb8202"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 36): route.POST has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 10 (17 pts), if/else 7 (10 pts), error handling 4 (5 pts), boolean chains 4 (nesting depth added 11). Of this number, 31 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":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbec5ca4d0dc497a3c25620d097787d3a58a3bce3351a9d16b983ff27b1319a3"}},{"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 284, 347, 364, \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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"00525a6ab40bf06c9f1dc552baaf29fcb13f5ce75b3140fa3787c89611d04e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::parseTsvContent (cognitive 36): mergeTracker::parseTsvContent has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 4, other 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":"merge-tracker.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9ecfe8a876e20d08822dc5fdd03ff6f704033d043cec5629fa55b129254550"}},{"ruleId":"D2","level":"warning","message":{"text":"normalizeTextForATS (cognitive 36): normalizeTextForATS has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 10, ternaries 5 (7 pts), other 2, loops 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 20 belong to 26 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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"89314d5d7a33ff296054a0f903bc3f01e89ca396565301e53b90175dd5467a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"readPrivacyConfig (cognitive 36): readPrivacyConfig has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 10 (11 pts), boolean chains 7, loops 2 (4 pts), error handling 1, other 1 (nesting depth added 9). Of this number, 28 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":"lib/privacy-guard.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"955ef710f69057a2e238f0c09aca1038df4e25684a8152e159da5e2e1a7a4cd5"}},{"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":1086}}}],"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":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24e46a5b3f77b873ee5a5c722d4c2c68fafe5f2e673c301ce978f7ae0b632e7"}},{"ruleId":"D2","level":"warning","message":{"text":"clean-markers.processFile (cognitive 35): clean-markers.processFile has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 5 (8 pts), boolean chains 4 (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":"clean-markers.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4879fe49a030292a6b9366276272bb070edc4ab98eb7863f8cae7002294905a2"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n-drift.main (cognitive 35): i18n-drift.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 10). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into 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":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6588a76b6ce9d196ba392effc3bb60be58455d902a0a7297e014a9d12d814277"}},{"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":"jobvite.parseJobviteXml (cognitive 35): jobvite.parseJobviteXml has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobvite.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6875d4c1ac62563f2af5520b22ae50099a97c087960a8b3baa97c2891b8d71"}},{"ruleId":"D2","level":"warning","message":{"text":"job-store.JobsProvider (cognitive 35): job-store.JobsProvider has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 8 (9 pts), boolean chains 8, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 184, 153, 226, \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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2959c2714169a3440fa0814babf0aab4d7360c89aa7fa18e0e5d2ad1e73fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"claude-usage-scan.createUsageScanner.scan (cognitive 35): claude-usage-scan.createUsageScanner.scan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 3 (6 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 15). Of this number, 33 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":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1fb0e7f88dfee8a09cc5d07dd6770f8d0533c19111fa0475ed3fc1f2bd3327"}},{"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":"workableFeedCache.stream (cognitive 35): workableFeedCache.stream has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (11 pts), boolean chains 5, error handling 3 (5 pts), other 1 (nesting depth added 11). Of this number, 20 points are the body\u0027s own statements and 15 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":"scan-ats-full.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15b8c703e8334e0ad14357a7355146a6153a2283670d60fdc7e9cfe392f8f1b"}},{"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":787}}}],"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":"cv-templates.scanHtml::closeOpen (cognitive 34): cv-templates.scanHtml::closeOpen has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 16, if/else 7 (13 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d7346a1eb0bbf6e18ed18bb3c5fe870210e1708e186076ee18ff790ca078b5"}},{"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":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"860e93c4365dcf100b7245a846781f075d2a1ecbddb139c1368f5cd35903aa64"}},{"ruleId":"D2","level":"warning","message":{"text":"community-asks.main (cognitive 34): community-asks.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 7 (13 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 11). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"community-asks.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4747f0362835bd14db0d6daea2565d75873debbdb41dc017f401f616bad1ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"breezy.parseBreezyResponse (cognitive 34): breezy.parseBreezyResponse has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 6 (12 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c0aa1d5bfb43b92904e06d8ca676093fc9419ccd03844861143b8cdaadc989"}},{"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":607}}}],"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":"scan-seek.main (cognitive 34): scan-seek.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, loops 3 (4 pts), ternaries 4, 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":"scan-seek.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e21883a8f69eded46ce257adcb61197408b7b98226e35edadfaf8dad5ed835"}},{"ruleId":"D2","level":"warning","message":{"text":"buildCooldownFilter (cognitive 34): 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 5 function literals inside it that branch (lines 1701, 1732, 1730, \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":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d2325a9776f98b46def57893f58deb283da1e40a194eaa6a3210b95e621bb"}},{"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":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5186ff2ca279799fe0f5aed025cb0b6649fea5b7e3b620336a108c151393ec18"}},{"ruleId":"D2","level":"warning","message":{"text":"diffLines (cognitive 34): diffLines has cognitive complexity 34 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 5 (7 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"03512a2e0cd440946587b02b041683e7ff7c4a13e7fb9f1157b71972f04af546"}},{"ruleId":"D2","level":"warning","message":{"text":"parseWorkableWidget (cognitive 34): parseWorkableWidget has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 3 (7 pts), boolean chains 4, loops 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":"providers/workable.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e64b5882d393a2bbf9cb4766dea69cf42c24618d1f98d46d413c5730fed328"}},{"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":"audit-portals.auditCompanies::worker (cognitive 33): audit-portals.auditCompanies::worker has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (11 pts), ternaries 3 (7 pts), 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":"audit-portals.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125930fc919a31d445ecc0be880f17f4b4dc4bcc4bab3eada60c8f2c4ad31e5"}},{"ruleId":"D2","level":"warning","message":{"text":"_country.uspsStateCodesBeatingIso (cognitive 33): _country.uspsStateCodesBeatingIso has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 9, 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/_country.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd71fa734fc79d51acf31c3a3055840730e24fe4b3037c938d9eaa91fd1dfeb"}},{"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":"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":"fetch::split (cognitive 33): fetch::split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (5 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1, other 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/workday.mjs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"c538cd7e1d524d19b5b600c6579883e50393b66b550747c93c1a2433e3e0d7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"zhMentionsIn (cognitive 33): zhMentionsIn has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 10, ternaries 5 (10 pts), loops 1, 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":"jd-years.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1e3cf1c80b875f380448df2e6d39b1657c8538ff2d6d04f34c3d4f9baaaf7f"}},{"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":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"da569ab4ef414f8018bfa97f852cbc29645ae3f91423ff355633653c88a373d0"}},{"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":1363}}}],"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":"scan.buildCooldownFilter.\u003Creturned closure\u003E (cognitive 32): scan.buildCooldownFilter.\u003Creturned closure\u003E has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (26 pts), boolean chains 5, loops 1 (nesting depth added 18). Of this number, 26 points are the body\u0027s own statements and 6 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":"scan.mjs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e11d3fcd27fcdf43ebc5d58ffd06104491228ad5229d6a1d776d1059d3784"}},{"ruleId":"D2","level":"warning","message":{"text":"ics-interview.firstEvent (cognitive 32): ics-interview.firstEvent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e32dfaa8d2a7646717d1a186df2186cbaf3d7a9656b8f9542453033c7f235c"}},{"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":657}}}],"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":"triage-row.TriageRow (cognitive 32): triage-row.TriageRow has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (25 pts), boolean chains 7 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"686b4995759d8377804a6baee2d5844a3e2fb69d2f2e3adaa6f83b07016cb6b3"}},{"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":433}}}],"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":885}}}],"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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c504617d4540dcfd0228c51e61e438b207507b62d564344d696a59cfa58631f1"}},{"ruleId":"D2","level":"warning","message":{"text":"checkLivenessViaApi (cognitive 32): checkLivenessViaApi has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 9, error handling 3 (4 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-api.mjs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7185284b2d41978fe1121021cf7553743d1fdd480c65e5aee820fcdabd5272"}},{"ruleId":"D2","level":"warning","message":{"text":"waitForJobText (cognitive 32): waitForJobText has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 pts), error handling 1 (2 pts), other 1 (nesting depth added 14). Of this number, 20 points are the body\u0027s own statements and 12 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":"openrouter-runner.mjs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3e5972f8855e3e444ef915b0008525b494e85b1c8ea18976b109517b80dc17"}},{"ruleId":"D2","level":"warning","message":{"text":"readInbox (cognitive 32): readInbox has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 13). Of this number, 22 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5600714349d8b0edc4ace7980114b2352ccf8da3e7793d202c269fa1823956a8"}},{"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":347}}}],"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.release (cognitive 31): dir-lock.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":"267a812150db60afd77a2514456552ac4e85d8603253c4be3c445e0d1c2a3713"}},{"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":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c72efca8af93e87c56297830c7cc9199db0f178a64d200592489ecd91b4505d"}},{"ruleId":"D2","level":"warning","message":{"text":"history-ats-seeds.atsBoardUrlOf (cognitive 31): history-ats-seeds.atsBoardUrlOf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"356e38dbd87de9cec139bdfdd6da1fbce2e45805d523cb28036c5adcc1be2d17"}},{"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":197}}}],"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":"role-matcher.roleFuzzyMatch (cognitive 31): role-matcher.roleFuzzyMatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 11, ternaries 3 (4 pts) (nesting depth added 4). Of this number, 28 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":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d1a6839a3375629199434d6f8ceeb48e603cd8408cecfd143958990f0997f0"}},{"ruleId":"D2","level":"warning","message":{"text":"dir-lock.createRelease.release (cognitive 31): dir-lock.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":"7299700b23c46543bb8bf41fb09ae7b5eebaf2a66ebd81e7fcce827741b306ec"}},{"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":"pipeline-views.viewsForMutation (cognitive 31): pipeline-views.viewsForMutation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (7 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 9). Of this number, 27 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/pipeline-views.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f060227cc1a13de54b8b9d3c2980e1e9a1880a67b125d061492d830e80764b96"}},{"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":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"415bb5bbfb7a8f44505cdb6c18985e62c4b6e067d98ba76b4919fbc96f9d13e1"}},{"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":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"093736953fd0451792eff071607a14acb06b4fbb0d1e822797141df6ea10d984"}},{"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":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b876c17e2e22bb0ee96744cfe30b0a16a16cc17490955cc855968823cf68de9"}},{"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":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad3c348d4bf311fcd3ea869ec10893d749c6d81f284d89bbcb495dd8f751390"}},{"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":"mentionsIn (cognitive 31): mentionsIn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 14, ternaries 9 (14 pts), loops 3 (5 pts), other 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":"jd-years.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"257c6a38c97be4635d52ed46c50c59071576346fff4a6cc5e3bc700f8ccd7603"}},{"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":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b0672c245f6fe349f952dc9ee490fec8bd6ba425c943f39af32798e2e726f1"}},{"ruleId":"D2","level":"warning","message":{"text":"archiveUrl (cognitive 31): archiveUrl has cognitive complexity 31 (threshold 15). Drivers by points: error handling 5 (11 pts), if/else 8 (10 pts), ternaries 3 (4 pts), boolean chains 3, other 2, loops 1 (nesting depth added 9). Of this number, 30 points are the body\u0027s own statements and 1 belongs 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":"archive-posting.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"330d1387a8dc8b78e0c60954627ff4c991bda66a72cbea02d0a993dc8fdacf79"}},{"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":1297}}}],"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":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24600d3496c9c7c070fdf097255dc06f979f4478e07a5baa3a46d047cf6fccd"}},{"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":"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":"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":"_country.buildWorkplacePolicy (cognitive 30): _country.buildWorkplacePolicy has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 9, loops 3 (4 pts), ternaries 2 (nesting depth added 6). Most of this is not in the body itself: 12 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (geographyTarget, supportsHomeGeography, restricted, \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/_country.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"692a6c471479fd354a8fbe187acc7c30f573212bdf7cfe3558accab2d5d62caf"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.main::resolveEntries (cognitive 30): scan.main::resolveEntries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 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":"scan.mjs"},"region":{"startLine":4859}}}],"partialFingerprints":{"codehealthFindingId/v1":"420262e50b59c990fa4f1223f1b4e0b7563a97190745615ac7ea2cd8c5fd8d6f"}},{"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":"status-hooks.archiveJdOnInterview (cognitive 30): status-hooks.archiveJdOnInterview has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 8 (10 pts), boolean chains 6, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/status-hooks.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2225958beb9046bfa9e72a2d5b412d0271af73e16f642d240f190b1c9ff0ef7e"}},{"ruleId":"D2","level":"warning","message":{"text":"aldi-nord.resolveConfig (cognitive 30): aldi-nord.resolveConfig has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 14). Of this number, 29 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/aldi-nord.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9914c3772215e6ac1d30626b10fe9ed07796ee74d736fea313b37439051bdc37"}},{"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":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef1c38710ab107f82c2f06efb53a6c6c8f3a0531c6230aa3b2744e465a8fe55"}},{"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":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb681f129b742e22a6fa2506539af1bb12d9121e125c7212d445aaebfe0dfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"jobPostingNodes (cognitive 30): jobPostingNodes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (11 pts), ternaries 1 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"214946b440097fc77f225705da319656315d814ce78df544c46697a29d057eb4"}},{"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":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8660ab58628d54ea31da385aa0966febba67d991415e50e87b2d8342d440e374"}},{"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":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff831e254e64054da28718f0fc923895a0b54efef16010418ffc3304b7eccf3"}},{"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":"parseCriteria (cognitive 30): parseCriteria has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 9, loops 5 (9 pts) (nesting depth added 11). Of this number, 27 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":"providers/talentlink.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26541865032d5e2a1319451a2164ab3a7470805ff4fdc347f8dc07bbd4f773b"}},{"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":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"3550574874bb30f117c52fddf668f25899e4d286bf371eeec1d0e4510c07006c"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.scopeInflationClaims (cognitive 29): verify-cv-facts.scopeInflationClaims has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 12 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":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b3c35a883bc412ba77ff478e292c97521be2c6b1623ad50710d7a1b597e07b"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.verifyOne (cognitive 29): verify-portals.verifyOne has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 9, ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f1a58df60f0306d7231c57160e079f137df00135772a30b5ee560b5dd1155"}},{"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":1148}}}],"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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddb1e48bd9e43387bc14211d356a18006feaef3bd535ab53e0568d247c2a2b0"}},{"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":1899}}}],"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":"import-tracker.printPreview (cognitive 29): import-tracker.printPreview has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 5 (10 pts), boolean chains 6, 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":"import-tracker.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba2569d2e09ad008c5cacddb0f19eefe839148f91689fa63a9b7e2eb4d90d34"}},{"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":260}}}],"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":"scan-ats-full.workableFeedCache.fetchStream (cognitive 29): scan-ats-full.workableFeedCache.fetchStream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (10 pts), boolean chains 5, error handling 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 11 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":"scan-ats-full.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"728d95ea4f72de79f3708abc53a2702c1879f4e535ca1399f4d55a5ce5c572e9"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-ats-full.runSeedScan (cognitive 29): scan-ats-full.runSeedScan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 3, error handling 3, ternaries 2 (3 pts) (nesting depth added 10). Most of this is not in the body itself: 5 of the 29 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 1400, fetchBoard, a function literal at line 1380). 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":"scan-ats-full.mjs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"721e7f9f902380e8ab27fe72703f80207a6ac47eccbee37c7cbbe411e902692f"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-tracker-url-match.runCheck (cognitive 29): verify-tracker-url-match.runCheck has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 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":"verify-tracker-url-match.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d265392d10a694c72d2f738fefe6da335df00ab0622b41dd50468faf2048aa62"}},{"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":"job-stream.readJobStream::consume (cognitive 29): job-stream.readJobStream::consume has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 8 (9 pts), boolean chains 7, 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/job-stream.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1f455656e7d4a2d087d44b08c175a6b04979047f1a0891ae3418d855cac2d9"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.Update (cognitive 29): PipelineModel.Update has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3665ac341b06d81335f5dac19caf9db184e5533a725450fec6a96cb38e73c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderPreview (cognitive 29): PipelineModel.renderPreview has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (27 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":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e4fc74eb77de6d4ebbb071b3d2faec44ab61c04b65478fc75487c8e6d0ded0"}},{"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":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c8f4eda166f905a08ab7604a842d6fbb7c60a3c9085edb8b477e9da6b73053"}},{"ruleId":"D2","level":"warning","message":{"text":"renderDocumentsMarkdown (cognitive 29): renderDocumentsMarkdown has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (14 pts), if/else 5 (8 pts), loops 3 (5 pts), other 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":"github-evidence.mjs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4401757fb973e9a5db3146c84341d52d057256b55e5c7bdff7276b4a1c2b34ed"}},{"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":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90676d8a87949aade450d25943c5d55dd29bf8b2b1f1486ff008160b3fa1fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchJobPage (cognitive 29): fetchJobPage has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 4 (8 pts), ternaries 1 (3 pts), other 2, boolean chains 1 (nesting depth added 11). Of this number, 28 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc869e747c6e097608fcf8e9d0380ce0e9541d963c54fbdb0834c40bd6ddfb0"}},{"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":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d4993cbd522222a5449b7a1f3e76ccb2582253ba1132a583273c0b8df1f931"}},{"ruleId":"D2","level":"warning","message":{"text":"fetchInContext (cognitive 29): fetchInContext has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), error handling 4 (6 pts), ternaries 3 (4 pts), other 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/_http.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a4a6ea774393663a200b9693fa9a9578ef2510d87c9e4aeefcae1efc800568"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 29): main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 3 (5 pts), boolean chains 4, loops 2 (4 pts), other 3, error handling 2 (nesting depth added 5). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"backup.mjs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e0bc58999b39f14899d4e856940a6c02b0b6d4e1f20a43e18a7756c90de889"}},{"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 155, a function literal at line 128, a function literal at line 122, \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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5007efac3a3ad01da18b9a40a19a9e8f19ac17ff15d20b08b3f7256b4168b483"}},{"ruleId":"D2","level":"warning","message":{"text":"add-entry.main (cognitive 28): add-entry.main has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (8 pts), boolean chains 7, if/else 4 (6 pts), error handling 4 (5 pts), 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":"add-entry.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ac239003fdc7b9b2e81112799b3d72871778e73876feedbe2c427ff82563dd"}},{"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":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca5bcafeeb4b3ea9e83c4e0e0a96827fdcf1eaecbc88de6562e05572b71bec"}},{"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":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"df623a3852a9f8292dc7386062fa1ebbaf6a6bf7a0b19cb7a4761a77930a6050"}},{"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":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"58be30869c103413862f78bdba6b39a33911085bf34216a36a8dbb12684de9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"bulldogjob.parseBulldogjobPage (cognitive 28): bulldogjob.parseBulldogjobPage has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (9 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/bulldogjob.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ea560dff28af5a792fe46c6f887031f5b9b3a95dadaee79386ac5b2ce77f0b"}},{"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":120}}}],"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":"job-card.JobCard (cognitive 28): job-card.JobCard has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (14 pts), boolean chains 9, if/else 4, error handling 1 (nesting depth added 2). Of this number, 18 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":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257a1e26e05d4ebf0793bae2d2e6e2786796a8587137765bbbadd9d650fad6d"}},{"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":769}}}],"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":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee4a1dbf52bbc995111c28591313526fbf3621ec01d43beee7104777c08b20"}},{"ruleId":"D2","level":"warning","message":{"text":"foldDriftKeys (cognitive 28): foldDriftKeys has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 3 (5 pts), other 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":"verify-cv-facts.mjs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0db5ecf0ecbe5c4cbac849bfcc544c0e5b7872ff7d013dc0d6e76c8ac97298f"}},{"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":"harvest::worker (cognitive 28): harvest::worker has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (5 pts), boolean chains 3, ternaries 1 (3 pts), 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":"harvest-buildlist.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"02189a46b0818053d44087ff482a2f88c8090971431866d3079b51342fa98a41"}},{"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":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbe2550bb57a6513005fe881bc1594e9ad57e3377fa3fc6795f99ef268c2c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 28): main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 4 (8 pts), error handling 2 (4 pts), boolean chains 3, ternaries 3 (nesting depth added 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":"seeds/employers-validate.mjs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"201675bbbb08638c3a53bdceb2e9fc6129e7190224b98cfdbb6ce847306ea161"}},{"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":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e9b34352d535dff105a999cd9ed7d61f61e79f2ca5c8ce10d9bbc38b7b96c8"}},{"ruleId":"D2","level":"warning","message":{"text":"checkPortalsCoverage (cognitive 28): checkPortalsCoverage has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (7 pts), loops 3 (6 pts), if/else 3 (4 pts), error handling 1 (2 pts) (nesting depth added 9). Of this number, 24 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":"verify-pipeline.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a20bbb05e16d23b4c6e364e1b2264c51d87e6b4b499a657fe931acb026cb12b"}},{"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":"cv-templates.srcsetUrls (cognitive 27): cv-templates.srcsetUrls has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (10 pts), boolean chains 4 (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":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9291c524e8ca16970aead097eedd67f5e4db2d296bae218767de69247ac1593"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.collapseMarkdownLinks (cognitive 27): verify-cv-facts.collapseMarkdownLinks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225b6a4c0043f47fec31086d5e5dea56f1d4422ae538df12f563ec8db9f26fe"}},{"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":"employers-import.parseCsv (cognitive 27): employers-import.parseCsv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 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":"seeds/employers-import.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bc54436b850227f398a6924d61b261502f2c827faeab89fca342d0d162f7bd"}},{"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":215}}}],"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":"trakstar.parseTrakstarPage (cognitive 27): trakstar.parseTrakstarPage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 7 (9 pts), boolean chains 7, loops 1 (nesting depth added 7). Of this number, 25 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/trakstar.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b012688eeee640fac8a127944c30057c5c50743a41ad1da41120a6ddd0e44"}},{"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":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"9591ed62428610c979a5fe5e2d0d1329852d5b7ccfb46d830a05ca734bdb5995"}},{"ruleId":"D2","level":"warning","message":{"text":"assistant-chat-store.saveChat (cognitive 27): assistant-chat-store.saveChat has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 13, if/else 10 (11 pts), error handling 2, ternaries 1 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 11 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":"637f6eb8df9bbac61f4c80e5fd92663a583d136aaf1a3f3e4598d2eb161ccedd"}},{"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.renderBodyWindow (cognitive 27): PipelineModel.renderBodyWindow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, loops 2 (nesting depth added 12). Of this number, 23 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":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e4776a3553a00c267c2cd3e0c6bf5e2bab162296f07e148a2ab837801077f"}},{"ruleId":"D2","level":"warning","message":{"text":"bulletDriftClaims (cognitive 27): bulletDriftClaims has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 4 belong to 18 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a099bea3e82c7009d8240745739d87ea00c07fdee78d105789e18ba072d4b8a"}},{"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 5 function literals inside it that branch (lines 546, 520, 520, \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":"build-cv-html.mjs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f89bc7d3d2caab96da3adf498f7ba864809f70bc9c2fe162c508df7bfb460c5"}},{"ruleId":"D2","level":"warning","message":{"text":"planScanHistoryPrune (cognitive 27): planScanHistoryPrune has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1, 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":"detect-reposts.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5016b1c17042f23ea89820dc75056af66725ee960ab844adc7d0c1d1710c7b06"}},{"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":"backup.templateUserFiles (cognitive 26): backup.templateUserFiles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 2 (4 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 10). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0add13afe4962ebd9e461475ec5e0f0956a1c80d04f5fae64570e7899e3ab2e"}},{"ruleId":"D2","level":"warning","message":{"text":"invite-evidence.parseProposedTime (cognitive 26): invite-evidence.parseProposedTime has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 8, ternaries 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":"lib/invite-evidence.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1820d96ce2a1ee37a95315f36141a9fa0677dc2480614886e62f75b3bf139d93"}},{"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":1666}}}],"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":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7800ea49cd642a38819b5ff88b2969dd398e9553023690356c5b223ba440b90"}},{"ruleId":"D2","level":"warning","message":{"text":"harvest-buildlist.boardFromUrl (cognitive 26): harvest-buildlist.boardFromUrl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (8 pts), boolean chains 5, loops 2, 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":"harvest-buildlist.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adac6cd4953b26c9bca26e360a7c50174058ff04d872d83ec4a2f70d65c4788"}},{"ruleId":"D2","level":"warning","message":{"text":"ics-interview.parseVtimezones (cognitive 26): ics-interview.parseVtimezones has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 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":"ics-interview.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"10686db3d08ebf39257968efb138e3ee7917a5e54732c17bf9b921e1d4114863"}},{"ruleId":"D2","level":"warning","message":{"text":"inbox-rank.titleClause (cognitive 26): inbox-rank.titleClause has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, 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":"lib/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9754cb68ddde3fb3ad51a5b43ba99ccebe1c2c0da66a159be11b0adbb9eeff29"}},{"ruleId":"D2","level":"warning","message":{"text":"applicantpro.parseDetail (cognitive 26): applicantpro.parseDetail has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 4, if/else 2 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 10). Of this number, 23 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":"providers/applicantpro.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08aeb6f6e4039c076183aba93bf2d7164e2c38b03bc6094910d668badd74f9f"}},{"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":187}}}],"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":191}}}],"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":"route.POST (cognitive 26): route.POST has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 3 (5 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c428f659d4091d5633ce6101f3ca573e20e44e576d3442e07d87d62e559c95"}},{"ruleId":"D2","level":"warning","message":{"text":"page.JobPage (cognitive 26): page.JobPage has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (12 pts), boolean chains 11, if/else 3 (nesting depth added 4). Of this number, 20 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":"web/src/app/jobs/[id]/page.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dda799c43464bada8f385479181e7011b964a544ba20382274ebd680328511"}},{"ruleId":"D2","level":"warning","message":{"text":"worker-card.WorkerCard (cognitive 26): worker-card.WorkerCard has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, ternaries 9 (12 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0d19a16017ef3e6b66cfefe012af9d0d861c524273cae9ec9a7f8983d8eaf5"}},{"ruleId":"D2","level":"warning","message":{"text":"mark-pdf-ready-button.MarkPdfReadyButton (cognitive 26): mark-pdf-ready-button.MarkPdfReadyButton has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (14 pts), boolean chains 8, if/else 3, error handling 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 6 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/components/mark-pdf-ready-button.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3eff744828bd1aba1e6099846f18970679005e3cbf768b47eb273cc0596e4"}},{"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":"inbox-rank.titleClause (cognitive 26): inbox-rank.titleClause has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, 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/core/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4a2bd41ec0ab2168fbc6f075ad2cdd918c4b53ebf867c1838c384bfc136d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"studio.studioReducer (cognitive 26): studio.studioReducer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 4 (9 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9289746dfa8f4e6b2d9dcd2b0f8cbc796a1d83f8ae0ced0a4ae27ed07f79a4"}},{"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":"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":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e5c0a49cbf86d4889258f0709eb3455f29d5449f071ee0d8475797ddf65af5"}},{"ruleId":"D2","level":"warning","message":{"text":"parseArgs (cognitive 26): parseArgs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 6 (9 pts), boolean chains 5, other 2 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 4 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":"scan-ats-full.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7996094f8a930e10c9a0c5fc8105b0ff5f99e161682918f0b704e3f89babbc1"}},{"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":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cc1b5e7da2d2e1273bafe6c637808ab88dd57fc77538768647b3f66477c6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"runCli (cognitive 26): runCli has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 4, boolean chains 3, error handling 2, other 1 (nesting depth added 3). 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: 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":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"476338a8d59ba7e2ccb478aebc7bd20cc968b25cbf89c5ef461ca6fc4a9aa4f7"}},{"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":943}}}],"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 353). 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":350}}}],"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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7634626782a383382a48ac576dd65199aefb836b0373d4c856f58fb05356c27"}},{"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":"hibob.parseHibobJobAds (cognitive 25): hibob.parseHibobJobAds has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 9). 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/hibob.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7a2ede24c82798e3b329ef12aaa5d14e8cf1d0eb2f69180044c74585636eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.buildLocationFilter (cognitive 25): scan.buildLocationFilter has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 11, ternaries 1. Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (filter, filter::matches). 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":"scan.mjs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d98ee74219bea446022be4d118e80d19ae53a45e7b5d34e04b6d0141e8e7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"pinpoint.parsePinpointResponse (cognitive 25): pinpoint.parsePinpointResponse has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (12 pts), if/else 6 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). Most of this is not in the body itself: 9 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 134). 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":"fix-slugs.appendNote (cognitive 25): fix-slugs.appendNote has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-slugs.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd98d26105218e2e6408f2819d9ffe3e5801c93b63a36a903da05f5992782540"}},{"ruleId":"D2","level":"warning","message":{"text":"reserve-report-num.occupiedFromFailedBatchState (cognitive 25): reserve-report-num.occupiedFromFailedBatchState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 1 (4 pts), boolean chains 3, 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":"reserve-report-num.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1c7a1fa520efdc6a2da7c66978012ae15ca28cd6f97cc0efb98294f35ea6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-cover-letter.main (cognitive 25): generate-cover-letter.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12, ternaries 3 (6 pts), error handling 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"d029a60ebbf7ef3c9b51684872a968ec07150990266867bc69f50e7d3dfad0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-validate.parseArgs (cognitive 25): employers-validate.parseArgs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba48bc782b350b96a692aa56cbfc1e2ec058502fbdd453c5d8861ddd6d71a1ab"}},{"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":"merge-tracker.reportNumbersWithStatus (cognitive 25): merge-tracker.reportNumbersWithStatus has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 1 (4 pts), boolean chains 3, 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":"merge-tracker.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd401c9c43eafb3103ce31a60a345f23552cd71b5354fdf5e879d673d2592ddb"}},{"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":280}}}],"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":250}}}],"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":"comeet.parseComeetResponse (cognitive 25): comeet.parseComeetResponse has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 7, if/else 3 (5 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 125, 159). 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":"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":"remote-com.parseRemoteJobs (cognitive 25): remote-com.parseRemoteJobs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 4 (7 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":"providers/remote-com.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"77213ba5cefa6bbdb0490fef8b7169c1db856bb5a67de731d587dda6b5614d2e"}},{"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":"vc-portfolios.fetchYCCompanies (cognitive 25): vc-portfolios.fetchYCCompanies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 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":"seeds/vc-portfolios.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"600efb91c05cd7398bba3c74741136177a18bbcebe2e9ace132290cdb5c5e8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-topdev.cardsToJobs (cognitive 25): scan-topdev.cardsToJobs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-topdev.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b653b5e19acb360a44e8ef713fa10bd8151c4be9540eae966f6dc30e21044496"}},{"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 43, 63). 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":22}}}],"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":"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":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe43ec5b1726628920364ce5937b9d1e7726b19ce48f1764afbd4667a1ac97"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.overlayDiscardPicker (cognitive 25): PipelineModel.overlayDiscardPicker has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"86723f8066e0946551307035f8152260d0cc493ce24dfac1ae3b915e44e12d34"}},{"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":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa63959d3f4f0b1d60579400a60c15b23712242c5a7b4958da8aa1ce3cb5307"}},{"ruleId":"D2","level":"warning","message":{"text":"scanHtml::htmlEnd (cognitive 25): scanHtml::htmlEnd has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (9 pts), boolean chains 6, 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":"cv-templates.mjs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0884cd76ff780ec1d0ac3f368485ad3092d0b9c95943113fa125c5a4c978b6"}},{"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":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b02c003dc2055991bf6372cbb0dccaf947737b8caea3318352511aa54b992c"}},{"ruleId":"D2","level":"warning","message":{"text":"readCheckpoint (cognitive 25): readCheckpoint has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (5 pts), ternaries 5, other 2, error handling 1, loops 1 (nesting depth added 1). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 8 function items inside it that branch (boardHolds, isEntry, clean, \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":"harvest-buildlist.mjs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabf6d77f1b77025b9264e1b3eee1731c23a244941049b7246d44fb41a79c821"}},{"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":571}}}],"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":"visibleText (cognitive 25): visibleText has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 5 (10 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":"lib/jd-page-fetch.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1a9f902ccc2354f641de70a87d3d072f431848d7d881ca6b0e697413f792a5"}},{"ruleId":"D2","level":"warning","message":{"text":"planImport (cognitive 25): planImport has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (10 pts), other 5, ternaries 5, boolean chains 3, loops 2 (nesting depth added 1). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 225, notes, at, \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":"import-tracker.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ef42eb855504a38f9832a1a5acf3607020da916517a37366e7850747fe1b13"}},{"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":"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":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddecd4beccebc6d4364759fa16a392b655c17909a7a88e3ace41dda20186b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.main (cognitive 24): build-cv-html.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8, ternaries 5 (6 pts), boolean chains 5, loops 2 (3 pts), 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":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ed13b59550433ab5d822e46278305196ba5ac1c4a1fa0cb5c631a693c75b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"_country.countries (cognitive 24): _country.countries has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 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":"providers/_country.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c5677bc3c5cf3b362e0e8734a2a18cf69aa6cdad9b019db5a245f01ad380d1"}},{"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":468}}}],"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":431}}}],"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":181}}}],"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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01c0fcb95b62e9dc6795cb6d69daf6d57061c3cfe2ec912c8729abd10ba97b"}},{"ruleId":"D2","level":"warning","message":{"text":"inbox-rank.fitTargetsFromProfile (cognitive 24): inbox-rank.fitTargetsFromProfile has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 11, if/else 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, 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":"lib/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950561506ccadabece5b6b82c5ba6c4d6d3caa6c774083488990ee42e38b014"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-mail-drop.decodeBase64Parts (cognitive 24): linkedin-mail-drop.decodeBase64Parts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). 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, split the body into named stages: move each independent step or branch into 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/linkedin-mail-drop.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e06ff26919faf191b2c203b2643f42e2673e40e2d620542ff06bc00d622c3ae"}},{"ruleId":"D2","level":"warning","message":{"text":"darwinbox.parseDarwinboxResponse (cognitive 24): darwinbox.parseDarwinboxResponse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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":"providers/darwinbox.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4225144817f90300327ea94da125830639007f5354fb0b5a08485e2053b01f"}},{"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":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab84304690512fe63d7462313a34f67134a60b60df848c3315c19788d528bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-fold.main (cognitive 24): employers-fold.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (7 pts), loops 2 (5 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":"seeds/employers-fold.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7904f64f5eb13b360a02a9de1d95544e9d428ba7009f592761a556b0a6a89446"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ApplyPage (cognitive 24): page.ApplyPage has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 10, if/else 5 (8 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8344b033ada85fbbe7e89e7d83b17a4ecfe23952a397d2bfa5749b5b47ceded"}},{"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":"analytics-metrics.canonicalizeArchetype (cognitive 24): analytics-metrics.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":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8d60456f4df4a8af5efa6bcc8c531d9b2576d7d4b974a26ea84b3811f74bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"inbox-rank.fitTargetsFromProfile (cognitive 24): inbox-rank.fitTargetsFromProfile has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 11, if/else 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, 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/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"566b6578d578f1e2dcaae524049d56a355534f58ed7ccf18b477c4c317ff3489"}},{"ruleId":"D2","level":"warning","message":{"text":"posting-url.markdownLinks (cognitive 24): posting-url.markdownLinks 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":"bf62d727c6022114d4f96ce527e85a3a4a70ed9ab3c9bc6878e89f06675f438d"}},{"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":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"26427c852bf7cdecd3d8ae5c9d0652511659b5dbb2227fdcbbf0056177bbdc41"}},{"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":"PipelineModel.renderKeysHelp (cognitive 24): PipelineModel.renderKeysHelp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdcacbec3c62a5a941d6fd9351d75d896b93ac5943f6b780cffb5f1530435ac"}},{"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 1409, 1390, 1399, \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":1389}}}],"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 854). 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":846}}}],"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":1451}}}],"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":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a06973bf33c08f12c5c70e12ee0411d022563f6a9c2164025671e6e4b383c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"cmdEvaluate (cognitive 24): cmdEvaluate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 4 (5 pts), ternaries 3, boolean chains 2, loops 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":"openrouter-runner.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f277ef3bbc80f69b2adb14d56aefb4e7d785bf78b95d440ce42f5c93c20bd4b"}},{"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":"inspect (cognitive 24): inspect has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (5 pts), other 5, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/privacy-guard.mjs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5a9aba50020ae5e5f8bf0d486608cc522cc0c80a81577687d17c582e078947"}},{"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":480}}}],"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":"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":1852}}}],"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":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db0118d155ec6806987b18e44feabae0786791de38ad2fc33a581934fcf2693"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-profile.checkKnownValues (cognitive 23): validate-profile.checkKnownValues has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 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":"validate-profile.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"45307d071d604a01cc95964ca201f3a54dbdd9df927d636c777287517cff0677"}},{"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":352}}}],"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":"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":"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":"employers-import.main (cognitive 23): employers-import.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2, error handling 2, loops 2, ternaries 1 (nesting depth added 1). 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":"seeds/employers-import.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a979349f2e427e839e89da59c4e68a42ae892cfdebda752821f3ab72b1c4eb"}},{"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":271}}}],"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":"applicantpro.parseListResponse (cognitive 23): applicantpro.parseListResponse has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 5, if/else 3 (5 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/applicantpro.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adf0d93ed1f0474320ee5af2165fd40a845605a43da7a23a5e0260fd901e595"}},{"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":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056ab8cb58eb4d640b156dcef3d2db2ced7ebdad5a83a1e6769dbb32acb2538"}},{"ruleId":"D2","level":"warning","message":{"text":"polymer.parsePolymerPage (cognitive 23): polymer.parsePolymerPage has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (8 pts), boolean chains 7, if/else 4 (7 pts), loops 1 (nesting depth added 5). 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":"providers/polymer.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46d0d85a2e1680d77f88aa3e5727659d2964848474637a9b2878ebfc7b9735b"}},{"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":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"10276a09b2fad2715e0e65b72c061f8f1740ae37bb2c7a1ac74264709d724084"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluation-gate.classifyEvaluationGate (cognitive 23): evaluation-gate.classifyEvaluationGate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6147f5c3b6871055542ebb7b85708c19abf16e374d99cc31acb014f0952ddc5"}},{"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":118}}}],"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":461}}}],"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":778}}}],"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":435}}}],"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":647}}}],"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 1125, 1154, 1149, \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":1109}}}],"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":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d4098dd66abd22a9e70c3948e000d637e159cb397858e4478cdf2d0c55c6f8"}},{"ruleId":"D2","level":"warning","message":{"text":"crawlDelaySeconds (cognitive 23): crawlDelaySeconds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (4 pts), other 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d130f71082452f8fed302df7309cc8db56ab4229fb4a8793b6b597172aed9032"}},{"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":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4a51a7d518acd098b617827de210e394f671bd0eec2ef6a7bdd2a28b218b85"}},{"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":197}}}],"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":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"51735342169b623e529f66bb8a2488e6a489e02f5a2c419152624afc303724a7"}},{"ruleId":"D2","level":"warning","message":{"text":"process-quality.aggregateProcessQuality (cognitive 22): process-quality.aggregateProcessQuality has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"process-quality.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc5f4d39ba7494d8a4ce1f126d54284151ff442863245c9614e363ee483c08"}},{"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":236}}}],"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":211}}}],"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":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ee6c74927f918ee444c0e7717440d05409612b2d3d1cb3fd7cc054ffccf8f"}},{"ruleId":"D2","level":"warning","message":{"text":"privacy-filter.buildRules (cognitive 22): privacy-filter.buildRules has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 4 (5 pts), loops 2 (3 pts) (nesting depth added 4). 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: 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":"utils/privacy-filter.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2bb3f7cd1d22910f5e30623b8feb5b2174873ee531e7624870d9de862b10a5"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-latex.compileLatexFile (cognitive 22): generate-latex.compileLatexFile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 3 (5 pts), loops 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"703743508e66e0e469c23ba791801c32b3058aaf4a7b1f43d765754b38495dfa"}},{"ruleId":"D2","level":"warning","message":{"text":"intake.formatHunks (cognitive 22): intake.formatHunks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). 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 into named stages: move each independent step or branch into 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":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea31e7f073f0770ad1b099501623f7fae2c92ea976d20393ea3544a99bfa9fe"}},{"ruleId":"D2","level":"warning","message":{"text":"openrouter-runner.validateEvaluationResponse (cognitive 22): openrouter-runner.validateEvaluationResponse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"569315014854f1f285217c5ab487e19306332dff9e88e80d9c5919edf011d916"}},{"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":"adp-workforcenow.resolveTenant (cognitive 22): adp-workforcenow.resolveTenant has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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/adp-workforcenow.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ae2efbc100fae120d90f9aa71f34f7937edcbcde53895b581e1acd97fc6776"}},{"ruleId":"D2","level":"warning","message":{"text":"arbeitnow.normalizeArbeitnowJob (cognitive 22): arbeitnow.normalizeArbeitnowJob has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5, 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/arbeitnow.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c7f1bb0511093022b58055cca9607700361134ca057761ea65fc8842f279f8"}},{"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":"successfactors.fetchRmk (cognitive 22): successfactors.fetchRmk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 3, ternaries 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9323c31fdaed20e4637917fd4e9721e09f57d53b5fe2bfb59a141da9561f5ec4"}},{"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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e215dbcddcd46bf7528787265de89ddd7ae00676193656c6d226dd692c7a46"}},{"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":986}}}],"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":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ad942e444e40c459221ffacb11321aa9944d09313d5698b9a672221ba02c38"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 22): route.POST has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, ternaries 7 (8 pts), if/else 4, error handling 2 (nesting depth added 1). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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/app/api/runs/save/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cac7864f07bb141907d26429a3ac2a8218ca469137cfad56bb8a67dc8af11e9"}},{"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 57, a function literal at line 167, 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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb896028f4998f5b5c61acf09a668b7456dceb562279c33e945da80cbdef124"}},{"ruleId":"D2","level":"warning","message":{"text":"handoff-gate.handoffDecision (cognitive 22): handoff-gate.handoffDecision has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (10 pts), loops 1 (nesting depth added 6). 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":"web/src/lib/apply/handoff-gate.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eac4808f2e8297e8661b146c31955f9844a77c6f0e284ab2dd9e32fc9845a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-pdf-file.locateTailoredPdf (cognitive 22): cv-pdf-file.locateTailoredPdf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 2 (4 pts), boolean chains 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":"web/src/lib/cv-pdf-file.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a1984c247da0385e3531740a7776d2bbc27ea8081318a4c81d95b5ab549d3"}},{"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":395}}}],"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":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3498139c5ae078fc4ea535c68bf0631615212dcace6f2180e623cc7301999d"}},{"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":4034}}}],"partialFingerprints":{"codehealthFindingId/v1":"615bbb7e5ab0c289c01285b45d6993df6d1e75629bfd6ae575454018632fddfd"}},{"ruleId":"D2","level":"warning","message":{"text":"syncIndex (cognitive 22): syncIndex has cognitive complexity 22 (threshold 15). Drivers by points: other 8, loops 4 (5 pts), ternaries 3 (5 pts), if/else 2 (3 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":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473b848e3e48dd7ca3d929aa2ac83438fc5632b48a5f674c3e1b11b4a62ebc2"}},{"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":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ebb2c522f4e221ae26e505ebabacee1dae3c4f1c1c7b4bf8d6f751572517ad"}},{"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 301, a function literal at line 286, 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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb569da6bf99d6e017f0decbdadcfa8eee2e3ae0648dc86aaf46125af00077a"}},{"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":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d07593d20d515838436af925e661bf2ace5d5bb4aca620cf96cbfeee78032b"}},{"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":"consumeEvent (cognitive 22): consumeEvent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, other 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-eval.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d8694ab86cb56dd759563dd58a12544e7c70daa54537213eba184ae1fa6410"}},{"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":"fetch (cognitive 22): fetch has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, ternaries 5 (8 pts), if/else 4 (5 pts), error handling 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into 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":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8c2bf6cfabc0f90e966efc86e608a74ee9d25ded74bc5fa4a111e8577ce539"}},{"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":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e77f4f68d58244c321b597c7cf7292cb1cd67f83bf494bde74de35adf1af363"}},{"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":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0671487093a45545d593de263f55f9520ec6cd05eb97f9a4a9aa4de66bde6d"}},{"ruleId":"D2","level":"warning","message":{"text":"update-system.checkStatus (cognitive 21): update-system.checkStatus has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 5, if/else 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e89414b8c93170f80e00da5aeae424720048886da2c6e2af7e723d9643f235"}},{"ruleId":"D2","level":"warning","message":{"text":"browser-extract.normalizeHibobJob (cognitive 21): browser-extract.normalizeHibobJob has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, ternaries 5 (6 pts), loops 1 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 4 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":"browser-extract.mjs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"61666307668774b33e31cc0e118d498956b769a3f239a32f7a41c50c3b1cccc3"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-voice.voiceIssues (cognitive 21): cv-voice.voiceIssues has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). 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 into named stages: move each independent step or branch into 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-voice.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"91918d27c0fdc45680db5868097ad58a33f2b7aeabb87a60ecdbb0af0c41b44f"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-portals.probeSlug (cognitive 21): verify-portals.probeSlug has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 4 (7 pts), error handling 2 (4 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":"verify-portals.mjs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dbc8055b59ed0a1cdc8df1f2d4837e66eface09a72668d76f4b755eaa2cb1b"}},{"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":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff3a3a22a7d2dda132fe0cb7d632bb369b1c49e04514acbb9aa9776436c5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"check-liveness.urlPositionals (cognitive 21): check-liveness.urlPositionals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 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":"check-liveness.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a185fa5e521696b4110a458dac18382f3989432694943453c17dfbfeb1ea430f"}},{"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":356}}}],"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":"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":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db5cd102ecdbc276ab49c1550e22918a13d558358a23fff3cd04f7211ba7d5"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize-statuses.normalizeStatus (cognitive 21): normalize-statuses.normalizeStatus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 1). 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: 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":"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":"a16z-speedrun-talent.normalizeSpeedrunJob (cognitive 21): a16z-speedrun-talent.normalizeSpeedrunJob has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (8 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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f540fa4e69a909b3c4c6246147314de30ae9191802f71cecf0aa41dab6a6678"}},{"ruleId":"D2","level":"warning","message":{"text":"germantechjobs.parseGermantechjobsFeed (cognitive 21): germantechjobs.parseGermantechjobsFeed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"providers/germantechjobs.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f688971df9873b43e4850279da0db6cf924953ed38d6a440f3fdd6924b0ece"}},{"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":"sponsor-check.renderAnnotationSummary (cognitive 21): sponsor-check.renderAnnotationSummary has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (12 pts), boolean chains 4, if/else 2 (3 pts), loops 2 (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b25cbf7c9171d49cfd4912041b400fbfe7a19b3f3fa1a37d34b4aefbe444c4"}},{"ruleId":"D2","level":"warning","message":{"text":"web-service-ops.uninstallService (cognitive 21): web-service-ops.uninstallService has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/web-service-ops.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b802a5d6fea2ff9ad0ba138979a2c76b893832eea1866059e8020a424adfcf0"}},{"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 47, 88, 71, \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":37}}}],"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":"page-estimate.heightAfterPages (cognitive 21): page-estimate.heightAfterPages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/page-estimate.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e373fee1f9a41fd1050859f30379ef4e9a54cd72dabf7324a6e1a50900d6cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-table.parseInbox (cognitive 21): pipeline-table.parseInbox has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (7 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":"web/src/lib/pipeline-table.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6889fa1cd5b4cd92d5b59b73ad4d04b1c403c41e4cab685dc433439ff851ead2"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline-views.normalizeView (cognitive 21): pipeline-views.normalizeView has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 4 (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-views.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae102594912582d8b950d32bc626bd402c7fc052789c2ba58c91e91efd700df4"}},{"ruleId":"D2","level":"warning","message":{"text":"schedule-label.scheduleCadenceLabel (cognitive 21): schedule-label.scheduleCadenceLabel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 3 (5 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":"web/src/lib/schedule-label.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed400cf0318399ddeb569b84fb2803510a3d7137070df8e716d57d928b181314"}},{"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":"PipelineModel.columnWidths (cognitive 21): PipelineModel.columnWidths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), match/switch 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4036bc176f65b91df783f588ba4bd7ae67db58088e74ef0adfc1647b6055ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderAppLine (cognitive 21): PipelineModel.renderAppLine has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2c74d5bfe82736b6ab5974b44006fb4b4fd409ff4f5e0cefa33e12b3bd742a"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.handlePendingKey (cognitive 21): PipelineModel.handlePendingKey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts), match/switch 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_pending.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e9d72007b9d087a8fb9ddf3eb39783c627ce6cccfa073cfb50325cfc4bbd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"buildContentFilter (cognitive 21): buildContentFilter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 7 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":1088}}}],"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":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6305a955dbd9fef8b6a013e2adb1e0a243aa54a8217b1c70cc9931714542377"}},{"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":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"264c7705ac26dc1ce2ad0bf1a033cd8996ac86509a59ace1fe57b3074f5a09f3"}},{"ruleId":"D2","level":"warning","message":{"text":"buildPrompt (cognitive 21): buildPrompt has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 5, other 3, boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-prompts.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be9c3de2f05ca0e68b6c76181b89056e90de022ed48bb037e95cd4eddc90ccb"}},{"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":356}}}],"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":"_net.resolveAndValidate (cognitive 20): _net.resolveAndValidate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, error handling 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_net.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc0b89e2d280f6638bcddfa755d44bb966a03982c13bb7075fa67b76275f67"}},{"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":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe0bb040378afeeea781f94acabf7ebedbf92ae0aaa2f737bee0643965d5547"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.releasedHistoryKeys (cognitive 20): scan.releasedHistoryKeys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"a345c8b0ea8242fd924eaa1e552ca0c01c849a189df6800c4d09ec2a743fb4b2"}},{"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":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c28d8fad5057f56f87ebd6d8e6b82774a9e334df335874f8e0f295178bc37c"}},{"ruleId":"D2","level":"warning","message":{"text":"adp-myjobs.parseListPage (cognitive 20): adp-myjobs.parseListPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 3 (4 pts), loops 1 (nesting depth added 5). 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/adp-myjobs.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d4e43c38522545d531fd97e07b63596870160696db2c09dfbfbf62b9621d27"}},{"ruleId":"D2","level":"warning","message":{"text":"aldi-nord.parseQueryResponse (cognitive 20): aldi-nord.parseQueryResponse has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (8 pts), boolean chains 6, 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/aldi-nord.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"255d252e9d66fd9878090a3c07a775442c5bc186b9e87b35ed24f0c06568a271"}},{"ruleId":"D2","level":"warning","message":{"text":"ibm.parseIbmResponse (cognitive 20): ibm.parseIbmResponse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (7 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ibm.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1706859cf235517811b8aa09590e25f15a7241d5b020c517949c65cdd9d995"}},{"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":237}}}],"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":159}}}],"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":"rexx.parseListPage (cognitive 20): rexx.parseListPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef03cd21f22490b89190ebb6e62463e3e9fe8eef1e6d7a6c7935a2da00954e"}},{"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":"thehub.normalizeHubJob (cognitive 20): thehub.normalizeHubJob has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (11 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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa89ef07a5e357dfd9addd4dbadd790d577469bcc205137b836af4a82405e921"}},{"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":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e16ceda62e571432b040508ba9fa97f2a1e740f4f62220039c027d8653fc6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 20): route.GET has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 5, error handling 3, ternaries 1. Most of this is not in the body itself: 5 of the 20 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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"76148a4681540453ac86347994c2b3264dbe17e02656af00f1001e806a22527d"}},{"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 32, 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":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8592e975a10ade72ee3718d5de7fd8586dbde01a753984b10f6938f41e9d66"}},{"ruleId":"D2","level":"warning","message":{"text":"template-editor.TemplateEditor (cognitive 20): template-editor.TemplateEditor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 6, if/else 6, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 5 function items inside it that branch (save, a function literal at line 29, a function literal at line 34, \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/templates/template-editor.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0692c62890e113a59062dacc3fd0af441c7ffed6f1c4d10bb893bc4ecbd2997"}},{"ruleId":"D2","level":"warning","message":{"text":"analytics-metrics.computeProgressMetrics (cognitive 20): analytics-metrics.computeProgressMetrics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 3, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffd91fa33dc4e24483dbdffe3befb4d27d4e479411b3a636ac679136be8f0eb"}},{"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":"cover.resolveTailoredCover (cognitive 20): cover.resolveTailoredCover has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (3 pts), boolean chains 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":"web/src/lib/apply/cover.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3ee72fccf866a9532f6c2daf53d485f2258077e0a46beae209a44d7e292a87"}},{"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.View (cognitive 20): PipelineModel.View has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5014e2ab64fc58171ac44818d7a921282a87f497400ffbbeac19826ff2f18bf6"}},{"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":"resolveTemplate (cognitive 20): resolveTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 4 (5 pts), boolean chains 4, error handling 1 (2 pts), other 1 (nesting depth added 4). Of this number, 19 points are the body\u0027s own statements and 1 belongs 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":"cv-templates.mjs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe8bbffd19fcff66baa587a2ff47be9956000c058e7653edd374690559865b4"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 20): main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 3 (4 pts), boolean chains 1, other 1 (nesting depth added 3). Of this number, 19 points are the body\u0027s own statements and 1 belongs 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":"browser-extract.mjs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76398a6f9900636ef6d1da26d3930bd7f4dad9c6757f89294002e9f145fb52"}},{"ruleId":"D2","level":"warning","message":{"text":"classifyLink (cognitive 20): classifyLink has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 3 (5 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/telegram-channel.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed5387df37cad64df6c3b670e60e7c76f5c6eb1e24caa13140e868f5d5e451"}},{"ruleId":"D2","level":"warning","message":{"text":"makeGuardedFetch::guardedFetch (cognitive 20): makeGuardedFetch::guardedFetch has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (8 pts), if/else 3 (7 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0bd0af171d08823c5ca7db64f658018bad4ee11903f023f908f166a2b9d14a"}},{"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":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cc27cb9a587ea236eed709beb7506bb556edd946be2fd0e6cef71969fdbd8d"}},{"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":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d738c74b91463ed941d79ba0fd2dd94ce3e897c3aad17bb80e7793e13b5aa36"}},{"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":"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":"jd-parse.stripMarkup (cognitive 19): jd-parse.stripMarkup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (7 pts), boolean chains 2, 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":"lib/jd-parse.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cdac487685e089448ce2374ba0f7002ea9a07e2e5e6e695425117d40819fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"himalayas-posting.classifyHimalayasPosting (cognitive 19): himalayas-posting.classifyHimalayasPosting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"himalayas-posting.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe5947a575295c15ed2c99b0006b0f73eb8cd405b683056b908e985e2f835d2"}},{"ruleId":"D2","level":"warning","message":{"text":"_salary-text.parseChineseAmount (cognitive 19): _salary-text.parseChineseAmount has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 5 (6 pts) (nesting depth added 1). 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: 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/_salary-text.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c3995d3d13dd0ad79cddfecf09dbfcb26da37d19d0bb3d4ec0afcf72da2fda"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.predicateWords (cognitive 19): verify-cv-facts.predicateWords has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (7 pts), loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 2492, takesObject, isVerbal). 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":"verify-cv-facts.mjs"},"region":{"startLine":2478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f65016ebbbdf84e2b4f3c5e28b7fefb24e25ee1f1f39b461f36497094aa863f"}},{"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":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363cd0bf2cfdf4c4246e722983a793a6fbe84dad8ffdc5d15c8e132df0dec07"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cv-html.runMarkdown (cognitive 19): build-cv-html.runMarkdown has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"719029973823652cfcfc348076d43dcc504d7698756df5546cf930a070331058"}},{"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":"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":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0062e40f4d7444d20f08fccf0a75b520a76cb5385b17b4eb6016214412251e95"}},{"ruleId":"D2","level":"warning","message":{"text":"eval-evidence.moneyTouchesPayWord (cognitive 19): eval-evidence.moneyTouchesPayWord has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/eval-evidence.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"779a0c7ef9c50ce25018b9fdfea778a8f406ab2e2a70f5948adc112a2125af56"}},{"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":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b6aeb62de08a0faef2f412b17b2ab0e895379aefe3387337e3c51740fd59fe"}},{"ruleId":"D2","level":"warning","message":{"text":"reserve-report-num.gcStaleReportReservations (cognitive 19): reserve-report-num.gcStaleReportReservations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, 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":"reserve-report-num.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bfe17e1600bc1959efbb5584be6d4c8e91a4ea82c7abae7617b8cee11978a8"}},{"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":"keyword-match.resolveKeywords (cognitive 19): keyword-match.resolveKeywords has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 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":"keyword-match.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e2a42affbb9b40dfabbb8d98db2e92352f8f69e2ab5731759dc339b245e4f"}},{"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":"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":"keka.parseKekaResponse (cognitive 19): keka.parseKekaResponse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/keka.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bc84b648a97a8609f90e656e483c66e62d94c724be0cdd1f2660643824acb7"}},{"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":"tes.parseTesJobs (cognitive 19): tes.parseTesJobs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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/tes.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"affdfd12306a178e0d663ab17f3d6b5a15a2ad3b20a77711d251224c59f5c4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"turbohire.jobLocation (cognitive 19): turbohire.jobLocation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (5 pts), boolean chains 3, 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/turbohire.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"326b7f7d69bc437fe6550a77ebd741ea76b108c4e6ee1e81fb8a170d829e6a16"}},{"ruleId":"D2","level":"warning","message":{"text":"turbohire.parseTurbohireResponse (cognitive 19): turbohire.parseTurbohireResponse 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/turbohire.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"90148715add2b46c1cebc477eac1a9d384bc106e850266968d1a706ef40ff471"}},{"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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3232b4e408b2cda7b915d4cc09bd04a21657e773eee5f199b538c66070cd63a7"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 19): route.GET has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"76afef6ad129af90ad0da4b24bb2394ead86f144143c85314728b38965dae5a1"}},{"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":"cadence-settings.CadenceSettings::save (cognitive 19): cadence-settings.CadenceSettings::save has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (5 pts), boolean chains 3, 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":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0af3f6ee0f9bfcd02c28cbcdff7408eb2b422b9f8d94dc1ef1d4c7626deaeb"}},{"ruleId":"D2","level":"warning","message":{"text":"onboarding-progress.OnboardingProgress (cognitive 19): onboarding-progress.OnboardingProgress has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, ternaries 7, if/else 5. Of this number, 15 points are the body\u0027s own statements and 4 belong to 4 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/components/home/onboarding-progress.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74ca97a242b161faf52ac54dc68e242347b4a13954be6fb23a6264bb7eef7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-paste.LinkedInPaste (cognitive 19): linkedin-paste.LinkedInPaste has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, a function literal at line 37, a function literal at line 81). 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/linkedin-paste.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e2fd9d4f17733200091abc7e1728aaa1719a2ce885bcec1f260517587e6b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-checklist.walkElements (cognitive 19): apply-checklist.walkElements has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86db591e1a7100fd8487b7abb17ad7e579733f82e12c859d6fdce4f74879133"}},{"ruleId":"D2","level":"warning","message":{"text":"apply-checklist.tailoredResumeText (cognitive 19): apply-checklist.tailoredResumeText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 1 (2 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfa8025362c21aef7597ad13870dc16612afdc870db46ac6608f8ef06dbe40d"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnose.tryApplyTrigger (cognitive 19): diagnose.tryApplyTrigger has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9259cc7b63c08f393c009f5146c34bd91a5429cf1dea583a5440348df4e645b1"}},{"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":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdb9277aa31a0b1111ac8297340e8b7cd8404724096e8683e8b19157c3e383"}},{"ruleId":"D2","level":"warning","message":{"text":"page-format.resolveRenderPageFormat (cognitive 19): page-format.resolveRenderPageFormat has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/page-format.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7309cd61e3e38fc444cd61e4f4798afbd81cee46fa8916e168fd090bd1173f50"}},{"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":"data.loadBatchStatuses (cognitive 19): data.loadBatchStatuses has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3, 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":"dashboard/internal/data/pending.go"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"768345e144cb51f761303beb357e013af58417980ad2a1ff3c04acd3179e8d49"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.applyFilterAndSort (cognitive 19): PipelineModel.applyFilterAndSort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2d03d16e7f692c0be7bae7db55fe2b0ee229ce24aa907dd0d23d24ab4981b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineModel.renderMetrics (cognitive 19): PipelineModel.renderMetrics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 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":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432e1fc7bf0fd20b977bd2aa79852ec1730c3c06aa7906dc796db9fe4128121"}},{"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":1467}}}],"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":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1344e967917c2efe908dfdcf5c28d784a5df1215e648a0e8c1bba80eb7e2d2"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeTracker::buildRow (cognitive 19): mergeTracker::buildRow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 2 (3 pts), loops 1 (2 pts), other 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":"merge-tracker.mjs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c3a86f9f326c82d94f130e827f6932ce8475bc8d8e3b528ebc5d7a9c0994cd"}},{"ruleId":"D2","level":"warning","message":{"text":"parseRegister (cognitive 19): parseRegister has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, other 2, loops 1, ternaries 1 (nesting depth added 4). Of this number, 16 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":"sponsor-check.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a9c0dc09234cf58a10a98b6ebf7dd447a977cb9d78a587f99d1aa7cafc1bd0"}},{"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":200}}}],"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":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d7f332b36b163cda0299ae2e5c3a2a7456cec5fed00e291e048313d103f208"}},{"ruleId":"D2","level":"warning","message":{"text":"resolveDestination (cognitive 19): resolveDestination has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, other 4, ternaries 1 (2 pts) (nesting depth added 2). 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: 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":"backup.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5d0f5de64990e8fe856cefa1acb62fe0498475ce5a8fb6b7c0664da0b47973"}},{"ruleId":"D2","level":"warning","message":{"text":"loadWorkableFeed (cognitive 19): loadWorkableFeed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), other 5, loops 2, boolean chains 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 627, 680, 655, \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":"providers/workable.mjs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"39287851ac0d2ced9ce878a25a957c8872647304fa6bb3da9b93d530b5213972"}},{"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":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f96be9b84a66216656e9c712da652b8a86c9f4ab14811615e99d20afae485b"}},{"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":"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":"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":1493}}}],"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":420}}}],"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":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ad7418cc24ac7baeeab5c89acf8b6414e4762df89100f12e97b8cc015101f"}},{"ruleId":"D2","level":"warning","message":{"text":"backup.listEntry (cognitive 18): backup.listEntry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (6 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 7 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":"backup.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1fdc13bf5d87cd9d7b0b3e138ff9ef392307d4b174363e99e9ddb27a5b7542"}},{"ruleId":"D2","level":"warning","message":{"text":"token-tracker.estimateCost (cognitive 18): token-tracker.estimateCost 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":"utils/token-tracker.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0032773803f88968f64f7e152c1f2868eaaa978e7b34e1669f2b21c61b35bf1f"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-rescue.main (cognitive 18): jd-rescue.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, error handling 3 (4 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"554d700d5bf26174b01599d4259da705d97c21dccbae2759076b376d3de26e21"}},{"ruleId":"D2","level":"warning","message":{"text":"verify-cv-facts.assertFacts (cognitive 18): verify-cv-facts.assertFacts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (5 pts) (nesting depth added 10). Of this number, 9 points are the body\u0027s own statements and 9 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":"verify-cv-facts.mjs"},"region":{"startLine":3557}}}],"partialFingerprints":{"codehealthFindingId/v1":"da812556dd0d6eceac0d0cfc079b05e03b9405da671dcfe078d78c9b522d137d"}},{"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 498, 474). 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":471}}}],"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 608, 588). 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":585}}}],"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":"robots-check.parseRobotsGroups (cognitive 18): robots-check.parseRobotsGroups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6040b5b5b6ab48421489eb26a334a6e67248099301873246422588e796f2f7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"robots-check.matchLength (cognitive 18): robots-check.matchLength has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"764b292094afc1211d979e721e11281d44b0b4c73e89886a20d1fbad3727ad3b"}},{"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":1171}}}],"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":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dec78673953e12392d09181f744e0e5aad83f1c577d969bd0fbf57127f6c17"}},{"ruleId":"D2","level":"warning","message":{"text":"workable.createFeedJobSplitter.push (cognitive 18): workable.createFeedJobSplitter.push has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"providers/workable.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"227bff9df6675d1a46ace0feaffab9f0e9f79cd67fd78e9f11480d3101712645"}},{"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":"gemini-eval.validateEvaluationShape (cognitive 18): gemini-eval.validateEvaluationShape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 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":"gemini-eval.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26decd35156a9fef23fe396ebaf79aaaf0c834936af8d0482ad4c76c30cc397"}},{"ruleId":"D2","level":"warning","message":{"text":"generate-cover-letter.replaceBalancedTokens (cognitive 18): generate-cover-letter.replaceBalancedTokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8fae6a110278b25513cf0d8093b340e001393e9e3becb1caa7c9eba0b99c8"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-import.importList (cognitive 18): employers-import.importList has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"seeds/employers-import.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85a12a3e8d5a3aa39d867eee6ae5e130b733332a719611df427d9d99711736"}},{"ruleId":"D2","level":"warning","message":{"text":"employers-import.parseArgs (cognitive 18): employers-import.parseArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 3). 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: 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":"seeds/employers-import.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08c0e4061825e2dc1f726041dc3d1466044927a3bdbb09e59fadb2c07440ad6"}},{"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":"prepare-application.readProfile (cognitive 18): prepare-application.readProfile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 1, loops 1, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (pick). 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":"prepare-application.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b860447907bcb3edf892bd3ae580c092bd126bd9799a52b9dff5785f90f3d8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"applicantpro.resolveOrigin (cognitive 18): applicantpro.resolveOrigin has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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/applicantpro.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02f3dc19eeeb36d15e9661e124f730d0f5380c64e9c79d0115e0c7adde40eac"}},{"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":"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":"sitemap.parseSitemapDocument (cognitive 18): sitemap.parseSitemapDocument has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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":"providers/sitemap.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f12f6839d98913fe11423575cd060091a3218716d5d4ed74ceb7abd7e03f42"}},{"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":227}}}],"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":399}}}],"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":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b9f119c9930796858cbfaf8b0ddc8fbbd9aea64f03c1537669567fcb85ebd0"}},{"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 413). 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":396}}}],"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":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a2f524694a4f24e3bb659d22f9c0712f6977e7d7fa76f1a68a060b73e8de6"}},{"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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"140d4277fb6d32d62456e8e9cef945e3a1615be04f4c1e4e07d869ba70aa517d"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluation-gate.dedicatedBlocks (cognitive 18): evaluation-gate.dedicatedBlocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4816c66a15ecd2bab1d7a08fc4b3fcc3cf4930ec2d2af1d81406eea5db6d539c"}},{"ruleId":"D2","level":"warning","message":{"text":"discover.assembleDedupContext (cognitive 18): discover.assembleDedupContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), 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":"readiness.experienceHasRole (cognitive 18): readiness.experienceHasRole has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 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":"web/src/lib/cv/readiness.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c01a9db830c5756f3e021cf5ada5be2e9f47c013f85daa27b8380b50f6dc35"}},{"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":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fd64403fed1e998813439bd4e9bb99aa720b63eb4765b1d8ac6cae3724a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"zhCountClaims (cognitive 18): zhCountClaims has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, ternaries 2 (4 pts), loops 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":"verify-cv-facts.mjs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc1218dee24138a1c9c6ad52ee8ad5726d5001aa5636adffa67c3dd0d000540"}},{"ruleId":"D2","level":"warning","message":{"text":"renderHtmlToPdf (cognitive 18): renderHtmlToPdf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, error handling 2 (4 pts), other 3 (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0065d3ba2aa7bd35b0feaff6a78bb8e7f93e9e49f1b10a4efa19e46b3c6636e"}},{"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":906}}}],"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":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc4e52f82202ab86c6429ef1e49e8c5f97c3bbf87a9302a0b7e9359769d7e11"}},{"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":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54f5b09fd0a94ef5f1952427eb922ff8219a6b2f62c6921a8a471b74f1b02e1"}},{"ruleId":"D2","level":"warning","message":{"text":"createFeedJobSplitter.push (cognitive 18): createFeedJobSplitter.push has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"providers/workable.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d428dc64c881555b630b6ef31912ce91f818d31c062f42c1040d687ed7b35b5d"}},{"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":"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":"_dns-cache.createCachedLookup.cachedLookup (cognitive 17): _dns-cache.createCachedLookup.cachedLookup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 312). 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/_dns-cache.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9a1d0d4a47ea804de65796f2b9698b773771fb404eeb6c3b577fd094ebef14"}},{"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":"_engine.makeGuardedFetch.guardedFetch (cognitive 17): _engine.makeGuardedFetch.guardedFetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (5 pts), ternaries 1 (3 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":"plugins/_engine.mjs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"34609dec7bbb3d423bdd1674c5b148c98e1588fac1034de3a4ce029e57320378"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.scriptEnd (cognitive 17): cv-templates.scriptEnd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"cv-templates.mjs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"30beb0d5ca02813bb12874bd4208ddd635a8b7f689d0e10185b8ed23f483c37b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivacyGuard.constructor (cognitive 17): PrivacyGuard.constructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 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":"lib/privacy-guard.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbeba227160b40c625e4b38fea249ccce71cdd1e40fa78d6e0ac8cccb136b3"}},{"ruleId":"D2","level":"warning","message":{"text":"batch-evaluate-gemini.processOffer (cognitive 17): batch-evaluate-gemini.processOffer has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 5, ternaries 4, error handling 2. Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: 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":"batch-evaluate-gemini.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c282c98327160f3977481280984d8d19fdc4f62365b5e6f4eb3005470fa450d"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-parse.ldJsonBlocks (cognitive 17): jd-parse.ldJsonBlocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-parse.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"998661a7058cd66c3631cdddb25512867589e91b3f68041fa53cf98b97600d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"himalayas-posting.main (cognitive 17): himalayas-posting.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 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":"himalayas-posting.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e111d70513d237736bf403ff0027d196dd7bc3a18b4d790bf2bc2d2d652b4ac2"}},{"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":"board-truncation.boardTruncation (cognitive 17): board-truncation.boardTruncation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/board-truncation.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f9b2f4d572149d420d3bf63a0621c71b2e3776807f91d747c25066a0963df8"}},{"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":92}}}],"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":1579}}}],"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":3575}}}],"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":753}}}],"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":170}}}],"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":407}}}],"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":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a578a6266ab6a6d85ca2fe4a625ba281c98dd00ca3edb2d160f802e3aaa23a"}},{"ruleId":"D2","level":"warning","message":{"text":"jd-years.latinHeadingKind (cognitive 17): jd-years.latinHeadingKind has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 5, ternaries 2 (3 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":"jd-years.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff6213ea0b8125176db7582473d9c4b6392356a552740c1dbd055fe293c305"}},{"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":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"86df13e99e60b7610dc795611de8ea89f8f4add2734b5211d612669e613ca8db"}},{"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":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a09a5efce2dd26bef900b972e1b4bae40f982161a9850680dd6959b710fbf9"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkPlaywright (cognitive 17): doctor.checkPlaywright has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 2 (4 pts), error handling 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83bc31c4723b8b4655f45a7921f6e352e7ffab6e168c233a7cb32cfb1170160"}},{"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":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2651aa5c6bfa108689d25de55e1db0d6448db425fd61716c486a3ffa06c597"}},{"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":"employers-validate.slugProblem (cognitive 17): employers-validate.slugProblem has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bf0f2cc9098e413e27b84b03625de5b0fc2efb1b2c580c93f8282c558c5c6d"}},{"ruleId":"D2","level":"warning","message":{"text":"harvest-buildlist.renderSummary (cognitive 17): harvest-buildlist.renderSummary has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 5, boolean chains 4 (nesting depth added 2). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff87aa49a96cb1fc4161cdbbe2d968c58c33323c7193e01447c1404d32b3833"}},{"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":"intake.extractAll (cognitive 17): intake.extractAll has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (8 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 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 437). 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":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0745fc6911432281d46181c919900761e02e42015bae776ca7624dca27656c"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin-import.main (cognitive 17): linkedin-import.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 2 (4 pts), ternaries 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-import.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7e7d63b9d54434263b7ac4197651312b9423b262b0e798818c328ec0f1b11"}},{"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":"openrouter-runner.cmdPipeline (cognitive 17): openrouter-runner.cmdPipeline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, error handling 1 (2 pts), ternaries 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":"openrouter-runner.mjs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"673fd8ee5aba55072262192b591104c13e75e8453d5e27372e10a94ad6d9edb5"}},{"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 3 (4 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":625}}}],"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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d82bea244441f3573069d108b07b80f27503d98b68e4966f2a4cb9da9f90407"}},{"ruleId":"D2","level":"warning","message":{"text":"avature.parseArticles (cognitive 17): avature.parseArticles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0346ff87200fa07ea4b8790e5a2f7252f536467e28c7ecf262429ff00e514b"}},{"ruleId":"D2","level":"warning","message":{"text":"deel.readTextRows (cognitive 17): deel.readTextRows 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":"providers/deel.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be8d5fb4a357495ddd2a40e4a5e2a7ab12f4a29b7736c1a9869a54a57700cb"}},{"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 249, 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":239}}}],"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":164}}}],"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":76}}}],"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":"remote-com.formatRemoteLocation (cognitive 17): remote-com.formatRemoteLocation has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (7 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remote-com.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1610c2ffd39cd81e8f9ddacab66bcfe2a46e5b73e4b6ca48db6094fe7a5a61e2"}},{"ruleId":"D2","level":"warning","message":{"text":"sitemap.parseJobPostingJsonLd (cognitive 17): sitemap.parseJobPostingJsonLd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (2 pts), ternaries 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":"providers/sitemap.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"10959cd62a5aed656fb232d7ba6c528091526a66ec89b4dbf3d980b32995bbf3"}},{"ruleId":"D2","level":"warning","message":{"text":"scan-seek.scanSeekSearch (cognitive 17): scan-seek.scanSeekSearch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, 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":"scan-seek.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbcde9a10f262acd98bd0289c8f2c6830a2dca786ac36dcc57e097998cc4ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"validate-plugin-registry.checkRegistryFreshness (cognitive 17): validate-plugin-registry.checkRegistryFreshness has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"validate-plugin-registry.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"0521c90513dd0276faa1c066666a2203ec0d2b9242d8727d76c7aef212cbd6a1"}},{"ruleId":"D2","level":"warning","message":{"text":"web-service.parseRunArgs (cognitive 17): web-service.parseRunArgs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (3 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":"web/src/lib/web-service.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71df4fcd5019a0e7154435b67f47b82fc48dbe17e2ec55e3fdbf2f3a3c88333"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 17): route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: 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/fill/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f68f24f9067d4916ac16dc3e157ad74b28d4394ce675f5d937cda1fd305bdc"}},{"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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a950afc1a0a34a25e2e5126c687d2c57eba9e4da1a789895a1b219c440f1fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"command-palette.CommandPalette (cognitive 17): command-palette.CommandPalette has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 6, ternaries 2 (3 pts) (nesting depth added 1). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (onInputKeyDown, a function literal at line 49, a function literal at line 27, \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/command-palette.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8581e2e230a790253b08ab9cf8dae4a1e1636d21b310d6d40c0f510833765e"}},{"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":23}}}],"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":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff8193e7508092f7bc301636003e2d9e91b53c346bee78e3bcc9d13aa974b82"}},{"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":"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":"list-search-sync.nextSearchWrite (cognitive 17): list-search-sync.nextSearchWrite has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, ternaries 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":"web/src/lib/list-search-sync.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f1769432717341e6964aa210bde49cdd9430b3b88c5d0a1eaf37f617d129d7"}},{"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 (cognitive 17): mergeTracker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 193 (327 pts), boolean chains 104, ternaries 56 (99 pts), other 26, loops 16 (24 pts), error handling 4 (6 pts) (nesting depth added 187). To reduce it, split the body into named stages: move each independent step or branch into 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":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"e273c01071b45a1212ae5ca42b8f0f593ab7e7142be8ba77a9eadd8cadeddee1"}},{"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":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f367cfc8c16a7e62128579e2ff8405f08491c7ddd5548a5333d2ce60853e596"}},{"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":374}}}],"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":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9723b4753a908ff93263f8ba929eb06a5f4e9646ccae5bdc6098926f93a39fe6"}},{"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":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af70447111fe2389f5a1ee44317106495d80dfdf7983abd561863e3ce026bab"}},{"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":"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":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d6dc0bf46dd56481f9cd58d7144da07327f1c225760517994c1fc81b17e7ad"}},{"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":"fetchTextStream (cognitive 17): fetchTextStream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1, loops 1, other 1 (nesting depth added 5). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 533). 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/_http.mjs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"6099ebd9a57462881f1b539e9c522c059f8dae3ac38f451ba0ff9872d5296be5"}},{"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":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3e20d57b7b5dbb8bc7d8173a0b062625225201197e41853e2b1c7f14d2123"}},{"ruleId":"D2","level":"warning","message":{"text":"inspectPage (cognitive 17): inspectPage has cognitive complexity 17 (threshold 15). Drivers by points: other 7, if/else 5, boolean chains 3, error handling 1, ternaries 1. Of this number, 10 points are the body\u0027s own statements and 7 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":"lib/jd-page-fetch.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"14714dd88014bdac9478eb8a297a65abd15fe78f3b9f37c441b86af6a0c660ef"}},{"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":272}}}],"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":"liveness-browser.extractApplyControls (cognitive 16): liveness-browser.extractApplyControls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, error handling 1. None of this is in the body itself: all 16 points belong to 4 function items inside it that branch (linksToPosting, a function literal at line 540, isOwnApplyAnchor, \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":"liveness-browser.mjs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"26658a34336ad908403176418042e604b506930c5d438f349ef8914ab203e7f9"}},{"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":"url-key.canonicalJobKey (cognitive 16): url-key.canonicalJobKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, error handling 1, 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":"url-key.mjs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5bc2abdd89bfb972dc516bb117e239a5121b2c20e733608c6fa61670676e85"}},{"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":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ff25553e42416759a2503ea7549ef324d2dd5c40ed716da17c7b82feb07803"}},{"ruleId":"D2","level":"warning","message":{"text":"cv-templates.loadProfileDefault (cognitive 16): cv-templates.loadProfileDefault has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, error handling 2, 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":"cv-templates.mjs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5f968e482ccb76fd7f4fb62ff901d242b764516055787a810d07322ce289d3"}},{"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":"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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d4dbbaa1f2a87490c0f8d4571f4b4b739ba17a311fb7719a158c4145c1fa48"}},{"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":860}}}],"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":916}}}],"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":362}}}],"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":"ats-board-url.buildBoardUrl (cognitive 16): ats-board-url.buildBoardUrl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ats-board-url.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"526ad626bc0e90d04104338f7a2eaac5b172cc52a8d41bc40ade9d5bfae6051f"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.checkPlugins (cognitive 16): doctor.checkPlugins has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 1, 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":"doctor.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ddd03fbfd96e4bde51e60a0068a5530cd56ccaca624e2b6b2375401161109a"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluation-cache.machineSummary (cognitive 16): evaluation-cache.machineSummary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 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":"evaluation-cache.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcf0b9a1f186c7714d7d7b22feb5fed3b5c61bed60178ce5792a806b633025b"}},{"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":686}}}],"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":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f81b2d0ddadfd51ec3511b5fe257c57c249896c93041c434d83cc8a6536e54"}},{"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":"employers-inbox.classifyInboxDiff (cognitive 16): employers-inbox.classifyInboxDiff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 4). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-inbox.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee6d3458e0a1ae04c7a613c95296e892c4a070e38c3137359571de123b50e3a"}},{"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":68}}}],"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":143}}}],"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":"gupy.normalizeGupyApiJob (cognitive 16): gupy.normalizeGupyApiJob has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 4, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5a1aae023327cc916f58ed5877ae694ce7f3b652495f794a2a27bbdc03e514"}},{"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":199}}}],"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":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdb78331d76fef1cc8649c0f95cd5ae893e030f205f59208da5019f71fa7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"sitemap.jobsFromLocs (cognitive 16): sitemap.jobsFromLocs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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":"providers/sitemap.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e072fe2f40d9ba3d93508017832bde5607fb77a84aa1afbb34885cf0d8619e76"}},{"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":"employers-fold.renderFoldSummary (cognitive 16): employers-fold.renderFoldSummary has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (11 pts), loops 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":"seeds/employers-fold.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"07efaab2d93c52bfc301c36515b0ad7d184d997b60df83f1080880723a05eecd"}},{"ruleId":"D2","level":"warning","message":{"text":"sponsor-check.renderCompanySummary (cognitive 16): sponsor-check.renderCompanySummary has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (5 pts), ternaries 3 (5 pts), if/else 4, 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":"sponsor-check.mjs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d279deee59ae6b1d78cb6b2033e0a42eb7930c98f77e47fe11251fabdce9c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 16): route.POST has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 5 (6 pts), error handling 2, boolean chains 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":"web/src/app/api/apply/session/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6da35daeb282ff1bf73503f1247a74833a91f9a6c0b1c436b5b16da36ecff38"}},{"ruleId":"D2","level":"warning","message":{"text":"page.JobsHistory (cognitive 16): page.JobsHistory has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 6 (nesting depth added 6). 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 52). 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/jobs/page.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e86f704a284a3f489dbf77dfffeee9150ec1d0061d3ce9d593d267eff65b638"}},{"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":15}}}],"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":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a115f0daceae272ad7c9797d71a36faaec731f695160f1d6ca965dbe29cdbe6"}},{"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":"url-key.canonicalJobKey (cognitive 16): url-key.canonicalJobKey has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, error handling 1, 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":"web/src/lib/core/url-key.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfba6958bd9453fd3481a30a9e299d806a945be19eb0f0972dafe7705b76bca"}},{"ruleId":"D2","level":"warning","message":{"text":"preview-html.mapText (cognitive 16): preview-html.mapText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, ternaries 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":"web/src/lib/cv-studio/preview-html.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6092099c918ed30953d2c454ba701626311f6758223b431e00aa5f51690775"}},{"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":"main.runGeneratePDF (cognitive 16): main.runGeneratePDF has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (nesting depth added 1). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 331). 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":"dashboard/main.go"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f59b36569bf8e95ead13080f2d97454dbc058aa1a1739931e587acaf2df45a"}},{"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":943}}}],"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 610, 639, 624). 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":608}}}],"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":142}}}],"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":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f8b487e412a8a12b06dabac1eab0fef8573ad1ed1e2a90e05c405784630462"}},{"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":1238}}}],"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":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a09ff8339462b8651c1862397ce67e3d324ab543e460d2f2aa9db7a51c6a1b"}},{"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":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d96e41e6305d972daa1d81cf9e2902d2783eb3e7e2e0bda15e9f877a0a0320"}},{"ruleId":"D2","level":"warning","message":{"text":"buildWorkplacePolicy::geographyTarget (cognitive 16): buildWorkplacePolicy::geographyTarget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ab9ee3e9224442a37a9c9c1109c00190c0700ad9416c6d42429895afd643ee"}},{"ruleId":"D2","level":"warning","message":{"text":"withoutScripts (cognitive 16): withoutScripts has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (6 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":"lib/jd-page-fetch.mjs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e02ae563cfccebf35c1f42c9677f57c0537aeb3981516c20beea3306611b21b"}},{"ruleId":"D2","level":"warning","message":{"text":"loadContext (cognitive 16): loadContext has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, loops 1 (2 pts), ternaries 2 (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":"coverage-check.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d615f2bf6749f0d49d5915011b2503e165becf6bba1bd3df58d2790aa7f85003"}},{"ruleId":"D2","level":"warning","message":{"text":"parseA16zPayload (cognitive 16): parseA16zPayload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 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":"seeds/vc-portfolios.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0717c836e505b7ee42da3581a794f44c12d7987b94fa7fe29dca2553b61fcb88"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: merge-tracker.mergeTracker: FunctionTooLong \u2014 mergeTracker runs 875 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 775 over it, 8.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cd4862831ab9202459ebd8facf69322f705b18aa97c74d8ee76d74ba2e241b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pipeline-view.PipelineView: FunctionTooLong \u2014 PipelineView runs 770 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 670 over it, 7.70\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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a51e0aa01572a719e19b9f060a49bb2632afd07039fe9f0688679ad80978c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./scan.mjs: FileTooLong \u2014 2804 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 2304 over it, 5.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a40f0df0c1fec81e53c2586638dbe1e676b420486831556915ecaed1294f5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scan-ats-full.main: FunctionTooLong \u2014 main runs 523 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 423 over it, 5.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc064be53b797105e9a3a918b21364384db01e620ce1393469b966270252383d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Catalog: TooManyFields \u2014 156 stored fields beside 6 methods. The bar is 30 stored fields; this is 126 over it, 5.20\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":"FileTooLong: ./update-system.mjs: FileTooLong \u2014 2547 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 2047 over it, 5.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d0fca0cda4c2f0dd20128a9ef50536485b63189479169a64fb94e93a319522"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: explore-provider.ExploreProvider: FunctionTooLong \u2014 ExploreProvider runs 417 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 317 over it, 4.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/components/explore/explore-provider.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"099714d474694a900881ac25b5c929fbe365b688d3f2d613cb33e0d78bd9ac51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./verify-cv-facts.mjs: FileTooLong \u2014 2061 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 1561 over it, 4.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":"verify-cv-facts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42373b1e7cf1c9797da657d4f8888ceeb91a6f7303f4c67c48e0bb16df349eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PipelineModel: ClassTooLong \u2014 1598 significant lines (blank, comment-only and punctuation-only lines excluded), 86 methods, 67 blocks, lines 307-3043. The bar is 400 significant lines; this is 1198 over it, 4.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"92770b3b5744d26fcc16a481285dd5d10f8ff6199c70eae9e7a853ce27c0deea"}},{"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":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53127cd8665ba589062143f0444178304f36d78aaec6b8671a5765ac87b2ae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/pipeline.go: FileTooLong \u2014 1912 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: PipelineModel (67 blocks, 307-3043). The bar is 500 significant lines; this is 1412 over it, 3.82\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25613425a760b2b3fc0016115771f7c7eb187804e5bdf417544b93ce0c5498d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 369 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9178e3468366b683fcf7eb4573150f27800e6dea54355a43200fdb0729d648"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cv-ingest.CvIngest: FunctionTooLong \u2014 CvIngest runs 367 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 267 over it, 3.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5976982a3f7fdc374cfd9441e082019d7fc7e01ec7f54f54abf0c1a3e96a4d1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: apply-provider.ApplyProvider: FunctionTooLong \u2014 ApplyProvider runs 311 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3984276ba2374fcba28d02699ba17c6d3ed3fbc66eb7400000824a574113d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze-patterns.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5651c220e5fdf3af25d076e4a7726aa869b49d4755a0be7098b743b02de2721"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PipelineModel: TooManyMethods \u2014 86 methods, declared across 2 files: screens/pipeline.go (69), screens/pipeline_pending.go (17). The bar is 30 methods; this is 56 over it, 2.87\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"927dc2bc64d6a583cf51e2ee33750e65b8e8ee8067f61369ae5b90077012c56b"}},{"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":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd79c76256c83cf4966c5e2a3c1109412d3f7a76cf973e87a53f35289c3f6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: today-dashboard.TodayDashboard: FunctionTooLong \u2014 TodayDashboard runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c538a7a32ddbe8a7da3d3089562bbccf28064ae01952d36baa6d66473c29dcf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./scan-ats-full.mjs: FileTooLong \u2014 1361 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 861 over it, 2.72\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: 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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b36677c2d5aaeb31d7c92855169940feb658fdc4e151ba194cc24a54efde9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./generate-pdf.mjs: FileTooLong \u2014 1289 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 789 over it, 2.58\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: 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: 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":"FileTooLong: ./analyze-patterns.mjs: FileTooLong \u2014 1217 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 717 over it, 2.43\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":"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a441b26c9b802530512c6dc3ae7df07c93641589e1deb7a984a0048214ebe3"}},{"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: ./doctor.mjs: FileTooLong \u2014 1140 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 640 over it, 2.28\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: config-form.ConfigForm: FunctionTooLong \u2014 ConfigForm runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"97692a3c9fb06aa4be4ca253c3700ee48af851a28256404f6dc21ba633a20351"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: validate-portals.validatePortalsConfig: FunctionTooLong \u2014 validatePortalsConfig runs 219 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"validate-portals.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c49bc31fcc00a433e7e4b916b9d49c826390bb61560c7ffd85101035ab09eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: report-view.ReportView: FunctionTooLong \u2014 ReportView runs 218 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 118 over it, 2.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/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"de12c80c4e64052c70ee26df21e8d75f9c25a8c9bde0c0c154f6a84532977cac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./salary-gap.mjs: FileTooLong \u2014 1037 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 537 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c2373efe5b5830e49610acd4fd147e8a3f37999d37446a2c6ff566757110b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./build-cv-html.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":"build-cv-html.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a056e347075f2dbf1106a60f78dabb748b9b302700ef9d04df57df1f007b45e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: followups-view.FollowupsView: FunctionTooLong \u2014 FollowupsView 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/followups/followups-view.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a536519382c813ea54036186e229fa99e444d1234c27211a00fac23bbfa2a455"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cv-studio.Studio: FunctionTooLong \u2014 Studio runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.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/components/cv-studio/cv-studio.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed0864ca68e2f2d709cf3a3753c620233ef7e587d578ccdfc28c914292d1b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: templates-section.TemplatesSection: FunctionTooLong \u2014 TemplatesSection runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/templates/templates-section.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab537d81931acff1243c7e10aa903c377a2a3279550d60ee2cbff7b894e247a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/pipeline-view.tsx: FileTooLong \u2014 989 significant lines (blank, comment-only and punctuation-only lines excluded), about 78% of them inside a single declaration: PipelineView (45-1033). The bar is 500 significant lines; this is 489 over it, 1.98\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/pipeline-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be314e912a00c0e10298391b9588e9b83448b6c8f06c29a42f49f1081706b3da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./merge-tracker.mjs: FileTooLong \u2014 983 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-2508). The bar is 500 significant lines; this is 483 over it, 1.97\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: cv-editor.CvEditor: FunctionTooLong \u2014 CvEditor runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-editor.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31c837a397a103da799c63f64bc02feff5978a7e09cef3a1437cdf63dd0f27a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: weekly-digest.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa021bda4c1d6532f44b641de24a5ffb11241fa57d0615a6ed8e3a6819e6f5"}},{"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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f2d68f5eeda1388c28b6d432c9f4b0b49546349e8e21a3e045067f1e0c35ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/assistant-console.tsx: FileTooLong \u2014 904 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 404 over it, 1.81\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":"FunctionTooLong: status-select.StatusEditor: FunctionTooLong \u2014 StatusEditor runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.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":"web/src/components/status-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e895fc89c45c9fbf604d960849684ca84ddcf8c1126477eaa0d0e68718839ce7"}},{"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":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e5c75c0befb737177526a84ad9b04e8f5f7c285e07b5a0d31d8d8144e234e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: employers-validate.validateRegistry: FunctionTooLong \u2014 validateRegistry runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"seeds/employers-validate.mjs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4000ce04ca63c139ddce7420128b38c1d32e6e8d5c16c856ed9e053255f465"}},{"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":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfe8411a87ae91e2285e74351a76dc9857049370b7ab65d8e0449c811353a96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PipelineModel.handleKey: MethodTooLong \u2014 handleKey runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2d23a28f265790f249fe8a0fd502f55fd8a510b97e71bc2e5c3d64808dbc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./cv-templates.mjs: FileTooLong \u2014 844 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 344 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fea805957eb6d6074033248dd866f916f24e5fcccf0c1dc6f966cb5e37992d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./openrouter-runner.mjs: FileTooLong \u2014 842 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 342 over it, 1.68\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: 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: detect-reposts.runSelfTest: FunctionTooLong \u2014 runSelfTest runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa69f042bde5df51bccaf8ba6f15208d0204fc772b966bf3885296b12dc861f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./sponsor-check.mjs: FileTooLong \u2014 785 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 285 over it, 1.57\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":"sponsor-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b00106f36c023e6bc940e67c0b9939fddfdabe521423c6b5d61dfba8b1048"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cadence-settings.CadenceSettings: FunctionTooLong \u2014 CadenceSettings runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffee98303b0ed9cb47a2f7705eab9c8dc024e893f3a2c820df32728ac632e916"}},{"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 772 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 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a648e5cf7db9dc00fb8ccf50f520ba5ffd15dfebe74bde0ea24505a898d862d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data/career.go: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"442b4d3f938bb79a83aaeae61ada4e3144f97bbd2cc8c90634557986b50859a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./github-evidence.mjs: FileTooLong \u2014 770 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 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ef469c6786e0faff53c6f0fb7798b72c583652e59c2a925cedc53917c2c1e"}},{"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: i18n/catalog.go: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 259 over it, 1.52\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":"FileTooLong: ./verify-ats.mjs: FileTooLong \u2014 757 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 257 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7863eaac7941a058695211c30d7086a620cf93d62d0c419b7992441ba2ed632"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: job-store.JobsProvider: FunctionTooLong \u2014 JobsProvider runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0723428f799db1d48bc11f852e70cfaacfbb8f6ca45a3bc8c049406a39fa115c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./tracker.mjs: FileTooLong \u2014 752 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 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":"tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c57abfa29df1487600c12642e07a54b52126f2b189054a54b8b8787f8fa86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./harvest-buildlist.mjs: FileTooLong \u2014 749 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 249 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":"harvest-buildlist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1d9307b00cb6708918b3fcbd35143078df63e4f85187f548f733da1ce1e418"}},{"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":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"21127dbef615efc907ee087a6b54b6b1dc74409076e3584ff7861857aa60e14e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./check-jd-archive.mjs: FileTooLong \u2014 736 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 236 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":"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":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba67f6bf439e49a4f76c628906759e21b2e3367bf716153d1abff88b3b2a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./jd-skill-gap.mjs: FileTooLong \u2014 710 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 210 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-skill-gap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4d5b9e91e7a0e5531a084b51c504a64d54211d9aa87bdc53cd8df05d06d34c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: check-liveness.main: FunctionTooLong \u2014 main 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":"check-liveness.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284e5a7271a562494174bc0f1da024d56bcdd1f9680627bceda62f7cd235b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./browser-extract.mjs: FileTooLong \u2014 702 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 202 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094dda9a3bf297fbb430bec802067bfe27aef7f97aa08e9cbed9a1130b1ab0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: seeds/employers-validate.mjs: FileTooLong \u2014 696 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 196 over it, 1.39\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":"seeds/employers-validate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f01e3b8fae98bfee7bb7dd2eeb46a4411e7dafba664c91e2043322f4a7c9650"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: apply-checklist.ApplyChecklist: FunctionTooLong \u2014 ApplyChecklist 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/apply-checklist.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea72d6c2600fc63b8df2d2b70015624b96ffb5c6cfaa960ca193c88a746e9c10"}},{"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: page.DocumentsPage: FunctionTooLong \u2014 DocumentsPage runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.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/app/documents/page.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"191d878e6b0ff8c504a9fa29132f895da925947fe403350651a80a8c5e911f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: appModel.Update: MethodTooLong \u2014 Update 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":"dashboard/main.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f06843f58ef053b1cdf792bea9232d56b3ac0e286653aa530058fd9db8ead"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PipelineModel: TooManyFields \u2014 40 stored fields beside 86 methods. The bar is 30 stored fields; this is 10 over it, 1.33\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":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"55457f539df0b59aa6aba44686d4d7cec8ecb2a8b0df864ccfd65b39d2648f06"}},{"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: mobile-nav.MobileNav: FunctionTooLong \u2014 MobileNav 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/mobile-nav.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe89c0850ddd0ceca52c0baeec1ea0fda22a51977cb599d1666d3add3a106ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.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":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fb749d04084b0027116b0823dd9947ccaa9aa584987c475118580412cb8f83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: create-job-modal.CreateJobModal: FunctionTooLong \u2014 CreateJobModal runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.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":"web/src/components/scheduled-scans/create-job-modal.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cfb46d56630039588977e7fff39e46dfbbc98a39f6bf16b5714c3ccbcdb6e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./discover-ats.mjs: FileTooLong \u2014 646 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 146 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":"FileTooLong: screens/viewer.go: FileTooLong \u2014 636 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 136 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":"FunctionTooLong: decision-card.DecisionCard: FunctionTooLong \u2014 DecisionCard runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\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/decision-card.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b770ec37b6e156e3ab27968edfe6a9fc77ee1187d0ce6969f47da48a2474d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: log-dialog.LogDialog: FunctionTooLong \u2014 LogDialog runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/log-dialog.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f124734bbda2e5902acbc223a396c457dac99fe12f335048617ace17ebac74e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: triage-row.TriageRow: FunctionTooLong \u2014 TriageRow runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dda2ef08ee275a36c25d827a6abbbd1d4ffbe4ac440f18593da2794b9b09cef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./verify-portals.mjs: FileTooLong \u2014 607 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 107 over it, 1.21\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: claude-usage-scan.createUsageScanner: FunctionTooLong \u2014 createUsageScanner runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1cfc264b269304ec5e1103ea0e9fd9855adf33bf5a1e5efe3c433d3d0142bd"}},{"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":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc652b0c114e23652cedd53a47549dc21a2feeb718fe5072962c096beaf4cc15"}},{"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":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"410c2b6395f6ecdbcd6fdb6e45fae138da19fe239cae403791a3bd940f30b77c"}},{"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: 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":"FunctionTooLong: discovery-card.DiscoveryCard: FunctionTooLong \u2014 DiscoveryCard 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/explore/discovery-card.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bd0c0667b4011f08531d02900cc84195520922481e811544148b83881f524d"}},{"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":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"496a03a0988401604a58a6053585e5fcc32cc627d02442ef65670e1d6399125c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./liveness-api.mjs: FileTooLong \u2014 562 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 62 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":"liveness-api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c13a362b1649ea1f114b71e89aa78034538bc9d23223cc57e89ef5f2a2166"}},{"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":"FunctionTooLong: command-palette.CommandPalette: FunctionTooLong \u2014 CommandPalette 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":"web/src/components/command-palette.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b58eeb5f0646d97f27497d9224810db91089b35aefe211135c6302cbf8b3913"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reply-watch.main: FunctionTooLong \u2014 main runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e91fef6598577a156e272feca8cb66c599b2e44b3070bc349792635990c015"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liveness-browser.checkUrlLiveness: FunctionTooLong \u2014 checkUrlLiveness runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"736574f5d2dcd6455fbe8e1f775c700d26119d5d52ca531e257c3d129cd2fa61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reply-matcher.classifyReply: FunctionTooLong \u2014 classifyReply 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":"reply-matcher.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b309bf46ef73689ca83e02716b0652b5846ea0ccdc0959d095cdb0be38a35e1"}},{"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":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe48ea0879c79410ce6c368e8603aaad81f66457373b10c99cb9daecff4d7e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session.openSession: FunctionTooLong \u2014 openSession 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":"web/src/lib/apply/session.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88e5446c3000bcd88146ac14eb74dfa0029479fd1faf0763069c3b70095af9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: session.fillSession: FunctionTooLong \u2014 fillSession 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":"web/src/lib/apply/session.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac27b7ba3f0db811d034e79028559a65c00c76dde50f0f12ce421a94a63dd876"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./invite-match.mjs: FileTooLong \u2014 540 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 40 over it, 1.08\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: pipeline-view.TrackerRow: FunctionTooLong \u2014 TrackerRow 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/pipeline-view.tsx"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4076dfdd74b02a39b04c898ecf13f09fa387f92de03da956a2e20595c806037"}},{"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":1140}}}],"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":"FunctionTooLong: next-date-dialog.NextDateDialog: FunctionTooLong \u2014 NextDateDialog 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":"web/src/components/followups/next-date-dialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8607fe1ff0d6ba8274f582c41995b4b9e04dda5a5f88537778b1bf3280bd22d0"}},{"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":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e32222cdb26270c6b0d35b9fa7e7544989c132332f0e5ae6f30fb844bf01c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewerModel: ClassTooLong \u2014 423 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 23 over it, 1.06\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: followup-cadence.analyzeFromContent: FunctionTooLong \u2014 analyzeFromContent 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":"followup-cadence.mjs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c7b0d0368e0aef8eb32d7570e57b7632bb7d1d23cf2acd785ca4c6ce0c2637"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: explore/explore-provider.tsx: FileTooLong \u2014 523 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: ExploreProvider (132-675). The bar is 500 significant lines; this is 23 over it, 1.05\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":"FileTooLong: components/apply-view.tsx: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04\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/apply-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998df8914ee102e87c22a4fe45c454246c214f255b552cddb35dbffef041985"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scan.verifyOffers: FunctionTooLong \u2014 verifyOffers 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":"scan.mjs"},"region":{"startLine":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c0ef25fe84565b39a69bb7dac37c249e327fdc86df3117c50cf719fdd7359a"}},{"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: ./set-status.mjs: FileTooLong \u2014 516 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 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"set-status.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b035f803a03306dfea7910949228851ecc02d80cee161407c911432876b81d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sponsor-check.main: FunctionTooLong \u2014 main 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":"sponsor-check.mjs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcf3d6af6c662fdb248651ae6893190d3a99d54ebbe6c918cd9a3519631598b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./followup-cadence.mjs: FileTooLong \u2014 514 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 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b37db4090ac74599ab7fca685b6a13ad3b92c730ce742fd288676d918925f0b"}},{"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: 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":385}}}],"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":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf18ead2e34af2ba2e28eac7e29ca54a75d33bf267c8b9d9555a6a4a119a1c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 63\u002B corresponding lines): dashboard/internal/ui/screens/progress.go:142-213 | dashboard/internal/ui/screens/progress.go:215-277 | dashboard/internal/ui/screens/stats.go:517-580 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 63 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c296053f5626f02e14459f72955feee7c0befe10b63e071c41477b4a1c35f103"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): dashboard/internal/data/career.go:508-566 | dashboard/internal/data/career.go:579-652 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a088afda349cabc8099f11fc10b5ca3204d000aff539cb845334135cee3948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): dashboard/internal/data/pdf.go:108-150 | dashboard/internal/data/pdf.go:157-198 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/pdf.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ce10d1d3538dc8cb486d834bca7fbc1864b4fe7b50abb892ef807b567878e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): dashboard/internal/ui/screens/pipeline.go:2756-2784 | dashboard/internal/ui/screens/pipeline.go:2836-2866 | dashboard/internal/ui/screens/viewer.go:948-974 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"025943a7b79e828827ef0a3afe0e5908a047f2b6d7785e457ec091eee274005f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): dashboard/internal/ui/screens/progress.go:387-408 | dashboard/internal/ui/screens/stats.go:667-688 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66ad8094af21c8c301c59cbb2a10a01051b9b2b5c617488115321aeb6c78634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): dashboard/internal/ui/screens/pipeline.go:974-1012 | dashboard/internal/ui/screens/viewer.go:915-946 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d5b172aa71bedb215d6344a4f38a05dafe2e2f8c1586b3f3c924d067a6a648"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): dashboard/internal/ui/screens/progress.go:77-121 | dashboard/internal/ui/screens/stats.go:244-272 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6916cf91104be7f2d871a2b850644056a409e346462d0be8c7bb579816129d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): dashboard/internal/ui/screens/progress.go:123-140 | dashboard/internal/ui/screens/stats.go:274-285 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"236c18d098ecd5184427a17c81ae36f771c53942b00005aa24395293c864f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): dashboard/internal/ui/screens/progress.go:411-422 | dashboard/internal/ui/screens/stats.go:692-705 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946a217cc77d97339fb1d7da8d26e36ab1506871d51f5e7a9d7b8980cf8ec70"}},{"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 (22\u201323 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2762-2784 | dashboard/internal/ui/screens/viewer.go:953-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dashboard/internal/ui/screens/pipeline.go:2762\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/pipeline.go"},"region":{"startLine":2762}}}],"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:607-625 | dashboard/internal/ui/screens/pipeline.go:1151-1170 \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:607\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":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"089d9e4f5df8d3854dc3f002a22afd7bf6396d3c929ea908257bbb59d3c8c712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:390-408 | dashboard/internal/ui/screens/stats.go:670-688 \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:390\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":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b52cc73137a4e453da2699b474f2dfda1ecb13dd72bf47b6681153d0803f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:978-993 | 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:977\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":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f257ae5d79df1932ceff3f0e5b1ba0885a602b27ae34c6c8ce17d4c01631a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:179-197 | dashboard/internal/ui/screens/progress.go:252-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/progress.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c91a752692ed58a9efc6d9eb07fc1ec1818e47a101f5bef871e546dabd4461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): dashboard/internal/data/career.go:537-551 | dashboard/internal/data/career.go:622-636 \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:537\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/career.go"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e64ca18ccd8cd215edc46174f8ee19e74c737b55da683f63133b8d123c2a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): dashboard/internal/data/career.go:394-405 | dashboard/internal/data/career.go:478-491 \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:394\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:389\u0060 calls \u0060Join\u0060, \u0060loadBatchInputURLs\u0060 and \u0060dashboard/internal/data/career.go:475\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":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"497249d7cd3154fc6823b655b1b4959df55c69c4e67f7977f458c2cb56ce8294"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): dashboard/internal/data/career.go:553-566 | dashboard/internal/data/career.go:639-652 \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:553\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":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d8d7e6767ba1fbd8bd31ab8ab1fd5f87988bd5e2a68c0e356ff077589806c6"}},{"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 (7\u20138 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2837-2844 | dashboard/internal/ui/screens/pipeline.go:2983-2989 \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":2837}}}],"partialFingerprints":{"codehealthFindingId/v1":"6930982e4e5aaec53ff358d6e202589074f3153d9c9022f13933951787c131a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): dashboard/internal/ui/screens/pipeline.go:2592-2598 | dashboard/internal/ui/screens/progress.go:388-394 | dashboard/internal/ui/screens/stats.go:668-674 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060dashboard/internal/ui/screens/progress.go:396\u0060 calls \u0060NewStyle\u0060, \u0060Foreground\u0060, \u0060Render\u0060 and \u0060dashboard/internal/ui/screens/pipeline.go:2599\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/ui/screens/pipeline.go"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"869e21afce37dd7366808abdecacab8c8ac8b0cb04dc8644aa6a666f375ff4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): dashboard/internal/ui/screens/progress.go:150-156 | dashboard/internal/ui/screens/progress.go:223-229 | dashboard/internal/ui/screens/progress.go:339-345 \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:150\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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab9ade4952db310c1da9d2d1977e30bab83735e6833551b4271a02c59568fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): dashboard/internal/ui/screens/pipeline.go:2761-2766 | dashboard/internal/ui/screens/pipeline.go:2843-2848 \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/pipeline.go"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98a4e64d5d2fd177c4299f356517c1a9008c46138815a300b37a0964735a7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): dashboard/internal/ui/screens/stats.go:444-448 | dashboard/internal/ui/screens/stats.go:518-522 | dashboard/internal/ui/screens/stats.go:583-587 \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":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b688d51e0f53e908fe562aaab5dedd25638eff7f92831679de80c6aaa72cae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): dashboard/internal/ui/screens/progress.go:124-128 | dashboard/internal/ui/screens/stats.go:275-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 both 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 (11 lines \u00D7 2): dashboard/internal/data/terminal_text.go:13-23 | dashboard/internal/ui/screens/pipeline.go:2579-2589 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/internal/data/terminal_text.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9286adaa17eb54ac1ecd37fb9660d69641616f1c0fe01309d2ae947cf3289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): dashboard/internal/data/career.go:486-492 | dashboard/internal/data/career.go:523-529 \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":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"419252fafcc5c47dc916b015c7df22ddc6372ea1bddcbd42e9937a3f0219c4ee"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: doctor.mjs: 25.6% line coverage (514/2010)."},"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: keyword-match.mjs: 46.1% line coverage (448/972)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0cb83d4a6f7d7c94afbcadaabc30287de899d7fc3970a3603bcf1f443fac01"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/linkedin-auto.mjs: 45.8% line coverage (11/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-auto.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2dc07a94e095a2546307ee203359130ce8885434db9e90a4df1176a4b0d35e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/linkedin-import.mjs: 36.2% line coverage (92/254)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-import.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d8e0e4ab9bc1769cce8c16ed870a8623fca93f3600cbb27d5a7758c3ff4c6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: lib/linkedin-mail-drop.mjs: 25.6% line coverage (58/227)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-mail-drop.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa81638abcdac6b4af8413f062eee68141034f5fca6ec6f29d673f64263911"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: liveness-browser.mjs: 37.5% line coverage (347/925)."},"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: 38.2% line coverage (337/882)."},"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/_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/cv-studio/[n]/route.ts: 36.5% line coverage (27/74)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fbaea2aced373546e0e734cb406dd1977f9442814502a5d7e763f3b2078d71"}},{"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/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: 33.7% line coverage (230/682)."},"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.8% line coverage (116/449)."},"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/employer-preset.mjs: 38.2% line coverage (29/76)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/employer-preset.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1830e7878ea5d46aa1667db1384c67592ec2168fb81536f77733a4704b8f08f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: web/src/lib/template-files.mjs: 47.0% line coverage (109/232)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/template-files.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a5fb17436594b0f2ef02f70346ed55813a0770f9b11df8656dfaaa553e62c8"}},{"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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/inbox-skip-client.test.mjs"},"region":{"startLine":119}}}],"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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pipeline-lock.test.mjs"},"region":{"startLine":262}}}],"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":"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":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-darwin-arm64: \u0060@img/sharp-libvips-darwin-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb9cac83efbb8fb5b1b1714cd7ce06ef46586b0cb953bfde13d5cef10838aa9"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-darwin-x64: \u0060@img/sharp-libvips-darwin-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de28cedeef63f197969d04616e27ba4aeb27e4375cfebf400bfd8540537a9c"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-arm: \u0060@img/sharp-libvips-linux-arm\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed930a6d1b3ac4b890509506dec0a58727b515b0b43327cc1a4b4298e79514d8"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-arm64: \u0060@img/sharp-libvips-linux-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1b9a31ae3b29118432d1284fc0c855fbfbf2bc26303258aa349bed6999fa27"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-ppc64: \u0060@img/sharp-libvips-linux-ppc64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b20c11a65955bafb54a0fe488a53c597a9857c6aea42950b92968a57c6553f1"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-riscv64: \u0060@img/sharp-libvips-linux-riscv64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fa7dd2c5433945143e886736f323d34568a1815de5755ea55f247d83db2255"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-s390x: \u0060@img/sharp-libvips-linux-s390x\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3d0fc4342775e0cda07639d86e20b7ecd506920fa0b1a66c6f1ebfb1f8c2ab"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linux-x64: \u0060@img/sharp-libvips-linux-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e740d28a1384feb307d2f24d03cf2e2e13a5d6eda920a4040480f40df2e9d50b"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linuxmusl-arm64: \u0060@img/sharp-libvips-linuxmusl-arm64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ce0111811bc0c564efe3bc5758a9fe2ff77adefe8940d96c0e94f001dc6bb6"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-libvips-linuxmusl-x64: \u0060@img/sharp-libvips-linuxmusl-x64\u0060 1.3.4 is published on registry.npmjs.org under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91fe0a042e1c39cd9d87efaed4be891aa907345e587e25c7d6b01efdaaffd89"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-wasm32: \u0060@img/sharp-wasm32\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later AND MIT\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1135ffbb448d71e8cb7f5d4d9fb10acf52d978f9eb537a0cd1f2166ada470428"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-arm64: \u0060@img/sharp-win32-arm64\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7501b1efe547a916924b31662388631addbf15548a0d166cc082f57b0eb7a93d"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-ia32: \u0060@img/sharp-win32-ia32\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7e073ff938556e3b1cdba3c54fe725620ac7ffe9e735802eeadb3dcc853d57"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: @img/sharp-win32-x64: \u0060@img/sharp-win32-x64\u0060 0.35.5 is published on registry.npmjs.org under \u0060Apache-2.0 AND LGPL-3.0-or-later\u0060, which this policy bans, and it is not declared by this repository but is installed by one of its production, optional or peer dependencies, as its committed lockfile resolves \u2014 a transitive dependency ships its licence just the same \u2014 so it is installed by everything that depends on this repository, not just by its build toolchain. A package offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package (or the dependency that pulls it in), or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/package-lock.json"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"376605ff2c96456f54476e6225693261afc28ecb15a09757b469cf8cfd84bf3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan.mjs: scan.mjs changed 104 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 359 in scan.main at line 4672. 64 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"150526ad7703e19f26b944680afb4e64b1cefb44d345eb6c47d8d3d648be31cb"}},{"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 388 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: update-system.mjs: update-system.mjs changed 179 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in update-system.apply at line 4749. 77 of those changes were fix/bug commits, and the other 102 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00591262e16981a9da05f6d3b177eac27832879c1fc198411c3aa24fa68586f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-ats-full.mjs: scan-ats-full.mjs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 197 in scan-ats-full.main at line 1693. 25 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b95e9c033e7f04d309d2e59e6ef55a7434ba23b9d763293f20837354f4d5af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/pipeline-view.tsx: web/src/components/pipeline-view.tsx changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in pipeline-view.PipelineView at line 45. 18 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e75560fd3d7c63fcf0f3b8f1a814dcb89b5910d56107d5e772f6d75dbe3408a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/assistant-console.tsx: web/src/components/assistant-console.tsx changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 243 in assistant-console.AssistantConsole at line 143. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/app/api/run/route.ts: web/src/app/api/run/route.ts changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in route.POST at line 41. 28 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a511a9f39e233b5a18f69c2df384bc7aae062ea3574f3236862e86ffd281d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: analyze-patterns.mjs: analyze-patterns.mjs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in analyze-patterns.runSelfTest at line 447. 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"102e501f9270a984bb26b278c5a4391861e44e35fb5607baa1dd7ce81414f000"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/career.go: dashboard/internal/data/career.go changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in data.NormalizeStatus at line 695. 26 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"64988feb57f9535e1614706ec3e48fbd8b2968a44ebbc7a4b743197cf2ce4d08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: validate-portals.mjs: validate-portals.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in validate-portals.validatePortalsConfig at line 273. 13 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d7c23dd1b6fe0d5eb2979e7584064903e6250951a981da2b82b4a530d08847"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-pdf.mjs: generate-pdf.mjs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in generate-pdf.generatePDF at line 1850. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"2861e9da690b589170a7dbf3c86f25486bcb9214051c776cfce1aca683bb3f2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build-cv-html.mjs: build-cv-html.mjs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in build-cv-html.runSelfTest at line 1199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52e880caa198739161d032b7e1f6ea621d36c280baa925327585506b6443523"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/ui/screens/pipeline.go: dashboard/internal/ui/screens/pipeline.go changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in PipelineModel.handleKey at line 633. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a282c323d3297b26a5c9b187e9fb86b8d87153503b09b6f05a6bf45b57b3682"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: doctor.mjs: doctor.mjs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in doctor.onboardingState at line 1899. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d68b6b4d146b27d85c7ca70d06e7ba7feb5cca871566508a1eaaf1ee5c49aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/inbox/inbox-triage.tsx: web/src/components/inbox/inbox-triage.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in inbox-triage.InboxTriage at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8116432bc892c6dafc17681f19e64d537d77ea25a9a08703244ff7a9460088e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: salary-gap.mjs: salary-gap.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in salary-gap.selfTest at line 765. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e771624cf0cdd47cb164c9c1a9770d8e833586fe3db51bbe4b853f93fa3ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-cv-facts.mjs: verify-cv-facts.mjs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in verify-cv-facts.runCli at line 4310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5478efdbc85fe1b4ac8a61c2c1633cf5dfb018cee977df4f6cf859dda21a2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/today-dashboard.tsx: web/src/components/home/today-dashboard.tsx changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in today-dashboard.TodayDashboard at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8040417dc44834fa6f5a8b685e20014737d62d3266db9eec2e376f5d72d14611"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/report-view.tsx: web/src/components/report-view.tsx changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/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 147 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: liveness-browser.mjs: liveness-browser.mjs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in liveness-browser.checkUrlLiveness at line 595. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed967467f57942ae83c06d39ef22df488aa121422f656a95ef3387af375f8a72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: check-liveness.mjs: check-liveness.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in check-liveness.main at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc3a82aab0c8e0a9bd02c8e601910d014559b1dbaefc8b1f32421efdb31d1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: stats.mjs: stats.mjs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in stats.computePortalRecommendations at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd76415ff5e02f9ef4684c8c1d9069194305d75752026638d5f71cf4f37d6ca4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: openrouter-runner.mjs: openrouter-runner.mjs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in openrouter-runner.callOpenRouter at line 402. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a60e569b8d750958755b3e2a70a5616476b9a5ed8b29d3096c852ee718673c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv/cv-ingest.tsx: web/src/components/cv/cv-ingest.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in cv-ingest.CvIngest at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6fbff9dd09e56d05ba0007274927ccef256e600b4e33d93e67f199d7190113"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: liveness-api.mjs: liveness-api.mjs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in liveness-api.checkLivenessViaApi at line 1170. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"de34cfa7f15036530bd19b1e1cf1666948ec561ffeb88f667a08af2a61d77920"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browser-extract.mjs: browser-extract.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in browser-extract.readDom at line 1271. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc23fdddc3a44f631ef0e283985bab6cbe639d0c83ed9f78d2ff36127a0d5842"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: plugins.mjs: plugins.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in plugins.cmdRun 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"176f8776842247506f9418fb1dcf58e2617694a26fe7b561b861e04d963b7f6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/_http.mjs: providers/_http.mjs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _http.fetchInContext 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f07f370f3d6ff63b4d6e0c4e701aac6e83421b812dffb8c0379761885545b26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/followups/followups-view.tsx: web/src/components/followups/followups-view.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in followups-view.FollowupsView at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e43cc9c636a425b33e60e82387ddc5c142b92a28930ba8b2d255dd514758ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/career-ops.ts: web/src/lib/career-ops.ts changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in career-ops.readLanguageConfig at line 804. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b3de4eb06f728cc524f5192bca096a3319ec379c37ae7aa06d9a4e8930928e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/explorer-view.tsx: web/src/components/explore/explorer-view.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in explorer-view.ExplorerView at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e512c209a072954b42faf95ba4470c51ba8a0eabe08fa825f6529d8fe287b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: discover-ats.mjs: discover-ats.mjs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in discover-ats.resolveCompany at line 691. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6446a0a3a042552c3d6666b0c3c13188965be03ecd43a7b2534eb2ab42bc451"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-portals.mjs: verify-portals.mjs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in verify-portals.verifyOne at line 945. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07cc37cf2c78a9301dbeab16c304c4f8a89259f6182fa15c3fc7cfa7075af36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rank-pipeline.mjs: rank-pipeline.mjs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in rank-pipeline.main at line 385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7150ea1d79f988183c2b2f17de9fe4263c62a1d8f8fd1f7dd9c998c18f2cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-pipeline.mjs: verify-pipeline.mjs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in verify-pipeline.checkPortalsCoverage at line 739. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2ed8f3b7118b7787b1ab649805c735aca63209c9702a2e2510b1884f60ccb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: followup-cadence.mjs: followup-cadence.mjs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in followup-cadence.analyzeFromContent at line 880. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5791b2bc1d5277bbdccee1142cb6df803f4aece45f4ad4e7676d3b2760c41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/ashby.mjs: providers/ashby.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in ashby.parseCompensation at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"07575e3f7e1a92b3969a0a02df912926ca48ddb91e0bb48909f1bc7476de9103"}},{"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 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cbd8806974e95b2e93759198af54a23877c694d206879dceebd14facc13a18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tracker.mjs: tracker.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in tracker.query at line 906. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2ca1c60beebdccc9b8049dd94c4a2d9ac8d4882485ff9d0acee626824b4a15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/main.go: dashboard/main.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in appModel.Update at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df6bb9a2a46bd3628ae64bc439a20d2229958de9fd270f40ede434706899c94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/apply/session.ts: web/src/lib/apply/session.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in session.openSession at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b1df666da12e40a3ee6e02692222464ce57784ee92f52211a375b7107ee997"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: reply-watch.mjs: reply-watch.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in reply-watch.main at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cbc365a6a7f27aa5017329370329d4dee02fb15573e36db322972e1d72ee91"}},{"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 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7ceb8d12ab1a2166fd1e35cea9b96aa7438743498114f58c2aa611651e5f60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/assistant/route.ts: web/src/app/api/assistant/route.ts changed 12 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/components/apply/apply-provider.tsx: web/src/components/apply/apply-provider.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in apply-provider.ApplyProvider at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"500b2a3d9e6a24e221f10b72d2bee8f8f60913c195065ed0ea3d6a236e901396"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: verify-ats.mjs: verify-ats.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in verify-ats.cssDeclarations at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca3e2ea11cd7877286adc79bd4c93e33d82807ca00efb93294f5d29b8af011"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/workday.mjs: providers/workday.mjs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in workday.chooseSplitFacet at line 289. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e67d6b235ec4ddde381f252040d40062ac3e29a5614eb882d05827461a85b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: funnel-velocity.mjs: funnel-velocity.mjs changed 15 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: jd-skill-gap.mjs: jd-skill-gap.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in jd-skill-gap.scanJd at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917c770557f403df6a545fe2ba069253e6b534436204de5aeccbf3e69758680"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: audit-portals.mjs: audit-portals.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in audit-portals.main at line 418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"668397e2b88ab1d4656d4f03bcef180199d1701b8fd24e870f9019dcb0a82ce5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: github-evidence.mjs: github-evidence.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in github-evidence.buildEvidence at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369719825ccb58b68a2ba374a355295c1d3481419c67ea3dd33df5f8856d67d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: coverage-check.mjs: coverage-check.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in coverage-check.diagnose at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc26f0d9ac75aa10cb569a8550f8cd613911b77e7f0b0fe42b4e2c92d58071cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/status-select.tsx: web/src/components/status-select.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in status-select.StatusEditor 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5a57baf7c6c01f755eb3c43a04ebaccab14ff224151e0f846d351fdb5de30c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-cover-letter.mjs: generate-cover-letter.mjs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in generate-cover-letter.main at line 635. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1bfb162c5af4af1caaa9e3fcb9f6ac2667c1909168f1bba8ba7d0a61ff1f7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: followup-seed.mjs: followup-seed.mjs changed 19 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: batch-evaluate-gemini.mjs: batch-evaluate-gemini.mjs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in batch-evaluate-gemini.processOffer at line 447. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"babc322ecabfb012086e9f84283a5e2146cd42c99a331de557162716eb9f2950"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: rejection-latency.mjs: rejection-latency.mjs changed 13 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: sync-pdf-flags.mjs: sync-pdf-flags.mjs changed 6 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: reconcile-pipeline.mjs: reconcile-pipeline.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in reconcile-pipeline.reconcile at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d60c5c68896b06c022c64cc9b234126cb804fb887cedb6a4c40b7263d678d9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/jobs/job-store.tsx: web/src/components/jobs/job-store.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in job-store.JobsProvider 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a239ebb477afb826a34fc97f7c3aef5a8aec4ce89d33ceb492783585f9503bbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/apply-view.tsx: web/src/components/apply-view.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in apply-view.ApplyView at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f2df1b7f26eacd0ef1f8aaaf897e17b13dc9b35addd320e8083417da343da7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: build-cv-latex.mjs: build-cv-latex.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in build-cv-latex.runSelfTest at line 337. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13bb6e3a875a9c39cdde894ffbd50faf551b5c1f7346d696e7fe06eaebce1b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/scheduled-jobs-view.tsx: web/src/components/scheduled-jobs-view.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in scheduled-jobs-view.ScheduledJobsView at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8932b5534bbe74eb7eff20717a2ccedf5bceb80fbeae13ced274793f81102836"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/analytics-metrics.mjs: web/src/lib/analytics-metrics.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in analytics-metrics.canonicalizeArchetype 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b8bbb1bb09a6a3b201a91aafa1d0e630674200248cb5e42ef1722f2a06a99e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-hn.mjs: scan-hn.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in scan-hn.main at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1649977822b9a2d8884f3130e17e440649a0d0516650eca9dcb75bc45530b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/config-form.tsx: web/src/components/config-form.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in config-form.ConfigForm at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b27a39699a85d02416174208022ba81dd64e3d5895bacceeec69e4eeaca9a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scan-dayforce.mjs: scan-dayforce.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in scan-dayforce.scanBoard at line 477. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- scan-dayforce.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-dayforce.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b25fee76e4450566c9bbe72b94f2d5174bbc82f1678154bd9a4ef2a2054063"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/core/scan.ts: web/src/lib/core/scan.ts changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in scan.runScanner at line 191. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"69634b8555fedad2016eb04d618c4960df9a83cd5e8a3500dc66b214f5181084"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: detect-reposts.mjs: detect-reposts.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in detect-reposts.detectReposts at line 511. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc09d9bdb31197f2edadaa4b12c16c7972e52659cbd94428fd86ee0a50e6fbb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: archive-posting.mjs: archive-posting.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in archive-posting.archiveUrl at line 344. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84cbe517f14b15c77cd28b7a5448a0fdaa343c862c9e4e1e8cc49e2ccc95bd2"}},{"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 41 in successfactors.fetchCsb at line 367. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f968e6a35e23942c9126bea1cd72543f0515606c6da3d0b31ae207006ccbd047"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/smartrecruiters.mjs: providers/smartrecruiters.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in smartrecruiters.parseSmartRecruitersResponse at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f175d3c83b575d5e968bc5fafca284aec97596aa14c6ac4fdb4ab9a749f3332"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/cv/ingest/route.ts: web/src/app/api/cv/ingest/route.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in route.POST at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94766c37c740ef39949e34828cff3632083bb8a6f81df5e363b2bfcf1c7f493"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/run-prompts.mjs: web/src/lib/run-prompts.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in run-prompts.buildPrompt at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6001c5b157396c7ad673455654a590a01e93391be2d7a5496c96ac30eb92280"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv-editor.tsx: web/src/components/cv-editor.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in cv-editor.CvEditor at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/cv-editor.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-editor.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"69736dc03e43a2ffd5f15a008272b91ca18df34e5709af693d1f3696ee7338db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cv-templates.mjs: cv-templates.mjs changed 13 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: application-answers.mjs: application-answers.mjs changed 11 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96c9b53eda35c21d9c70c0d499ffa9744524b548aee7a0a16d7ed80bed829ac"}},{"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 26 in scan-interamt.main at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd6c6744cae4532192d67e833089614036a3daf412844c353ebd50122366c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/jobs/worker-card.tsx: web/src/components/jobs/worker-card.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in worker-card.WorkerCard 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4adedb19a8c2d4ee3c5a956cb2aed75d9afdec2ab5f7b209bd4bd4018f40e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: company-history.mjs: company-history.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in company-history.runSelfTest at line 992. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"07920402ce24a32d3530936043595caafa5d0db42db14c8abb48d49ad43f9238"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/apply/prefill/route.ts: web/src/app/api/apply/prefill/route.ts changed 9 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: check-jd-archive.mjs: check-jd-archive.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in check-jd-archive.checkJdArchive 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"59464775ebde1c2d595e1791ac0aa1d16b7c71d12f84d08daeb65556e1ce5c2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/_country.mjs: providers/_country.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in _country.buildWorkplacePolicy.\u003Creturned closure\u003E at line 372. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/_country.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/_country.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5f2714e0ba29d01cff2260f6a01be6947bbdff0e33fd4a3ec4733291c02834"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/report-persist.mjs: web/src/lib/report-persist.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in report-persist.persistEvaluation at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ea63a7e597c91d4c1e83bc8a833dd9e02b57153ff104ec210567e6cdb06479"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hired-share.mjs: hired-share.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in hired-share.main at line 368. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa6882d1485ef73e8d85eab7a251c2870b2319fce0409fd1321dbbc67934272"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: history-ats-seeds.mjs: history-ats-seeds.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in history-ats-seeds.atsBoardUrlOf at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- history-ats-seeds.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":"history-ats-seeds.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe2b407c6361a52dff2e84f6dd420033f6f6286ba2e1878f6e7e43465e77370"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/followups/cadence/route.ts: web/src/app/api/followups/cadence/route.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in route.POST at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b935842c4fcf0e49a6ee448d6d02cd29d7960633124cfd21ef07e2baa323eb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv-studio/cv-studio.tsx: web/src/components/cv-studio/cv-studio.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in cv-studio.Studio 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/cv-studio/cv-studio.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/cv-studio.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bdbde87070907364d1226f3476269dd8a003da38d5ce73a2e33841677577cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: url-key.mjs: url-key.mjs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in url-key.canonicalJobKey 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb7b6b474f3738017424cf2c3aae17a091fe72a0981743ae390e814c0761533"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: keyword-match.mjs: keyword-match.mjs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in keyword-match.extractKeywords at line 347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185f987ea0227881c2962136a1bfe8803474128c7cfc944196d4a03b163903a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/discovery-card.tsx: web/src/components/explore/discovery-card.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in discovery-card.DiscoveryCard 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcc97096366fd302ddd39c5fb6dbbadeebac040226dc1ebc359288a6d607899"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/decision-card.tsx: web/src/components/home/decision-card.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in decision-card.DecisionCard at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a1940c13a8ce2aa96bbbbd6adb903c44427d99a83bf34c875f2a33da790d47"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: ics-interview.mjs: ics-interview.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ics-interview.parseIcs at line 414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- ics-interview.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":"ics-interview.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea668232b59cb49de698ff526b4e2824e81ac2cf46adfd34e0731443d2da2fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/whats-new/route.ts: web/src/app/api/whats-new/route.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in route.GET at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a625176b85cd7f3d5484006e8ac0e3fa72619838d8e889717617ea308bdcf285"}},{"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 431. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9705dfa5441f8f04c333eb172341380245f3478489fafc63803f110b9c74c818"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: onboard-write.mjs: onboard-write.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in onboard-write.normalizeAnswers at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b855746bf5a43f15fd330a30f693da99ce978b4611c0b19f09e2c7a8906f76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: normalize-statuses.mjs: normalize-statuses.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea9da0c8e206860a9a2edc468d75c85c067722db44ffbc9a7a7fe791e9f0c90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scaffolder/bin/cli.mjs: scaffolder/bin/cli.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in cli.main 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6259bd7d55d4cf5335c151eeeb68a3d8d7de6d8d78b974f2de2bf76aa5b1db3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: role-matcher.mjs: role-matcher.mjs changed 5 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: add-entry.mjs: add-entry.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in add-entry.main 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d121760c511475e26bdfb1006d2ed16ff93a89de2a716d569e2b2c26584d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hired-wall-build.mjs: hired-wall-build.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in hired-wall-build.buildSvg at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ca7effb22b108568920ceb2abd96a07dd9e7dd87309092ab170c3a79d35bc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: company-funded.mjs: company-funded.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in company-funded.fetchHnDiscovery at line 787. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eacf1cbf62b736494708e61cfe2e41ae431df9c972e2c7eed2c87668da59be9"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/scripts/scheduled-jobs-runner.mjs: web/scripts/scheduled-jobs-runner.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in scheduled-jobs-runner.executeJob at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/scripts/scheduled-jobs-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":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c2720178d97ba901c605a832d1c89f5d7ae544ff3f6f74666bede3b6161e93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/jobs/[id]/page.tsx: web/src/app/jobs/[id]/page.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in page.JobPage 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/jobs/[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/jobs/[id]/page.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"88290244ff7ab8f8a0f565d61b8cb08c60456ac08da6277742d7a0a93e4ec876"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/core/url-key.mjs: web/src/lib/core/url-key.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in url-key.canonicalJobKey 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b546cec004757e03baf7764804c399539ac5a41102ebc3635d043cb8c2f16b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/cv-studio/section-card.tsx: web/src/components/cv-studio/section-card.tsx changed 4 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/workable.mjs: providers/workable.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in workable.parseWorkableWidget at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b7028f1f166ef1a10f2b6919ab034b8d4a803ce154c53453eb3edc0dbe63f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/mobile-nav.tsx: web/src/components/mobile-nav.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in mobile-nav.MobileNav at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed132b814a8bdc7b8c40304dc676cd078037ae6d8dd3176b85abb885c895f0f"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: dashboard/internal/ui/screens/viewer.go: dashboard/internal/ui/screens/viewer.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ViewerModel.Update 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7363faa44b08bee7e0c79565b29fb151a5b3b0ef4f63c687eac00415f28f969"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/explore/results-list.tsx: web/src/components/explore/results-list.tsx changed 5 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/components/templates/templates-section.tsx: web/src/components/templates/templates-section.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in templates-section.TemplatesSection 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/templates/templates-section.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/templates/templates-section.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40238b53c1fa6d9811cd907a8c2918236fc4ab8be6d5d3d917e9a8ac956bd3b"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/components/portals-view.tsx: web/src/components/portals-view.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in portals-view.PortalsView 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeac0ebcf21c8de71778534e25b1652379946358a94b8a631a34b59063fdb135"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/inbox/triage-row.tsx: web/src/components/inbox/triage-row.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/telegram-channel.mjs: providers/telegram-channel.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in telegram-channel.employerName at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/telegram-channel.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/telegram-channel.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aaeca5cfb71f5fbb13b841c53d4999f077bca38d842be98e757079b290e0af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/apply/drive/route.ts: web/src/app/api/apply/drive/route.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in route.POST at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"836d9bf9e990fa347cdb9f58e5f7aadf8c1e7458c4e8cc02ac2339291b3e801e"}},{"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 37 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/scheduled-scans/job-card.tsx: web/src/components/scheduled-scans/job-card.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in job-card.JobCard at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a70e3a2327325d60f90201f270dd3995647fbb1e90fcfe59804f0e988e30e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: generate-latex.mjs: generate-latex.mjs changed 6 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: dashboard/internal/data/derive.go: dashboard/internal/data/derive.go changed 3 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: prepare-application.mjs: prepare-application.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in prepare-application.readProfile at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eacf0865ff93190b18499310bb224dad80eab01ce8dce539c64c869cf2afbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/pipeline/[id]/apply/page.tsx: web/src/app/pipeline/[id]/apply/page.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in page.ApplyPage 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/pipeline/[id]/apply/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]/apply/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d432ab65aacc892fef2b38daad0626e0cb039de3131a99f1dbd2ca91d1729"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/home/follow-up-card.tsx: web/src/components/home/follow-up-card.tsx changed 5 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/components/home/onboarding-progress.tsx: web/src/components/home/onboarding-progress.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in onboarding-progress.OnboardingProgress at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/home/onboarding-progress.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/onboarding-progress.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a6d20cfdd15e2330ef4050bb8afd9745ed5b4ecc4780c33dba5afbdd5b65c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/jobstreet.mjs: providers/jobstreet.mjs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in jobstreet.parseJobstreetItem at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7bf40c65fad744ee94adab42e7bf0aeb9823f0b6371056bb7bb8f0f6838fbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/_html-entities.mjs: providers/_html-entities.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in _html-entities.decodeEntities at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/_html-entities.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-entities.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cc6c66fdc18cc0854690edebe348061cafaa2bc83b94a5c58db01e51880854"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/apply/fill/route.ts: web/src/app/api/apply/fill/route.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in route.POST at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba490e8dad35820f0ea658b858c137f432bc94ccb35a66d62d723be4f66d0f87"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/lib/job-stream.mjs: web/src/lib/job-stream.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in job-stream.readJobStream 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/job-stream.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/job-stream.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3991ebcc6b855ad227043372a984f96b69a134267f10664b0e8a697b9d8281"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: backup.mjs: backup.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in backup.runBackup at line 510. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- backup.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":"backup.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a8e23e46b4f5b378e50500082ea3662c80dbdc7da2948ab3d7afabeff1053d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dashboard/internal/data/pdf.go: dashboard/internal/data/pdf.go changed 4 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/app/api/tracker/delete/route.ts: web/src/app/api/tracker/delete/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 22. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e180577b6032ccde41931d8ab89accf72f4cdfa284e85928f8b97194e76b9baf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/app/api/portals/verify/route.ts: web/src/app/api/portals/verify/route.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"50655a99f5db064a728aa8120791060fe4b8b882eee3efda58626cd9a5412789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: jd-years.mjs: jd-years.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jd-years.latinHeadingKind 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- jd-years.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-years.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40a6133bb8cb96097681cd2ec44d73aef5728dd4273edd7dd902ecaf5ef5cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/scheduled-scans/edit-job-modal.tsx: web/src/components/scheduled-scans/edit-job-modal.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in edit-job-modal.EditJobModal 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/scheduled-scans/edit-job-modal.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/edit-job-modal.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86564cfe5e08159ca65460b081f3cbee74e6e0363663d7d5fbb7c7e3a5d0299"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/jobicy.mjs: providers/jobicy.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in jobicy.parseJobicyResponse at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/jobicy.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/jobicy.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b583906ca6fd71d3e27f0d692be243e892630f9c1a86a2a3d90c1605edf843eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/lib/apply/drive.ts: web/src/lib/apply/drive.ts changed 3 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/app/api/runs/save/route.ts: web/src/app/api/runs/save/route.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in route.POST at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/runs/save/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/runs/save/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfa2054470584515bde88a0c6a3cf21d8719738f7849b5d043d3a406d4f3d1e"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/gupy.mjs: providers/gupy.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in gupy.normalizeGupyApiJob at line 307. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/gupy.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/gupy.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a92ed514121a84066f30d12bcfbdc58228510024dcee401218d1142fa9ccb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/components/scheduled-scans/run-history-drawer.tsx: web/src/components/scheduled-scans/run-history-drawer.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in run-history-drawer.RunHistoryDrawer at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/scheduled-scans/run-history-drawer.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/run-history-drawer.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56fc63eaff2fb85f0881834c0ff841f657bb46fdbb253dded3b534381a3fc3e"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/app/api/followups/log/route.ts: web/src/app/api/followups/log/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 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/thehub.mjs: providers/thehub.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in thehub.normalizeHubJob 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"937eb9ead4609885eeb0a4b05dc8473275f5c3e2f268df47ae9af8c7c18750a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/pinpoint.mjs: providers/pinpoint.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pinpoint.parsePinpointResponse at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/pinpoint.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/pinpoint.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa2fd3bafb6f644966ec93d1267e2a9083329e1973f8b623ce2be8a7571e70c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/breezy.mjs: providers/breezy.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in breezy.parseBreezyResponse at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/breezy.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/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9d5046d08baf85e824d5b752367f53618c8415f6859dd37da717492a6d23bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/comeet.mjs: providers/comeet.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in comeet.parseComeetResponse at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/comeet.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/comeet.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9b7fdb7d30ee3ec540df7ed5a0625b4e8780771f4f4eed0f9841d573afc365"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/arbeitnow.mjs: providers/arbeitnow.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in arbeitnow.normalizeArbeitnowJob at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/arbeitnow.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/arbeitnow.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9ca1b70bf0a6251cb4a532fa1983c2865d814372f02e7af628dce37d6b38e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: providers/applicantpro.mjs: providers/applicantpro.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in applicantpro.parseDetail at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/applicantpro.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/applicantpro.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"326ff1288f3000e03731fb553940b1420aa73861b3445fa7963e36fed971c5bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: evaluation-cache.mjs: evaluation-cache.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in evaluation-cache.machineSummary at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- evaluation-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":"evaluation-cache.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a464a0e55ea482f94ea502a635de7ba641735b1c0f902445ecbd0b0d0d675e"}},{"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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":"Repeated repair: test-all.mjs: test-all.mjs changed 183 times in last 90 days and 93 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 2808), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracker): keep a rejection when titles match (#6981)\u201D; \u201Cfix(templates): record the AI Act Omnibus deferral as final law in the EU row (#6864)\u201D; \u201Cfix(latex): the CJK template and --test honor the PAPER placeholder (#6954)\u201D; \u201Cfix(seeds): read a16z\u0027s embedded company list and probe Ashby and Lever too (#6809)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":2808}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd9b8595e857863a8a73b31dc933ffc2618e3981b4f50aab103d49963f43638"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tracker-utils.mjs: tracker-utils.mjs changed 32 times in last 90 days and 23 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): name companies no provider claims (#6088)\u201D; \u201Cfix(status): strip a date from a status cell however it is written (#5860)\u201D; \u201Cfix(add-entry): serialize confirmed additions before reading user files (#5915)\u201D; \u201Cfix(dedup): promote a status without its bold or date, so the ledger reads it (#5859)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: openai-eval.mjs: openai-eval.mjs changed 29 times in last 90 days and 20 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 269), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(evaluator): reject incomplete evaluator streams and preserve unknown usage (#3949)\u201D; \u201Cfix(score): claim only levers that move the score (#6705)\u201D; \u201Cfix(eval): reject OLLAMA_NUM_CTX and *_TIMEOUT_MS values that are not whole numbers in range (#6662)\u201D; \u201Cfix(eval): read .env from the data root in the model runners (#6659)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c18db4983587e4975caa27137bec5e4b9f21a3a3f819d3156bb8d724ecc62"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: set-status.mjs: set-status.mjs changed 29 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 484), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(status): strip a date from a status cell however it is written (#5860)\u201D; \u201Cfix(set-status): reject a list of tracker numbers with the one-row commands (#6042)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a515525994b29b65102eace5cc8bae64e4243b444009e755e0133bccf80539"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: gemini-eval.mjs: gemini-eval.mjs changed 18 times in last 90 days and 15 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 340), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(eval): read bolded summary keys in the Gemini evaluators (#6825)\u201D; \u201Cfix(gemini-eval): send the job description once (#6826)\u201D; \u201Cfix(score): claim only levers that move the score (#6705)\u201D; \u201Cfix(eval): read .env from the data root in the model runners (#6659)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28af8370c5a03441d270f72d99f36c7c009d9fd5e888f56f70015ef2fca4176"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dedup-tracker.mjs: dedup-tracker.mjs changed 17 times in last 90 days and 14 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 dedup-tracker.roleMatch at line 364), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracker): keep a rejection when titles match (#6981)\u201D; \u201Cfix(tracker): stop a placeholder or a URL spelling hiding which posting a row is (#6390)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"35456ece57076c36597faead9069c851a844dcae995da96bbe441bdc6169c14f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: ollama-eval.mjs: ollama-eval.mjs changed 15 times in last 90 days and 14 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 204), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(evaluator): reject incomplete evaluator streams and preserve unknown usage (#3949)\u201D; \u201Cfix(score): claim only levers that move the score (#6705)\u201D; \u201Cfix(eval): reject OLLAMA_NUM_CTX and *_TIMEOUT_MS values that are not whole numbers in range (#6662)\u201D; \u201Cfix(eval): read .env from the data root in the model runners (#6659)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f7e798c504f7d89c54742eb03a48a66f8ad6d35faac6f4f673475891b4fc28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tracker-parse.mjs: tracker-parse.mjs changed 15 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 15 (its worst body is tracker-parse.scanMarkdownLinks at line 503), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tracker): stop a placeholder or a URL spelling hiding which posting a row is (#6390)\u201D; \u201Cfix(tracker-parse): read a req id behind an id-parameter name (#5782)\u201D; \u201Cfix(tracker): keep a balanced closing paren on a report URL token (#5581)\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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- tracker-parse.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-parse.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4c566a2e3137bae61ad343aa88133ee7d6e69adc72496061ce08f2f3ccb4a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/report-sections.mjs: web/src/lib/report-sections.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 9 (its worst body is report-sections.sectionPreview at line 286), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(modes): mark the draft-answers heading with (draft) in every mode (#4272)\u201D; \u201Cfix(web): point apply next at the stored call (#6777)\u201D; \u201Cfix(web): label the report archetype so it is not a second job title (#6141)\u201D; \u201Cfix(web): read report headers saved with Windows line endings (#6052)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/report-sections.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-sections.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5886fd1fcc4f1e6e58a6f3b955f8407a115a9b1b31ddc4c3a9adbc18bea56c6c"}},{"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 647), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(outcome): find a posting capture under the slug archive-posting wrote (#6658)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1e79d586b01448fe75edd87100bc2a447b9beb4b018eab8ce4d7c0ba724fb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/greenhouse.mjs: providers/greenhouse.mjs changed 13 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 14 (its worst body is greenhouse.resolveApiUrl at line 66), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): throw on a greenhouse, ashby or lever response that is not a board (#6918)\u201D; \u201Cfix(greenhouse): give /offices its own size and time ceiling (#6937)\u201D; \u201Cfix(greenhouse): fetch bodies for title-matched postings on an oversized board (#6673)\u201D; \u201Cfix(providers): read boards over the 10 MB body cap (#6560)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"85226b521c40f2e2c2c67ca7d54a40e465e99d0eecfafbb6565a4e61bd42cd49"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: pipeline-lock.mjs: pipeline-lock.mjs changed 11 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 11 (its worst body is pipeline-lock.acquirePipelineLock at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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-tailor.mjs: openai-tailor.mjs changed 11 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 3 (its worst body is openai-tailor.readFile at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(openai-tailor): refuse a reply that did not finish, as openai-eval does (#6991)\u201D; \u201Cfix(openai-tailor): send OpenCode Go the session id and user agent it asks for (#6800)\u201D; \u201Cfix(eval): reject OLLAMA_NUM_CTX and *_TIMEOUT_MS values that are not whole numbers in range (#6662)\u201D; \u201Cfix(eval): read .env from the data root in the model runners (#6659)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee8b8ddf9e727b8e92c5fdb3190702317d71786000e4565f5b8a55782d4f3f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dashboard/internal/i18n/catalog.go: dashboard/internal/i18n/catalog.go changed 12 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 12 (its worst body is Catalog.StatusLabel at line 239), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dashboard): give unknown statuses their own pipeline tab (#6142)\u201D; \u201Cfix(dashboard): fit the pipeline to the terminal width (#6050)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f11834bb72fb6b912a200bbb1cd377e4caf3e64cc469dae8ceffc6f0ed0e98"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/lever.mjs: providers/lever.mjs changed 11 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 14 (its worst body is lever.leverSalary at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(providers): throw on a greenhouse, ashby or lever response that is not a board (#6918)\u201D; \u201Cfix(providers): read boards over the 10 MB body cap (#6560)\u201D; \u201Cfix(verify-portals): probe Lever and Ashby boards with their provider\u0027s timeout (#6507)\u201D; \u201Cfix(lever): keep a remote workplace on the location (#6138)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c3cb69475508f80dccf5572eb7f9e99cc4cd7c4fa7e5afc6553d3a0fe9f03b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/pdf-render.mjs: web/src/lib/pdf-render.mjs 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 8 (its worst body is pdf-render.pdfRunOutcome at line 49), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: name a missing data folder and fail unfinished doctor setup (#6618)\u201D; \u201Cfix(web): show the real PDF render failure, not the warnings printed before it (#6624)\u201D; \u201Cfix(pdf): keep a warn-only page-budget overflow off the output path and out of the manifest (#6458)\u201D; \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5844ff3821306a15a193e8afeefdcf6fa5904592fc57d1ea7415d3547db47bb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/generate-pdf-button.tsx: web/src/components/generate-pdf-button.tsx 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 7 (its worst body is generate-pdf-button.GeneratePdfButton at line 18), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \u201Cfix(web): download the tailored CV and reveal it in the file manager (#6596)\u201D; \u201Cfix(web): keep your place when a Pipeline back link returns to the list (#6072)\u201D; \u201Cfix(web): darken light-mode status text so it clears WCAG AA (#6078)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a6ee7ff44d7604cc44e4773341761d53a8ee329d04beb5c8603a72358e1fda"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/cv-pdf/route.ts: web/src/app/api/cv-pdf/route.ts 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 3 (its worst body is route.GET at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): download the tailored CV and reveal it in the file manager (#6596)\u201D; \u201Cfix(web): offer Generate when a marked CV has no file (#6116)\u201D; \u201Cfix(web): serve cv and cover pdfs whose filenames are not ascii (#5163)\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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b08c7db9aca2d78dbceeb6b27801d4a15ea1ba2deef184bfaad27077be95bd7"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/avature.mjs: providers/avature.mjs changed 7 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 11 (its worst body is avature.parseArticles at line 150), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(avature): drop job links whose scheme is not http(s) (#6971)\u201D; \u201Cfix(avature): parse article--result cards without leading article class (#6593)\u201D; \u201Cfix(avature): accept query-style /JobDetail?jobId=\u003Cid\u003E links (#6477)\u201D; \u201Cfix(providers): end csod and avature paging on the rows the source returned (#4885)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4044cc90072eee1adc260af34e8cae8e773b52a948f7176abc979d1d48017bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/beta/beta-banner.tsx: web/src/components/beta/beta-banner.tsx changed 7 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 15 (its worst body is beta-banner.BetaBanner at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep the version pill and Ask button inside the sidebar (#6126)\u201D; \u201Cfix(web): keep keyboard focus inside the follow-up and bug report dialogs (#6079)\u201D; \u201Cfix(web): darken light-mode status text so it clears WCAG AA (#6078)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"73deecb2802d229cddd0856939681bf10d7cee4614643aa86e34f00cd20e47d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/cv-studio/server.ts: web/src/lib/cv-studio/server.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is server.findTailoredHtml at line 52), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep missing Studio CVs attached to their report (#6650)\u201D; \u201Cfix: name a missing data folder and fail unfinished doctor setup (#6618)\u201D; \u201Cfix(pdf): keep a warn-only page-budget overflow off the output path and out of the manifest (#6458)\u201D; \u201Cfix(web): open the Studio from the HTML path stored in pdf-index (#6550)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/cv-studio/server.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/cv-studio/server.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2dd51156de3c179548bb9e019d4a4333763907951838c4099f08f34096a788"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/actions/registry.ts: web/src/app/actions/registry.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is registry.coerceProfile at line 76), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/app/pipeline/[id]/page.tsx: web/src/app/pipeline/[id]/page.tsx changed 8 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 6 (its worst body is page.ReportPage at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): polish Today, Pipeline load, and job 404s (#6619)\u201D; \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \u201Cfix(web): offer Generate when a marked CV has no file (#6116)\u201D; \u201Cfix(web): preserve Pipeline filters when returning from a report (#5049)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90ec2bf265ec06be355268a0ae18b09ab712245f13f2082a0be339c6ae21833"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/icims.mjs: providers/icims.mjs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is icims.pickLocation at line 237), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(icims): read location labels that start with Location (#6130)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98337b218b47a98f59e675c6ede713cc30614b72db4c23df40d5fd18c0b983d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: discover-new-companies.mjs: discover-new-companies.mjs changed 8 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 3 (its worst body is discover-new-companies.candidates at line 221), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: stamp the local day, not UTC, in four more writers (#6564)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c97f43e5fbbffb15ec86b9668efc4200051b2c8323cd8c0769a492a5811711"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/apply/cv.ts: web/src/lib/apply/cv.ts changed 7 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 9 (its worst body is cv.resolveTailoredCv at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106cdf356bbcef744051fa640296bb81710886c5762ec214049b862daa217ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/documents/page.tsx: web/src/app/documents/page.tsx 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 15 (its worst body is page.DocumentsPage at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): ignore stale document fetches and refresh the list when a tab returns (#6963)\u201D; \u201Cfix(web): let list pages use the width of a wide screen (#6899)\u201D; \u201Cfix(web): match the Documents heading and padding (#6817)\u201D; \u201Cfix(web): polish Today, Pipeline load, and job 404s (#6619)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/documents/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/documents/page.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"093151bf75cc13881a7e08f4fe1bc248f9b1f4a19acbf4d67b9fbcd9bc403932"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/context-budget.mjs: lib/context-budget.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 9 (its worst body is context-budget.buildBudgetedPrompt at line 264), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(eval): include the profile and send each JD only once (#3950)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":264}}}],"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 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 13 (its worst body is pipeline.addOffersToPipeline at line 40), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): gate conditional workplace geography before Inbox admission (#6484)\u201D; \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":40}}}],"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 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 11 (its worst body is route.patchToProfile at line 46), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep the example person out of a first profile (#6359)\u201D; \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc72288092a1e07f1403a00bac3db93e94fead035a45fe6639bbbd5248c797e"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: tests/evaluation-mode-parity-helpers.mjs: tests/evaluation-mode-parity-helpers.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 12 (its worst body is structuralGaps at line 143), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(modes): ask for the Machine Summary in the ar, ja, tr, zh and zh-TW templates (#6161)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aa429812b19bcb5d5d1cf6cf23443b8a3d58f99e9e70ca20b558cd64e765a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: path-resolver.mjs: path-resolver.mjs changed 8 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 path-resolver.getCareerOpsRoot at line 110), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: anchor relative tracker overrides and importer retries to the codebase (#3952)\u201D; \u201Cfix(batch): read batch-state.tsv from the checkout in merge-tracker and reserve-report-num (#6449)\u201D; \u201Cfix(paths): resolve the profile through one CAREER_OPS_PROFILE-aware helper (#5087)\u201D; \u201Cfix(tracker): Go and Node agree on the lock directory on Windows (#5365)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- path-resolver.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":"path-resolver.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffa37e4212ce7325a999387fd50f689dbf3e9c033751b3b1faa952550228097"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: process-quality.mjs: process-quality.mjs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is process-quality.aggregateProcessQuality at line 173), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix/5197 followup seed flags (#5253)\u201D; \u201Cfix(rejection-latency): report placeholder-employer applications instead of dropping them silently (#3712)\u201D; \u201Cfix(cli): validate flag values in detect-reposts via the shared safeIntFlag\u201D; \u201Cfix(cli): close the missing-operand hole for value-taking flags (#3087)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- process-quality.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":"process-quality.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6b344f885ea59399f85fa0016cbc6a960d90ecf4a4f409a1ab4828dfff1e9a"}},{"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 12 (its worst body is tracker-table.loadHeaderAliases at line 63), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): invalidate header aliases after same-size edits (#6823)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/arbeitsagentur.mjs: providers/arbeitsagentur.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 14 (its worst body is arbeitsagentur.normalizeJob at line 167), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(arbeitsagentur): mark the board partial when a keyword or pass fails (#6984)\u201D; \u201Cfix(providers): arbeitsagentur links and liveness for reference numbers with a slash (#6499)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b35a5a5fb23300c8d3741b2682e9851ded971d62a9376850449a2d8f1c1c55f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/analytics-view.tsx: web/src/components/analytics-view.tsx 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 7 (its worst body is analytics-view.StatsPanel at line 138), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): let list pages use the width of a wide screen (#6899)\u201D; \u201Cfix(web): stop printing the conversion rate on the volume funnel (#6136)\u201D; \u201Cfix(web): announce why an analytics rate shows a dash (#6239)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/analytics-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/analytics-view.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d600f2a65c5a7bcd992a05be5e7c42c2f48996bf2634f75149bd277b011d3e0b"}},{"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 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 15 (its worst body is route.POST at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): hold an incomplete greenhouse, lever, or ashby handoff (#6778)\u201D; \u201Cfix(web): refuse Workday, iCIMS, and UKG before opening a browser (#6595)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0651dc747d25454737917a593df0e06a69fcd6e8ef39348e8939c128a2ae31"}},{"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 21), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a07826e3b5000921997725059ea1cb70243e8f78a2c278707c23f0d108e5b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skill-extract.mjs: skill-extract.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 7 (its worst body is skill-extract.mentionsFineTuning at line 414), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/getro.mjs: providers/getro.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 11 (its worst body is getro.getroSalary at line 185), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(getro): warn when getro_max_pages cuts a board short (#6433)\u201D; \u201Cfix(providers): getro warning names the failed page and the real attempt count (#6465)\u201D; \u201Cfix(getro): do not stop the walk at an old featured pin (#6406)\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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/getro.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/getro.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff5495742d83112e9184ea40ffb0f237d434cbd1c7267c2c3d27f2ffaeba714"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: lib/pdf-server.mjs: lib/pdf-server.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 10 (its worst body is pdf-server.startPdfServer at line 231), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pdf): keep a warn-only page-budget overflow off the output path and out of the manifest (#6458)\u201D; \u201Cfix(pdf): honor PLAYWRIGHT_CHROMIUM_EXECUTABLE_PATH and document macOS fallback (#6209)\u201D; \u201Cfix(pdf): isolate shared painters by workspace context (#6164)\u201D; \u201Cfix(pdf): replace the shared browser after disconnection (#6163)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- lib/pdf-server.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/pdf-server.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"039139b84c0155718de3231255ef202ee145b722ca49cd35ca3b0c0e124a043c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fetch-jd.mjs: fetch-jd.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 7 (its worst body is fetch-jd.main at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read script-rendered JDs before the evaluate worker starts (#6604)\u201D; \u201Cfix(fetch-jd): exit 1 on a miss instead of aborting on Windows (#6462)\u201D; \u201Cfix(cli): handle --help and -h in fetch-jd and seed-fixture (#5822)\u201D; \u201Cfix(fetch-jd): read JDs from company-careers gh_jid links and SmartRecruiters (#4673)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- fetch-jd.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":"fetch-jd.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896d16ba105cc6701379b36e5867f0584109490a35392bfb212f443b8a60d66"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/lib/apply/cv-selection.mjs: web/src/lib/apply/cv-selection.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 8 (its worst body is cv-selection.pdfIndexEntriesByReport at line 92), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read pdf-index.tsv once per Pipeline page, not once per row (#6976)\u201D; \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \u201Cfix(web): open the Studio from the HTML path stored in pdf-index (#6550)\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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/apply/cv-selection.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/apply/cv-selection.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f81f37cae8ece059ed9c2151d6d5039eb3bb6809b80389ecedebe2d0f620fea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: utils/token-tracker.mjs: utils/token-tracker.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 token-tracker.estimateCost at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(evaluator): reject incomplete evaluator streams and preserve unknown usage (#3949)\u201D; \u201Cfix(openai-eval): record the evaluation\u0027s token usage from the stream (#6331)\u201D; \u201Cfix: prefer MiniMax Flash in text evaluation (#5531)\u201D; \u201Cfix(token-tracker): add MiniMax-M3 and MiniMax-M2.7 rates (#3800)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- utils/token-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":"utils/token-tracker.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c5d96c9ff0383371b476244bfd2508530fcb083ab08af7bb25ebabf14e6537"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/posting-url.mjs: web/src/lib/posting-url.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 15 (its worst body is posting-url.markdownLinks at line 59), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \u201Cfix(web): show a second posting with the same title in What\u0027s New (#6148)\u201D; \u201Cfix(tracker): read report links through the shared parser so parentheses survive (#5482) (#5483)\u201D; \u201Cfix(web): keep an extracted posting url intact (#5149)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":"acad9e5f7f8c02702e618817a17e244e6dc2b792cf39b386dea1a444d11fef31"}},{"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 186), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(match-star): read --jd=\u003Cfile\u003E and --top=\u003Cn\u003E, and refuse an unknown flag (#6451)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"224224954d4817f37a29ae2ec27703947f35581562de62b5388aee0c50aef412"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/saved-cli.ts: web/src/lib/saved-cli.ts 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 saved-cli.resolveCliId at line 60), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): onboarding offers the assistant only when a CLI can run (#6432)\u201D; \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/app/api/followups/route.ts: web/src/app/api/followups/route.ts 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 route.GET at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D; \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3f86ff4ade4da9d6964d8b2751c4286aec2c9f0b6ba12bb4969681505a4398"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: find.mjs: find.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 find.findMatches at line 161), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: lib/tracker-addition.mjs: lib/tracker-addition.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 tracker-addition.normalizedTrackerScore at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix (tracker): support standard bullet points in summary extraction regex (#6848)\u201D; \u201Cfix(eval): read bolded summary keys and skip the tracker row without one (#6332)\u201D; \u201Cfix(web): deny Write/Bash when evaluating untrusted JDs (#3629)\u201D; \u201Cfix(tracker): read a decimal-comma score instead of truncating it (#5199)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- lib/tracker-addition.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/tracker-addition.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba12e855e27c83fd4c9d22996d49991243ceb114c68b2ccf6f3624daa50246f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/_dns-cache.mjs: providers/_dns-cache.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 14 (its worst body is _dns-cache.createCachedLookup.cachedLookup at line 274), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read script-rendered JDs before the evaluate worker starts (#6604)\u201D; \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): validate resolved addresses before connecting (DNS rebinding guard) (#3096)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ca3f10fdd599e1d0664cd92dcb9d8426426b03cd8df2533e320b265d93b2de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/logo/route.ts: web/src/app/api/logo/route.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 11 (its worst body is route.GET at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): the logo route\u0027s curated lookup guessed an un-folded domain first (#6711)\u201D; \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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 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 logo-cache-key.companyCacheKey at line 70), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): the logo route\u0027s curated lookup guessed an un-folded domain first (#6711)\u201D; \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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb5c9189c1d464c3a0bde0ed523f8de96b61e919cf94a520c0c3e4bb0bc4fcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/cover-draft-button.tsx: web/src/components/cover-draft-button.tsx 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 cover-draft-button.CoverDraftButton at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): ask before marking an application Applied (#6600)\u201D; \u201Cfix(web): keep your place when a Pipeline back link returns to the list (#6072)\u201D; \u201Cfix(web): darken light-mode status text so it clears WCAG AA (#6078)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/cover-draft-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/cover-draft-button.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85c1439f2d161d6752056aa0f8274e9c222cb8e7193e013c63bc79c1f3a83b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/jobs/page.tsx: web/src/app/jobs/page.tsx 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 12 (its worst body is page.JobsHistory at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): show evaluation stops as unscored review outcomes (#6496)\u201D; \u201Cfix(web): darken light-mode status text so it clears WCAG AA (#6078)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D; \u201Cfix(web): say where cli evaluations go on the workers page (#5172)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/jobs/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/jobs/page.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce0f2a5f08278ef1529110cec9f924b98c83b4aff95ae2c1986c02a3a8a2878"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/jobspresso.mjs: providers/jobspresso.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 6 (its worst body is jobspresso.cleanUrl at line 70), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(jobspresso, wp-job-manager): pass the full post through so the scan filters can read it (#6585)\u201D; \u201Cfix(providers): read jobspresso\u0027s query-free feed path, robots.txt disallows /*? (#6546)\u201D; \u201Cfix(providers): move // @ts-check to line 1 in six providers (#4790)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"56422e5dc44779fc7d99713d75c17b90a44c9a3c726bdfa3cbaf647931b67c22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/explore.ts: web/src/lib/explore.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 13 (its worst body is explore.parseExplorePatch at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): gate conditional workplace geography before Inbox admission (#6484)\u201D; \u201Cfix(web): keep Explore results from sources that finished when another times out (#4431)\u201D; \u201Cfix(web): block_hard survives the Explore round-trip \u2014 type, URL params, seed and serializer (#3102)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/explore.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/explore.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c21a1bb45277a48612563e95cccad3706cdaa778cb659feb62419ec8b7f378"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: cv-sections-core.mjs: cv-sections-core.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 5 (its worst body is cv-sections-core.isEmptySection at line 160), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cv): drop the summary block when the summary is empty (#5021)\u201D; \u201Cfix(pdf): drop optional sections that arrive as a bare header (#3997)\u201D; \u201Cfix(cv): an empty Skills section no longer deletes the sections after it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- cv-sections-core.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-sections-core.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb41a9d0e9271e2b76ccf78162fdb2e9d9e07b3931bdefc80757c9971ba0ab0"}},{"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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: web/src/lib/status-alias.mjs: web/src/lib/status-alias.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 4 (its worst body is status-alias.canonStatus at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(i18n): read Chinese years requirements and status aliases (#6943)\u201D; \u201Cfix(status): map Lapsed to Discarded (#6598)\u201D; \u201Cfix(funnel): retain replies and historical stages across surfaces (#4374)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/status-alias.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/status-alias.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f1c5db7493e507669dbb4ff8add4396626fb9bc47bd20642e1ff56c22eb78b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/api/usage/route.ts: web/src/app/api/usage/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 5 (its worst body is route.plan at line 39), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): make the usage meter show real plan limits reliably (#6934)\u201D; \u201Cfix(web): read only appended transcript bytes for the usage meter (#5503)\u201D; \u201Cfix(web): count cached input in usage meter (#4744)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/api/usage/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/usage/route.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac166cb9bc551af0699cc0e028445ce794e76d0bf5b35f5ef8628d9da75a0c4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/score-methodology.tsx: web/src/components/score-methodology.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 1 (its worst body is score-methodology.ScoreMethodology at line 17), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(score): claim only levers that move the score (#6705)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D; \u201Cfix(web): give the methodology link a real tap target and a new-tab cue (#3023)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/score-methodology.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/score-methodology.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d974fe7d305b0380276073d3922ef93da56aa0de78bd2cca180a73a6a52b4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/home/awaiting.mjs: web/src/lib/home/awaiting.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 5 (its worst body is awaiting.pickAwaitingDecision at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): point apply next at the stored call (#6777)\u201D; \u201Cfix(web): group a flagged posting on Today the way its report labels it (#5332)\u201D; \u201Cfix(web): rank \u0022Awaiting your decision\u0022 by every EVALUATED alias, not an English prefix\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/home/awaiting.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/home/awaiting.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce1b0734eb55b8c0ddb2e69dd185216fa46bb315ab61a83b8c89636d549d145"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/mokahr.mjs: providers/mokahr.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 12 (its worst body is mokahr.parseMokaHrJobs at line 164), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(mokahr): read the tenants the old robots.txt rule skipped (#6694) (#6726)\u201D; \u201Cfix(providers): support MokaHR\u0027s international hire-r1.mokahr.com host (#4606)\u201D; \u201Cfix(providers): route feishu-jobs and mokahr id encoding through _safe-url\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/mokahr.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/mokahr.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"427d398721681411f87c27864c7f863ff54dd2e00973dd38d1ad7a87e86b26e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/app/portals/page.tsx: web/src/app/portals/page.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 page.readWatched at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): explain a missing portals.yml before the health check (#6109)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D; \u201Cfix(web): honor CAREER_OPS_PORTALS on portals page and API (#5360)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/app/portals/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/portals/page.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb677c92636062cf0db99ecc6264c0fed1e8837eec6c1dfc9b7d9422ac92fd18"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/radancy.mjs: providers/radancy.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 12 (its worst body is radancy.parseLegacyResults at line 217), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/phenom.mjs: providers/phenom.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 phenom.resolveConfig at line 75), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: 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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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: providers/cryptocurrencyjobs.mjs: providers/cryptocurrencyjobs.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 11 (its worst body is cryptocurrencyjobs.parseCryptocurrencyJobsRss at line 143), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cryptocurrencyjobs): read location from the feed teaser instead of \u0027Remote\u0027 (#6999)\u201D; \u201Cfix(scan): read the CryptocurrencyJobs teaser\u0027s eligibility clause (#6765)\u201D; \u201Cfix(cryptocurrencyjobs): stop passing the feed\u0027s teaser as the job description (#6746)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/cryptocurrencyjobs.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/cryptocurrencyjobs.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc9f8e2fc6cf58e5a20f0c94a9f5f71f4fa1721c32760c93b538a2f0cb49f6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/core-cli.ts: web/src/lib/core-cli.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 6 (its worst body is core-cli.runCoreCli at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): read script-rendered JDs before the evaluate worker starts (#6604)\u201D; \u201Cfix(web): run core scripts and read system files from the checkout, not the data root (#4430)\u201D; \u201Cfix(web): launch every remaining web child process without a console (#5902)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/lib/core-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/core-cli.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cf8ec18e4597df44aa0a316715ee05f5b5aff9037cefe3bd909ac295070e59"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/scheduled-scans/create-job-modal.tsx: web/src/components/scheduled-scans/create-job-modal.tsx 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 7 (its worst body is create-job-modal.CreateJobModal at line 12), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): polish Today, Pipeline load, and job 404s (#6619)\u201D; \u201Cfix(web): keep keyboard focus inside the follow-up and bug report dialogs (#6079)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/scheduled-scans/create-job-modal.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/create-job-modal.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b72fe0bd17ffe006a4dde6cc69602d893cdf46aa6c76143f05e89552d35e0b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/himalayas.mjs: providers/himalayas.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 10 (its worst body is himalayas.parseHimalayasResponse at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): accept worldwide labels in country-only filters (#6553)\u201D; \u201Cfix(providers): give the himalayas health probe a no-retry policy (#6008)\u201D; \u201Cfix(himalayas): follow bounded cursor pagination (#5042)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- providers/himalayas.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/himalayas.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2810b35dfd3be05eb6cffec6f359ce3823d8cd69de7005bb02605fcc69651940"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/analytics/search-insights.tsx: web/src/components/analytics/search-insights.tsx 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 15 (its worst body is search-insights.SearchInsights at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): label the insights rate as a share of applications sent (#6137)\u201D; \u201Cfix(web): a breakdown bucket nothing was submitted from shows no conversion rate (#5875)\u201D; \u201Cfix(web): a vendor rate from one application is not a rate (#5372)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/analytics/search-insights.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/analytics/search-insights.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0bca1feb2d7321168f421982595cb18a07e269aeca598d5ea1288b4c5b7296"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/lib/core/portals.ts: web/src/lib/core/portals.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 8 (its worst body is portals.seedExploreFilters at line 83), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scan): gate conditional workplace geography before Inbox admission (#6484)\u201D; \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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7483b059aae9ad8c7f59642c293e47280642f4581dbd11654ae221834bfb2cba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/src/components/followups/next-date-dialog.tsx: web/src/components/followups/next-date-dialog.tsx 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 next-date-dialog.NextDateDialog at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): keep keyboard focus inside the follow-up and bug report dialogs (#6079)\u201D; \u201Cfix(web): paint brand text with the brand-text token (#6081)\u201D; \u201Cfix(web): persist Today snoozes and confirm status writes (#4106)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- web/src/components/followups/next-date-dialog.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/next-date-dialog.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b66c8c564c044efe30ec2e7797a35e44987410b099101605a587c7d1455b701"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugins/apify/index.mjs: plugins/apify/index.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 11 (its worst body is index.normalizeItem at line 154), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent-inbox,apify): stamp the local clock, not UTC (#6212)\u201D; \u201Cfix(apify): write JD frontmatter with js-yaml instead of yamlEscape (#4961) (#5306)\u201D; \u201Cfix(plugins): pass the data root to plugins through ctx, so gmail and apify write under it (#5139)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- plugins/apify/index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/index.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bd1d2c70c651d86aa0afe942e281139f00c80fdc3cca7429f0b548892f2e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dashboard/internal/ui/screens/progress.go: dashboard/internal/ui/screens/progress.go 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 ProgressModel.renderFunnel at line 142), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dashboard): fit the pipeline to the terminal width (#6050)\u201D; \u201Cfix(dashboard): no average score in the headers when nothing is scored (#5885)\u201D; \u201Cfix(dashboard): 0.0% rates in red before the user has applied to anything (#4941)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \u002B00:00\u0027 --full-history --no-merges -- dashboard/internal/ui/screens/progress.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/progress.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9e2257f4dd95ffc8f774847e04b8b8ea5f8ba6ae5f73ec974275bbcd0a277"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: providers/hackernews.mjs: providers/hackernews.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 11 (its worst body is hackernews.parseHnComment at line 124), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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/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), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:56:52 \u002B00:00\u0027 --until=\u00272026-11-13 15:56:52 \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":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 10 significant file(s) lose their only recent owner: web/src/lib/analytics/view-model.mjs, web/src/lib/home/hero-state.mjs, web/src/components/analytics/funnel-rates.tsx, lib/outcome-types.mjs, web/src/lib/keyword-coverage.mjs, lib/ascii-fold.mjs, web/src/lib/quiet-companies.mjs, web/src/lib/core/ascii-fold.mjs (\u002B2 more). 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, 5 significant file(s) lose their only recent owner: providers/taleo.mjs, providers/prevueaps.mjs, providers/eploy.mjs, contact-lookup.mjs, providers/collage.mjs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6ac47f98d8ed124cdf94109435782cee9ac8faf0f5eb86566846d041b4776a4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: ats-payload.mjs, lib/syntax-check.mjs, lib/is-main-module.mjs, lib/node-floor.mjs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"142cdbe9e8f0be4d385cc517bdb38b819a4c4f4a7d5a0d741ff465590363fab4"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: 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":"Further sole-owners (lower concentration): 28 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 (56 single-owned of 706 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; 706 of the 960 production source files in this repository met that bar). They are anonymized user #5 (4 file(s)), anonymized user #6 (2 file(s)), anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (1 file(s)), anonymized user #10 (1 file(s)) (\u002B22 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/diagnose.ts, web/src/lib/apply/url-guard.mjs, web/src/lib/apply/fill-stream.mjs, web/src/app/pipeline/compare/page.tsx, providers/techinasia.mjs, providers/kalibrr.mjs, web/src/lib/cli-fencing.mjs, web/src/lib/bind-host.mjs (\u002B26 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. ADRs are expected here because \u0060dashboard/clipboard.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dashboard/clipboard.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5db8ced2b044fda3c28279b62229b69d9bb6bd3b0166b206fe5125d0f680c03"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022responded-before: a Rejected row only.\u0022 repeats the code it sits on: 4 of its 4 words (responded, rejected, row, only) are already in \u0060const respondedOnly = buildCompanyCards(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52e3b99e37be8a3e36a5b21f5e71e56ca236db5f0b3c19a78b7e79e0e3ec859"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Most-recently-listed first.\u0022 repeats the code it sits on: 3 of its 3 words (recently, listed, first) are already in \u0060assert(folded[0].name === \u0027Old Jane\u0027, \u0027most-recently-listed row comes first (reversed order)\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contact-lookup.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3557cfb97d367742b9df6c170eee9bb77a4f345d7f3ac120c3689dcdfb4dd7d6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 955, 966, 1040, 1097, 1103), for example \u0022parseCompanyInput\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1364c455c96b116fc72117da5e563457584fc8d53b1912f4e2e989691e70f1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022detectMimeType\u0022 repeats the code it sits on: 3 of its 3 words (detect, mime, type) are already in \u0060assert(detectMimeType(\u0027screenshot.png\u0027) === \u0027image/png\u0027, \u0027png detected\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"img-to-pdf.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ef4e462bf10213bb2dc912fec581b5681a62969cc1b24dab0e621c6cd4becd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022extractQuantifiedClaims\u0022 repeats the code it sits on: 3 of its 3 words (extract, quantified, claims) are already in \u0060const claims = extractQuantifiedClaims(\u0027I cut a recurring process from 8 hours to 2. Then reduced errors by 60%.\u0027, \u0027Test \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"negotiation-roi.mjs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d05c331fe3db9b65e7e0ce00c8e322d5babd800dbd94e2a54ffdf8cfc053e22"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Wait for results table or \u0022no results\u0022 message\u0022 repeats the code it sits on: 4 of its 5 words (wait, results, table, no) are already in \u0060await Promise.race([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-interamt.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdc2ba758b78d082aceeca555454b37d5434c035c08f26a869a292ead69d1f3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022shouldDedupScanHistoryRow tests\u0022 repeats the code it sits on: 5 of its 6 words (should, dedup, scan, history, row) are already in \u0060const activeCo = shouldDedupScanHistoryRow({ firstSeen: \u00272026-06-24\u0027, status: \u0027cooldown:CompanyA:2026-12-21\u0027 }, { today: \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":15682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43729fff62cf9e02b79e9937dc2395437ab8696f86309eba50d38cb0cb98d62"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A value may itself contain \u0027=\u0027 \u2014 only the FIRST one separates.\u0022 repeats the code it sits on: 4 of its 5 words (value, only, first, separates) are already in \u0060check(\u0027only the first = separates\u0027, flagValue([\u0027--file=a=b.md\u0027], \u0027--file\u0027), \u0027a=b.md\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cli-flags.test.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"753c438674e4bfc4c1536d94835868a5f6df3f44e27f3a2b9a698b8e7c149d9b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Absolute path already inside output/ is accepted as-is.\u0022 repeats the code it sits on: 5 of its 6 words (absolute, path, inside, output, accepted) are already in \u0060checkEqual(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cover-letter-output-path.test.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bcbe5acbc429730e8d0203458cbd24426d40976ad6b5a92aea3ee404110c37"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Window = 1: 1 day apart\u0022 repeats the code it sits on: 3 of its 3 words (window, day, apart) are already in \u0060eq(\u0027window=1, 1 day apart -\u003E flagged\u0027, detectReposts([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/detect-reposts.test.mjs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a05e01597c28b9cae73267148391bb11f684d9f79494b76afac2637fa09b11"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022URL with different fragments\u0022 repeats the code it sits on: 3 of its 3 words (url, different, fragments) are already in \u0060eq(\u0027URL with different fragments treated as different\u0027, detectReposts([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/detect-reposts.test.mjs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0792d042b579c3f8dbd75c0118c893f5fa65038610023f9b5b0ca449d6408f8e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022URL with query params\u0022 repeats the code it sits on: 3 of its 3 words (url, query, params) are already in \u0060eq(\u0027URL with different query params treated as different\u0027, detectReposts([\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/detect-reposts.test.mjs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c818f2009e746b081a69178729a5b4d10dae6e2852cbaf8a9bfcb506be24a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Shared with audit-portals\u0022 repeats the code it sits on: 3 of its 3 words (shared, audit, portals) are already in \u0060ok(\u0027threshold is shared with audit-portals\u0027, AUDIT_THRESHOLD === DEFAULT_SMALL_THRESHOLD);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/discover-ats-small-board.test.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a06cfdeb56f84970fa3c9e4ffdc01c977f415bcd3d0d3d02703895b807f9f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022renderPortalEntry\u0022 repeats the code it sits on: 3 of its 3 words (render, portal, entry) are already in \u0060const flagged = renderPortalEntry({ name: \u0027Personio\u0027, careers_url: \u0027https://personio.recruitee.com\u0027, provider: \u0027recruite \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/discover-ats-small-board.test.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"752d65181632b311ea016037568ad4c31527b7616540ec5087849cd3c63f7b06"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Workday entry rendering\u0022 repeats the code it sits on: 3 of its 3 words (workday, entry, rendering) are already in \u0060const wdRender = renderPortalEntry({ name: \u0027Nvidia\u0027, careers_url: \u0027https://nvidia.wd5.myworkdayjobs.com/NVIDIAExternalCa \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/discover-ats.test.mjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c769484f3895de373f636302d514722fc9fcaf08b0edbc34d0f26e6ddb2cce78"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022writeChangelog() is what --write-changelog calls.\u0022 repeats the code it sits on: 3 of its 3 words (write, changelog, calls) are already in \u0060writeFileSync(reg(head, \u0027CHANGELOG.md\u0027), \u0027\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/employers-registry.test.mjs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"790458c5146271f731c6112b480f3982f11b48064099df57e315c94cef55ed0e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022career-ops interview is the CV onboarding interview; debriefs come from interview/debrief.\u0022 repeats the code it sits on: 7 of its 8 words (career, ops, interview, cv, onboarding, debriefs, debrief) are already in \u0060check(\u0027Onboarding messages point to /career-ops interview/debrief, not the CV interview\u0027,\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/interview-redflag-practice-exclusion.test.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57149c5930b04094e7cb3134d960a51ef809aced55851bab1fc13d3b3c4f2af"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022classifyEmail phraseStrength \u0026 demoted phrases\u0022 repeats the code it sits on: 5 of its 6 words (classify, email, phrase, strength, phrases) are already in \u0060eq(\u0027a strong rejection phrase reports phraseStrength \u0022strong\u0022\u0027, classifyEmail(\u0027We are sorry to inform you that we have d \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/invite-match.test.mjs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1767fe6f839f2f03ecba626842b6469fe1e89f500c70fbe40dff079fd90c7140"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Formatted with thousands separator: 98,765\u0022 repeats the code it sits on: 5 of its 5 words (formatted, thousands, separator, 98, 765) are already in \u0060assert.throws(() =\u003E guard.assertSafe(\u0027amount: 98,765\u0027), PrivacyGuardError, \u0027thousands separator formatted number\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/privacy-guard.test.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea8ba5a875ea804fd0be75d97b701067efe1932ddf40f8723493a5ccfb51f19"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Company name in output preserves the first-seen casing.\u0022 repeats the code it sits on: 7 of its 7 words (company, name, output, preserves, first, seen, casing) are already in \u0060eq(\u0027output company name preserves first-seen casing\u0027, acmeSignal.company, \u0027Acme\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/process-quality.test.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ceb43c1b1ac0221b594d7025dc9eaf017f58173a515637b576c56f614c62a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Non-strings are coerced with String(), same as encodeURIComponent does.\u0022 repeats the code it sits on: 6 of its 7 words (strings, coerced, string, encode, uri, component) are already in \u0060eq(\u0027a number is String()-coerced\u0027, safeEncodeURIComponent(42), \u002742\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/_safe-url.test.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d829b4265713941d46e6b0d46dc8e14bc56178874b26aaf01b5884addf07e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022normalizeSpeedrunJob \u2014 full mapping.\u0022 repeats the code it sits on: 4 of its 5 words (normalize, speedrun, job, full) are already in \u0060const full = normalizeSpeedrunJob(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/a16z-speedrun-talent.test.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c788d77ffa1e6d12bf961e30413df468485c2193370dd1dda9de579ead3ee"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022company fallbacks: entry name, then \u0022Arbeitnow\u0022.\u0022 repeats the code it sits on: 4 of its 5 words (company, entry, name, arbeitnow) are already in \u0060const coFromEntry = normalizeArbeitnowJob({ title: \u0027T\u0027, url: \u0027https://www.arbeitnow.com/jobs/c1\u0027, company_name: \u0027\u0027 }, \u0027E \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/arbeitnow.test.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd53bd95127cc6f9289441fcb4a44fed35dbd4d9d277e579a22d4ed4cf7002d3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022detect() \u2014 the API URL and the embed-script URL both carry the siteId.\u0022 repeats the code it sits on: 7 of its 8 words (detect, api, url, embed, script, site, id) are already in \u0060const detectCases = [\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/clearcompany.test.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"28359e28ffca4eefb51e93098ff5b6f5f736ee956f1804a583ca212290ec6f5c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022resolveMaxPages()\u0022 repeats the code it sits on: 3 of its 3 words (resolve, max, pages) are already in \u0060if (\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/darwinbox.test.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"441b76ae9ba5f82e808e9fa5314a1be8b484efcc38cf7411a63baa4414629bdc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022company fallbacks: entry name, then \u0022Flowxtra\u0022.\u0022 repeats the code it sits on: 4 of its 5 words (company, entry, name, flowxtra) are already in \u0060const coFromEntry = normalizeFlowxtraJob({ title: \u0027T\u0027, urlJobApplay: \u0027https://flowxtra.com/apply/C1\u0027, name_company: \u0027\u0027 } \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/flowxtra.test.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"94705e5b9ad595c786be7817b0a10dec911e494e70962c443c5805ffca7153cc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022fetch() \u2014 stops when hasMore is false (single page)\u0022 repeats the code it sits on: 4 of its 5 words (fetch, false, single, page) are already in \u0060const singlePageCtx = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/glints.test.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"824531892d62ef9cd639cf6b1d56bc2f2ccf4e4550c30d16d2fe3b75925e3e9c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A full page of PAGE_SIZE distinct ids starting at \u0060start\u0060.\u0022 repeats the code it sits on: 6 of its 7 words (full, page, size, ids, starting, start) are already in \u0060const fullPageIds = (start) =\u003E Array.from({ length: PAGE_SIZE }, (_, i) =\u003E String(start \u002B i));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/google.test.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b8795c6c59abec0c83e0f5970ef1eb3181109242a5d8db6998090236b48e52"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 parseHomerunFeed \u2500\u2500\u0022 repeats the code it sits on: 3 of its 3 words (parse, homerun, feed) are already in \u0060const jobs = parseHomerunFeed(FEED, \u0027Acme Inc\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/homerun.test.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"56650d739c84e4341714d0cf6c128dd8107d77e9af3bd76f98e3e9e7f8bed111"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022parseJibeapplyResponse \u2014 empty input\u0022 repeats the code it sits on: 4 of its 5 words (parse, jibeapply, response, empty) are already in \u0060if (parseJibeapplyResponse({}, entry).length === 0) pass(\u0027parseJibeapplyResponse({}) \u2192 empty result\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/jibeapply.test.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"02310a4cc3b05c8cecf641ef294900fcd46a854171a1a26dcd6965dde2326637"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 parseJobBankConfig \u2500\u2500\u0022 repeats the code it sits on: 4 of its 4 words (parse, job, bank, config) are already in \u0060if (JSON.stringify(parseJobBankConfig({ jobbankca: { keywords: [\u0027 engineer \u0027, \u0027nurse\u0027, \u0027\u0027, 42] } }))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/jobbankca.test.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81adb8c3bf4c43eb9a4d855863d55648f91afa552f3d8de4935568367fa6d04"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 buildFeedUrl \u2500\u2500\u0022 repeats the code it sits on: 3 of its 3 words (build, feed, url) are already in \u0060const built = new URL(buildFeedUrl(\u0027backend developer\u0027, 2));\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/jobbankca.test.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d60e79eccdd2d87ec2ad8e398daa11f78cb6bf39b0026f96fa0a34d292eb0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022normalizeLandingJob \u2014 full mapping.\u0022 repeats the code it sits on: 4 of its 5 words (normalize, landing, job, full) are already in \u0060const full = normalizeLandingJob(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/landingjobs.test.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c117f45e1a9915f4a5d50687a6fe1ea6b98feb151a99a1a2672cae3642d6d9f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 parsePaylocityBoard() \u2500\u2500\u0022 repeats the code it sits on: 3 of its 3 words (parse, paylocity, board) are already in \u0060const jobs = parsePaylocityBoard(page(SAMPLE), \u0027ExampleCo\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/paylocity.test.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"46da7d062a1005cef3c8b3f3ed86153b0a97ab17800b4427e54f65c5b60cb2f7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022\u2500\u2500 parseRemoteJobs \u2500\u2500\u0022 repeats the code it sits on: 3 of its 3 words (parse, remote, jobs) are already in \u0060const jobs = parseRemoteJobs({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/remote-com.test.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab4472d1320056e92520ab295cce8cd8c924e9c89e07cd70623a304aa0ccbe"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022fetch() handles empty locations array\u0022 repeats the code it sits on: 4 of its 5 words (fetch, empty, locations, array) are already in \u0060if (fallback[0].location === \u0027\u0027) pass(\u0027solidjobs.fetch() returns empty string for empty locations array\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/solidjobs.test.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5ff8a8d16f8469f97613c15c9c903021a99a07195062031846e72493118671"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022normalizeHubJob \u2014 full mapping.\u0022 repeats the code it sits on: 4 of its 5 words (normalize, hub, job, full) are already in \u0060const full = normalizeHubJob(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/thehub.test.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1739e23755bc1a102dde60144f8a6029376f98c37137b64bd9ebcde43ce56e8b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022location assembled from locality/country, \u0022Remote\u0022 appended when isRemote.\u0022 repeats the code it sits on: 5 of its 6 words (location, assembled, locality, country, remote) are already in \u0060const assembled = normalizeHubJob({ title: \u0027R\u0027, id: \u0027r\u0027, location: { locality: \u0027Berlin\u0027, country: \u0027Germany\u0027 }, isRemote: \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/thehub.test.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e120313444b0c4f771d349beb817a3fcd6a4671a34dd7912221c84a610cf69"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022company fallbacks: entry name, then \u0022The Hub\u0022.\u0022 repeats the code it sits on: 4 of its 5 words (company, entry, name, hub) are already in \u0060const coEntry = normalizeHubJob({ title: \u0027T\u0027, id: \u0027c1\u0027, company: {} }, \u0027Entry Name\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/thehub.test.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b50e9df62514aa009912abe3ce165db587bd9d18570fbb9d4db9ed6a2846b1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Unknown-language row resolved by title.\u0022 repeats the code it sits on: 4 of its 5 words (unknown, language, row, title) are already in \u0060check(\u0027unknown-language row titled like the German version: German is a duplicate\u0027,\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-dedup-url-language.test.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3d8c2c2e01a27ce6580b8d0af452553111268863de0b2f52fd3ea10a377229"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022The other rows a skipped_dup row can restate.\u0022 repeats the code it sits on: 4 of its 5 words (rows, skipped, dup, row) are already in \u0060check(\u0027an aged skipped_expired row takes its repeat with it\u0027, [row(AGED, \u0027skipped_expired\u0027), dup(\u00272026-08-06\u0027)], RELEASE \u2026\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-recheck-policy-siblings.test.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4282f164a8ffabc97a0fb5c9f47fa6f5952002fa1ea701bd400329b9927b6497"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 6 comments in this file only repeat the code they sit on (lines 155, 163, 179, 192, 205, 213), for example \u0022\u2500\u2500 markTrackerReady \u2500\u2500\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/pdf-render.test.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d44a07392f31eb281a80f18ed83cd4a3c985729640272face3a1ae0a082488a"}},{"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 (191763 LoC, 456 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":"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":"f3dabb8d5bd384e55194c561e4f3bf973af21f6e363e7cb2da51e3510725a4d6"},"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":"d6d829e040b45702c37b55f7f97434993572560635f54524fac6eebb67060673"},"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":"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":"b5e888d68457b46a3b4d1111bfc9ad7a6b2aac866a749182bb7c8be8d7566e26"},"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":"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":"5b36e3474c59d04c768f67ee7e07898c8fb803a7bf4cf3b9da3063b49ebb2c6e"},"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":"cd9ac11f68ecad114ec100ce3a06a9e5539ed10914adbdc5289fb5a7e2f395c4"},"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":"0844d077f10dcc3cfe22f4cd183f46e4ed28c83162ea87b41d745e1843538f58"},"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":"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":"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":"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":"83677741235b5116f54e7053fa391759e8a82cd43ab387cb1df8c18282e8bca1"},"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":"c0b3426f9d37f99677a5594b70d8eb9e366e4c6c014907468f74f8c099d8ac8c"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a4872e718b4b7d260f8ea6d50846826df434611a6c1bc486f9ba321686fada1f"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fe087e5b87eea0de6c68208c10988f660b3de4e3320b287cd61ce86dfeab12d8"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1a879ce0b8950fca4fd7dc4abe9380a605b863eef9c317db8d8d1ba0f7761b20"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"803e28e13ccfee5cae00d7ad0959a0815849cdfeb12229c6d0ee37b77721c8a3"},"taxa":[{"id":"CWE-457","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"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":"c84a4854f927cb42258fc27937cd4cba1a701d707195de66c663365b1e9cf71f"},"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":"3d06d94b485edb2858c9254ae00968fd68b97f3bed93ba572ca558eba7133baf"},"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":"fc5c2a1cacc9797d3cf9e7f176774d1cbb807b99fe8fd664cccdaeac7e1c0e14"},"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":"de2b0edf50923ad22ce81a85ece02ee66bbb64dc5e7efcdbb5d280fd89a58dc4"},"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":"06b84cd655d0a9b43ea86904cb3fd6dbce84c45c8a908373d2457b10f9f32189"},"taxa":[{"id":"CWE-209","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":"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":"e13ac6b473d4956dc3588a1399501d073a5f1ba7c9792b1d716964dde48dc496"},"taxa":[{"id":"CWE-209","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":"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":"958d745905972ae1d29fd3bdd7449a1f60a72b35a686bef5166307315d3d4834"},"taxa":[{"id":"CWE-209","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":"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":"feb551963c166cd79fd64d6acce4b81cb521272ce8062d2f17655ce36d392c01"},"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":"568b7eb33d5b112bd52c6e7ac4976849a855a2a9eb728d1a3ccf5092f6b86109"},"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":"b71b6f70e6d3ead8a7aef720cfee505d6d2ff9578df1ad476d49f0ae400334ed"},"taxa":[{"id":"CWE-209","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":"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":"f9f58644fadf62d40c5e36e6992385160329baff5bbdb46de6c110511ac9dbd5"},"taxa":[{"id":"CWE-209","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":"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":"9e9f459200c16911da16730f49695ddc1d3648dca901a95077b6fa54c15b8702"},"taxa":[{"id":"CWE-209","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":"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":"06b65c2bdbd001873d7319dc7fd67a1d8798635467071757f34ccc5fe9a5b3a8"},"taxa":[{"id":"CWE-209","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":"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":"050d5d6aa2a6caa0ff6f47649c1554d0dda57ffb65b68fd471e2bb598a3a6d08"},"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":"58962c337120fca45aceeb9c9c5292d90b40c6ec582bff968f91b06268cd60bb"},"taxa":[{"id":"CWE-209","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":"8c6afada67889d9fcb382106abe5a15f37b973f2a7ea84d7c0add0ff2d23f9e5"},"taxa":[{"id":"CWE-209","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":"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":"8733291f8132d6672d4d966b1f07f5b702a11e2bf9f03ffde0f4ca34e186f690"},"taxa":[{"id":"CWE-209","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":"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":"111afac3ae232ee99d17f6374e3a973334298066e8ddc4e73ec9e7c14d30e20d"},"taxa":[{"id":"CWE-209","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":"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":"b0499fc254c6a482c778e269acb72970922d916b56c5c72cdd374108b10f17c7"},"taxa":[{"id":"CWE-209","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":"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":"c0f61c5cca15655aa5e412c2cf27f65f15291807cd67c3bbfce1f254522dee01"},"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":"389ff0ee0b3ffdf3d618c03e45840e1fa60bf11c068d70b04a5ab5043b897dc5"},"taxa":[{"id":"CWE-209","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":"a8593c04ea85feba0ad3eff975a4ec5937c8538c69b4b0f3b3726114873226b0"},"taxa":[{"id":"CWE-209","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":"68be9db04cdb837f33c163a88785063f2f0b50a7935c487a696c83b41e806fb1"},"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":"5b5b3ffdb58754475013fe08a3ec32451257a6a3e9170644abe3ff49a6963df7"},"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":"9da7aeefc0b289c293c5976c17d67fee92103c49b51a22b339045eda7f049ce2"},"taxa":[{"id":"CWE-209","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":"7b9cdc411c42ded163af3a64ddac1f50948100d44f64405d5ae19b8c6402b322"},"taxa":[{"id":"CWE-209","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":"76ac2b75aaf8a8056dd0ca38c182eca40b2f97e80e711f5a4f7d3e4129c3aa6d"},"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":"31fa196bf5f57a345998daa4faca85036bc525a85be45e8535fc47c440a06f08"},"taxa":[{"id":"CWE-209","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":"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":"dd6096e7cf56cc257b215675ee2cff9cf9a28e13e05d7de5a1e82ad61b978bad"},"taxa":[{"id":"CWE-209","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":"21fd0c0cac5392875edfc3b371fe13f2a9043ca7ccc7390c750736db7a0e6f9d"},"taxa":[{"id":"CWE-209","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":"42d1faff8c0075acc73d9fe749da5062dee873247d9225a517de8e56e67b7893"},"taxa":[{"id":"CWE-209","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":"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":"33ed3bfbc43b97ad2df674dc2644f5ff1743c57891c185fb8246e33a08b47e27"},"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 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 13 shared commits counted here, the most recent 3 are \u0060fc3034f6\u0060 fix(web): render dashboard CVs on the profile\u0027s page_format (#6839); \u0060e56ab083\u0060 fix(web): read script-rendered JDs before the evaluate worker starts \u2026; \u00608ed548b9\u0060 fix(web): show evaluation stops as unscored review outcomes (#6496) \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 (16 of the 28 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 16 shared commits counted here, the most recent 3 are \u00603bb9fde1\u0060 feat(scan): read workplaceType from Ashby/Lever and add opt-in workpl\u2026; \u00601374f8ab\u0060 fix(startup-jobs): stop passing the feed\u0027s teaser as the job descript\u2026; \u0060d62f7d5f\u0060 fix(scan): read the CryptocurrencyJobs teaser\u0027s eligibility clause (#\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":"D35","level":"warning","message":{"text":"Change coupling: ashby.mjs \u2194 lever.mjs: \u0060providers/ashby.mjs\u0060 and \u0060providers/lever.mjs\u0060 change together 53% of the time (9 of the 17 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u00603bb9fde1\u0060 feat(scan): read workplaceType from Ashby/Lever and add opt-in workpl\u2026; \u00607800e14f\u0060 fix(providers): throw on a greenhouse, ashby or lever response that i\u2026; \u0060580e1fd7\u0060 fix(verify-portals): probe Lever and Ashby boards with their provider\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92ae0825800686581a188ca21ae9dfc8eedae0010811152aa9f726a1e7a9ee4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: scan-ats-full.mjs \u2194 scan-interamt.mjs: \u0060scan-ats-full.mjs\u0060 and \u0060scan-interamt.mjs\u0060 change together 50% of the time (5 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060052ab808\u0060 feat(browser): share the Chromium executable override across every la\u2026; \u0060339ee57e\u0060 feat(scan): one machine-findable marker line above every scan summary\u2026; \u00607d7b0f97\u0060 fix(scan): resolve scanner user data against the data root, not the c\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6378b0095ff258c28e3f5f8cb4fd8dd2e44760b3b14e07125d110f7742554825"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: scan-ats-full.mjs \u2194 scan-dayforce.mjs: \u0060scan-ats-full.mjs\u0060 and \u0060scan-dayforce.mjs\u0060 change together 50% of the time (5 of the 10 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060a38e9534\u0060 fix(scan): apply scan_history.recheck_after_days in the admission gat\u2026; \u0060a0e4f0af\u0060 fix(dedup): keep one row for one posting (#6602); \u0060adeb8002\u0060 feat(scan): content_filter min_match and rescue_title_misses (#6020) \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e06e33f998f0f4186eb68a9f8197bd6d68979dcb33327c26725ac1e731ed20"}},{"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":45}}}],"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":111}}}],"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":111}}}],"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":222}}}],"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":244}}}],"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":248}}}],"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":271}}}],"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/cv-ingest.tsx"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ba3f069b26261ca29a2c854ecd3f4d6bcb040575797e1e3cff4e5887b5cbb1"}},{"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":133}}}],"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":219}}}],"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":"\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/linkedin-paste.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4c4a7e4b22a73363ea10c8f4d1e25f32c0dd8e363c091d865338c83c5f8d51"}},{"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":288}}}],"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":66}}}],"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":80}}}],"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":81}}}],"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":94}}}],"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":95}}}],"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":107}}}],"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":109}}}],"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":116}}}],"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":90}}}],"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":104}}}],"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":105}}}],"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":118}}}],"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":119}}}],"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":130}}}],"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":132}}}],"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":139}}}],"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":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2cc6f6b33ab96bc625beee2e728f4532d8a86a0448aebe5106f715feb97f3e"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-checklist.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea78cfcada9ed83a20a8f4752801949054effc15c689db4d379ebc74cbb54e6"}},{"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":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d4fbac5d4ec65b855a29e0a1c0166c5cab57d5d18fc00cc39c743483968e27"}},{"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":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d945cb3ab5f0afb736f4daa1feea8281acd2b1ecd862e103dd7a9f4a71590b1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060.project-badge\u0060 sets color: hsl(187 74% 32%) on background-color: hsl(187, 40%, 95%) \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/cv-template.html"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67da332c94bc467bec179f638f1a22683fa37d818f5bacc6c5cdf119a187066"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060.project-badge\u0060 sets color: hsl(187, 74%, 32%) on background-color: hsl(187, 40%, 95%) \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/cv-template.zh-minimal.html"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91882420601169fb5d5581e04282b363ce83a07a7d98a85800101920e5959c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060.project-badge\u0060 sets color: hsl(187, 74%, 32%) on background-color: hsl(187, 40%, 95%) \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"templates/resume-template.html"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"311ed84cffde1416469f510f182846641703719115b52a9328fe349f85cabf39"}},{"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":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"123c137746a60f8ccaca3f4953f55fa071af1a55107e79a02f9cefbaf2c3fda6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (2.1:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa94fd91c5df6c3f876fb013bc4a3985c4bab40f7d9a847a44c5e0a514885d7"}},{"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":503}}}],"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/command-palette.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bc6160f708681aa2256e3a2f957a8934824c7d612fc87959e494867fb0e5b8"}},{"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":248}}}],"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-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":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aede1107c7f857d88b8652b992153a7c79c7350c124464824db791b2b61c134"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast Tailwind colour pair (3.8:1): This element\u0027s Tailwind text/background colour utilities fall below the 4.5:1 WCAG AA minimum for normal text. Pick a darker or lighter shade."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/delete-from-tracker.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9886b3ef124c261a3f5a0d488ab44962a7b00ad09198ba6b7e62a89b93d3fbe0"}},{"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/pipeline-view.tsx"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a1c48bf1474dba56936ef0699693576006f0a50576f96c0b6d997f0400c7b2"}},{"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":288}}}],"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":95}}}],"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":109}}}],"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":116}}}],"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":119}}}],"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":132}}}],"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":139}}}],"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":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff547827e0d4b320e32b67010742ab3c94e719c28c2fc9f9197a51572ed4babd"}},{"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":972}}}],"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":1273}}}],"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":975}}}],"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":454}}}],"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":505}}}],"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":625}}}],"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":912}}}],"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":395}}}],"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 960 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":286}}}],"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":431}}}],"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":508}}}],"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":509}}}],"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":538}}}],"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":548}}}],"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":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80d72d5996f500f35c5ecabc745f2ebed415d3adbc219dd31ad04ddf407f47"}},{"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":610}}}],"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":615}}}],"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":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5bf71a401d9160a70a597fd78956c5262e28cbf348b6bfda5211ee8ba8e87b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060coverLetterVoiceNotes\u0060 blocks the event loop until it finishes \u2014 a 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":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3402bb06a81a7f2a730de0f91c91aa73dc31f0f34c264aaf02b0fb4543981d3b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060coverLetterVoiceNotes\u0060 blocks the event loop until it finishes \u2014 a 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":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe486c52233f4419d68d8453c915292634089a7df6f049f7531a1e9a2dccc9"}},{"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":650}}}],"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":655}}}],"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":679}}}],"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":679}}}],"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":1723}}}],"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":1730}}}],"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":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe200d12dd50aaf1c58434b327c83b4f1058280ac705d3ebf7b7d0ba361690"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060runFactGate\u0060 blocks the event loop until it finishes \u2014 a 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":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3dcea0b0d51d5358efb0cca4d8ac042796d85055716b52c77f9f5381bf147d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060runFactGate\u0060 blocks the event loop until it finishes \u2014 a 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":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d55007ca1d2c11504f5373864e6450bfd30af750e9f95161bddacee13d85e2"}},{"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":2365}}}],"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":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e164c0884dc160cf7e094d714438302ebf30b657104192d50aca25a257abcbf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\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":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"801380ae4d90534b2c93ffce36254759b75e6d475aee1e3dd603097673faee20"}},{"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":235}}}],"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":240}}}],"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":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"3333f3152f868c001b5ea3a0a1cfe8958e3bf9ec29a55daa5fce85f5f26c142f"}},{"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":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1887bd6a205262568c98c40e5dfcc326b0f2428ac9c653a95d25b9545958c0"}},{"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":325}}}],"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":329}}}],"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":432}}}],"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":444}}}],"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":451}}}],"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":936}}}],"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":937}}}],"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":1248}}}],"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":1249}}}],"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":1249}}}],"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":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8762d1769dc276d4bcfd5037a2125f9f942b814e1bd2652a3d5913c9b234d6"}},{"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: \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":641}}}],"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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"2183fc67df05784a3cd8deb8342f79f876dbdb8c05fe8cde7bee5882500ac801"}},{"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":25}}}],"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.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":114}}}],"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":116}}}],"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":15}}}],"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":68}}}],"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":101}}}],"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":166}}}],"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":369}}}],"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":370}}}],"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.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":98}}}],"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":164}}}],"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":168}}}],"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":180}}}],"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":18}}}],"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":43}}}],"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":27}}}],"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":22}}}],"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":25}}}],"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":28}}}],"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":84}}}],"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":86}}}],"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":96}}}],"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":22}}}],"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":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8982e1c53abc7e1d3d4af5687012832ded673895eea60a4644909686d617aa"}},{"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":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2471c3a36dc309e635c115d0942d5a9e3be6ef4416c4a6a1ba6e9b0d36c8fb"}},{"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":109}}}],"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":110}}}],"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":111}}}],"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":112}}}],"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":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba1b93738de2e855197e7c46f1f1e49d15b40c765ac31678021951c4c780ac3"}},{"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":41}}}],"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":68}}}],"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":26}}}],"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.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/templates/default/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd09fcb4a667a0d4e753e5faf64de8c76f76932d7d69f7277d3e25f7433dcba5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to renameTemplateAndFollow\u0060 blocks the event loop until it finishes \u2014 a 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/templates/rename/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fc141f6180e45ace1584a7dcabf9029ea4270fbc022e0f44db9366e6fb1ff7"}},{"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":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"619684cf1bb05cb528f15009c33251fcde1ec1e0bcedacae310eec1fb02bad83"}},{"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":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf2651628c8b749f205700c13be91a5b60990eebb38f3df747bb9af35ab94bd"}},{"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":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b618552a78cbaa7c193b8ed7db040ea915c5700b9c5c19b5dcce56410cdc57"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to tailoredResumeText\u0060 blocks the event loop until it finishes \u2014 a 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":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"afda9d7f40613c4f3c4e364ac844164954c73dcb2a46ede5228002f8da8ed9f9"}},{"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":63}}}],"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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a804cd95913d0deba347e81a31c1df5b72bbe82d75d54e280ad4df2ccc463"}},{"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.existsSync\u0060 in \u0060resolvePdfIndexPath\u0060 blocks the event loop until it finishes \u2014 a 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/pdf-index.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd5fa96e9ca6b2f9472095df0663087317be85e33d458cb6c71dbfd8a0b104e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060loadWorkplacePolicy\u0060 blocks the event loop until it finishes \u2014 a 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/workplace-policy.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c5ce24223c668e38336a5ceb98caa95fd22080e97d7a4160732097d0cad3dc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readdirSync\u0060 in \u0060locateTailoredPdf\u0060 blocks the event loop until it finishes \u2014 a 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-pdf-file.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bafe1bb7e523673e5e100d7c1857668d9e532075bdd2e3fc4dc3b28fe15608a"}},{"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":71}}}],"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":102}}}],"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":106}}}],"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":113}}}],"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":141}}}],"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":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8b2ac4c97e201c7dee77cbd7e3dda347c44343e5f608d94d5c63b9706c1992"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060unsupportedRewriteClaims\u0060 blocks the event loop until it finishes \u2014 a 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":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c52ed1a425994312b3bc06a2aa1a13208cf605d287be176ef318a75a13e8869"}},{"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":214}}}],"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":214}}}],"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":223}}}],"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":206}}}],"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":215}}}],"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":220}}}],"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":232}}}],"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":337}}}],"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":"R1","level":"warning","message":{"text":"Type Safety: 256 typed \u00B7 2289 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 (\u002B2283 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 22 sibling directories (37 clone groups): 37 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 34 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 37 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 37 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 37 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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d153e94567224f9788f257c70f929f7d401259a4aa50031061df8e38ee275"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 7 sibling directories (18 clone groups): 18 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 13 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 18 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 18 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 18 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":"Duplication concentrated across 3 sibling directories (18 clone groups): 18 duplicated blocks under web/src/ have copies in at least two of the sibling directories app, components, lib \u2014 8 of them are reported below, and 10 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 18 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 18 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 18 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/documents/page.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea5fee464bd91e114df7f7a1d888df3478119654a2cb20dbdc0b7ea499f1aa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (13 clone groups): 13 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 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 13 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 13 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 13 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":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e19a44f1411e23386d23b85c61eea57e91eaa3ddcadd15839625512f54d07c"}},{"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 (239 matched lines \u00D7 2 locations): ollama-eval.mjs:47 \u00B7 openai-eval.mjs:54 \u2014 the two spans are one implementation copied and then locally edited \u2014 1799 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":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf91ef8959a221c9afac34296f526268221fba3426185c2b4fa73e1a998546"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (181 identical lines \u00D7 2 files): lib/inbox-rank.mjs:18 \u00B7 web/src/lib/core/inbox-rank.mjs:18 \u2014 these 2 files are line-for-line copies of one another \u2014 181 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/inbox-rank.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b827adc83c4a34470e869f2bb3c4e0bc0975a95ac04aee4c64b92f6841ce1f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (144 matched lines \u00D7 2 locations): url-key.mjs:262 \u00B7 web/src/lib/core/url-key.mjs:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 1311 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":"url-key.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5cfd341e2bb83ad6f9b76c2298e615ff4d998b1f3f31291e1bae231a6f44d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (116 matched lines \u00D7 2 locations): web/src/components/scheduled-scans/create-job-modal.tsx:17 \u00B7 web/src/components/scheduled-scans/edit-job-modal.tsx:19 \u2014 the two spans are one implementation copied and then locally edited \u2014 747 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":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd3be6dd50cd72d8f35748f05beea0ff6ed21e3239b3f38f55fc8b53f95ee8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (103 matched lines \u00D7 2 locations): providers/jobbankca.mjs:53 \u00B7 providers/platsbanken.mjs:73 \u2014 the two spans are one implementation copied and then locally edited \u2014 634 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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c9472f71172d18fdce7634d5e0c1b4147b53985c37a747701345d6deec49f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (101 matched lines \u00D7 2 locations): providers/polymer.mjs:66 \u00B7 providers/trakstar.mjs:61 \u2014 the two spans are one implementation copied and then locally edited \u2014 846 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/polymer.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef938d1da0cc7d7b97366aaa334de723a96611a09c52bf6676f12837ddbc91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (96 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 685 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":"7078af5084b52dfc1bd2b657b9cbc97ba6b373d4c5695b83367d20411e6fdad7"}},{"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 825 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":"0cdd8af4305babc8a01afe7502daedec14ffbc85aff2151f0e64b76ff83edaa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (94 matched lines \u00D7 2 locations): providers/clearcompany.mjs:43 \u00B7 providers/polymer.mjs:31 \u2014 the two spans are one implementation copied and then locally edited \u2014 740 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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"928725347116586f018a239928b510667cd0f10f93fabc7b4cedfff561ec1ac4"}},{"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:46 \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":"3f94906bdf2594be524e502d21102197212392976fbc0cb50d3ab8a08b4064c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (78 matched lines \u00D7 2 locations): providers/adp-workforcenow.mjs:359 \u00B7 providers/ultipro.mjs:337 \u2014 the two spans are one implementation copied and then locally edited \u2014 638 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/adp-workforcenow.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec87ebf73c67300da8218574b43b5444952a6591667fa941870323a81090bcc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (74 lines \u00D7 2 locations): providers/nodesk.mjs:12 \u00B7 providers/weworkremotely.mjs:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/nodesk.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27d326d6115721f27b33ada0a3e1bdc3f04ce087a9999a23718dba8516fecf4"}},{"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 (71 matched lines \u00D7 2 locations): providers/a16z-speedrun-talent.mjs:27 \u00B7 providers/arbeitnow.mjs:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 550 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/a16z-speedrun-talent.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0e4db69dbf424de02c83df5a9d21d482151746b93f0e00f2727ed3ff5f9d45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): providers/darwinbox.mjs:19 \u00B7 providers/turbohire.mjs:45 \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/darwinbox.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a0e213f5645d0e51dfefa4a551a4fbbe88684ed5d6d1a56cfff5c57f540ffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (54 matched lines \u00D7 2 locations): web/src/app/api/assistant/route.ts:138 \u00B7 web/src/app/api/explore/ai/route.ts:192 \u2014 the two spans are one implementation copied and then locally edited \u2014 339 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":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff68636fce80fa58bc5f70c52636fa4876d6991c937e345fd30675b8d99c01c"}},{"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 (51 lines \u00D7 2 locations): lib/score-action.mjs:10 \u00B7 web/src/lib/core/score-action.mjs:10 \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/score-action.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed583bf514f15b20532ef40f4411ab22f324270d0825451337222a5766ee4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): providers/careerviet.mjs:53 \u00B7 providers/itviec.mjs:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 373 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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"144cdae7324d8dffe98dfe9f00f1d8755e67e82744b63dca922b247d397f4df8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): scan-interamt.mjs:308 \u00B7 scan-topdev.mjs:553 \u2014 the two spans are one implementation copied and then locally edited \u2014 416 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-interamt.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcd6f74e457f972aa42a93fb27e84d3955eb6a27f7643566929134f978dd125"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): build-cv-html.mjs:1539 \u00B7 build-cv-latex.mjs:434 \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":1539}}}],"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 (46 lines \u00D7 3 locations): providers/careerviet.mjs:243 \u00B7 providers/itviec.mjs:207 \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":243}}}],"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:13 \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 (45 matched lines \u00D7 2 locations): providers/neogov.mjs:29 \u00B7 providers/schoolspring.mjs:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 297 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":"b8fe8ad8daa238e27d677d69ba25d87b203b3d54803462f2f6167de5b7b22bdf"}},{"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 (42 matched lines \u00D7 2 locations): providers/higheredjobs.mjs:66 \u00B7 providers/weworkremotely.mjs:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 362 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/higheredjobs.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e04afdee9b66b3ce5fb50f467aa22e0d7cb405381c1e4ffb3623b21b1b2817e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): gemini-eval.mjs:283 \u00B7 openai-eval.mjs:178 \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":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1c93e1826ec25e4f4eb2dce9645305189b803902a96aa7739ee3b54f39ed54"}},{"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:254 \u00B7 build-cv-latex.mjs:551 \u2014 the two spans are one implementation copied and then locally edited \u2014 335 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":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2c460b0f39706537b71ad33b73cf3a8a0262512a6ceb7bb1c01155f82614a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): ics-interview.mjs:579 \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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede22c0d201f0e2dfa2461aad692e590c2d7397b1c524c7b10c39428b5f03e4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): analyze-patterns.mjs:846 \u00B7 upskill.mjs:719 \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":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b44e84e4092802281e3fb7e3617cc82a51249d2c02c1edb1928c7739ae022f7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): company-funded.mjs:232 \u00B7 sync-batch-input.mjs:85 \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":232}}}],"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 263 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":"cdd3687c1b462ccf30958985e05ed586015a1fa6e80eb422c3e098fb5aa10b83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): scan-dayforce.mjs:711 \u00B7 scan-interamt.mjs:361 \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":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c107bdb4cd05792c639800bb313e011d35074cc2b7c17074fa6b6aac6bd55d95"}},{"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): providers/remoteok.mjs:15 \u00B7 providers/workingnomads.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/remoteok.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"55165d4128890b73809bcc6ca8f2b7a0905cb755e7742669c7e568bb2902b3be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): test-all.mjs:15339 \u00B7 test-all.mjs:15396 \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":15339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3fa31068dcf636048c5ec412ba2f4ab668f20c4f0f8a1fa6586012c245dc08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (32 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 244 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":"11507f5a74eaa13ba6660ea1862924b38d9377c78403563231367aa180cc8462"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): providers/darwinbox.mjs:115 \u00B7 providers/keka.mjs:127 \u2014 the two spans are one implementation copied and then locally edited \u2014 228 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/darwinbox.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6651e8d69661f64622aef6b4c4e30365a063ec263c39d328a9fdc9be72c8737f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): providers/eploy.mjs:146 \u00B7 providers/sitemap.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/eploy.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2328d0c690c14787f72161373c084062ea25f48a8c56c880265e28e2b88e824"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): openrouter-runner.mjs:417 \u00B7 openrouter-runner.mjs:483 \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":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dd2dbf03d35656447044f7eb4eb8c3ead30dee1d45053234c1a594fed1f35b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): providers/breezy.mjs:61 \u00B7 providers/prevueaps.mjs:152 \u2014 the two spans are one implementation copied and then locally edited \u2014 207 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":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4757b11eb37307b79d5c30bbfa01dd155f9d5274575acfd2a03be6eee123d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): web/src/app/api/assistant/route.ts:91 \u00B7 web/src/app/api/cv/ingest/route.ts:136 \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":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"631c59f092bb6ece627946e4b0fa67605c1a77fe5155684d4210ef49c49af13d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): generate-pdf.mjs:282 \u00B7 web/src/lib/cv-studio/preview-html.mjs:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 249 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":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"037737d67013e31a37bce41fc82f0739995ad42389ed7934b9b1f391e7f02186"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): openai-eval.mjs:345 \u00B7 openai-tailor.mjs:251 \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":"openai-eval.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad908830175c2b04621d94c8858835bb07ed86ebf9aeacd3ea91b39c0a8abcc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): web/src/components/app-shell.tsx:45 \u00B7 web/src/components/mobile-nav.tsx:164 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/app-shell.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9f37ca0ce32892750164e97a063ce220c98bd55ee9752100698791ebc57a6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): lib/machine-summary-section.mjs:36 \u00B7 web/src/lib/machine-summary-section.mjs:36 \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/machine-summary-section.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb2436354cebd3dbca0c2dd4ea9e21f6ba83f4958c339129c958b0b552e12dc"}},{"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:187 \u00B7 providers/vdab.mjs:265 \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":187}}}],"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:148 \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":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ecd2a107013c3d719c44e44bfd9c511b59c84352aa613578de9b65a83ab6d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): web/src/components/followups/log-dialog.tsx:65 \u00B7 web/src/components/followups/next-date-dialog.tsx:57 \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":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"27074ae1b91c23c4bd060ec28baa663f76ba62c96265f0c0989f621ac52ee00a"}},{"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 with local edits (25 matched lines \u00D7 2 locations): providers/thehub.mjs:85 \u00B7 providers/themuse.mjs:108 \u2014 the two spans are one implementation copied and then locally edited \u2014 195 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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"71803d8ba3e7eec4620bdab4345e870a673620bc11164a4d65d9e932918cfebf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): build-cv-html.mjs:1051 \u00B7 build-cv-html.mjs:1142 \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":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f17bcc7fdca89140636b69daaffa5d41bf4f5be0bd2c88d2d687644e1a29742"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): build-cv-html.mjs:1472 \u00B7 build-cv-latex.mjs:386 \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":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9637a5f2a7c95388ecefa68781754b55f82b83740f11c6773feb35d922f55712"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): check-jd-archive.mjs:706 \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":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a231c12970bf878e62eb7bcae396ea3340b321ca44b6aa308108aac17b21d34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): providers/a16z-speedrun-talent.mjs:74 \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":74}}}],"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:119 \u00B7 web/src/components/apply/apply-provider.tsx:270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f99b5d46eca0cb25772db10acd30ab447795c591c21545026f96d918a85216"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): providers/arbeitnow.mjs:46 \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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"082c978e5e66589c57f4aa32d0d9a5f348e0e100a5e1fdaaaba8312f1bd067e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): analyze-patterns.mjs:948 \u00B7 upskill.mjs:63 \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":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"102704ba968195ed23708a6dbf0fc2816a3ec359110109b66c5ab97d3992c851"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (20 matched lines \u00D7 2 locations): keyword-match.mjs:841 \u00B7 test-all.mjs:16036 \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":841}}}],"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 with local edits (20 matched lines \u00D7 2 locations): web/src/components/apply-view.tsx:59 \u00B7 web/src/components/apply-view.tsx:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 111 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/apply-view.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3fc62f12f92a41c7adae55562046fb2e25703d59043cd6d627413a2f6402e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): generate-pdf.mjs:1010 \u00B7 generate-pdf.mjs:1090 \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":1010}}}],"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: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":"providers/4dayweek.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d75bdcd5e647be6ddef5f0d0ba87a91c11e2b3031ef944e97a4238c15ed5ee1"}},{"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:13313 \u00B7 test-all.mjs:13390 \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":13313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d705d74f2569c6c43dec64b8db0d8ec27571aa28132325353322589176c71ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): verify-cv-facts.mjs:3613 \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":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"18875e641aaa7951ae684b0f5fca260bbd98423b19698d69b6d7d50b3969e243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): web/src/lib/core/aggregator-id.ts:34 \u00B7 web/src/lib/core/pdf-index.ts:42 \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":"web/src/lib/core/aggregator-id.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eb2e69badddb5b12419ab61e74a58e20e11e089af5349b194cf4fabbe08950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): generate-pdf.mjs:2050 \u00B7 img-to-pdf.mjs:228 \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":"generate-pdf.mjs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9252a3e0ca2e778ba1911b24375f7d81a330e94fa88027ef9d60e1edfa59a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): merge-tracker.mjs:75 \u00B7 reserve-report-num.mjs:88 \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":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa7bb7fd38d0cb894cdde159f434ab8dfdfac41b74774eb9d64ebeb826c679f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): providers/pythonorg.mjs:49 \u00B7 providers/teamtailor.mjs:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 133 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/pythonorg.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78cc18a7dbb5ea8eac583452cade1627eb0d6c43dd9f586f2e0ba444074b20b"}},{"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:185 \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): test-all.mjs:12997 \u00B7 test-all.mjs:13021 \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":12997}}}],"partialFingerprints":{"codehealthFindingId/v1":"422705fea9f46f9755cb3f3c18bc52d97c10c1c7421caa66bdde70f9dc5fde87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): test-all.mjs:19066 \u00B7 test-all.mjs:19178 \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":19066}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d2e08ca81272a516d893cb5d51bff8f6a0fddf9527fe27fe78a56fb4f56180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): upgrade-tests.mjs:482 \u00B7 upgrade-tests.mjs:570 \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":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b79b697b50bd34e6d03f873617f675dc827ab64017f237e327d9a621ca6216"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): web/src/app/api/assistant/route.ts:161 \u00B7 web/src/app/api/cv/ingest/route.ts:196 \u00B7 web/src/app/api/explore/ai/route.ts:269 \u2014 the 3 copies are spread across 3 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. 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":"web/src/app/api/assistant/route.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e9134c2756cb1645ee1eb2269672e269df6534b7efc3cad33eed88b2ced4b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): web/src/app/api/patterns/route.ts:6 \u00B7 web/src/app/api/stats/route.ts:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 208 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/patterns/route.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9932db95af18a685a5b5ee17ea18d6962ec3c53d492742a5a50f78ddd2675600"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): detect-reposts.mjs:702 \u00B7 tracker-sync-check.mjs:515 \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":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"01036134feaa757eac32121b8c57e71781631e23c757615faad9b6af1f6804c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): generate-pdf.mjs:1515 \u00B7 tracker-utils.mjs:506 \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":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c628c16009dd49c273a09e8e2f8d115414c44509b24c8b69031e42c5aa0529"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): intake.mjs:267 \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":267}}}],"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:142 \u00B7 providers/gupy.mjs:347 \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":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684cd24e06620b78bfb103c8f9e905a830b4b06c0a6856c96929a067764a253"}},{"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-hn.mjs:211 \u00B7 scan-seek.mjs:379 \u2014 the two spans are one implementation copied and then locally edited \u2014 104 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-hn.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716b29f0874793a314fc4392b2f3c32c649f4d9544f27b60a0b3f55b9ad1c97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): scan.mjs:4293 \u00B7 stats.mjs:335 \u2014 the two spans are one implementation copied and then locally edited \u2014 170 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":4293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5aa1f102f873d9deadfbef2250c318c6d42fd085652006c63df7a56f80ed4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5 locations): test-all.mjs:5073 \u00B7 test-all.mjs:5156 \u00B7 test-all.mjs:18184 \u00B7 test-all.mjs:18203 \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":5073}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f68d28a6a0855ab7f8bd5835346b47caace3035067fc3dd99fd2162989b04e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): test-all.mjs:7447 \u00B7 test-all.mjs:7478 \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":7447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac120d20fa00a0aa95241ee50d7ebb8dbf67ee6b768b020bd277da87ef506c40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): tracker-parse.mjs:827 \u00B7 web/src/lib/core/report-url-token.mjs:24 \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":"tracker-parse.mjs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"702cb8627b132a9c48243f767cea2e7f6fa127c504eb52ef6e5bab7433f530be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:181 \u00B7 web/src/app/api/profile/route.ts:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 152 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":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"32937fa2f1c342534d5a409dafafb7cb59bcd6b87ccb29007ca2bbfe58beb127"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): web/src/app/documents/page.tsx:87 \u00B7 web/src/app/documents/page.tsx:115 \u2014 the two spans are one implementation copied and then locally edited \u2014 76 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/documents/page.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19045298dfee1cb139e3209785a003b7f43b5d23166cc1852b0876ba2cffd1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): web/src/components/cover-draft-button.tsx:43 \u00B7 web/src/components/generate-pdf-button.tsx:38 \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/components/cover-draft-button.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"06db10a568310a3ff1ba4936a0f76590faefe13d6d82270c95b065fd2bd9f087"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): detect-reposts.mjs:702 \u00B7 process-quality.mjs:245 \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":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7a68c8b4ae525c67ae6da47670e566b644a2c53342a058c228df60a027ed1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): process-quality.mjs:81 \u00B7 tracker-sync-check.mjs:241 \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:268 \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:80 \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 (16 lines \u00D7 2 locations): validate-profile.mjs:151 \u00B7 validate-profile.mjs:178 \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":"validate-profile.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e55e0db58fb66a7cd298a1f367dc92c6e13997872179d0f8f005421693658f"}},{"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:403 \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:422 \u00B7 fix-report-links.mjs:127 \u00B7 normalize-statuses.mjs:169 \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":422}}}],"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:211 \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":211}}}],"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:175 \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/consider.mjs:49 \u00B7 providers/getro.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/consider.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aaae97715c0461d5f435cac1cee799a7cfc26cdfb11dd2ef69a40b46d2b34d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): providers/eightfold.mjs:376 \u00B7 providers/oraclecloud.mjs:226 \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":"ecbbc40469cf5030174ba8076e3eaa7c8f20d17607f58507e5c22c8fc72854c0"}},{"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 (15 lines \u00D7 2 locations): providers/germantechjobs.mjs:58 \u00B7 providers/larajobs.mjs:63 \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/germantechjobs.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cce1f3007c7b60996ccf4c3f7770abc4fd44f321119393fb9e4b01d7a5cc52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): providers/germantechjobs.mjs:140 \u00B7 providers/startup-jobs.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":"providers/germantechjobs.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ade46373871e8c44d5dd535df3f7585120bd9fd878523871d0d5f5c6a0e036"}},{"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:66 \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): robots-check.mjs:211 \u00B7 robots-check.mjs:316 \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":"robots-check.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac77e8f47b3b47582c79361f2d45d8eeefd4db436cce03d096ce94fa983112db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): test-all.mjs:6404 \u00B7 test-all.mjs:6426 \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":6404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b67a9328067ef61ef8bf3d64cc3533488bd392199d6b0a7bd8f3d23be56c01f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): test-all.mjs:10979 \u00B7 test-all.mjs:13854 \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":10979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6743432d23f551dd765f6fd6aa4abfddeac4bfc004527225211e2b912d085a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): test-all.mjs:14258 \u00B7 test-all.mjs:14361 \u00B7 test-all.mjs:14440 \u00B7 test-all.mjs:14516 \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":14258}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa966cb46df06db9772772b8284baa99336c6125108edfb371253c6843098624"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): web/scripts/scheduled-jobs-runner.mjs:218 \u00B7 web/scripts/scheduled-jobs-runner.mjs:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 91 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/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"452fc7a01415667ec67ff581cb12057b2d36bc608310f3d4961fb4471342d5e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): web/src/app/pipeline/[id]/error.tsx:17 \u00B7 web/src/app/pipeline/[id]/not-found.tsx:9 \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]/error.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efbaea6823fa0b3cc5b1df4b26b8b380183b1ce04fa82265bff8d6b4b4c6271"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): web/src/components/assistant-console.tsx:1094 \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":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"466a343dd2c0ebdc0f5cf2503e5d6bd8eac4a474045583d28ca04448183251d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): analyze-patterns.mjs:376 \u00B7 analyze-patterns.mjs:1677 \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":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2070335950400d60ac78f014264c713456f224289ca9420c82e9dfc47fcedcb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): company-funded.mjs:205 \u00B7 sync-batch-input.mjs:123 \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":205}}}],"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:115 \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 openai-tailor.mjs:365 \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":"a4b106191c1ec67ed5d1af95b7c36b87340d071d22a3c73bdda9221e8895dfae"}},{"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:4769 \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 (14 lines \u00D7 2 locations): providers/_wp-job-feed.mjs:59 \u00B7 providers/weworkremotely.mjs:124 \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-feed.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e96e7c8e1132d024b28c848edbd6aa74f3cb2862190219746d1133c9a33aff"}},{"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): scan-ats-full.mjs:1631 \u00B7 scan.mjs:4486 \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":"scan-ats-full.mjs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b72fb284a5a2dff52e7aea5639160a2b6a7b2652b9a88dfb91dc83932c4889d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): test-all.mjs:11670 \u00B7 test-all.mjs:12367 \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":11670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb3352d35bc8bcb04f2860bdaf37a99f2924dfdcc929e8fa372949fbf6cb1bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/components/apply-button.tsx:43 \u00B7 web/src/components/apply-next.tsx:27 \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/apply-button.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"912c50bedac2221214a711ce518a7882cd892f207b8582165174ec42eac46524"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/components/page-loading-skeletons.tsx:84 \u00B7 web/src/components/page-loading-skeletons.tsx:144 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/page-loading-skeletons.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca8890799cbe171924a46dcf714b56138f44115f9bf3ce5ad7979b1869434aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): browser-extract.mjs:303 \u00B7 browser-extract.mjs:958 \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":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"343e17f997fd7772c6938aa2052e90b330b7ebe831f59f3deab666482ac445c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): browser-extract.mjs:480 \u00B7 browser-extract.mjs:571 \u00B7 browser-extract.mjs:660 \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":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b157cc40a0e2e0c0e32b3614d1eee4845eed905fd1d7c44d95987e25f89a42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): build-cv-html.mjs:627 \u00B7 build-cv-html.mjs:661 \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":627}}}],"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:791 \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:462 \u00B7 ollama-eval.mjs:286 \u00B7 openai-eval.mjs:308 \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":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297b05a0d069b959d73ad9d87bb1bb8f12ae7e0584c220b1b68ed724804b257"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4 locations): providers/4dayweek.mjs:48 \u00B7 providers/a16z-speedrun-talent.mjs:41 \u00B7 providers/flowxtra.mjs:26 \u00B7 providers/gupy.mjs:130 \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:164 \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":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3543dd4a7135fdc745cc4895830b18c91cef1dcdbccc44023915a3f7ed59181d"}},{"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 with local edits (13 matched lines \u00D7 2 locations): providers/avature.mjs:201 \u00B7 providers/garena.mjs:116 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 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/avature.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f21d968473e4088665b5b36fa5005b77d6927b4d45adfa942cb87b25e49d07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/comeet.mjs:127 \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":127}}}],"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 with local edits (13 matched lines \u00D7 2 locations): providers/glints.mjs:70 \u00B7 providers/lever.mjs:22 \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":"providers/glints.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b4d0f52be05564feaa8d9a9fa3ed127f6ac62b74373a086fd33c35c003b50"}},{"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:28 \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 2 locations): providers/hirehive.mjs:214 \u00B7 providers/keka.mjs:154 \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/hirehive.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f38f16319e56f6f3a4f20b6ed040fddc6e0e9754481f9ce73a37e2c9db38dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): providers/keka.mjs:42 \u00B7 providers/turbohire.mjs:43 \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/keka.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c0a8e32806f8d1308ad3ebf540c9f2c642b1ddb174b3a0cf4e207fd91be64c"}},{"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:17 \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:106 \u00B7 providers/workable.mjs:108 \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":106}}}],"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:61 \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:1153 \u00B7 test-all.mjs:1203 \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":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fede09669d0ce36780624d58a80f178241984485ae7150a38d11246c8ce243a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): test-all.mjs:4515 \u00B7 test-all.mjs:19075 \u00B7 test-all.mjs:19191 \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":4515}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f72d1011e97fff9cf247e2a6a9895f7e210c76e08d67fd0ab8d49bdff470401"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:7244 \u00B7 test-all.mjs:7466 \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":7244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c303c7dbe6681e544bd06d9dc2a126224e797674666b78b260902d8ebb52c07"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:13537 \u00B7 test-all.mjs:13562 \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":13537}}}],"partialFingerprints":{"codehealthFindingId/v1":"987bd23f61c05f4ddc8f27c8a7720c651f5cb190f77370c1c92d9c1e0fcbcab5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): test-all.mjs:14129 \u00B7 test-all.mjs:14148 \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":14129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5944bea8d01b2225b3ce53b8a34f353ec7a09a69861ddf2eda3effb50f65013"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): update-system.mjs:1202 \u00B7 update-system.mjs:1236 \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":1202}}}],"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:211 \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:20 \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:65 \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 (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:922 \u00B7 invite-match.mjs:755 \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":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101b8f3e16092d9baeca40a1b44c2e4a417995dcc07b958ef9bcf644862cef5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): analyze-patterns.mjs:1847 \u00B7 followup-cadence.mjs:1055 \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":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad91faf0102fd0e994f245366b9b4db3f0c34d0c62061e4e9b4a507f3d253d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): browser-extract.mjs:715 \u00B7 browser-extract.mjs:762 \u00B7 browser-extract.mjs:893 \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":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb319a74eb4aded9202ee9243d76a816991ae28658013861bd55a3b871a2ec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): cv-title-check.mjs:328 \u00B7 jd-skill-gap.mjs:720 \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): lib/admission-gate.mjs:113 \u00B7 scan-local-lib.mjs: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":"lib/admission-gate.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217d94d9ca2252f1de4f154a92fa00bb010485b3d6fba63a2854d67752bf6ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/amazon.mjs:95 \u00B7 providers/dassault.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/amazon.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9819a805719bb3b235d7d2dcdd795f7801eea3f385ce1af0b7fd985ccad7783"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/ashby.mjs:204 \u00B7 providers/greenhouse.mjs:52 \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":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ea829ff1620a16355df927088515bfc649256d3fb36a0ce664c50ccc122573"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/deel.mjs:150 \u00B7 providers/ultipro.mjs:303 \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/deel.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c40e6a7310b07b3cbd4e851b4a1c3a4908a01ad357f3635ffdf33f3b69ef465"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/eploy.mjs:50 \u00B7 providers/sitemap.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/eploy.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa2884c4594469a03fe4d0e37087213be3b6f44f626b40caaa48f825c04165a"}},{"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:72 \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:111 \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 2 locations): providers/oraclecloud.mjs:97 \u00B7 providers/smartrecruiters.mjs:120 \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":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8594f4732adb3727929b3ce0a3adf0811eabcc45b8052372302f3a5691dff35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/pageup.mjs:95 \u00B7 providers/sitemap.mjs:192 \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/pageup.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6055daa0bc10827581b350f545fdad3be7c7fa42a19e7f07ecd896d14892e49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/pageup.mjs:218 \u00B7 providers/tes.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":"providers/pageup.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcdad806ca1d2a8d8cfea01e8394eef4037e296f8b0e2d56463bde0f25d5453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): providers/personio.mjs:379 \u00B7 providers/pythonorg.mjs:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 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":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b17f4fbe2eee50c17d8a6a4683cde1f3f224bf64a5aba6ac93092bd011075f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): providers/remotli.mjs:228 \u00B7 providers/workable.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":"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 5 locations): test-all.mjs:2846 \u00B7 test-all.mjs:5036 \u00B7 test-all.mjs:18212 \u00B7 test-all.mjs:18328 \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":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f153200f7fa6f4179ce3081d79986f72b020af56c3b2c20afd7f7fd9dcee88ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): test-all.mjs:6240 \u00B7 test-all.mjs:6268 \u00B7 test-all.mjs:6282 \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":6240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4933cd90b78180fe859911a08b4a3f787e0b5f7d0320dda09abcc4ff37ec729"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): test-all.mjs:10653 \u00B7 test-all.mjs:10670 \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":10653}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec6e2bcb2d1074985710c6a62d25f1a426df1e3a87e8530fdb756fe6268cbb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): test-all.mjs:18221 \u00B7 test-all.mjs:18797 \u00B7 test-all.mjs:18840 \u00B7 test-all.mjs:19048 \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":18221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e1e51c6781e883bfbf31e8fbbdc76a47ab56a901b4aea5471668cd04c3494f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): update-system.mjs:5909 \u00B7 update-system.mjs:5952 \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":5909}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ae13192a36e28ad95ecf940c99e8d557448f53a02a12c2e1bf69d2a090f2ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/app/api/assistant/route.ts:48 \u00B7 web/src/app/api/run/route.ts:55 \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/assistant/route.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"10834498c61907120d466602a96de8cdfb46c134852043932e6b4603209d04a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): web/src/app/api/company-history/route.ts:33 \u00B7 web/src/app/api/quiet-companies/route.ts:27 \u00B7 web/src/app/api/upskill/route.ts:26 \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":33}}}],"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:283 \u00B7 web/src/components/inbox/inbox-triage.tsx:78 \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":283}}}],"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 (12 matched lines \u00D7 2 locations): web/src/lib/apply/diagnose.ts:184 \u00B7 web/src/lib/apply/diagnose.ts:201 \u2014 the two spans are one implementation copied and then locally edited \u2014 103 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":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c22ec1ff38d3ad41b312ed44fb2de5a0985af2d339db6a84544ca6c74e9b3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): archive-posting.mjs:325 \u00B7 liveness-browser.mjs:353 \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":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d7fd7edd1b244d2c579e3f5e3821cfc43441926a1e0e48a2803e713ef8454b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): batch/aggregate-tokens.mjs:170 \u00B7 batch/aggregate-tokens.mjs:221 \u00B7 utils/token-tracker.mjs:157 \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":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ce31b2d6741a4768d9c102ac2dd510bfeb3bb0e38742f5a958058f228a77c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): build-cv-latex.mjs:166 \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":166}}}],"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:935 \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:526 \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:595 \u00B7 ollama-eval.mjs:456 \u00B7 openai-eval.mjs:601 \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":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c93f2be0aeffd2f91efa72551d37c36fc272f450630ce62627c379474cc39a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): gemini-eval.mjs:685 \u00B7 ollama-eval.mjs:543 \u00B7 openai-eval.mjs:688 \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":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"591008d635cf26e618eea3fa4229f930f6920dcf982f82dd8d38c168a093fed7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): harvest-buildlist.mjs:304 \u00B7 liveness-api.mjs:1066 \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":"harvest-buildlist.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1543ac4d468aede7d82248dc68aaa297791586c3752fde90447d67ef4d92181"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): lib/jd-page-fetch.mjs:59 \u00B7 providers/_http.mjs:463 \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":"lib/jd-page-fetch.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e80d195a2ba9a1d29848bbf0e6d87a66dcdc522511a063c3679683e2f7a0ec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): merge-tracker.mjs:1299 \u00B7 merge-tracker.mjs:1334 \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":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4807e6161ac2f48b6efda5c09d619310dd4521a64a118a227433657ab224830a"}},{"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 with local edits (11 matched lines \u00D7 2 locations): providers/_http.mjs:355 \u00B7 providers/_http.mjs:536 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 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":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5973fe5ce69f419167fe39ca608d7a28d1f98dac344660a4d6507bc1e545e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/adp-myjobs.mjs:75 \u00B7 providers/peoplesoft.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":"providers/adp-myjobs.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6e3ec101ffab2d4edfb51e91a8629c3a81e3ce3237ed9203cc004144c69d92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): providers/applicantpro.mjs:281 \u00B7 providers/bamboohr.mjs:91 \u00B7 providers/breezy.mjs:52 \u00B7 providers/hirehive.mjs:214 \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/applicantpro.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"20727e40d9b2051888dc0fe448ca34967a7e7617b6cd1017f9ecb031a1668065"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): providers/applicantpro.mjs:122 \u00B7 providers/join.mjs:222 \u2014 the two spans are one implementation copied and then locally edited \u2014 75 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e37b653a22aa7bb88f5cb8e3e60b799dedb959dbeb13a917a8e9be7d9809c33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): providers/atlassian.mjs:20 \u00B7 providers/germantechjobs.mjs:32 \u00B7 providers/larajobs.mjs:16 \u00B7 providers/nodesk.mjs:12 \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/atlassian.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a901f7c5241cc8e76ef8704c197be200fc694bca7c613356c06591a5c1c8558"}},{"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 4 locations): providers/deel.mjs:66 \u00B7 providers/hibob.mjs:173 \u00B7 providers/polymer.mjs:172 \u00B7 providers/trakstar.mjs:149 \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/deel.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7a289109c9f48ef93e3830403e82b1a770b287dd455d57fdd9a20848f3ca03"}},{"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/himalayas.mjs:82 \u00B7 providers/rexx.mjs:299 \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":"providers/himalayas.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"720a3b2687c58615d3ecfd38c065addb144e415945af6498883b03e702404647"}},{"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:84 \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":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"88137762ad703e01d5adaa7ecc1eb397256fc47d35f7a03eed83fc9c7aa61718"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): providers/jobvite.mjs:84 \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/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:95 \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":95}}}],"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/platsbanken.mjs:191 \u00B7 providers/remote-com.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":"providers/platsbanken.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a3600c752d89081363f89b554e0c9142c0e061b2809a591d202dfcb1939c42"}},{"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:214 \u00B7 role-clarity.mjs:245 \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":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a904414b607fdb07ecd2ec5463c95d881f01ac0aa3efe578987f062816b06"}},{"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:2796 \u00B7 test-all.mjs:16811 \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":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ce3f7edf25e69e8bce58a2e1f99da2b8514c67cb16a576282a8cdb3bd42894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): test-all.mjs:2951 \u00B7 test-all.mjs:4210 \u00B7 test-all.mjs:5188 \u00B7 test-all.mjs:18385 \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":2951}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a2157c32fff105e6ff01a3a31b82f033792a1515483c4f371a89c7b23e7a14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:3668 \u00B7 test-all.mjs:7073 \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":3668}}}],"partialFingerprints":{"codehealthFindingId/v1":"740d630adfc313f97eea3107457764adc8094be77919626034d203c32492d28b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:4258 \u00B7 test-all.mjs:4304 \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":4258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b27452a37c6743faafa343bdde541824548a1b4aeb1e6e1daa4646db337c638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 12 locations): test-all.mjs:5034 \u00B7 test-all.mjs:5081 \u00B7 test-all.mjs:5148 \u00B7 test-all.mjs:18191 \u00B7 \u002B8 more site(s) not listed \u2014 all 12 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":5034}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e9ab8da965a7ceebabd5fada4f2bfd675567011ab8b155a0047e14118149d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7 locations): test-all.mjs:5095 \u00B7 test-all.mjs:5151 \u00B7 test-all.mjs:18165 \u00B7 test-all.mjs:18195 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":5095}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d10dbb4f8d9139e092a3cd6b0b154f2c502b9c7196a80e236b05f79b5234b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): test-all.mjs:11858 \u00B7 test-all.mjs:11927 \u00B7 test-all.mjs:12098 \u00B7 test-all.mjs:12289 \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":11858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f054dd4c2d7e6c883fe44b7363b0b2eb04b5e6f76d6aa1d9654f857e66c9e937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9 locations): test-all.mjs:12341 \u00B7 test-all.mjs:12411 \u00B7 test-all.mjs:12523 \u00B7 test-all.mjs:12600 \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":12341}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e89769d06c8c25403746d36a282e679c6deb73ca8ea7bbbac5a0527d78d55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:13999 \u00B7 test-all.mjs:14020 \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":13999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f16cbd01bda7d46b351e0eaa12b85452cfd6731846f1754038b03058001cb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): test-all.mjs:14207 \u00B7 test-all.mjs:14235 \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":14207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2008dbbb255d8c36872de9687ac867dab3e7b321adbe9678bd8dcf15125d9e2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): validate-system-paths-coverage.mjs:144 \u00B7 validate-untrusted-content-coverage.mjs:158 \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":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af8a763afbe89bdd51cf18439d1593628384f6c4dda9c07fbc17d4f3931d084"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): verify-cv-facts.mjs:4359 \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":4359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b49d6a3445463b5e2414d4d498bcb733aa6c839ac7aed507e3bee949299ef4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): web/src/app/documents/page.tsx:41 \u00B7 web/src/components/home/today-dashboard.tsx:101 \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/documents/page.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c9e56cbb6c9153ef5486621f245a82868ec1b8855b46e430f976fb6d913bb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:308 \u00B7 web/src/components/linkedin-paste.tsx:24 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-checklist.tsx"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb584185782ad0461bd28839b0968cf6d9399119cfbafed446efeba1c9d205"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/apply/apply-provider.tsx:178 \u00B7 web/src/components/apply/apply-provider.tsx:439 \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":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57966bf675e7872bdb7ac044a08d84ad579ac167c3950d2bab8c2d12a4bc336"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/followups/followups-view.tsx:116 \u00B7 web/src/components/pipeline-view.tsx:105 \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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d62ebf7f3ead8172a9da0e3e09b1d423f68558282580afe5b10605611869158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/components/followups/log-dialog.tsx:39 \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":39}}}],"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:53 \u00B7 web/src/lib/job-stream.mjs:57 \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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e651d158bc3174a88827e90ba78e1781c7cc90f2a0a9bdf3a33bd8ba91430ed9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/lib/core/scan.ts:264 \u00B7 web/src/lib/core/scan.ts:302 \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":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36ed121314f648ccd98a3fef47c039fd7dc7ec229bcbbb2bcd1c4e92c19ae25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): analyze-patterns.mjs:2056 \u00B7 followup-cadence.mjs:1144 \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":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcee8e4682bc95325316deff4fde4f7df2782d349760a16a2a4151d0fb26668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): ats-vendor.mjs:35 \u00B7 providers/clearcompany.mjs:53 \u00B7 providers/hibob.mjs:53 \u00B7 providers/polymer.mjs:36 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 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. 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":"ats-vendor.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bab99fa427a3464d0582865dbb417b8ddb4a201605d05a2d024d9bcd3bf1e9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): batch-evaluate-gemini.mjs:511 \u00B7 ollama-eval.mjs:462 \u00B7 openai-eval.mjs:607 \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":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7389061474ad0f43512d666b378848f4847547d85aeff03422024dd3366df4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): browser-extract.mjs:390 \u00B7 browser-extract.mjs:475 \u00B7 browser-extract.mjs:566 \u00B7 browser-extract.mjs:655 \u00B7 \u002B3 more site(s) not listed \u2014 all 7 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":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1f861fb92906df6df302c4197aea8170bd958478cf8438e598b768e30c0f5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): build-cv-html.mjs:512 \u00B7 build-cv-html.mjs:580 \u00B7 build-cv-html.mjs:619 \u00B7 build-cv-html.mjs:649 \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":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5ca614d1a9a1acced438f09e19f62a156c302c5a55dbdb9b2a80c7e849cbbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): build-cv-html.mjs:612 \u00B7 build-cv-html.mjs:644 \u00B7 build-cv-html.mjs:678 \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":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"54280e4f16d08efe7cae825a27c712fc9d1c4865add2c99037e5278175582222"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): build-cv-latex.mjs:74 \u00B7 build-cv-latex.mjs:91 \u00B7 build-cv-latex.mjs:116 \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":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e99950569a1d4b9980f6198e54e7dabb5178f83c2ecab5f4582ec4b73ae30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): check-jd-archive.mjs:749 \u00B7 tracker-sync-check.mjs:551 \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":749}}}],"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:1247 \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":1247}}}],"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:2211 \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 (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:588 \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:758 \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): install-latex-engine.mjs:139 \u00B7 lib/jd-page-fetch.mjs:61 \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":"install-latex-engine.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"40050e3f1c2db98b613514f1a2ee7ccc48236d4f84b67b938d24fcc5c3ca6a24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): lib/golden-budget-analysis.mjs:27 \u00B7 ollama-eval.mjs: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":"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): lib/jd-page-fetch.mjs:142 \u00B7 lib/jd-parse.mjs:187 \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/jd-page-fetch.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557f94f341aba203ca63486f4d031b4da5044f560fba508fd8b783545e780ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): lib/privacy-guard.mjs:548 \u00B7 lib/privacy-guard.mjs:562 \u00B7 lib/privacy-guard.mjs:579 \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":"lib/privacy-guard.mjs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"168fde013b8c661e6f2ea4a84bcc6b2b28b7155af2bbea5313db06a8d1891833"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): liveness-api.mjs:235 \u00B7 liveness-api.mjs:315 \u00B7 liveness-api.mjs:372 \u00B7 liveness-api.mjs:547 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 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":"liveness-api.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba112a8257cde67468a4d352d94cc250c643faea73fbfde17c1cc54a634ac952"}},{"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): providers/_wp-job-feed.mjs:19 \u00B7 providers/germantechjobs.mjs:53 \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/_wp-job-feed.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"143bb243f9b1b0ae3eabe949231cc95306584c8844730e00029773459240e9a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/adp-workforcenow.mjs:96 \u00B7 providers/eightfold.mjs:151 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"566704ed07beaa97de87cf483ff1d2e6f821a39ba63f081d37a7dc499d5bfc12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/aldi-nord.mjs:87 \u00B7 providers/talentlink.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":"providers/aldi-nord.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3c5f7d0e76ee7aa7e82090ed2fce632f3fdb86ba8f9cdd6988e6350ba75d80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/ashby.mjs:296 \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":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db025c245b671e24a1c9f54a8859bccad9fb776e1afa3e8af1463082ce7ad18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): providers/avature.mjs:60 \u00B7 providers/beesite.mjs:55 \u00B7 providers/deutschebahn.mjs:58 \u00B7 providers/hecklerkoch.mjs:32 \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":"providers/avature.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6c7c86e8aec003687a9beb3dac1edb8b79f7aebb80d90ef72f54718ce3fbfa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/avature.mjs:201 \u00B7 providers/tkms.mjs:148 \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":"providers/avature.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9070e692a6d03784498eeebb707c404763f0f9bda8290ef038918a32c769ff44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/bulldogjob.mjs:81 \u00B7 providers/paylocity.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":"providers/bulldogjob.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6bfdec301708b075a5c8568733b5f41171b088447d57773b2b31ba26c374d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): providers/bulldogjob.mjs:150 \u00B7 providers/ibm.mjs:97 \u00B7 providers/phenom.mjs:153 \u00B7 providers/radancy.mjs:307 \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/bulldogjob.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fc23ab894a1c932dfeebcee664371d5dc543e4dcd13c98ad17786516601a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): providers/bwi.mjs:43 \u00B7 providers/pythonorg.mjs:17 \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/bwi.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce4d9cb595e6f5f1ee4d1904bdc15365ebd10bdd1c498303e1a2505c8996018"}},{"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 (10 lines \u00D7 3 locations): providers/consider.mjs:49 \u00B7 providers/getro.mjs:59 \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":49}}}],"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/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 (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 3 locations): providers/personio.mjs:368 \u00B7 providers/pracecz.mjs:88 \u00B7 scan-seek.mjs:194 \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/personio.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0247aaa73b9e35691b482613c04ebf94a76d43252ec416bbd9dfb96bc093c5ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): providers/phenom.mjs:245 \u00B7 providers/rexx.mjs:349 \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/phenom.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99638236c59c76a62ff5bd08b751a0f8e76c27d3c930f6bbf56b847c87f4674"}},{"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:76 \u00B7 sync-batch-input.mjs:341 \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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"066cb1d9b2732c08af2104e0bc4a57d616c9108a70dbce5af3a13993bb7df48d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): reply-matcher.mjs:683 \u00B7 reply-matcher.mjs:699 \u00B7 reply-matcher.mjs:761 \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":"reply-matcher.mjs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"56de11712945c26c977ea786ca2db254c78eb7f0db65b5342f446efb4fc90250"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scan.mjs:3835 \u00B7 scan.mjs:3864 \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.mjs"},"region":{"startLine":3835}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c482c7e80ebd0d52360d13284d724cfe9b57c7a523f75d23651bcaefc75075"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7 locations): test-all.mjs:3701 \u00B7 test-all.mjs:3822 \u00B7 test-all.mjs:3916 \u00B7 test-all.mjs:4769 \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":3701}}}],"partialFingerprints":{"codehealthFindingId/v1":"501844559d5c6e108c3a0ad5ff38dfa172add2edc81d7decc378f3e997bcdc6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:4037 \u00B7 test-all.mjs:4289 \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":4037}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33256bb260c3522d572e3dc24d6a47a63e0376ff58b534bb075c2d7dca13499"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:8706 \u00B7 test-all.mjs:8745 \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":8706}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df4f236ebede8890362e339b8aaf2984ff35b3bb783666fcf35928966cf7513"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): test-all.mjs:13277 \u00B7 test-all.mjs:13349 \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":13277}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dad76dd23dde924e390a9020ed5431e06c3dd538a2a02620093e8c4874f8dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): theme-style.mjs:79 \u00B7 theme-style.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":"theme-style.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fba43b3938bf4afe0a683da538e6b38dd5cdf8c7953c86f3706506e413cc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): update-system.mjs:5740 \u00B7 update-system.mjs:5766 \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":5740}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05e14154a2cb20056ea3b1ed72cacfceaafa359be7543d15133f17209b77121"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): verify-cv-facts.mjs:1713 \u00B7 verify-cv-facts.mjs:3461 \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":1713}}}],"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/cv-studio/[n]/rewrite/route.ts:22 \u00B7 web/src/app/api/cv-studio/[n]/route.ts:44 \u2014 the two spans are one implementation copied and then locally edited \u2014 132 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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb0723562960126a4972e81641fd0551041626c3afd96a59ab804872d6f049"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/route.ts:30 \u00B7 web/src/app/api/cv-studio/[n]/route.ts:49 \u2014 the two spans are one implementation copied and then locally edited \u2014 188 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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2edbeea86371a2bcf16091b715c49b0c87605f4779c0703fb2bd909ac20b95"}},{"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:5 \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:146 \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":146}}}],"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:57 \u00B7 web/src/app/api/followups/route.ts:17 \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":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa4f433835feeb0601e1f5dd4b20ed81d51a434e9f6276a798145733a12c818"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/app/api/run/route.ts:640 \u00B7 web/src/app/api/run/route.ts:677 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b260b7b5bdebe0c11eb0a9679b073b88d8f0fd1d4eae03380d01e3c98a4f3819"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:112 \u00B7 web/src/components/apply-checklist.tsx:124 \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":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a078389430b0b26d65c3fcab9abc385d7729e5b8ecac8cc0bc7ca686dcb32704"}},{"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:15 \u00B7 web/src/components/home/today-dashboard.tsx:192 \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":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634882edae353e9cc233909f8de7e6b33ceba8c1850cd28676f7df04c950c1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/lib/apply/session.ts:22 \u00B7 web/src/lib/apply/unsupported-ats.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":"web/src/lib/apply/session.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d5f9c3195f1137b764b374d21dd1b41b58853eff4a6d4094c9b05ac530bff0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): analyze-patterns.mjs:329 \u00B7 upskill.mjs:269 \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":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d32c94d8bb3bcfb42563b451d233f4957428b1d7e08786e1ada80cfe885470"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): analyze-patterns.mjs:1377 \u00B7 analyze-patterns.mjs:1392 \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":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce8fe931cf988df907a58bcb0d3a4f27ef268e5338eb55a1e78157736ec319"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): application-answers.mjs:618 \u00B7 discover-ats.mjs:1303 \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":"application-answers.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2c01d49ea397cc92f555f71892d05fe3b732e97358cf96b3c74b0b673670cf"}},{"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:36 \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 with local edits (9 matched lines \u00D7 2 locations): apply-scope.mjs:117 \u00B7 validate-profile.mjs:310 \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":"apply-scope.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e91871eceeb67c2947ce20b6f3a5c134ccabd7b84258f9f0ff83b4ca698a2c0"}},{"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:56 \u00B7 ollama-eval.mjs:67 \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":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a67db22ffe0b992b6c433e28e25e145a197e94fd9d0cd8675f0a9414aafdbe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): browser-extract.mjs:547 \u00B7 browser-extract.mjs:650 \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":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"35988ed4f866a88215a93b0329c1fc488750ed6830dc5f57d5412c281e957706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): build-cv-html.mjs:601 \u00B7 build-cv-html.mjs:631 \u00B7 build-cv-html.mjs:665 \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":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"901da55149031c0b2c95929008a098000db63e73bb8c6d64870a307f56169667"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): build-cv-html.mjs:1098 \u00B7 build-cv-latex.mjs:146 \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":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7c60c62f2a61254d557ef7056b1297d5150c4cc8b4583e4735545dc3c95e94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): build-cv-html.mjs:1513 \u00B7 build-cv-latex.mjs:414 \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":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15cfebe2940931c4b942b189b63fad88aaecb4e7827e312b691454dc93f07a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): community-asks.mjs:335 \u00B7 learn.mjs:464 \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":"community-asks.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bada014294246dfbdcd9aa97c59245fd8c73109eb1dc79bc8fb7f83393cb364"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): company-history.mjs:988 \u00B7 weekly-digest.mjs:390 \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:649 \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 with local edits (9 matched lines \u00D7 2 locations): debrief-sync.mjs:314 \u00B7 discover-ats.mjs:1303 \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":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6188baccb219592fbbd0a4828ca5c06c4eae69884aa9b68ea751b9797d50f4e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): discover-ats.mjs:1304 \u00B7 sponsor-check.mjs:1554 \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":"discover-ats.mjs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7929d4d3dd1e21725ba7f64222a86f03c98846100999d6020816a7288ab161"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): gemini-eval.mjs:573 \u00B7 ollama-eval.mjs:434 \u00B7 openai-eval.mjs:579 \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":"gemini-eval.mjs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86cb6cc41dbaaf4b823421c867cc3a47d69ac5e0c6cd1441531672026b4691e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): hired-share.mjs:102 \u00B7 intake.mjs:199 \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 2 locations): jd-skill-gap.mjs:1334 \u00B7 story-provenance-check.mjs:971 \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":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"435e64a2b329b61711a968b35203bcee95bac532772950e304a4c80d844d43f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): jd-skill-gap.mjs:1381 \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":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4cea49e5778140bac4c46750a077b621a6938ba126b8ddf78de387a281e730"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): lib/jd-page-fetch.mjs:61 \u00B7 plugins/h1b-sponsor/lib/api.mjs:206 \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":"lib/jd-page-fetch.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f8b7cad276618f13e494b72dfd4558f395a97b6aa512f9c04c08c7b010e5ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): liveness-api.mjs:116 \u00B7 liveness-api.mjs:191 \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":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965bb7ee036a80403d1e4edb721a2e687c1006125cf78255e7eb66dbb60c25d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): liveness-api.mjs:340 \u00B7 liveness-api.mjs:628 \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":"liveness-api.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a44c3cd1b324283ca27c681859a728b55d25607be6d6ed6c75d86eefe3c8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mark-pdf-ready.mjs:98 \u00B7 set-status.mjs:553 \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:1312 \u00B7 merge-tracker.mjs:1348 \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":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"505142df96fd1140d889ff1b5df752eb8a6d7071e1250c57eb3fdd8d0ef1dc1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): merge-tracker.mjs:1774 \u00B7 merge-tracker.mjs:1788 \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":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"af70803cd65359d6ea645162b1e4e1b983c464fea560a670c50de6bd4a7ad4ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): onboard-write.mjs:51 \u00B7 seeds/employers-import.mjs:367 \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":"onboard-write.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d39743a6cf0bf3dc400da1c798f7465a253854223e92eb0e57779f31ad7e5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): plugins.mjs:122 \u00B7 scan-seek.mjs:304 \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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"902292bb0d1bde96e47a5a6860ddd1718fbfb593b68745e4d9325699e261b04c"}},{"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:862 \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 3 locations): providers/adp-myjobs.mjs:106 \u00B7 providers/adp-workforcenow.mjs:366 \u00B7 providers/ultipro.mjs:344 \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/adp-myjobs.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"221555191e9b9fb76db3f296d923a19d67f1f186f4b5ac96e09e2f3af2803f63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/adp-myjobs.mjs:211 \u00B7 providers/aldi-nord.mjs:202 \u00B7 providers/hirehive.mjs:193 \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/adp-myjobs.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6a69ffd0adaac03c4446251aa1b0de176ec701721c2ca5f1354500f9c8f2c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): providers/adp-myjobs.mjs:261 \u00B7 providers/adp-workforcenow.mjs:391 \u00B7 providers/ultipro.mjs:370 \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/adp-myjobs.mjs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"289451c46e7fff58893fbf2dc85c0f7e14a35e61e75545e96218c4488997b49b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 21 locations): providers/ashby.mjs:204 \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":204}}}],"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 (9 lines \u00D7 6 locations): providers/bulldogjob.mjs:39 \u00B7 providers/clearcompany.mjs:61 \u00B7 providers/factorial.mjs:85 \u00B7 providers/hibob.mjs:61 \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":"providers/bulldogjob.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69d012f2730eada3ec88c80e684c1930a276b0da72a901ef9f2393a7c15ab94"}},{"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 3 locations): providers/google.mjs:63 \u00B7 providers/polymer.mjs:74 \u00B7 providers/trakstar.mjs:69 \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/google.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28277e53dc5581c69880de3fb9e84372079aacde813d271283062091393f9e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/hibob.mjs:79 \u00B7 providers/tes.mjs:168 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hibob.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b41caf2dc6df1c55136599382b510d0a1d3d7053666ed1b0e680e43ea2f28fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/icims.mjs:143 \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":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4bf9ac7f3659b59938a0792e85a6b4cbb57c0d1e27031b363b84091bbdc558"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/jibeapply.mjs:41 \u00B7 providers/rexx.mjs:139 \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":"providers/jibeapply.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e899472234849c7251c47aaf77f7946ab2dd8fcc78a688ae93cd3e7a7c7a47a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/join.mjs:159 \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":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"308314ff943714ee6134a3f3e46e570033fab0ac877fd81c164dea4ad80d830e"}},{"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:61 \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:161 \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): providers/radancy.mjs:300 \u00B7 providers/yourator.mjs:89 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f497dba175f798c4e085451c2618d1d06cda39cdf2fc1d529cb41fe09bf0b850"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/recruitee.mjs:447 \u00B7 providers/remote-com.mjs:114 \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/recruitee.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4110742075e41246fd03cf97d1b48cd64d28da2f056f9cf2bc44f4516ae4a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/remotive.mjs:33 \u00B7 providers/solidjobs.mjs:52 \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/remotive.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe936e01b0f3683567e3147d76ba7fa68c36ca362379f272880c927739bca8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): providers/rexx.mjs:101 \u00B7 providers/wp-job-manager.mjs:69 \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/rexx.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ce9bfc0e48580a43d66c4f3f8385d0831170009fa25d62b5993180ade3f11a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): providers/rexx.mjs:159 \u00B7 providers/rexx.mjs:250 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdeca0503e87fef28cb285efbc0905d6cd3c51672fa124e140132448f4dba74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scan-dayforce.mjs:440 \u00B7 scan-dayforce.mjs:458 \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":440}}}],"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:1869 \u00B7 test-all.mjs:1879 \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":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdacfd1773a9c5f1c2eb537c2db30eda820f4d805ef9d39ea6d7d8b1c88559d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:7434 \u00B7 test-all.mjs:7461 \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":7434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93a264e648de7216bfc7da4451fc3b58add2c289dcf71b357bd05b8a2d47e2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:13204 \u00B7 test-all.mjs:13223 \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":13204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39ce91005c1e218e4d0d4d6c06863059d15983f8d1bb6f344df8536c44257e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): test-all.mjs:14355 \u00B7 test-all.mjs:14434 \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":14355}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b926f8feb3c4f65e7e67fd623cbe38d1c19c1062a8945a93964930533611e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): update-system.mjs:5007 \u00B7 update-system.mjs:5129 \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":5007}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a9e2247e5200cb7449f817420086beb59854ba992b5e787b95877ff061292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): verify-ats.mjs:1174 \u00B7 verify-ats.mjs:1241 \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":1174}}}],"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/explore/ai/route.ts:25 \u00B7 web/src/app/api/tracker/delete/route.ts:6 \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":25}}}],"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:5 \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 3 locations): web/src/app/api/tracker/delete/route.ts:67 \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":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb635816626f0627baffff700c2c187f3a26ea3cab2a26731ce27d4365a6c62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/app/pipeline/[id]/apply/page.tsx:24 \u00B7 web/src/app/pipeline/[id]/page.tsx:13 \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":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"99327cac190df611260815a934053236126670dabf8bdd6a1680cb189f89a21c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/components/explore/explorer-view.tsx:342 \u00B7 web/src/components/explore/explorer-view.tsx:400 \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":342}}}],"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:830 \u00B7 upskill.mjs:708 \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":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6479a8b30af678d39c1c4aa975e5b5c5974f18bb2a0114a02e733ccf11bb328"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): analyze-patterns.mjs:2038 \u00B7 analyze-patterns.mjs:2047 \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":2038}}}],"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:142 \u00B7 archive-posting.mjs:155 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae33a5ab638cf6ca8792c038dd628e7fadb628ff02b47f6690b147b554e1d61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): browser-extract.mjs:252 \u00B7 browser-extract.mjs:360 \u00B7 browser-extract.mjs:542 \u00B7 browser-extract.mjs:748 \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":"browser-extract.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dffdd8f765d0bbc0e644ef8146c38aa8d31fdb315c812351cc535786597a762"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-html.mjs:1169 \u00B7 build-cv-latex.mjs: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":"build-cv-html.mjs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f9d5f32c9dcec8b70b557c040b5346ee0a11f7be5beff319b4330af27d8980"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-html.mjs:1300 \u00B7 build-cv-html.mjs:1316 \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":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0904b7bd2d097bd60b4d2d0ce49e75e59747fec84ca03536820efe92ee26b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): build-cv-latex.mjs:307 \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":307}}}],"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:486 \u00B7 salary-gap.mjs:1476 \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":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc671f205a00e3a07d77a5017502301de8093a9b41019d31b98eb429233f468"}},{"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:232 \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:410 \u00B7 salary-gap.mjs:1607 \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":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd674b4629f5c68731720aea147114c8e0a2eee94c59715467ceeb813428b7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): cv-experience-order.mjs:92 \u00B7 generate-pdf.mjs:841 \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":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18ce9f7ab7e8e58483d6499a884dde133792f636ac64950dcda4f1e1faa7d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): debrief-sync.mjs:315 \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":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e3381fb34dda6f56767ac4974313d53cd2b37e4541b3cf3887a65265e79d9c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): dedup-tracker.mjs:605 \u00B7 dedup-tracker.mjs:645 \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":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c67a363468a8a261a7e466b005255a549eb52a48d3c41613d421f4aa3ea61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): discover-ats.mjs:1117 \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":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d6867fdcd4a15986326e010c07ffb4c999cbfe5175b2fcfb92e58a4320df2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): doctor.mjs:871 \u00B7 doctor.mjs:880 \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":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86330948be3a5e87ef21a01f32ff2451114e34f7194f34aec120f21b05cafd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): doctor.mjs:1804 \u00B7 doctor.mjs:1833 \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":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5b735ef98c6fd97b6a116fea94c1df563bbe829313a4e09ba2dfd0555283de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): eval-golden.mjs:32 \u00B7 validate-profile.mjs:313 \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":"eval-golden.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d55096070aa3b0fbaef1861811ce0902c30d1c4eceae5e0ef2e91b5c0675888"}},{"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:272 \u00B7 ollama-eval.mjs:149 \u00B7 openai-eval.mjs:159 \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":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"551b14d58b064992b1e27c9b964bdf683efadd823aace21f6769ae66f18962d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): harvest-buildlist.mjs:178 \u00B7 harvest-buildlist.mjs: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":"harvest-buildlist.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ba2f5f138677975e980aa08bce1aac04a383a4d5739c85ff270b467db7e362"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): invite-match.mjs:1229 \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":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3fb664387d95339a4d57e4c25a1cc41bdecd6eb06d6b5bfbe51182f6a561e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): lib/jd-page-fetch.mjs:318 \u00B7 lib/jd-page-fetch.mjs:383 \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":"lib/jd-page-fetch.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdf6af64979280082048376bb43bedfa4bffbe7f1040527398dcf28090a5f03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): linkedin-import.mjs:91 \u00B7 linkedin-watch.mjs:40 \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":"linkedin-import.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"661521505417dc2c89102d25a15bdb70b05bcb24297ddb4659509caad97a4692"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): linkedin-join.mjs:408 \u00B7 sponsor-check.mjs:772 \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":"linkedin-join.mjs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5f5442107a57cbd9e1013447b986723d865c094e2152d4bede08b3bd4af357"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): liveness-api.mjs:570 \u00B7 liveness-api.mjs:599 \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":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"221e4aa36b9d627713a322ee46114c64dca24eb3c52b0ff752330931d02992dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): liveness-browser.mjs:637 \u00B7 openrouter-runner.mjs:775 \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":"liveness-browser.mjs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"53086294caf51d4bae344591d72f00ee04a8302810fdcffedf445556bfe71a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): negotiation-roi.mjs:750 \u00B7 salary-gap.mjs:1769 \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 3 locations): ollama-eval.mjs:138 \u00B7 openai-eval.mjs:380 \u00B7 openai-tailor.mjs:285 \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":"ollama-eval.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"50efee07b22bcdc1786c07fb6d30a1f0fce6cbd9946d3fd21d14252ff765f784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): ollama-eval.mjs:360 \u00B7 openai-tailor.mjs:340 \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":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec04bdd0634b622fb60dbd85f9f78630d0c7e800f84619827f1bbe8332025bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): outcome.mjs:386 \u00B7 outcome.mjs:685 \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:290 \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/_country.mjs:307 \u00B7 web/src/lib/core/workplace-policy.mjs:12 \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":"providers/_country.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6f525227834c4ff536dfcfd36d705c24c225bd6ca73f6cd9cec84dab7180b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/_http.mjs:544 \u00B7 scan-ats-full.mjs:862 \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/_http.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d3e7fe614f24f46b73008aaa25f70fb1f3fda37845299e272b92dd6805ecb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/adp-myjobs.mjs:185 \u00B7 providers/keka.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":"providers/adp-myjobs.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"941676fbb8ac3565479d6761ea87404866d87abca048afa49049df20bcd1fdff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): providers/aldi-nord.mjs:166 \u00B7 providers/germantechjobs.mjs:47 \u00B7 providers/kalibrr.mjs:84 \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/aldi-nord.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dd0b35be9d092a444cba787eefad8b2c7244101cc7ca954d23d31184fa1602"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/applicantpro.mjs:176 \u00B7 providers/talentlink.mjs:284 \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/applicantpro.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b621e36f8c3e462666f31357cc095e251b5c1a779cd2cfc3a332cf4374391e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): providers/avature.mjs:243 \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":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b035e0b3d913341ca685530c1ef18e152c19bae83ff9eccc36748aa800f0530"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/bulldogjob.mjs:216 \u00B7 providers/phenom.mjs:265 \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/bulldogjob.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e07105db3d46b57c40305a5ef603e7edd6d8a8f59aa32b893f8ac9eae6bf6b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/clearcompany.mjs:204 \u00B7 providers/trakstar.mjs:187 \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/clearcompany.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5b9bbb23bb41deaac4639807e541a5a9d7b0cff6edb1781ca1669ea7eccacd"}},{"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 (8 lines \u00D7 3 locations): providers/dover.mjs:83 \u00B7 providers/flowxtra.mjs:38 \u00B7 providers/hirehive.mjs:87 \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":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b765c30164cdf97fcd24840f6b56501a9fcec5b85d9596d98b24c6a871637fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): providers/germantechjobs.mjs:104 \u00B7 providers/nodesk.mjs:88 \u00B7 providers/weworkremotely.mjs:86 \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/germantechjobs.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b260fc26b215ca62c04803f2ccbd4c18595918918feb4f0ef28df6d456be4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5 locations): providers/jibeapply.mjs:17 \u00B7 providers/neogov.mjs:29 \u00B7 providers/schoolspring.mjs:21 \u00B7 providers/thehub.mjs:37 \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/jibeapply.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c59d55763623c9550d6a95e958ddc47c74e82db3df39891665d8e18655bf00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): providers/jibeapply.mjs:41 \u00B7 providers/jobicy.mjs:97 \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":"providers/jibeapply.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0856a5dd4cf9ab53d571152b59ad08be79803c8e3f33ab0628147bec255797be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/keka.mjs:127 \u00B7 providers/platsbanken.mjs:208 \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/keka.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40742f8ea01bd67d153280fccdecfdc3bff3d25d90ad7a7c58ff01590287294"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/phenom.mjs:165 \u00B7 providers/smartrecruiters.mjs:178 \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":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"df09d4c60c26f185a909a4f23621045ba0923b0d37bf62116e0fad8530626b25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): providers/pinpoint.mjs:137 \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":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b87a87270a14c89a16dfe9311ab11f22496eb8ef09eb3ab9e3a07c29a03215"}},{"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 with local edits (8 matched lines \u00D7 2 locations): providers/rexx.mjs:139 \u00B7 providers/smartrecruiters.mjs:55 \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/rexx.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"535770b4a79046dc31b1011fe89bc0419f9e107a3cba173622be3da9eacbea32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): reserve-report-num.mjs:308 \u00B7 reserve-report-num.mjs:372 \u00B7 reserve-report-num.mjs:395 \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":308}}}],"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:1278 \u00B7 web/src/lib/core/scan.ts:107 \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":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d624250d58e41f4cf70e9ea3c3467fd30d1937ad9761af8cfd5609ca43a134fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scan.mjs:5637 \u00B7 scan.mjs:5681 \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":5637}}}],"partialFingerprints":{"codehealthFindingId/v1":"69af0f5168627354d6a541210765526cc7387d3191b3de292b5821853a43cfd7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): stats.mjs:778 \u00B7 verify-tracker-url-match.mjs:195 \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":"stats.mjs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e8080f946f700c11e282184500d8e8e9d075de824776fa638c0bb5f9959c50"}},{"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:102 \u00B7 sync-batch-input.mjs:114 \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":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3e51eeb9892a1f8d571d879a87d8052b0b39208ccc7ae5842a01d0f986ffdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:6430 \u00B7 test-all.mjs:6546 \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":6430}}}],"partialFingerprints":{"codehealthFindingId/v1":"810c3df17e5a801542ea38c84e9aef89f7d041938edd38b2b3414ab7d6894a2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:7328 \u00B7 test-all.mjs:7439 \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":7328}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac2dbe6442df4b2d39429a7cdb7724317b22548a41481e8b8b36fbfdf91d4c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:8220 \u00B7 test-all.mjs:8273 \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":8220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0fc1c1148c827d91068b2934aaf1f1cdaf068f61c641da2846d1dbe80ed25c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:14117 \u00B7 test-all.mjs:14136 \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":14117}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a0ce6cdfbe62a486783271908e2503bae95e00420d48e715c414ad07122106"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:14373 \u00B7 test-all.mjs:14529 \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":14373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d4d09316a9279a3ce1dd58e305d6725998b935692d13c6b50f3fd2c64a6e09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): test-all.mjs:14565 \u00B7 test-all.mjs:14580 \u00B7 test-all.mjs:14595 \u00B7 test-all.mjs:14610 \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":14565}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d2df7dc41db2115959ea38b3ae60e1814fe6732f2034697c9f1218bdb4f8f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:15018 \u00B7 test-all.mjs:15069 \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":15018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d250b7a225473d948495bb120d3df29a45ce276d8ed3dc4728d1183599670d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): test-all.mjs:17046 \u00B7 test-all.mjs:17110 \u00B7 test-all.mjs:17520 \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":17046}}}],"partialFingerprints":{"codehealthFindingId/v1":"c735cb6b471b465f72e77bfdd7fe33814723e2ee0d3335c1d2764201da9ded69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): test-all.mjs:18383 \u00B7 test-all.mjs:19407 \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":18383}}}],"partialFingerprints":{"codehealthFindingId/v1":"058764057388866ad58002cc0574d2df1242ebe6ca902c565a2136d12ee6b7c8"}},{"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:445 \u00B7 upgrade-tests.mjs:540 \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":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ca23ec5c4abe0d02097ae8b6088bbb8834a0f4f7fe1c82c47033191f5c9c59"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): upgrade-tests.mjs:534 \u00B7 upgrade-tests.mjs:623 \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":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"65565967bb1ed104acad49278af09c4279726f7e55acbdae9e0919ba774a7b7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): verify-cv-facts.mjs:1513 \u00B7 verify-cv-facts.mjs:2661 \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":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fadaa3751039c6bc03db3e67bd82c769f61374cb60619fe1247afe8b1051bc"}},{"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:19 \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":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad1d9bbaa7ef55c89c48fdc9d19cebe9ceb0fac046746315676d5e044c7fb53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/route.ts:41 \u00B7 web/src/app/api/memory/route.ts:9 \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/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dabb77f983eada0d8ae177e38cc9ea7c779df5d87e1ac30a9fb63fbd502fb89"}},{"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:28 \u00B7 web/src/app/api/tracker/delete/route.ts:20 \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":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"253375e42b6cd385c22167bf3067e60c2b55300bdd82c8efbf46c62e3f103e3e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/api/linkedin-import/route.ts:36 \u00B7 web/src/lib/core/pipeline.ts:102 \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/linkedin-import/route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"569c58c6487107d9a999af3346ca6e733d94c411dde07127d0e5656be6c7c934"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/profile/route.ts:68 \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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0910fc57a079dc68928a9b3462ac8421e7addbf15ef15e19277137e517c7112e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): web/src/app/api/templates/delete/route.ts:1 \u00B7 web/src/app/api/templates/duplicate/route.ts:1 \u00B7 web/src/app/api/templates/rename/route.ts:4 \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/templates/delete/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fa11b145ac7aad89c159ce33a7d38d9605c22416755125e43bff40b9faf23b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): web/src/app/api/templates/duplicate/route.ts:2 \u00B7 web/src/app/api/templates/rename/route.ts:5 \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/app/api/templates/duplicate/route.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e87d00e3c1cd61a7d264e3449b04ee50d9b0aeb49464f60043078761c43511"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/app/pipeline/compare/page.tsx:77 \u00B7 web/src/app/pipeline/compare/page.tsx:85 \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":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9dd70449473c883022ef6d9dee85410a298703929a9a441301eb287a519b78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/analytics/search-insights.tsx:139 \u00B7 web/src/components/analytics/search-insights.tsx:183 \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":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"29030e66f8aa9ce5673ae8760d4763ccc142b0dac1151bffbe92658930fa65d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/apply-checklist.tsx:316 \u00B7 web/src/components/mark-pdf-ready-button.tsx:36 \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":316}}}],"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:571 \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/explore/explore-provider.tsx:405 \u00B7 web/src/components/linkedin-paste.tsx:27 \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/explore/explore-provider.tsx"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"869a017da4760c54802e13a073be3ca7c94c60cee959ca65231e47fcc90878a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/home/onboarding-progress.tsx:108 \u00B7 web/src/components/onboarding-banner.tsx:88 \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":"web/src/components/home/onboarding-progress.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edc3fbad9f0bcec572b717bbddaabbdae5ec2026e2b640d7974a986f4bf823b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/components/inbox/inbox-triage.tsx:316 \u00B7 web/src/components/pipeline-view.tsx:579 \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/inbox/inbox-triage.tsx"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a9a897b02fbdd34023765f37c115a169e830386618d72e0e5ac4e1687d977"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/apply-checklist.mjs:58 \u00B7 web/src/lib/apply-checklist.mjs:306 \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-checklist.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdc81fafa71b6cd52dbd6e5582bbc1cc9733ec0583505d139e0ecd857091148"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/lib/apply/cover.ts:57 \u00B7 web/src/lib/cv-pdf-file.ts:48 \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/cover.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"722ac7f93430593c290b5e8687d347f348bf89426ef29f79230e5d76d4f27b1a"}},{"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 with local edits (8 matched lines \u00D7 2 locations): web/src/lib/core/pdf-index.ts:29 \u00B7 web/src/lib/core/text-key.ts:31 \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":"web/src/lib/core/pdf-index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d29a4daa416d090ac428f4144ad9a95fe380b3c377e93caedee5db2f2601b44"}},{"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/pipeline-views.mjs:130 \u00B7 web/src/lib/pipeline-views.mjs:152 \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/pipeline-views.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96da1240db28daed15ee7bad697f8c2e260a79d9f4992ffcf370cc8eb71e03f"}},{"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): add-entry.mjs:305 \u00B7 linkedin-import.mjs: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":"add-entry.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"402710ddbe84824a714ae152ac4b437e28007e815fd4eed0d954ad7b2a9c10d4"}},{"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 2 locations): browser-extract.mjs:948 \u00B7 browser-extract.mjs:988 \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":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"941401f9fcba9eaef89cbbb2fdbd78e9353bf312e6b74fad37c0a6933ed46b80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): build-cv-html.mjs:467 \u00B7 build-cv-html.mjs:514 \u00B7 build-cv-html.mjs:582 \u00B7 build-cv-html.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":"build-cv-html.mjs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fbf66328782c74c1d1100faf7049c3b9192a7fc1ad730effa5b20e081bc44f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): build-cv-latex.mjs:52 \u00B7 build-cv-latex.mjs:76 \u00B7 build-cv-latex.mjs:93 \u00B7 build-cv-latex.mjs:118 \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":52}}}],"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:576 \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:287 \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): cv-voice.mjs:193 \u00B7 cv-voice.mjs:209 \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-voice.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b612c1bcfa1f0e973c8c728719a56917326ce9ac2ba600dda921d2db00c1ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): discover-ats.mjs:1141 \u00B7 scan-ats-full.mjs:650 \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":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"166475806b20c543905dcf0b224499ab54961cb2b186e68d9f2c710d4b3e22a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): doctor.mjs:815 \u00B7 doctor.mjs:822 \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":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98b20f8cc2213d114425dc50a9a479506da4deae2e00c1d692b73e174f5456b"}},{"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:471 \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): github-evidence.mjs:1405 \u00B7 scan-topdev.mjs:658 \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":"github-evidence.mjs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"100dd9b7316646df548833fe87b11a83d664309841903ed9932090fa77fa94e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): harvest-buildlist.mjs:1438 \u00B7 rank-pipeline.mjs:646 \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":"harvest-buildlist.mjs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c53c806de3b469220c58dfdff9505272d612d8d12a942c6071f4096345e17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): himalayas-posting.mjs:97 \u00B7 himalayas-posting.mjs:117 \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":"himalayas-posting.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"91108233daa0f042955c54793d6e6fc8ed71e120ec59c6e803bbe016277efe4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): lib/context-budget.mjs:324 \u00B7 lib/context-budget.mjs:350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/context-budget.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f0200929800ae013340b8bb6680627bbccc5ab420526a96657a4fb697a4fb7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): merge-tracker.mjs:1742 \u00B7 verify-pipeline.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":"merge-tracker.mjs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6f12baa94d485122570181fa7b541b10bf80eeeb6cd595951e024c902a5a6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/4dayweek.mjs:94 \u00B7 providers/gupy.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/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:51 \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":51}}}],"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 with local edits (7 matched lines \u00D7 2 locations): providers/apple.mjs:259 \u00B7 providers/hirehive.mjs:239 \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/apple.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcad3614f77dd2357a975e17807e3740a4e6b70d44656436048f8e765a4d108"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/applicantpro.mjs:205 \u00B7 providers/eploy.mjs:165 \u00B7 providers/sitemap.mjs:299 \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/applicantpro.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8340de256766ec0a7e4620e46101275cca22f4379458b7d1e6ef84166f05ad90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/arbeitsagentur.mjs:370 \u00B7 providers/mycareersfuture.mjs:211 \u00B7 providers/vdab.mjs:311 \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/arbeitsagentur.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8489154e175a88e78987ef7d78335bdfcfc5761e0bf37ce8a7cda386f46098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): providers/builtin.mjs:218 \u00B7 scan-topdev.mjs:296 \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/builtin.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c600406ca92cc8b54287400bc3b4f02702bba1144f715c0fac9726418c968a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): providers/bulldogjob.mjs:174 \u00B7 providers/pageup.mjs:218 \u00B7 providers/radancy.mjs:332 \u00B7 providers/tes.mjs:282 \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/bulldogjob.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9040a2f83c5cc2fe180ba4a76d7a70e33fe4e04230a8c82e4d3847063aad3123"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/bulldogjob.mjs:186 \u00B7 providers/jobicy.mjs:165 \u00B7 providers/tes.mjs:297 \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/bulldogjob.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5f2a3d0ee59a7f27b92f5c3a0af708c21f81e8879db54e8f3b61a02142b710"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/dassault.mjs:172 \u00B7 providers/tkms.mjs:172 \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":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2595e501841cf942414b8f07b64184f8ff81a8e92b4b17d1efb916feffbc06d7"}},{"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:206 \u00B7 providers/workday.mjs:326 \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":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e6f4c52ec6ea4fcd440655ec2ba2f3a0dd24f07fca49e137b21c0bbd8d6b1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/hibob.mjs:105 \u00B7 providers/recruitee.mjs:359 \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/hibob.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"975cfc768d39b1c019b5116ddafdb52f436546aa1385f1af03481df81712ead4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/hibob.mjs:148 \u00B7 providers/tes.mjs:239 \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/hibob.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0664bbde9d55dd16f76166a0bf22aa0c861212cd6f4cf41a2372918cc41caa6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): providers/hirehive.mjs:204 \u00B7 providers/platsbanken.mjs:207 \u00B7 providers/recruitee.mjs:447 \u00B7 providers/remote-com.mjs:114 \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/hirehive.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e769a889420f17848ff8b75a8c0dd6c90492acdda6c77692e72d444bfe4394fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): providers/icims.mjs:32 \u00B7 providers/oraclecloud.mjs:97 \u00B7 providers/smartrecruiters.mjs:120 \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":32}}}],"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 with local edits (7 matched lines \u00D7 2 locations): providers/jobspresso.mjs:70 \u00B7 providers/pythonorg.mjs:62 \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/jobspresso.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"495bc8994a132775f64ae3c83037897d6ccc61052e9889abb9e15b43bfa2a3d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): providers/mokahr.mjs:236 \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":236}}}],"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:443 \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/pracecz.mjs:86 \u00B7 scan-seek.mjs:193 \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/pracecz.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcbe9d9a45385b1896b353c252701aef9c6db048d908fefe0219e65a624647d"}},{"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:369 \u00B7 reserve-report-num.mjs:392 \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":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcebb27cf91bb106f4ac1723d04c8f1c19af56b53fd191849c86291bc38c3a06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): reserve-report-num.mjs:135 \u00B7 verify-tracker-url-match.mjs:124 \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":"reserve-report-num.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae5d975e77b2f5dcf96c2eca2c30cce379e7cbb15950979ded3dbc3deb6e0fb"}},{"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 with local edits (7 matched lines \u00D7 2 locations): sponsor-check.mjs:772 \u00B7 stats.mjs:113 \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":"sponsor-check.mjs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc14ad67a4262e9ee4f8d6b1580276064473821dbeb23222e98938677214c1b"}},{"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:7021 \u00B7 test-all.mjs:10363 \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":7021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9afc5b6d1588da9d3c0e73c751ce179cc8ffc89aa79e22a8faa586d0b833a68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:9381 \u00B7 test-all.mjs:9501 \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":9381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c98daebea980e1449d58dfb8e1bdc4d5db1900a5df8dc27284e01fd7690a700"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): test-all.mjs:10014 \u00B7 test-all.mjs:10027 \u00B7 test-all.mjs:10129 \u00B7 test-all.mjs:10195 \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":10014}}}],"partialFingerprints":{"codehealthFindingId/v1":"359e787eb503b34bf52dea49d89495ca040bf4fa6c2e2459ffe7c3bf3305e6a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): test-all.mjs:10723 \u00B7 test-all.mjs:10777 \u00B7 test-all.mjs:17292 \u00B7 test-all.mjs:17307 \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":10723}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b154975e778f3c2e8ec0caa606b5b3074ee82fad0711e3ba605f283b855be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:14405 \u00B7 test-all.mjs:14483 \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":14405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9a7cb5da8c00aedc1b673431654dea3c6c26be56eb30667cb98a01b0494e94"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): test-all.mjs:15061 \u00B7 test-all.mjs:15071 \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":15061}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38d94038264019ef1974f05ff5d9f5a0186e2b0cf162e72e415c1b8cc73dcd9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): tracker-parse.mjs:596 \u00B7 tracker-parse.mjs:716 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"tracker-parse.mjs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf1c38d4761ec62860f055f29bba5fe2468cb49a922e038a9c47331eaa01aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): upgrade-tests.mjs:271 \u00B7 upgrade-tests.mjs:814 \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":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b29f66be4d3ac3b82e989d3e7cff3d823b1384a4e6d8b5f910c0806f5f681"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): validate-portals.mjs:691 \u00B7 weekly-digest.mjs:675 \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":691}}}],"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:37 \u00B7 web/src/app/api/keyword-match/route.ts:36 \u00B7 web/src/app/api/quiet-companies/route.ts:28 \u00B7 web/src/app/api/upskill/route.ts: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":"web/src/app/api/company-history/route.ts"},"region":{"startLine":37}}}],"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/followups/log/route.ts:46 \u00B7 web/src/app/api/profile/route.ts:68 \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 with local edits (7 matched lines \u00D7 2 locations): web/src/components/apply-view.tsx:327 \u00B7 web/src/components/explore/explore-provider.tsx:529 \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":327}}}],"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:127 \u00B7 web/src/components/explore/explore-provider.tsx:550 \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":127}}}],"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:366 \u00B7 web/src/components/inbox/inbox-triage.tsx:497 \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":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"04581c095cbe1d8b108f8bd2bd1735bc2e10d06f70238b110b93713821a268b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): web/src/components/inbox/inbox-triage.tsx:130 \u00B7 web/src/components/portals-view.tsx:37 \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":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2de760dfd3afa96e10b5165925e7c8a21842eb6d07d3c936e7a3878c9587119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/components/templates/templates-section.tsx:80 \u00B7 web/src/lib/inbox-skip-client.mjs:64 \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/templates/templates-section.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c27cdecaa13c6d704edbc0492e80b35ca92c2e893ec9146472399a79297bdf1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): web/src/components/templates/templates-section.tsx:111 \u00B7 web/src/lib/scheduled-job-client.mjs:13 \u00B7 web/src/lib/scheduled-job-client.mjs:24 \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/templates/templates-section.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2328a973f6ee20f875669fbc6ef2cb685de410e327e5cbd52e7c4b42ae6b50"}},{"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:234 \u00B7 web/src/lib/apply/session.ts:412 \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":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"feadc5cd9593b482f5e60c76993bc82ad202cc48a9a2ecd3570a8ae571e96130"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/lib/apply/session.ts:269 \u00B7 web/src/lib/apply/session.ts:288 \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":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac3646ccfce15163c4954bfb308d3db24563c984402e77c4721f2b22c855ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/lib/evaluation-gate.mjs:22 \u00B7 web/src/lib/evaluation-options.mjs:32 \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/evaluation-gate.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a1ea2223ed74114d3f2475dade801ef95ef275433bec257ea5828cf22b76e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/lib/status-save-hold.mjs:15 \u00B7 web/src/lib/status-save-hold.mjs:22 \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/status-save-hold.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3284c998eb7d2c22457ccb5e452fb78d98acccde52bfb2179dc8430cc8972f23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): add-entry.mjs:98 \u00B7 add-entry.mjs:182 \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":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd1338af22fb560e3160bf97c61c627843a1ebabbe4e649be47586faa770fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): application-answers.mjs:506 \u00B7 seeds/employers-validate.mjs:1008 \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":"application-answers.mjs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d209d1c8367b71cf25de0a87b524135773bb5bdfdee34c0e2c8dbcdc893967"}},{"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 2 locations): browser-extract.mjs:649 \u00B7 browser-extract.mjs:947 \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":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05e461c38fb6159bbd32067593e08c2afcb682051c09d86f34f73310d092bfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): build-cv-html.mjs:503 \u00B7 build-cv-html.mjs:611 \u00B7 build-cv-html.mjs:643 \u00B7 build-cv-html.mjs:677 \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":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6bae70f30501f5f530586bc2e5ec7e9f67b82c6e8d6674bbd5bfb4177783b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): build-cv-html.mjs:1530 \u00B7 build-cv-latex.mjs:430 \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":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbcf6acce0f66ed5d8608d6b743bb0630f124680e33efc7b1c8338d3b3d0d7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): calibrate.mjs:447 \u00B7 jd-skill-gap.mjs:1334 \u00B7 negotiation-roi.mjs:750 \u00B7 salary-gap.mjs:1769 \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":"calibrate.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27a4e3ea309c0e9365baac66d1bf4e77825820a189aea7e685147bacca1cb84"}},{"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:510 \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:750 \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":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810532c6e3f7544e58947683b458da7b5aae5c202bcaebbcdd2e113db363539"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): detect-reposts.mjs:997 \u00B7 weekly-digest.mjs:669 \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":"detect-reposts.mjs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3267ed769009b69103575a5817e88a91f5eb3e0a001e0ecf015e78b6dba54fc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): discover-ats.mjs:1157 \u00B7 scan-ats-full.mjs:712 \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":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9c7356d10cebe23fa7d05d06092cc5b887a7f2f6fccec2710304120ed05230"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): discover-ats.mjs:1141 \u00B7 tracker.mjs:859 \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":1141}}}],"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:309 \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:97 \u00B7 ollama-eval.mjs:61 \u00B7 openai-eval.mjs:68 \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":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1c17ee4a27f0957ece924f788be2719bd6a6c4d89e918c13a11976ff92c55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): hired-share.mjs:250 \u00B7 plugins.mjs:89 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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:36 \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":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b44c51b6817570d8fca3440f53bb76265080f213652aa2fd503f09d4c0c74a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): intake.mjs:634 \u00B7 openai-tailor.mjs:124 \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":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"712de55550fb955936ca6899afb05afa33c8bea648ebc4d15a9d99855b32f6e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): invite-match.mjs:115 \u00B7 invite-match.mjs:130 \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":"invite-match.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4403234b8f258a06405cbc02d271a7e3a70ea332248d8a924dfcd8c959ddf921"}},{"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:718 \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":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dd6102ffd0466bf6e76abba6782be091bcf5135b345cc772f93768795779ca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): keyword-match.mjs:955 \u00B7 scripts/claude-plugin-session-start.mjs:228 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b51f70dfb9b878f7c8a60eee513ed9191f92bbe3779effa60b7d097e1dc90d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/eval-evidence.mjs:279 \u00B7 lib/eval-evidence.mjs:301 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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/eval-evidence.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a358af3c3cb42de58418ddd20710bd7efe7923e97e0b1598249360ff1de61e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): lib/llm-outbound.mjs:217 \u00B7 lib/pii-interceptor.mjs:71 \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":"lib/llm-outbound.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf9f3c546bc54182df3b9a65ded9a578c3f18b92f13dc3a2a62c11cf5179f2c"}},{"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:636 \u00B7 liveness-core.mjs:675 \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":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb749b0b096b63540050204fb754f442d2009464a513b849ad7353286eb6d7f"}},{"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:279 \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:101 \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:690 \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":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df3b6640e4240b2ad6b8a180814e57c43e84a574ed68f9157f35d3ced9f050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): providers/adp-workforcenow.mjs:336 \u00B7 providers/atlassian.mjs:93 \u00B7 providers/bulldogjob.mjs:129 \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/adp-workforcenow.mjs"},"region":{"startLine":336}}}],"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: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":"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 2 locations): providers/applicantpro.mjs:312 \u00B7 providers/jazzhr.mjs:223 \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/applicantpro.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3a236f054233e657e204d818cbb2a0e1fb88907946d543d9b3a3caae7f08ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): providers/applicantpro.mjs:81 \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/applicantpro.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"752494dfe775609b20bf90789067c3345ce901c4132f0812a3b629757e676a47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): providers/applicantpro.mjs:135 \u00B7 providers/remotive.mjs:23 \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":"providers/applicantpro.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb22513e2e1cef8f61b28330d9135417b527f8463e73ef4b30531d7bb0353d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): providers/avature.mjs:246 \u00B7 providers/inrecruiting.mjs:253 \u00B7 providers/occ.mjs:252 \u00B7 providers/radancy.mjs:379 \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/avature.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c27c2e5cba6706bcd9983b742e71bf59ff97ee205a7a03f86721211c3f812c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): providers/bamboohr.mjs:217 \u00B7 providers/polymer.mjs:143 \u00B7 providers/trakstar.mjs: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":"providers/bamboohr.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2227ede912c6b842f55768cd02c242b1d0ba2ef9ca8a07981d4061e70059d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/beesite.mjs:109 \u00B7 providers/successfactors.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/beesite.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a56c74d02270306db63907bfcb091e58792b9fc5f7f2590a22f3776197c7e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/bulldogjob.mjs:133 \u00B7 providers/ultipro.mjs:251 \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/bulldogjob.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a94ad67f58ae0e424d94b81da820a41371edaa271be02f83deea6a030422f"}},{"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 3 locations): providers/consider.mjs:90 \u00B7 providers/eploy.mjs:56 \u00B7 providers/sitemap.mjs:112 \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":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"877e6849c101d4fc612ce3dd88c635a0e0bf9ce3077d332105b1d2a5d0b80873"}},{"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 with local edits (6 matched lines \u00D7 2 locations): providers/deel.mjs:46 \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/deel.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa58b5ed1c57986f8314f79e6018a2a8a9da6480f8f4da8ee5e2c3fcc478f215"}},{"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 4 locations): providers/eploy.mjs:239 \u00B7 providers/sitemap.mjs:461 \u00B7 providers/smartrecruiters.mjs:225 \u00B7 providers/vdab.mjs:297 \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/eploy.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a809478e39ba4f8d6a7e59475de12025ad398a462a85596645011305409fdad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/gem.mjs:235 \u00B7 providers/join.mjs:302 \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 (6 lines \u00D7 2 locations): providers/gupy.mjs:237 \u00B7 providers/hibob.mjs:127 \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/gupy.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8d2d683ba93eb4b5564995a0426ad99a9d3402a81b9d7b54f3cc64f76af760"}},{"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/lever.mjs:77 \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":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ddc872649b057d292ed14e9f24e6c36f954e6723a9f2ad93654b2fa8c2837"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/oraclecloud.mjs:307 \u00B7 providers/smartrecruiters.mjs:211 \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":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc69c1dcaf0281685c2df915d584731402ccad0c8c25589d16f0207bf1727353"}},{"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:88 \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/pinpoint.mjs:128 \u00B7 providers/smartrecruiters.mjs:298 \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":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5350437f44bc285c01cab2d9f609f04167b60646b878ee2611891f84a9f246"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/platsbanken.mjs:213 \u00B7 seeds/vc-portfolios.mjs:132 \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":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"258543bf5a011b97d604e3155fb3839f4f409c1c1962542bed9081a5cd42ef66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/successfactors.mjs:308 \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":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b7d78a5ed93cffda07e044c713fcbe086ce8290649d5e5dc9b994e96bb552"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/tes.mjs:286 \u00B7 providers/wp-job-manager.mjs:148 \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/tes.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3082bd36a972144023ccf1d22181daaa2db235009dc01547c671db4a39843eee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): providers/themuse.mjs:113 \u00B7 providers/wttj.mjs:129 \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:1080 \u00B7 salary-gap.mjs:1107 \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":1080}}}],"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:650 \u00B7 tracker.mjs:859 \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":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"9861ec70cee2aca3efcc1db33079dfa22df43eb677760cc628cdf355b38e496b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scan-interamt.mjs:184 \u00B7 scan-interamt.mjs:214 \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":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"564a911801401e263acbd43a22fb47017f6f68c895b740d5cbda75463736a3ab"}},{"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 with local edits (6 matched lines \u00D7 2 locations): seeds/employers-fold.mjs:280 \u00B7 seeds/employers-fold.mjs:290 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 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":"seeds/employers-fold.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b585dd172b7625d5bb25f916bcbea816f10162630e4fc319bb563ec43d96ec7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): seeds/employers-validate.mjs:417 \u00B7 seeds/employers-validate.mjs:432 \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":"seeds/employers-validate.mjs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fe74501e7975617a1f8da449230cb66ffb854470e685c14dc116c866847354"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): seeds/employers-validate.mjs:452 \u00B7 seeds/employers-validate.mjs:510 \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":"seeds/employers-validate.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30ccb9470a7f0cfb5eaae975ec79245baf36c0767f4a6b0cc69995307e1849f"}},{"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:257 \u00B7 sync-batch-input.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":"sync-batch-input.mjs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34dc456d6d79e2c73ca449274efa6811f8aae98871ec1ea1b10a72a4cdef14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): test-all.mjs:10375 \u00B7 test-all.mjs:10387 \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":10375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afec94a424bb4a2642f546cf7b529ab6449a6ff61496201b9792b7c67f75cc7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): test-all.mjs:10840 \u00B7 test-all.mjs:10882 \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":10840}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dca5274afc658c6ab653d0e9cc798644d2077b8b749ae0c4e185c5240f2b3af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): test-all.mjs:12363 \u00B7 test-all.mjs:12544 \u00B7 test-all.mjs:12692 \u00B7 test-all.mjs:12957 \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":12363}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0944538517601a47015e38c606cd046571237fae8f0888a6c82ff0e89f994d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): test-all.mjs:12429 \u00B7 test-all.mjs:12470 \u00B7 test-all.mjs:12489 \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":12429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2f4b49b1663cb3b8b35a42cc5eeeb7e0d564d98fadfad699c57b69c8c45ae8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): test-all.mjs:12631 \u00B7 test-all.mjs:13068 \u00B7 test-all.mjs:13681 \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":12631}}}],"partialFingerprints":{"codehealthFindingId/v1":"125b39fb737e040cee4807c3eb39b6a4a435749515ebe511a00628750f556c4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): test-all.mjs:16115 \u00B7 test-all.mjs:16122 \u00B7 test-all.mjs:16131 \u00B7 test-all.mjs:16138 \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":16115}}}],"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:846 \u00B7 validate-portals.mjs:691 \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":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf390ce9e3ad7b0d375d417e5d0e05c53b22cfbe80a6dfbdf7eee009a72b9edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): validate-portals.mjs:432 \u00B7 validate-portals.mjs:489 \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":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"db91d5545c3e229c078fbd49b2e5d6c71cf3e8dfc1b76affadeb33327990b08b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/app/api/apply/drive/route.ts:70 \u00B7 web/src/app/api/apply/fill/route.ts:34 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c0783227c458c893f366be7113126a4e155f45c60364a2927bcf33d6a6a6a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/route.ts:46 \u00B7 web/src/app/api/runs/save/route.ts:27 \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/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b5197272e08579b59d1d97def948b8b49d13d60dc8a1f182ed4f83bb1cb27d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/cv/route.ts:29 \u00B7 web/src/app/api/memory/route.ts:10 \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/route.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5e725d3d8b641acbfc4e3763dc342f39005acc60d6bed1ae1ae962a29fce4a"}},{"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:47 \u00B7 web/src/app/api/inbox/skip/route.ts:28 \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/explore/ai/route.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"36725f9688fade3f47f8d760bb9ebb57f331f1ff1f7dfd99df6ce987bba5b05f"}},{"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:49 \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":49}}}],"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:47 \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":47}}}],"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:20 \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:28 \u00B7 web/src/app/api/runs/save/route.ts:22 \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":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce273d59c9da345b35864b58ab7af17934ca4892353f7928721f3e5b66779176"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/app/api/memory/route.ts:15 \u00B7 web/src/app/api/runs/save/route.ts:26 \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":"web/src/app/api/memory/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad5f026fd1418b83e53482ddcd40682484768ad0bfff97a80dd6937ada9a791"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/app/api/quiet-companies/route.ts:6 \u00B7 web/src/app/api/upskill/route.ts:6 \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":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"68073097d72f5f6501de824cf8da3b4ab4edf863598f97aadbceb1334fb2b782"}},{"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:17 \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 with local edits (6 matched lines \u00D7 2 locations): web/src/components/cv-editor.tsx:111 \u00B7 web/src/components/cv/cv-ingest.tsx:56 \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/cv-editor.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b051e321729ad873793077a4aef77ea10c04f618648625e481ee5e5cc1d717"}},{"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 (6 lines \u00D7 2 locations): web/src/components/templates/template-editor.tsx:54 \u00B7 web/src/components/templates/templates-section.tsx: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/components/templates/template-editor.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5438050bcbdfbcf055b7ed5e6aa0bedb19041ae716c4e2a4bf2750695f1a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/lib/apply/cv.ts:34 \u00B7 web/src/lib/cv-studio/server.ts:67 \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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25103f2d0e6a21e7286d5b29f840471b7d6345f828c0725c7ea084d7f43933c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/lib/template-edit.mjs:19 \u00B7 web/src/lib/template-files.mjs:23 \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/lib/template-edit.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"683b5f45726d122a1ede6f8f02db2f83fc411c25fbd7c856c21042e10b1a5e1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:317 \u00B7 upskill.mjs:284 \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":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa30da28a554bec7df9a27444d6baeccaa42f787bfd1efba2834698f46f7c4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:1109 \u00B7 analyze-patterns.mjs:1118 \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":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc59c0852825defce758f3a7e7bfc61c6e937e79a5e1269f108acbb1ceb5f083"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): analyze-patterns.mjs:1132 \u00B7 analyze-patterns.mjs:1141 \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":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"facaba23279698f027ecc571d8ff5a490e0c021eac7e83109e88a8aff307175b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): archive-posting.mjs:559 \u00B7 plugins.mjs:729 \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":559}}}],"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:163 \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:1237 \u00B7 discover-ats.mjs:1128 \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 (5 lines \u00D7 2 locations): browser-extract.mjs:236 \u00B7 browser-extract.mjs:688 \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":"browser-extract.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc33857f53aa3fe1469185681962b6b3aaa4cf77a2eeb47c451229dd1e6a690d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browser-extract.mjs:454 \u00B7 browser-extract.mjs:546 \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":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5180e55693e520c2d8f9f5d1e1ae4708cf7784d6a8a8835b56ade32f6195239"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): browser-extract.mjs:610 \u00B7 browser-extract.mjs:904 \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":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd0ac3afa4e7b1dc4193d62efd39b72e4acec8db51b817df222db1806cda19e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): browser-extract.mjs:524 \u00B7 providers/lever.mjs:104 \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":524}}}],"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:856 \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:241 \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 (5 lines \u00D7 2 locations): harvest-buildlist.mjs:190 \u00B7 harvest-buildlist.mjs:199 \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":"harvest-buildlist.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c849b8f7a26f4e124c13941ed665b942fedf8c6b46fcfd5c8e4629e7e33e9d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): hired-share.mjs:366 \u00B7 hired-wall-build.mjs:269 \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":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"90293574641337a536bbb0ea284581fd35f9eafd17c0c5178001b7d247a8cb1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): i18n-drift.mjs:117 \u00B7 i18n-drift.mjs:132 \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":117}}}],"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:3797 \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 2 locations): lib/linkedin-url.mjs:51 \u00B7 url-key.mjs:153 \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/linkedin-url.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be152d95363aebcbc75c803f88cdb8337cf414907f02b07c432dca21016a24d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): liveness-api.mjs:136 \u00B7 liveness-api.mjs:165 \u00B7 liveness-api.mjs:286 \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":136}}}],"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:467 \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): plugins.mjs:238 \u00B7 plugins.mjs:548 \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":"plugins.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51d818d5da40874b740372775e54397b61d962ebeac15adfa6b31d699cc504f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): prepare-application.mjs:122 \u00B7 prepare-application.mjs:128 \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":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"815487ccab40cc5e830d6c14b34126ce90a3b12e9723bbffac82bb04d4bb056e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/_http-cache.mjs:16 \u00B7 providers/_http.mjs:56 \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-cache.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941425a74fbc34456b2052d527fdd767d5953f3ba40c2ae47e02e13baf40606"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): providers/applicantpro.mjs:247 \u00B7 providers/eploy.mjs:182 \u00B7 providers/sitemap.mjs:316 \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/applicantpro.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"08671120300714f835b6024c51ddfc669cbdcf923cca4870ffc0c10c6f2786a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/ashby.mjs:398 \u00B7 providers/ashby.mjs:423 \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":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba8069cf2415fcac26fa3e2b92c7f335247a3670d879e17b4e3563e1fea2f4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/ashby.mjs:598 \u00B7 providers/lever.mjs:305 \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":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc7b8d5b67b083bcd81343a775bfaa84bcc5ee3ccba48e701c61774183df53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/breezy.mjs:127 \u00B7 providers/comeet.mjs:119 \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/breezy.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab1b4de656b81cc6dd3668958547f68a02333c6479e31b9776ce2baa7e32282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): providers/lever.mjs:156 \u00B7 providers/recruitee.mjs:363 \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/lever.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7e958f034cfe3789aa534853007a88005d3cd9efc18a82c3ade84b1d0d644e"}},{"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): providers/rexx.mjs:127 \u00B7 providers/successfactors.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/rexx.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97860803c4b5cf066a0b38eeff259703a4b01d00de8eb1163e1ccd0ef7c586c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): reconcile-pipeline.mjs:243 \u00B7 sync-batch-input.mjs:237 \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":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e28ceade001c90724c6326d0cd5482f20a55553e6978710e8ebe783f86d236"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): salary-gap.mjs:919 \u00B7 salary-gap.mjs:930 \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":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8071af73b58cda0354daa6b6b6f18f78d52eac7304bcd1025308c405c5b71f38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scan.mjs:4723 \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":4723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac88c56568e8490915f80b61fb529e8fde498d713b548a9ce6a31ba0f0837b5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): seeds/employers-inbox.mjs:59 \u00B7 weekly-digest.mjs:63 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-inbox.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f12f2565c72077b6eefb596528b4c6aeb3dd73da19a55dbb5901527ef9f283b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): story-provenance-check.mjs:723 \u00B7 tracker-sync-check.mjs:75 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"story-provenance-check.mjs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ba38c288ca406a661d3f819cd3ac6f9d0058c21fc604d1e8486e722b536509"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:1660 \u00B7 test-all.mjs:1674 \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":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf5693e762d335422706320a0e17c98617340f295a45f0eea553d499a3aba3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:3969 \u00B7 test-all.mjs:19205 \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":3969}}}],"partialFingerprints":{"codehealthFindingId/v1":"8194e6a78e9ed9f58c3f578051c750454beab9db45da8d6446122271e4616a1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:4058 \u00B7 test-all.mjs:4529 \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":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafb840dce9e43cecb3d541520d51b430f79e441409d10b26b23378f84450243"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): test-all.mjs:4127 \u00B7 test-all.mjs:4265 \u00B7 test-all.mjs:4316 \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":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24097da2cea7997f3f933da7a36e4c5ae24c45d532892ca9a1dd7a3aa8b92e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:4165 \u00B7 test-all.mjs:4279 \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":4165}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c294c6fd58ccd296c7af31f456d4939cbcd543a569a5e540132457a55d6fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): test-all.mjs:4530 \u00B7 test-all.mjs:19088 \u00B7 test-all.mjs:19207 \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":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd80c2d8801d31760c2234f992cd68bfc80a563785aa42c78be0ad5fe8874688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): test-all.mjs:14386 \u00B7 test-all.mjs:14453 \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":14386}}}],"partialFingerprints":{"codehealthFindingId/v1":"579094cc8b44dd478ede740335869ea2026f5bf54a3ac0195edc9a6ddc543946"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5 locations): test-all.mjs:14552 \u00B7 test-all.mjs:14568 \u00B7 test-all.mjs:14583 \u00B7 test-all.mjs:14598 \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":14552}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3a94d0b058612e5bb8be233aba07ba17f7dac2dcc667001a58f9e55c7f15c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): upgrade-tests.mjs:324 \u00B7 upgrade-tests.mjs:345 \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":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8d93b86be05dcd0a53468bdd0c25b0119467c1f9a0c0dbb448a78343ac44df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): upgrade-tests.mjs:428 \u00B7 upgrade-tests.mjs:580 \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":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe93b315000bb4e5c6f4be7aed17cee25e752d13eab9cb5be3a03fea9b6297"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): verify-cv-structure.mjs:148 \u00B7 verify-pipeline.mjs:255 \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-structure.mjs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d31431f90029def8cd9ac34cf7fe97837f09cfa37c5eeafa05e4f2c505b7ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): verify-portals.mjs:763 \u00B7 verify-portals.mjs:1153 \u2014 the two spans are one implementation copied and then locally edited \u2014 53 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"95783ba25da63b353a39f2789b4548148290c01e28efa420a1a4641572c3012d"}},{"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:9 \u00B7 web/src/app/api/apply/fill/route.ts:8 \u00B7 web/src/app/api/apply/prefill/route.ts:14 \u00B7 web/src/app/api/apply/session/route.ts:8 \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":9}}}],"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:8 \u00B7 web/src/app/api/run/route.ts:37 \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]/route.ts:28 \u00B7 web/src/app/api/cv/route.ts:31 \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/cv-studio/[n]/route.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a54cd0859debfc5654697b522403a613ce59bbb057373da4aeae5f9428af161"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/cv-studio/[n]/route.ts:28 \u00B7 web/src/app/api/inbox/skip/route.ts:30 \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":"web/src/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a441c8bcb77ffbb1ef7955e7742ab4ede99cb4d549e6da7cea273db4341369"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/app/api/cv/route.ts:31 \u00B7 web/src/app/api/inbox/skip/route.ts:30 \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/cv/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c697a3b90142fb7851ac289d5608900c076c0fd006538c2a175f54b14dcd5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/app/api/followups/cadence/route.ts:219 \u00B7 web/src/app/api/portals/route.ts:48 \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":219}}}],"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:30 \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":30}}}],"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:62 \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:22 \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 2 locations): web/src/app/api/templates/default/route.ts:19 \u00B7 web/src/app/api/templates/route.ts:13 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/templates/default/route.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2d94d25552e9d06d88d31c77f3293f4b59a8e6ede8226c7d9b2953b2a7ae88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/app/api/templates/file/route.ts:34 \u00B7 web/src/app/api/templates/manage.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/templates/file/route.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8362e2bfa7ea11bdc85b607fea1a32230677346f98e466510d42fdda0d85443e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/app/scheduled-scans/loading.tsx:16 \u00B7 web/src/app/scheduled-scans/loading.tsx:21 \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/scheduled-scans/loading.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc4e50e23b7be7b60af0bf3517ab4d76340983c04cac4062d32c59175afd620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/assistant-console.tsx:371 \u00B7 web/src/components/assistant-console.tsx:405 \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":371}}}],"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:655 \u00B7 web/src/components/assistant-console.tsx:802 \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":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce5edd3e3049f4b47ae3b38108f7bccdc4b910c510ac7ecb2bd9d047cc83fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/followups/cadence-settings.tsx:85 \u00B7 web/src/components/followups/cadence-settings.tsx:115 \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/followups/cadence-settings.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a8fbb8cca6fd57873e11c629f2504e36477847102607cd856171d4071978a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/followups/followups-view.tsx:173 \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":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c89a7e996d757cd78c067c2f8744826ad211896bad63b2639b5fa2b6345a9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/components/home/today-dashboard.tsx:48 \u00B7 web/src/components/home/today-dashboard.tsx:54 \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":48}}}],"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":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/src/lib/template-gallery.mjs:54 \u00B7 web/src/lib/template-gallery.mjs:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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/template-gallery.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b6f55e666c093605933aa9dfdb080d4cd87f04163478d7578189fdbb5d9e0f"}},{"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:4265 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":4265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44b5ddf6c81a78bd573d9c69f62efccf6f3c0de0c38988f4dcdc2c2f408fc13"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: update-system.mjs:5384 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":5384}}}],"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/scripts/scheduled-jobs-runner.mjs:18 reaches into another package with a relative path (../../lib/linkedin-auto.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d5dcc669f9ab2153fdd5bbfb54b6879040721b845d6023803700263f0e4f6d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: web/scripts/web-service.mjs:19 reaches into another package with a relative path (../../lib/walk-tree.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/web-service.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee27bb2165080f40fdd31a8a5d3fd51b5cbb6c4b88b0809e54f5efe764972a45"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: web/scripts/web-service.mjs:20 reaches into another package with a relative path (../../path-resolver.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/web-service.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d340957513e3cc8555311074301c8f8b1c9326d1ce2409d39a63eb8315cff9"}},{"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 235, cognitive 346): main has cyclomatic complexity 235 and cognitive complexity 346; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":4672}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4406ceb9a9f34cc77fb33c69869db5501b822b5abe38a4b6880616109fba7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeUnderLock (cyclomatic 143, cognitive 252): mergeUnderLock has cyclomatic complexity 143 and cognitive complexity 252; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e8e07d240955d5b1d70ae2bc3b9b77294f184ceaa14e5cfbc978055caa7c0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 124, cognitive 151): runSelfTest has cyclomatic complexity 124 and cognitive complexity 151; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed053634ffd1ef990ccd65644d984cb6756dead4d7a98c6f224f4f8bd19b585d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRegistry (cyclomatic 123, cognitive 251): validateRegistry has cyclomatic complexity 123 and cognitive complexity 251; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"842e5be1ffe06c8d63abc7de52910666cd8e7870a2e03ea7283f461f923e1d32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 123, cognitive 185): main has cyclomatic complexity 123 and cognitive complexity 185; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0877a5d30841af3fbf63812e2d1e3f80750d7e67a9c84b2732acb67ec6496b84"}},{"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":4749}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af0d876b5e42deda17825c82d197e91e7d902fcd3729a595a71f22f932fcf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanHtml (cyclomatic 87, cognitive 168): scanHtml has cyclomatic complexity 87 and cognitive complexity 168; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a91496a64e951c5bbad85b58f541e983f07e14928d1360ee24a2a89d9963e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePortalsConfig (cyclomatic 80, cognitive 198): validatePortalsConfig has cyclomatic complexity 80 and cognitive complexity 198; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a8fc3fccac415a52a3a7de38983d03470ad88cd425cdecef0b939f97bf77db"}},{"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":1199}}}],"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":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2f7903c790f9ecb99351a6cac5171e65781c330e06ef2c892064591024c929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locallyModifiedSystemFiles (cyclomatic 70, cognitive 190): locallyModifiedSystemFiles has cyclomatic complexity 70 and cognitive complexity 190; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f4ce8917f6e55475414fbfe3bfe5ce03adb88b798c447aae58cb73cfdbd8ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 68, cognitive 69): (anonymous) has cyclomatic complexity 68 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1101d6d97a7f12675eb8fe333eab76cc879a92ab5f1bb50e9be77396077d0bd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processJobs (cyclomatic 65, cognitive 135): processJobs has cyclomatic complexity 65 and cognitive complexity 135; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":5229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2ca131efbe391553f81e1184bfcfe28ec5939c7f8a0c908ec001331a30d968"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PipelineView (cyclomatic 65, cognitive 56): PipelineView has cyclomatic complexity 65 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 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/pipeline-view.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a842d1d861962ff696a6311b2d27cbb446eca0335836d06ba329d816242942f"}},{"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 openSession (cyclomatic 58, cognitive 93): openSession has cyclomatic complexity 58 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/apply/session.ts"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c71aef4446175c8e964ffe2968702e22dac95620c2830559e50a5fd904669"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 56, cognitive 101): main has cyclomatic complexity 56 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":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1238825844d6ea4435e88cc1f2d8ab9d871105cf0eb66f4481b788bfdab3a7bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diagnose (cyclomatic 54, cognitive 87): diagnose has cyclomatic complexity 54 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0a8596b152376ed80d7f6c38e762bb448ff645785ee7e6e0988500e9d0b84a"}},{"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":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad829f564f3564207b13b2e3b78eb457c39f0daead8a15d1c7f05fd4f0cdb332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAnswers (cyclomatic 54, cognitive 54): normalizeAnswers has cyclomatic complexity 54 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1e55be43b59d021fd55a0134d12c6250e258c632acbc5aa42ba25d27b80600"}},{"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":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2605671fb5edb13ef473326def124d46d65940c4f7981117473e49e959456ed1"}},{"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":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"852942255e23b1e76eac8d47e64b33b56353b4281822087cb00a47bb5a1fc550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 51, cognitive 55): POST has cyclomatic complexity 51 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2792ff307723bbcb9ca60a152a9397c4211e27b8e9b81546c61eb1dbc2edaaf"}},{"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":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c172039c1a0a4bb45d7e6cf8c2d61b48225193878b182ab0577298270b2090"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatePDF (cyclomatic 50, cognitive 58): generatePDF 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":"generate-pdf.mjs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"203b8399a5e468e776c64f620806d69199b3f04efdab78bf80bafb3e391e6286"}},{"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":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"38210752f3aebf2062f8692ed00a141851f879bb41cef32fae9b3c582a25179d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyReply (cyclomatic 49, cognitive 40): classifyReply has cyclomatic complexity 49 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"reply-matcher.mjs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cf0942f2d0528c643d803f064dd936d57d54bcfe92ac510396f7a833ef547e"}},{"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":27}}}],"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":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f07d44d0cc459f7826b7b745892a8f597fcdb31f7792f37f289f37f4b9bc8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchedUrls (cyclomatic 45, cognitive 57): fetchedUrls has cyclomatic complexity 45 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fd888c4a14ebe7ef47417bb14050728344f5ee5b3c48ac60de8a7b91a5da6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 45, cognitive 50): runSelfTest has cyclomatic complexity 45 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"815ceffc6b92bd2a9a775b6795a4c5386f91ec1a58741c328a52093d51e921eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 44, cognitive 72): fetch has cyclomatic complexity 44 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getro.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15cb620246e897a1efb6cbab09435e15f44a891dccc2bce2b64c208a15d90a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 43, cognitive 79): fetch has cyclomatic complexity 43 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dd4fe8c5fd9cc34179bba3e9b59cba037c185d4bd78033202ab7f951fcc373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 43, cognitive 69): printSummary has cyclomatic complexity 43 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdb1d79aa80c464af99fe17d756865772bdcbbc6b3deccaeb1600cfea3e5396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCandidates (cyclomatic 43, cognitive 65): matchCandidates has cyclomatic complexity 43 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":"reply-matcher.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"829f719ca8e128979a682b0615ddcdf923afa09e3ce5750460fcfa218d4ebfb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 42, cognitive 89): printSummary has cyclomatic complexity 42 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"574d28aee28e7a3eeae01a1864d57315eb032e86a50385bf8b7cfe449317a77d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 42, cognitive 88): fetch has cyclomatic complexity 42 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"257e6293593d5e7a88245eb036f1a4d67a3e8b1b74cc150417868c1a1656e43c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cssRequestUrls (cyclomatic 42, cognitive 82): cssRequestUrls has cyclomatic complexity 42 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b97a5e11a8f936b9a884eeb4800921e5c02e00bdc466b9d3cc7ffa5a7d2d1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cssDeclarations (cyclomatic 42, cognitive 68): cssDeclarations has cyclomatic complexity 42 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"86968d91820a081b4bcee86b5a479929a66ef4f491e92bf315dd7970a64e81e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 42, cognitive 49): main has cyclomatic complexity 42 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-latex.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7fe1266195e4f9c89349c6b008474367575dc7b379b46743ec79e16f1506e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeProfile (cyclomatic 42, cognitive 32): normalizeProfile has cyclomatic complexity 42 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"323ff43b200ac1fed5c3ca6ecdb258f0bcf7a7bfefaa8cb62492dde296890093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchCsb (cyclomatic 41, cognitive 111): fetchCsb has cyclomatic complexity 41 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bdbd181ad834a095484ee958016ae56fdbd8e85f0895d14d45350604645143"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fillSession (cyclomatic 41, cognitive 102): fillSession has cyclomatic complexity 41 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":"web/src/lib/apply/session.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d699b048fe17ac1c6d90a5502ee0c822e2ea0fb06affce4c16fa5b34232bec31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeMask (cyclomatic 41, cognitive 95): codeMask has cyclomatic complexity 41 and cognitive complexity 95; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/helpers.mjs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"104b0d8bd15e38d34fc3a09582e1b1799addb9e0b03212057f8f2ec9562eef2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCvMarkdown (cyclomatic 41, cognitive 85): parseCvMarkdown has cyclomatic complexity 41 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cee06b384ab26e18b668aa8788a30a380e498e93b7df7446e389b9c7e456b78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lookupSponsor (cyclomatic 41, cognitive 59): lookupSponsor has cyclomatic complexity 41 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":"sponsor-check.mjs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc734e09905c6fa52725b779e1bc1a389a48b039d34bbfdeb07046a081c8a7ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 41, cognitive 54): runSelfTest has cyclomatic complexity 41 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac977402a855dae7c055252c9927f1668c76cd0f861880922d30910f6382a48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIcs (cyclomatic 41, cognitive 44): parseIcs has cyclomatic complexity 41 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d073d7d34f00f1898991daee314498371f10e7293f0130b9399147852122bcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inviteEvidence (cyclomatic 41, cognitive 35): inviteEvidence has cyclomatic complexity 41 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"lib/invite-evidence.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4fca6313bafe5c0e0ec6dc89a326933376599bf1627e7721bf76885a7e4e46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computePortalRecommendations (cyclomatic 40, cognitive 44): computePortalRecommendations has cyclomatic complexity 40 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff9c8469210740fa42c45c3bee5c21a818bda8081564e765258dce036fbc6ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 40, cognitive 43): (top-level) has cyclomatic complexity 40 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/title-fit.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8fb508137c5751b3a81c72aa2a6d5b0aa88a15fa1c47da623b38ce068e4626"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AssistantConsole (cyclomatic 40, cognitive 29): AssistantConsole has cyclomatic complexity 40 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a285d419ead7c52d2db0d77887b1773bb96e0488a28c1dee4db24744e8a0e2b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 39, cognitive 84): fetch has cyclomatic complexity 39 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitsagentur.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"03520cb169ac56618dfb2ee293dbe0a2691c167b7f4854eda21cad16ce9f259d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuredAssociationClaims (cyclomatic 39, cognitive 70): structuredAssociationClaims has cyclomatic complexity 39 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a538c19a521d96a8de24a2d88b9f0464443f517a70a27ae61a549d6ed6f0b415"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapTrackerToApps (cyclomatic 39, cognitive 68): mapTrackerToApps has cyclomatic complexity 39 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d84247b3b142d1584d47d4cf999f37d8b7484d1c7e93ae27627322ea985f07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rollback (cyclomatic 39, cognitive 65): rollback has cyclomatic complexity 39 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":"update-system.mjs"},"region":{"startLine":5787}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc735cad25ab912acfa98d190c75f0c7ff65b04d72ff7cfd8ef4c7571de19ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 39, cognitive 62): fetch has cyclomatic complexity 39 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48310e0788156d4aed0d36361b35c6e88695da0313a0855ce7bb37c5df325c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkMainChannel (cyclomatic 39, cognitive 57): checkMainChannel has cyclomatic complexity 39 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c179ecf90a230414bbaaf8230138aa3519d7f26b824e61a4966efd13c1198d13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcile (cyclomatic 39, cognitive 56): reconcile has cyclomatic complexity 39 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":"reconcile-pipeline.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ec7707b0292be9d72bc922ff816ec8e4d7274bea51fe82d1cfdb9f2b704710"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 39, cognitive 51): fetch has cyclomatic complexity 39 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/trakstar.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e59841dd00237746747848b2435b4395ebd3140ccd74f48b1fe8ff3074391"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestProblems (cyclomatic 39, cognitive 50): manifestProblems has cyclomatic complexity 39 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfc548d20fc90e7300f296a0ec814f7ff88145a9cc08d1ce04a73ad73dad65c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ApplyView (cyclomatic 39, cognitive 39): ApplyView has cyclomatic complexity 39 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5421742e40918d5ed3bdc086f502f8ddfa44fdf65acd55751449dbd85d046b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paintContent (cyclomatic 38, cognitive 76): paintContent has cyclomatic complexity 38 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5f9141e6494a64383cb0208851d51fb8acabda6aac602bc436575287feb8c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 50): (anonymous) has cyclomatic complexity 38 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bc06df4a51d83ea1bcd47315a46ed7bfc8cb6c6345c81fc6bb61e7d31d57c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBatchFromManifest (cyclomatic 38, cognitive 48): runBatchFromManifest has cyclomatic complexity 38 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"071970afe3f0f8ffa58bbc31f255dc05fb7e7f4c2b88e6ef1645c186e1bf5f10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDocuments (cyclomatic 37, cognitive 66): collectDocuments has cyclomatic complexity 37 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff721f0b410bc1def6874bc2b04ace014c6c35fbda9e08ac7708309626068f85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 37, cognitive 66): fetch has cyclomatic complexity 37 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cd91771e1fd76c7ded29c5910202910b89a6b5246f5f04c98de9e695bf2335"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdRun (cyclomatic 37, cognitive 62): cmdRun has cyclomatic complexity 37 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f2ec805226289fa68ea4032a4614cb4d658aaf0c2c19984d7962000eb3fdef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 37, cognitive 52): fetch has cyclomatic complexity 37 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/aldi-nord.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bada25ecd8a8068cf35519712ff3cd897f50e3fea06aba18962663999ab56840"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCompany (cyclomatic 37, cognitive 49): resolveCompany has cyclomatic complexity 37 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05ad7bd17efbc8449c3e7e3c861469827b712259b526391352ce0ae99b0f8f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 37, cognitive 47): main has cyclomatic complexity 37 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contact-extract.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d901e6b2ec4b42c4f34e0628ff700f7adb8421ce608f07ebb4e38aa81bc4b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeEvaluationArtifacts (cyclomatic 37, cognitive 39): writeEvaluationArtifacts has cyclomatic complexity 37 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"persist-evaluation-report.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"94651b1636063b14d97d4b15c7a03108785f9b82e329cccf0c2757848811bd37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 36, cognitive 75): fetch has cyclomatic complexity 36 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"af159732b4f13746ff678af01116eee5471a1d56908d7c107bc1130d4580e999"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 36, cognitive 68): main has cyclomatic complexity 36 and cognitive complexity 68; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cea7e6c359c6deb5ce911e85028596087c253ebbcbef56bcaadfe2257cf776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 36, cognitive 63): fetch has cyclomatic complexity 36 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-myjobs.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea66eecd958865978c49f7cdb7af369baffe6550b6d64b35f8fd01d797648eb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeTag (cyclomatic 36, cognitive 58): tokenizeTag has cyclomatic complexity 36 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":"cv-templates.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8e099ec4a7118e413e08af562e911379befeb27277e7a9dee8ee9dd056f0aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getOmpEffectivePlaywright (cyclomatic 36, cognitive 58): getOmpEffectivePlaywright has cyclomatic complexity 36 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":"doctor.mjs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"beae9ac68c7c3520f6dbec899f5b880772a0524f839a0964eeeb4d3b1d4eb10f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 36, cognitive 52): (top-level) has cyclomatic complexity 36 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/comeet.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1efffa3fdd78116ce71d04087fd6ddab6554b294d5a388369fcebd9234a471d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function employerName (cyclomatic 36, cognitive 39): employerName has cyclomatic complexity 36 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a91491b9e9e9e7e983d9d204d9e4749b1f67dde4de582d4f597a03585dbaf6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TodayDashboard (cyclomatic 36, cognitive 30): TodayDashboard has cyclomatic complexity 36 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/today-dashboard.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bb74c9d2f3b393b696ef0714ec610922bf79d1c089b9a644a0aadbeb0c8546"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRegistry (cyclomatic 35, cognitive 76): readRegistry has cyclomatic complexity 35 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de4018c98f3e955d211a463b283b51ad69ac5e1d2628c8ab5a69f9a4fbbd03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripNonCode (cyclomatic 35, cognitive 69): stripNonCode has cyclomatic complexity 35 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/walk-tree.test.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"87282a33f9417f7011342f4ad4395f8ef7628b5c7bd9d7820c6c1a4bb7d4ef3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 35, cognitive 61): fetch has cyclomatic complexity 35 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"66341c9b5e0f43b9d1fc8180a8130aa4013803a9a22d4e344680997cf1adeb3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 35, cognitive 48): runCli has cyclomatic complexity 35 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-structure.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe01cf6671149e34b0810ec1df841ac8ab5abb85c152457940de555bf556a35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCompanyCards (cyclomatic 35, cognitive 45): buildCompanyCards has cyclomatic complexity 35 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82662a95b5083fb2dd5f8b90e8bf0222a1724b4fc84af6fc9df3b3a0b03d7d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCoords (cyclomatic 35, cognitive 43): readCoords has cyclomatic complexity 35 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-import.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1294a61c525f4c7a0ee709e10a86401897a0a45c8b906889ebeacc37f74de931"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runLeg (cyclomatic 35, cognitive 41): runLeg has cyclomatic complexity 35 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upgrade-tests.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f9ace7f4181d76618714afa0223c20c68a43ec6fa9d32e906f29f211f0269"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WorkerCard (cyclomatic 35, cognitive 34): WorkerCard has cyclomatic complexity 35 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/worker-card.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb16fda2431b7f4d0692a40129e04c64610a931b2d610b9df2b68de31e7202b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DiscoveryCard (cyclomatic 35, cognitive 32): DiscoveryCard has cyclomatic complexity 35 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/discovery-card.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc2f4069d5501756b7bcf2ba0d16c95a155a0f80f012f0ce01f18f52c553066"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanBoard (cyclomatic 34, cognitive 48): scanBoard has cyclomatic complexity 34 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-dayforce.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffa276d861234f4fa83cfc2f002a5967658c5ee13758c80f8014ad16b7423cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 34, cognitive 46): fetch has cyclomatic complexity 34 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobstreet.mjs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc67d0060237d83d55ef3d29cb9dc179441c3b5f20fbec987dfc149c15a6207"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 34, cognitive 41): analyze has cyclomatic complexity 34 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cd247a7ae329495162f96158d4efa9a814e6745609a71f8777527eb4e482b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function persistEvaluation (cyclomatic 34, cognitive 36): persistEvaluation has cyclomatic complexity 34 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"978a25536acce69c947ba16e1ff23850659db9c7b9c3ce4f3d7da41a2d3596b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCompensation (cyclomatic 34, cognitive 35): parseCompensation has cyclomatic complexity 34 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca0526e58dcc0598595cd1a7faca02865bb425f135f964f8b2f9124c8ec93e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWttjHit (cyclomatic 34, cognitive 32): normalizeWttjHit has cyclomatic complexity 34 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/wttj.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec424dbdf5781d79140ab6aa24971668c6e213a5b0899d3d37b43bff15f62eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyHimalayasPosting (cyclomatic 34, cognitive 24): classifyHimalayasPosting has cyclomatic complexity 34 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"himalayas-posting.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e57d8a06d4dda607490ad2207c4a8ce9cc51e5dd94790f779859464066c89f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 33, cognitive 79): fetch has cyclomatic complexity 33 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/occ.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"209eb65f4e103998679ff6449f8c66743a84582da18bfaa3114a8e4898655608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractPanelists (cyclomatic 33, cognitive 56): extractPanelists has cyclomatic complexity 33 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":"panelist-roles.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ecc3a6f95202b358ed159fd72a3bc271378b3c957eba6ff7cf3e39b9c5ae0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 33, cognitive 48): fetch has cyclomatic complexity 33 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d3236aa7e53c02f45a3f0ee43fe5e9eb2fa6e7b476117c6bea3c407b75d1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 33, cognitive 47): fetch has cyclomatic complexity 33 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ca17f81e918b43b3bca49db09fc2b5c061f28c79b214088e3a9d6139814a57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 33, cognitive 41): (anonymous) has cyclomatic complexity 33 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f9bf0f09407d2b47da643e7b1017b74e243fa54515d47db02e1556a7c28e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeProfile (cyclomatic 33, cognitive 30): normalizeProfile has cyclomatic complexity 33 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6913c02680a6427b6ecaaca7bccd51a0a1770459c815d18c91a794a60e657a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 32, cognitive 84): main has cyclomatic complexity 32 and cognitive complexity 84; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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-topdev.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6b565e5668b3c653870801add3ea221fb76388ba904b6767f6325548a3a53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsComments (cyclomatic 32, cognitive 73): stripJsComments has cyclomatic complexity 32 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":17567}}}],"partialFingerprints":{"codehealthFindingId/v1":"459412e67d84b09cfc7e34ba3f6cf591c0105156d85130c474a031a04700c178"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codeOnly (cyclomatic 32, cognitive 66): codeOnly has cyclomatic complexity 32 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/nonzero-exit-guard.test.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fcbf0dd2fdbf66833aa366e548845682819b96a7efca1ccdaba0d5eb6043a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callOpenRouter (cyclomatic 32, cognitive 57): callOpenRouter has cyclomatic complexity 32 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5b9d197b40ddcdb931e6439acf07d32c41031e0be24ed9b68a07cd03ac94fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importUnlocked (cyclomatic 32, cognitive 50): importUnlocked has cyclomatic complexity 32 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-mail-drop.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90e894f2d78cca864cd43ed03b159bb780c21a4349302ef3bd50489b2b37ed8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 32, cognitive 48): fetch has cyclomatic complexity 32 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"527ef509a1c118eede312df8d8e68f79710a502e7213ece26eb2cdd1c50b8662"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditAts (cyclomatic 32, cognitive 46): auditAts has cyclomatic complexity 32 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f5014400db45a9d28d422c222a244dd90986806abf5e0031f3441fc97a70c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 32, cognitive 44): send has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b55e0d713d69a757a850b25a0f8234db1e0ba4bbbb63c4076ef1645dfbabc5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 32, cognitive 43): main has cyclomatic complexity 32 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8246c24506e109c1af1342d6f7f952935e07c93f804cde1cf080e83399a107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 32, cognitive 42): (top-level) has cyclomatic complexity 32 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-locked-sections.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"685cd4472c716d8a898a5e67467d1a3d5a1ab00a32d9cc2a4070b68f7448cf13"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 32, cognitive 41): add has cyclomatic complexity 32 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"895a71aa79537d4f35818078bbb0137018b36fec69b0a8b47d1f4682f680dd56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 32, cognitive 41): main has cyclomatic complexity 32 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rank-pipeline.mjs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e94ef0ce20b4ca2b951d619937a29e6b66f8bc450f9235c8938e54e7c733a3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeAction (cyclomatic 32, cognitive 40): executeAction has cyclomatic complexity 32 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive-action.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11c8f66830cc6ec08cbf2e516f700596fe2ace8f9a0e3167a98980c67726d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editorReducer (cyclomatic 32, cognitive 40): editorReducer has cyclomatic complexity 32 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-editor-state.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4be46c35d71c77fd155ae157a08fcbc18d9d9da7fd4e30dac0e9f9a9bea99e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJobsResponse (cyclomatic 32, cognitive 39): parseJobsResponse has cyclomatic complexity 32 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/talentlink.mjs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"37580c149f8834905f4a31e764bc63fb2f274a57e64c119911a78c09603a0ea6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveJdOnInterview (cyclomatic 32, cognitive 35): archiveJdOnInterview has cyclomatic complexity 32 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/status-hooks.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d740e739465f2da9cd14d47e7168cc16f2210eb5a77fcf146f0e958f80789a92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 33): (anonymous) has cyclomatic complexity 32 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-history.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"715c30a7175c74c95606465b073db105345cc47238b340fb8666ead634d40aaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FollowupsView (cyclomatic 32, cognitive 27): FollowupsView has cyclomatic complexity 32 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/components/followups/followups-view.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c869355dbaacc2165d3c7cd8a3a6bafbee1a86755011cb41f341045c11fc302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEntryList (cyclomatic 31, cognitive 61): validateEntryList has cyclomatic complexity 31 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742fc55b4cf8a8ca5e37d4698cfec59f0ff5b5412d4f58422517b565838eb99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 31, cognitive 49): fetch has cyclomatic complexity 31 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"656db6a862798497882463f5a97be59904d1e7011ab89b41f4e298a62b184d33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 31, cognitive 47): fetch has cyclomatic complexity 31 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/talentlink.mjs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0affc69159c5e0121b888e66acd97645a335d5f4d1e92fc40ffcf85372ac9c01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function registeredNames (cyclomatic 31, cognitive 47): registeredNames has cyclomatic complexity 31 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/root-tests-registration.test.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71662a41e59bbebf1a6302c4b0d2022d5502b51f700a12554f163c3904657d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inboxLineProblems (cyclomatic 31, cognitive 46): inboxLineProblems has cyclomatic complexity 31 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e5adcd01b435f7d3e220d37005957c9d8b2e555030d836e1d238573dee8ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPaged (cyclomatic 31, cognitive 39): readPaged has cyclomatic complexity 31 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/lever.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e6c8e8d4abec66621a1386d9df8897d3d726cd25b189a90a1ffd2d09a08261"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closeOpen (cyclomatic 31, cognitive 32): closeOpen has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f03a3590388ea04285be35f51fd726808ed026d3aa21aaa92685411a84efb3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StatusEditor (cyclomatic 31, cognitive 26): StatusEditor has cyclomatic complexity 31 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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/status-select.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba68374ae675c863c0a5ce8289e0320b6b96a11ff884bafc1981ae30f2ac30c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSummary (cyclomatic 30, cognitive 57): renderSummary has cyclomatic complexity 30 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5262c33438ec437e7381851c8a402afa260fb23dbe4fae51b6211d82df8dceae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractHeadings (cyclomatic 30, cognitive 56): extractHeadings has cyclomatic complexity 30 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":"i18n-drift.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b68660d37abb76ee38b78e200df9152bc3497405743fe35c6bf4cff4704073"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSeenUrls (cyclomatic 30, cognitive 54): collectSeenUrls has cyclomatic complexity 30 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"814e538139f6765d671df9b296378703c24996fcc0158452d7fe025e73b83901"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 30, cognitive 52): fetch has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobicy.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4cdfc96cae87a5a9c19dce421654793003a14a72fd21bc5e1d56be4e32328d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computePortalStats (cyclomatic 30, cognitive 52): computePortalStats has cyclomatic complexity 30 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b0462123409d4a520eef1f19059152347cfbdbf3aa6a445af938b8e4e6b2fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 30, cognitive 45): (top-level) has cyclomatic complexity 30 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/breezy.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6552dc55577e5748c97fdb77984c2dbecb4724c1c96832cfc7a25797466d601"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMarkdown (cyclomatic 30, cognitive 41): renderMarkdown has cyclomatic complexity 30 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"465c2c0aa00f390f2cbcfb6f781f657189eb4ec99879ce136dd19beaf04e9885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ApplyPage (cyclomatic 30, cognitive 32): ApplyPage has cyclomatic complexity 30 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/[id]/apply/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a12ab1f3696a7afa43e39f18b8b4410cb25231675755f74998b7fe573b1914"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchInContext (cyclomatic 30, cognitive 29): fetchInContext has cyclomatic complexity 30 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff070c93f66015f8aff874646838084fe38bcc1cfe78fdaf67512ce454507c0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 29, cognitive 54): fetch has cyclomatic complexity 29 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pracecz.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8bfbd495a4f52da93b871b4e34c75fbc9290f19a17ddee3469c48309834fa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 29, cognitive 50): fetch has cyclomatic complexity 29 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/computrabajo.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef05927f14ad74d057bf7499a0e795974a66bcaba975a313c0f59a87cedfaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeResponsiveness (cyclomatic 29, cognitive 48): computeResponsiveness has cyclomatic complexity 29 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89a36fe0a8ffec5e01abcf90baa33efa3da1c22ba4873cc4a87e9e219ae8ad6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planFold (cyclomatic 29, cognitive 48): planFold has cyclomatic complexity 29 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-fold.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"199361121a94c508e1f4cdff482f09a72869e7c86d37101316c322f3a7f5b9ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 29, cognitive 46): fetch has cyclomatic complexity 29 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/consider.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fdb4cc61e5b8e709fa7e7ce24328d8bd155f8d45d26950af0614712e019d77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeStatsMetrics (cyclomatic 29, cognitive 45): computeStatsMetrics has cyclomatic complexity 29 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e68dd7dada137ceb197c1cb4a7481f14df79ec1544cbb8fc0589b12c27271f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 29, cognitive 43): runCli has cyclomatic complexity 29 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":4310}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc0ae010f7500419ae2cc678364d191d68dee361594a143f5be57bed3951c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 29, cognitive 36): (anonymous) has cyclomatic complexity 29 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/smartrecruiters.mjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2f4eb3ef4acf6afa273ef0cb2a0fc846d1f2a68d8af692b7ee453086cd39d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 29, cognitive 35): main has cyclomatic complexity 29 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-seek.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5214f76bf3a4c3d23dbb6f37fb5ff55902a467e2eb068501e4a109a175cee997"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onboardingState (cyclomatic 29, cognitive 29): onboardingState has cyclomatic complexity 29 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"91337f37b1d3179548413b12f96c51b69bd45886107f36ba66f35d269056b9c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FieldRow (cyclomatic 29, cognitive 26): FieldRow has cyclomatic complexity 29 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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/apply-view.tsx"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"339ffdcc16cd86de03cbe63c4da246052463bae32a35875126c010d56b851fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 28, cognitive 52): POST has cyclomatic complexity 28 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv/ingest/route.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c930a3fce2b866204214f363c8e0744ef16aca2b655b8eaab161184caea6d754"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 28, cognitive 50): fetch has cyclomatic complexity 28 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobscz.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"355d84447b9bc90175d7263acb7a6198004c4bbf5689e6114b2207249a4edead"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stringLiterals (cyclomatic 28, cognitive 50): stringLiterals has cyclomatic complexity 28 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/root-tests-registration.test.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee30699fbda29b4af3a7e332fd3802ab9c82211bedb8e8b5cc6875c716229b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripComments (cyclomatic 28, cognitive 46): stripComments has cyclomatic complexity 28 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/self-test-registration.test.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3095e19ad6b5d55ca2d25ad0ec9c22ab84e2f41d3bf4217e588899eaa296fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractJsonObject (cyclomatic 28, cognitive 44): extractJsonObject has cyclomatic complexity 28 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/extract-json-object.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"86124487db9ea8fc2081e00b3eb293c0eaab20fb65f8a8ea5057017a0ff9f475"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeUltiproJob (cyclomatic 28, cognitive 43): normalizeUltiproJob has cyclomatic complexity 28 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5f1b84ca52bbc368ac088d7838bb27cdd7a3c587e6832213c55e5c1d180dc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRejectionLatency (cyclomatic 28, cognitive 43): computeRejectionLatency has cyclomatic complexity 28 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rejection-latency.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d956baac7ee8e70b653033db2073f7f2c69fe542378eeccab01659b1b4848187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 28, cognitive 42): fetch has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/magneto.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0821a7a74916842019cb74bcdf34a577def0f23c71c7805f0f14279323f14b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSections (cyclomatic 28, cognitive 42): mergeSections has cyclomatic complexity 28 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/personalization-file.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7b98a85f5cb6c312f522c7c452c13e738e00a59d667cfe6607f38d617c9441"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMarkdownRows (cyclomatic 28, cognitive 39): parseMarkdownRows has cyclomatic complexity 28 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee338c54e55ccfd7947c73e3704bc6307d923b0e8f3cae2f592b45151d8f75b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runQuery (cyclomatic 28, cognitive 38): runQuery has cyclomatic complexity 28 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5529acda17894ee43aceea5653565a151cd07311bf081cfbf221e903772e2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderInPage (cyclomatic 28, cognitive 36): renderInPage has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c9ed3170a4149a1f1858e20a3da1f978513b01e2e9aa923ff48144a261db3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archiveUrl (cyclomatic 28, cognitive 30): archiveUrl has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d2813f12f01fc28057643fc3ad912758794d4539896d42fbf5454617e4399c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roleFuzzyMatch (cyclomatic 28, cognitive 30): roleFuzzyMatch has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"role-matcher.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c625edad8ba9985cb3fc8e588577c1ece5ebca82f5769dfcb48c8424a17da9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 28, cognitive 28): runSelfTest has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea42a47585cffa18ce38235199cbcb3eb1aba13f9145e7f7241db3edcff3fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTier (cyclomatic 28, cognitive 24): classifyTier has cyclomatic complexity 28 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/tier.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b96b0dfde6d4375b7ab84ca3deca42d6e0622b4a79887e351e8696461066a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvaluationResponse (cyclomatic 28, cognitive 22): validateEvaluationResponse has cyclomatic complexity 28 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2ea1f2db02d064423f0f9777e9cee69c0e1f8a103fad099944bfeae68f9f5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 28, cognitive 21): POST has cyclomatic complexity 28 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/runs/save/route.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec929e23fc3d66a953a7b4682ffa1530558ac83f19d1d6a52b2df26c65862f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 27, cognitive 70): fetch has cyclomatic complexity 27 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/meituan.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec393472684914bff89ea5bcefc9e357d9c70d1634946fd994e926247df59d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkInbox (cyclomatic 27, cognitive 49): checkInbox has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9f2f9400fb074a39ad31d800de869941dd6fa7f7658b8a5d41561af4051650"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 27, cognitive 46): fetch has cyclomatic complexity 27 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccc5591e1922e300054328eb1ad925470491397dc2e490ebe1bc37c24625264"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doImport (cyclomatic 27, cognitive 45): doImport has cyclomatic complexity 27 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"794f722601ca29a24c6d9a698e27b8a3457a9486ea5b7bdd72cb9a8dcf5b55ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testDeadPostingOutcome (cyclomatic 27, cognitive 43): testDeadPostingOutcome has cyclomatic complexity 27 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/batch-evaluate.test.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c940f2f80f70208cec51803f94f438fbefb09045333dcd89474052956641c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 27, cognitive 41): fetch has cyclomatic complexity 27 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7260309b07c290c395114ac2ebad77183c2473e8b86b01912fa46c911eef0b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 38): (anonymous) has cyclomatic complexity 27 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/extract.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"916c4571f24d1118967bd7a2c767f617073b4f417f360c5ea2e0d440580949a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 27, cognitive 34): main has cyclomatic complexity 27 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5edb277d84bc8736e8aca589c4d1f9a003f89aba8c07fc1d54882fb8605a30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function zhMentionsIn (cyclomatic 27, cognitive 33): zhMentionsIn has cyclomatic complexity 27 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"6491b059252d07e21a8a3825c695e9d8e4253740671c86fc69f23e3b2bd89a99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkLivenessViaApi (cyclomatic 27, cognitive 32): checkLivenessViaApi has cyclomatic complexity 27 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-api.mjs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5663941467b5f2e4b05861be9e8d06988cdadda98d3d87f68faff19b67a3cb26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consider (cyclomatic 27, cognitive 23): consider has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6e185602e69dc10e12251203d619f0ad298841f5c8244d87d6c6dcc536862e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InboxTriage (cyclomatic 27, cognitive 22): InboxTriage has cyclomatic complexity 27 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5479fd359b93379cc4cc4bb6d8f1b85e8f0056d5d9b7d17a795c181039e46af1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 21): (anonymous) has cyclomatic complexity 27 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/report-view.tsx"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe73593e22229b6b21fb84db50fa3339e173a837ef168f5bc03040b4a6a1ca6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReportView (cyclomatic 27, cognitive 20): ReportView has cyclomatic complexity 27 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/report-view.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36a1cf8d4cfdefbee87e2d93dc7527cfeffaf66ba097fd0565c54b64ebd07cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeJob (cyclomatic 26, cognitive 61): executeJob has cyclomatic complexity 26 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa1d9e7dd462a3eb321eb2b6f884242d292a150779c67e4cbb935c86180c0c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 26, cognitive 59): fetch has cyclomatic complexity 26 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":"providers/google.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf95de727f36efced9a05b1b206e35509a1e3ee6a7a0bdbd9e3dc0dcc87bcbdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 48): main has cyclomatic complexity 26 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-interamt.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b231a19da6103780f69f90f05c4049a880337c0f767d513c3f7f246a0506e27b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 47): main has cyclomatic complexity 26 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-watch.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9845d60f8156ca2aba35ae31c750a4179384bc491d00520cf3c0e890ca268f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 26, cognitive 46): fetch has cyclomatic complexity 26 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"94443d6d8e5e20e1b5cfee130098f364f1339f3dfaf8b787927818d84227a8b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runBackup (cyclomatic 26, cognitive 43): runBackup has cyclomatic complexity 26 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"14723646197931d48cf8481f42e0c83e91e9afb62c4c87213a6d2750ff466364"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 26, cognitive 43): printSummary has cyclomatic complexity 26 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a687206dd642003c1e269c46eeca74d1a023f61d0a6dc0fa1c0959eee396c174"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyAdd (cyclomatic 26, cognitive 40): applyAdd has cyclomatic complexity 26 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"add-entry.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2f835d4eaf96f3e004f7af46d4c2b2130b1b5e2fd96534550edd5b1613e6ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 40): main has cyclomatic complexity 26 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a32fd0c89d03fe36aa5b13348a38fbadbcb3d5c1a2bfc6d39b0355bc95ad18f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePlatsbankenResponse (cyclomatic 26, cognitive 39): parsePlatsbankenResponse has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/platsbanken.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f47610eb55d9ae08f20b9bebeef541598ce7699f6e218970e30f47b77de8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 26, cognitive 39): main has cyclomatic complexity 26 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff23856fc7a5579318e1f4846f2cbd26e373735227190f6574e51f616be47e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readReplyProposals (cyclomatic 26, cognitive 38): readReplyProposals has cyclomatic complexity 26 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/reply-proposals.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe229beae954a808735d285a9e3980fb71a8d9078c00470effcd0eae09255e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 26, cognitive 38): fetch has cyclomatic complexity 26 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1562a782ac5f584e398073e2a56da00cfd857eab0fc3dd21f48d0b3eded9912b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyRows (cyclomatic 26, cognitive 37): classifyRows has cyclomatic complexity 26 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"close-stale.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"feebed7f732b92fb758c876d4048c249e3a0d6ee470c45099bd1da5a7d7343b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atsBoardUrlOf (cyclomatic 26, cognitive 33): atsBoardUrlOf has cyclomatic complexity 26 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f38951ab6789946d155365d9faad33fee0a870a5ef70891d16174e9c1e912a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTechInAsiaJob (cyclomatic 26, cognitive 32): normalizeTechInAsiaJob has cyclomatic complexity 26 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/techinasia.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd6ded0640f78c315a5e551ca89df8d283334dfe36c7a73adb3fe124dae0c5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListPage (cyclomatic 26, cognitive 30): parseListPage has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefaeb259f86e76f3316d79919866e4966f17896a0c7d8d640461555b0f324b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function studioReducer (cyclomatic 26, cognitive 29): studioReducer has cyclomatic complexity 26 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/studio.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00d89d659728808f8f271c05e08d62cee1c7584e963e09e17e33d3e85b20f8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 26, cognitive 27): fetch has cyclomatic complexity 26 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/polymer.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f3b4a7119707ff7d80da77c61e7c930065db0149c73b8a75e3184eaa273c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 26, cognitive 23): runSelfTest has cyclomatic complexity 26 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e27ef8b63fd18b42e4e1d140134a2643f7161e9e952955bf2b5d5f04d9592b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRegistryEntry (cyclomatic 26, cognitive 22): validateRegistryEntry has cyclomatic complexity 26 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_registry.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2ab211896bce05a40591517cb5db78d947d73a895a236d9d4c042c6b2d6f64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 25, cognitive 57): fetch has cyclomatic complexity 25 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/feishu-jobs.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6eb21a4c953c4c8b6f3292af06325c91987d9f4332b5c574169383534d68ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 25, cognitive 52): main has cyclomatic complexity 25 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-sync-check.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c3fabd09e47e912d729f5920e2f5014106b587b8c515db9d9a0830db18494c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 25, cognitive 52): fetch has cyclomatic complexity 25 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/platsbanken.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fcd1a362e1d26e65240f838097f77fa82b8216d480b1ebf28d952fc82e7f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findCrossListings (cyclomatic 25, cognitive 48): findCrossListings has cyclomatic complexity 25 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fingerprint-core.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9701e7af452264349cbefa136ee5019b991f3951b2df8a7cad805a1dd548556"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRecruiteeResponse (cyclomatic 25, cognitive 48): parseRecruiteeResponse has cyclomatic complexity 25 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4781335daef5e2f1c39eba6fdf2d1c8c5981ef510e30ee5fcb0f94f7c3e2d5b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatLocation (cyclomatic 25, cognitive 45): formatLocation has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"299816d960368c2bb5cbc80a603b63e85f0ae0efa8bece9b9410f67b83d32e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maskNonCode (cyclomatic 25, cognitive 45): maskNonCode has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/web-child-windows-hide.test.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"548cde0a43b27e965c1d274c91bffb0651390051197ebdf662a52f38d0b1aa71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 25, cognitive 41): (top-level) has cyclomatic complexity 25 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/_html-to-text.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"300b00feb4bf3bb56e344c738df940a18f957608a4cdb8f92f302202be57e825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 41): (anonymous) has cyclomatic complexity 25 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8bfc521f43070ccdf9e4ba824246cae678348f1d9b3d3d9323f6fe9260a2ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePageupListing (cyclomatic 25, cognitive 34): parsePageupListing has cyclomatic complexity 25 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f373f62f7fdbc400e56224dd4c4e851e4cc3da2c2a2a0810702d13b4d3281518"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function query (cyclomatic 25, cognitive 33): query has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54d37664249465a9e1a42746aed76d87b9beae9b7e23ea67891ff0f1bdf7bb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseValue (cyclomatic 25, cognitive 33): parseValue has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d5a0fe31ab92c107ddc9fbd3692003da13643fa932d8cd65acec63ba0b2be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatAtsText (cyclomatic 25, cognitive 31): formatAtsText has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289dfe57a7e9d78041ad99f35d9ec70bcd3dce903f1d74882760a5b23c4d537"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleEvent (cyclomatic 25, cognitive 31): handleEvent has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f08b58749f8cf8e916899b4f4bc07c19b19bab8410c93e3f267c3f10aeee8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 25, cognitive 30): consume has cyclomatic complexity 25 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/job-stream.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eec9c2efacfb937740cd64a322d84e106da70b61faa4d9ee141a4ba2ae0d09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRemotliJob (cyclomatic 25, cognitive 23): normalizeRemotliJob has cyclomatic complexity 25 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remotli.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"045cf321de5f9e82fd63c7577a18b7f2556d4c8deb41ff120449b84663cef9b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function factClaims (cyclomatic 24, cognitive 57): factClaims has cyclomatic complexity 24 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"613230697f61a6796985dd8e4feb64ffdd3e70973bcdcd95fb3172ed9d02b234"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 24, cognitive 49): walk has cyclomatic complexity 24 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2368fd922f5c981b137abf15b81acaf15db56013eae01ccf8c4bc87c2f16cb8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 49): fetch has cyclomatic complexity 24 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f242eb5979d083cc4dbb90d590d0ec1d83fb6d1e225063ef404adbe9b09b95f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 46): main has cyclomatic complexity 24 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-hn.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e3387d33d39270736eda80e8b4d6f8f242d24b9a4227dab8c41bf4eb632521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanJd (cyclomatic 24, cognitive 42): scanJd has cyclomatic complexity 24 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-skill-gap.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"627eceedd7d836842a41baa8d6090088bc7be02abb984af0616d822fdee1dd9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 41): main has cyclomatic complexity 24 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-dayforce.mjs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6a8c52b42ce64c95ba4409c0d684987c8ec9120ce5f5009be1e590b638d686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWebCoreArgvContract (cyclomatic 24, cognitive 41): runWebCoreArgvContract has cyclomatic complexity 24 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/web-core-argv-contract.test.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"67975c0fd447f29cea6b1227da1e04aa07beb94a97a5a2820766c9000b87c56b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEightfoldResponse (cyclomatic 24, cognitive 40): parseEightfoldResponse has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a554c931f4e43df9e1d4ad97cdb938bf98a242f6f7943d7cda4a6e38832cda1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePrevueapsResponse (cyclomatic 24, cognitive 40): parsePrevueapsResponse has cyclomatic complexity 24 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/prevueaps.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3837b8a083959efa99c2c05186b7ba53a2d6fde811c51f9d8e88a2d5364adffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 38): fetch has cyclomatic complexity 24 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobbankca.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb3abc0908d8c8a8c46287fcdb65c9faaab485116fa52b94f36ab2aabf2fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 37): fetch has cyclomatic complexity 24 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tes.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd3fbc171fec092ff9eb2fce28bc09d87741dc88f7f5813674541d6bcee4d80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTsvContent (cyclomatic 24, cognitive 36): parseTsvContent has cyclomatic complexity 24 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5bf8fc13e611c920f11a981630f4f6d6933332d1702607fc8411990e04717"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 35): fetch has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jibeapply.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"501be233dc7536bb5bf9e5160264fd7f8662a5d29892667198085e2f3c1490c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function driveSession (cyclomatic 24, cognitive 35): driveSession has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd57dc5b2d358c72f5c25a339d60e761fa86b9b8114a43db91a8042ce0d8d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 24, cognitive 35): scan has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9328b3ca1332d585c16da15dad1a8899ed14f5bee8bad57c856a2bd6482e5c6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 34): fetch has cyclomatic complexity 24 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d54cbb10b31ba575177e1522d13042ebe2e43510b6e0c2f0b3beddce2266d08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 34): (anonymous) has cyclomatic complexity 24 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e70d067cd3ce5a5598b8a3a9d0fbd7ad8c9535d982182b50309535620763ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeVcf (cyclomatic 24, cognitive 33): writeVcf has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6be39672925aee54c9584afeb5916067d39ecaa9b1070d4eea9a6ddacf3e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 24, cognitive 33): POST has cyclomatic complexity 24 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"608a18305f11d742fb687fa9e87e863c933c35d779972bb9be23df68501ca557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 24, cognitive 32): fetch has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bulldogjob.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646b506f59c0e5a8af2dfd25b4a25a6617f91e501de58e0a5dba53a6b3f88a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localEditLeg (cyclomatic 24, cognitive 32): localEditLeg has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upgrade-tests.mjs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff462662213a387b19486cb40b282578cfad3b261aa9b66ab27c75b55075078"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 31): (anonymous) has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-visual/contact-row-wrap.spec.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a35622b9d154bb18cf8ea83675c69db35e5a819b756d48f4a1c73f2226c690"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseScalar (cyclomatic 24, cognitive 31): parseScalar has cyclomatic complexity 24 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f8180d1b3397422165679f153e1ed62896e0b1f71e8f8885bd79cae935f40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCliArgs (cyclomatic 24, cognitive 30): parseCliArgs has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"774f734d8a538cba78d41dd74cf4610ac5a195f51948a5614e98a9888dd19755"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClaudeEvent (cyclomatic 24, cognitive 30): parseClaudeEvent has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9810fb1046558bc27a3e50e0edc862092b394d44a9a7166ca0dff013915e47b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ingest (cyclomatic 24, cognitive 29): ingest has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/index.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5bc2473fb8ec1a277149338780432f1f2fdc34b8a5609032fba8fb22f8e4d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCodexEvent (cyclomatic 24, cognitive 29): parseCodexEvent has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7586b8e3fa302c83707e8b93138d7359a7c1e0dc98aeeec903b8b8c03c427d94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeProgressMetrics (cyclomatic 24, cognitive 28): computeProgressMetrics has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5716c5478fa3a9244e065137a5c3c4540e0fdaebeb91ac7f272a94fc1dc8c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 28): (anonymous) has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/agent-interpret.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f082c60dbae0911d166c8aa19417aa39ac5527d6b6b83393702afd6c71e3dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 27): main has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-share.mjs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfcc7422edffe8ced06df6ee2bb507cd269575606d47a2dba9372d966b7f594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 25): main has cyclomatic complexity 24 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"add-entry.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195fc5f0bfa244941fd7117698c71fa49a3a1c15eb5a0f0c71d8e3629ed97d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 24, cognitive 24): main has cyclomatic complexity 24 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"714c123602249e4af6e5a9fb6c037946b5d166e5e6993e62d6bf6e06b3c5793a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 23): (anonymous) has cyclomatic complexity 24 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"10eaacd7bdb8b6e2a72773fdbb5bbd9436850594129ca783fddff670ea95fcf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize4dwJob (cyclomatic 24, cognitive 22): normalize4dwJob has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/4dayweek.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a7a91a43bcb835844bb8b4ddc6601e3756fb5a88f34edcee3fc4f2d2c9aab5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 23, cognitive 50): fetch has cyclomatic complexity 23 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mokahr.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8ac12c8f33df3f071801a903ab0bddaa514d3c1be063e57248e357199c2b81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recursiveDirWalkers (cyclomatic 23, cognitive 47): recursiveDirWalkers has cyclomatic complexity 23 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/walk-tree.test.mjs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d40185dc9f0c9532b742b37a553a2348d4c1fbf1dc3558a5ea581bc1498d4be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSummary (cyclomatic 23, cognitive 42): renderSummary has cyclomatic complexity 23 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cac809d854c00f55765a0f64a4852e015b765de01f46bd89a5882dfb4f4f8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverDocuments (cyclomatic 23, cognitive 41): discoverDocuments has cyclomatic complexity 23 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c7566bfc9001cfaaf35b4d5db58f8df91c0b8b66b63d93a3b5922921dba313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 23, cognitive 38): fetch has cyclomatic complexity 23 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/phenom.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f790fc58dfe0211e7f5ae9246283dbd84bd2ff2ef25614bd6235c0660253bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedBackfill (cyclomatic 23, cognitive 36): seedBackfill has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf779601168074cc6c68f45da457458a42ed297886555021bc794dd34df6eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 23, cognitive 36): fetch has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/inrecruiting.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0fbd16477b4fa53a16d77ecd7b4b088d55eaddb53e4169d7312544c7b093aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchHnDiscovery (cyclomatic 23, cognitive 35): fetchHnDiscovery has cyclomatic complexity 23 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc9255aed452ecc25db78bfacb32ce10069c7ac8220d66137581f7a033694e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPortalsYaml (cyclomatic 23, cognitive 35): renderPortalsYaml has cyclomatic complexity 23 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"450ceeea1ff2dabdc07559a2e23361b4122cc5344f85ae5d949d2de25c092194"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffLines (cyclomatic 23, cognitive 34): diffLines has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99c70107f87c67b40f79a12f045001e3ed2cb3cf1b36a8ef915baa355d0f281"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 23, cognitive 34): fetch has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f666a9de6b7808632762a60114125d5f6a7248c9f9dd462ffeb80a929d5739"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePaylocityBoard (cyclomatic 23, cognitive 34): parsePaylocityBoard has cyclomatic complexity 23 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/paylocity.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"336eda844e79189785fa8b0456e03598ca561301595157be6e20d7d4da243932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function worker (cyclomatic 23, cognitive 33): worker has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2a05b3da1b266ffc61fe5e5b593167fb08f35d8c8fe24c1d69319e3674e6f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uspsStateCodesBeatingIso (cyclomatic 23, cognitive 33): uspsStateCodesBeatingIso has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef20b462554d87ebb6f5fee565a21a2ae1ceec73e370da25e32a4b2b2d38d512"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statsModel (cyclomatic 23, cognitive 33): statsModel has cyclomatic complexity 23 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics/view-model.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"866af73c06155fa7adb1e6f663f452317942d9c72c07d553cc69b8550ea93e04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 31): main has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"community-asks.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0113de32fa235544f89e05d6aa4d356e1ad44a077c24e4204ba3b35df9f10899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mentionsIn (cyclomatic 23, cognitive 31): mentionsIn has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba0295da920a5745ab69c7a93e0fd5df60a853abf0f19b2b742e2344abd090c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkUrlLiveness (cyclomatic 23, cognitive 29): checkUrlLiveness has cyclomatic complexity 23 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8e91a18b8546ff68d771972b58af0c7c02e56874be584878bc3dd964c783d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printPreview (cyclomatic 23, cognitive 28): printPreview has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"import-tracker.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3050035a714b6a7e61c264871dfc166c66ce5fb4dda2547eee3c5fc61f2fd949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPrivacyConfig (cyclomatic 23, cognitive 28): readPrivacyConfig has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/privacy-guard.mjs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dd765dd4b9fc233948356d5d8b94bce53239b6ed252cafe38fe01abc3edf72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trailingComment (cyclomatic 23, cognitive 28): trailingComment has cyclomatic complexity 23 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d7ad8be034ba30db797f5453e35f1864e27695181b2faa3916909949b92f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProposedTime (cyclomatic 23, cognitive 26): parseProposedTime has cyclomatic complexity 23 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/invite-evidence.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c54c9f652402c101bc22f42d251b08ee0a283fc84fafe5750eaf4513f88a91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 23, cognitive 25): runCli has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f84e623de4a82acef38015496bdc1f31d2405a4e317406e1abf5032f98e3cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutSankey (cyclomatic 23, cognitive 25): layoutSankey has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80dc46cf386055008f8ece65f33827be2de523d59dc2bcbd742a28316005204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function seedFollowup (cyclomatic 23, cognitive 24): seedFollowup has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c5353aefeb2eb1388ef72ab984ff612b4a27add0c26c2a7944f4cfc265edeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 23, cognitive 24): runCli has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d65c9360d5783eccb58d4ecc32ae4b3252ec638c0d1a450bff3e413da4aaf6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CvIngest (cyclomatic 23, cognitive 24): CvIngest has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2ccdb3ce0c845e277c94c3a607053cc86110d135f203ea3d33e2b8a8d0f724"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEvaluationGate (cyclomatic 23, cognitive 22): classifyEvaluationGate has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcba134fb1fed07fea831121879e7a0c4bd0baa0f04a39695c061f908cb892d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 21): (anonymous) has cyclomatic complexity 23 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-watch.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac100f411f2cb9088b25ce4e34082a666ce3d6e2eafdbc7ba36283cd0612644"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fuzzyTierMatch (cyclomatic 23, cognitive 20): fuzzyTierMatch has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbec69d693ec3a20cccab4b9a875fec8124c49399f48e6a97d76d5d1be9f9ae2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 49): (anonymous) has cyclomatic complexity 22 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b892761bf20921b3cb368ee1e4d0c8403270e24bbe8ffbf15863464f20abbf9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 22, cognitive 41): fetch has cyclomatic complexity 22 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb8d0688d9b7331a1a498c6ea79a46c2b9dd5fd937d120bb8465b2b04ca68b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 22, cognitive 39): fetch has cyclomatic complexity 22 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e7c2a412b84fb8a0abb018171078f79d108fdc0b8f330262851d31a02443e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripJsoncSyntax (cyclomatic 22, cognitive 38): stripJsoncSyntax has cyclomatic complexity 22 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jsonc-parse.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"58878dff473e4d9758b80645bd807bf374ab9844c8c7613e89cf6ff3e3173134"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 22, cognitive 35): fetch has cyclomatic complexity 22 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/darwinbox.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096f895fe9da37cba75d3f2dda19e94a24633bb6897aef36fef0bb9e4d1890a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callArgs (cyclomatic 22, cognitive 34): callArgs has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/validate-flags-value-operand.test.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5865f1cbe56632ea8e82d4db2aca693d9dba3d701a98289b0f1fd34f85e72039"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMarkdown (cyclomatic 22, cognitive 33): renderMarkdown has cyclomatic complexity 22 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad5af5def775422578d6408a77851f0d8c1324d5ebdfe83f71eb4e8e5da702d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePayload (cyclomatic 22, cognitive 30): validatePayload has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cv-payload-schema.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c1c6f545b664a21130a9e9853ac31670520b4a744a82ea3d3af37347fd469b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListPage (cyclomatic 22, cognitive 30): parseListPage has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1143c5cf36da7448a8a495284a46b81ab765edf565ad05996301057f0111efb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveEntries (cyclomatic 22, cognitive 30): resolveEntries has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4859}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96f890f587c42a9c288a1f39ea4cb0748af93d501c51e1d6c6208423c9b21a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldDriftKeys (cyclomatic 22, cognitive 28): foldDriftKeys has cyclomatic complexity 22 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de1b091fb57a9559403a159633df17e977127d3412a59dc03f9204ef95a11a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 27): main has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa03a8185b8a14d7a7051b6f59e8a50f11b280e49fcdded888e1964d7f354044"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function titleClause (cyclomatic 22, cognitive 27): titleClause has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"538849ae4e760542106e0f57ed8cd29a667c35441b2770e05f7a04c187eb893e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function titleClause (cyclomatic 22, cognitive 27): titleClause has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/inbox-rank.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"238b38fed0a52b904e56d463a6c4a8b2d74d5fd075ebaa38adf2495f6981f2d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 22, cognitive 26): fetch has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/smartrecruiters.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0490686f472ee160a60ea402069b268397eecec66450d090d4004a6e9f6ad9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanEmployer (cyclomatic 22, cognitive 25): scanEmployer has cyclomatic complexity 22 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/employer-source.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231e856528b6378fd4c2c5679d22a6ed2c50e0df5a5308497b8f91b6ecc2852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchJson (cyclomatic 22, cognitive 24): fetchJson has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/employer-source.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b24b153df1da8c5e1e70981c0d6c669cf539c53fd39772b50b3111762caec6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 23): main has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"application-answers.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e694140ae5a454bac264b30f09f32027580cb654a881a4d13ecca38917b2324"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitTargetsFromProfile (cyclomatic 22, cognitive 23): fitTargetsFromProfile has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"67789e87536f9365bc704ac299a4d3082455dec8b106025603f988098059b5a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 23): main has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd598a0a094d5173161b9fbfe895641e1d078d04854f2937dfe84fbf40105b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitTargetsFromProfile (cyclomatic 22, cognitive 23): fitTargetsFromProfile has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/inbox-rank.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da9492fb82ee4db5948d02267d53c831d050e727d105560d7f8cdb0edd80ccd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeGetonbrdJob (cyclomatic 22, cognitive 22): normalizeGetonbrdJob has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getonbrd.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"302fe27fb7539ac49090bb0db0ff3c53b98be9e6a6900e573382c8d8f2b15ff1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLandingJob (cyclomatic 22, cognitive 22): normalizeLandingJob has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/landingjobs.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde12a0523265d070320b1521935f5071b04399daec14609a2a016071972b7df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 22): main has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-import.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d85e25e8a27e809d4f3351bd0ed8dfe4272e1d021a23e8d21328f57a8322cd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeHubJob (cyclomatic 22, cognitive 21): normalizeHubJob has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/thehub.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fce887fca5a822c3289ec25809fe5523febbe880a2709993c71c80ecdcc0d86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyLiveness (cyclomatic 22, cognitive 20): classifyLiveness has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-core.mjs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27d6016ae71bfea588e597f790c856c37437407a5ef94807413162349f77c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ScheduledJobsView (cyclomatic 22, cognitive 20): ScheduledJobsView has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d10c8de937416708a927891511010f98edba335a40bb1cdead966480e02080"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseScheduledJobInput (cyclomatic 22, cognitive 19): parseScheduledJobInput has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7829cb6b16e13d1fb489f5174832a0404168c1417f04bcde7234355644512f04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 22, cognitive 19): runSelfTest has cyclomatic complexity 22 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a579f85e71bca4fe0f8ce2b922910246c648648982681d584364a4ecbf5ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CvEditor (cyclomatic 22, cognitive 16): CvEditor has cyclomatic complexity 22 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-editor.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5df781821def1b94eb85bd953b61e59358f4cd515f53ac78b3e1b546958d0f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BulletRow (cyclomatic 22, cognitive 15): BulletRow has cyclomatic complexity 22 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/section-card.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4495bccf492aef882176159f87fe29a0dcbaf082be5fc624221d47e29b961cb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeVelocity (cyclomatic 21, cognitive 55): computeVelocity has cyclomatic complexity 21 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b263be5f8628212341d816037ea20c1fddbb747cb30fa66acbb35f6f13f84d92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanHeadings (cyclomatic 21, cognitive 45): scanHeadings has cyclomatic complexity 21 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/personalization.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff858a231d85114b98e84cd8c6528c8596c2c421a3e3aa36247e49568bd8c2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revertPaths (cyclomatic 21, cognitive 43): revertPaths has cyclomatic complexity 21 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa78adbcfb7ee024a823426e4a6c54a2ab9c6eaa5caeb155641fd81e6e67456c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 21, cognitive 40): fetch has cyclomatic complexity 21 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/csod.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c4fc2cd41989691496b2c0310f9f1e0488414af444b9a161c800e6c040197c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanCallSites (cyclomatic 21, cognitive 40): scanCallSites has cyclomatic complexity 21 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/verify-pipeline-hints.test.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14f8dd997fccb1eb8c27bb5efa83e2c9a4d0f8239c094ecedc6bc6e11b2dfcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFactorialBoard (cyclomatic 21, cognitive 38): parseFactorialBoard has cyclomatic complexity 21 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/factorial.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd1c560791894dc8f1a3d8ff8ca488d18cd0a70da75b9d826a192a68049aeff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanRequests (cyclomatic 21, cognitive 36): scanRequests has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"66488b0182235d1b985c72007eba1c1a6d1f5f676143595d5291e253baa91892"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPolicy (cyclomatic 21, cognitive 36): loadPolicy has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a498467ccb2e0b8929e1cdceaa37b3b5192c37987e710b0b69878c34d7d248b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tryApplyTrigger (cyclomatic 21, cognitive 36): tryApplyTrigger has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddf902e4fd6f6abb9d75fd95aee149cf6fef15708fb9294a780885b662780d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 35): (anonymous) has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c2cb38fcd995636025221208bd8f821844e5c65fc3969362d4d55b4cf32aa0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkJdArchive (cyclomatic 21, cognitive 35): checkJdArchive has cyclomatic complexity 21 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fa909265b895ade1e87cfdb4855e50201db1a201d7861aac57e526c2b3385c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readIcsText (cyclomatic 21, cognitive 34): readIcsText has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"panelist-roles.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e610bfe75fa732b076eb4b773e2311db3c1d0909a82794a7955c0387acaabaed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkableWidget (cyclomatic 21, cognitive 34): parseWorkableWidget has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c303cfd7ab3877a4543935e869ba4e312e81505f4ad41fe0c8c89503296874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 21, cognitive 34): start has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/drive/route.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cee0788233df22627b9d1e422f08149d2a7080bb897e2cc116f90f57dd9fc3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 34): (anonymous) has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c48e227251237950c6118b7be35e29dec36cafa82acd39d16caa91a05a17d6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyOffers (cyclomatic 21, cognitive 32): verifyOffers has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"735fc9970d53f94a5125294fc3eb82ab1b734faed4ac8355faa09798a407659d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 32): (anonymous) has cyclomatic complexity 21 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/run/route.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"380842e950810dcf6c3eea859710066bc5f06f0345c17ff62ebb5a8ffc311d37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function factLine (cyclomatic 21, cognitive 31): factLine has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/company-history.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"519c157faa29b5e6223dfc80b40a229eeedf99c6d5dd82fc630ca81b21479128"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCliArgs (cyclomatic 21, cognitive 30): parseCliArgs has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-seed.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5817df7023a39904c2cb51b79b3a09aa579bde3b9adf6cc859c2d60a495eb3e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDoverPage (cyclomatic 21, cognitive 29): parseDoverPage has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dover.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a763c287c9cb7390f1f06b2c6d602b0aba176df0e4799fff6807e59fc16c2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 21, cognitive 29): (top-level) has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/token-tracker.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"3778eefd1c660bbe3f46b47975abc91fe22e035808a0d74494f7b3d72ae473eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyOne (cyclomatic 21, cognitive 29): verifyOne has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c00a2f78ea70ea9babad7276add0343a3ddec218741526dfb0876fbb128a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function namedWithNewActivity (cyclomatic 21, cognitive 28): namedWithNewActivity has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"27558590dc473c5608c6c85ece3ba54832274388cdf8273167bdc0971ae25eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFormState (cyclomatic 21, cognitive 28): parseFormState has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"559d71bdc0ffa656bf5f53e2ef2ebd661179703d02157ff1efbba388e8463315"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 21, cognitive 28): main has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e47e7b58de17f1b958fd1c45a44a54f8e8a566c71a89594db47467f457d809"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 21, cognitive 26): fetch has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/vdab.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"215a322ff2fbe01906b500b8bf1607eff79c0adf6b7c8c62d52992c76e43e2b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 21, cognitive 26): fetch has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/wp-job-manager.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4685ab954b21c5fe262c5a78f4034f3f6cbe91f6b2a3c9cf6e9a027a911b14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkKnownValues (cyclomatic 21, cognitive 25): checkKnownValues has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-profile.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1379fce125ed4881b53422b7ca5b627e485e97f2ee4461fa64ed9ea28e0ca12a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeKalibrrJob (cyclomatic 21, cognitive 24): normalizeKalibrrJob has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9ce30bc61269752ac1f2334d2e0411f7a657a387c167c91064702056e7404"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRedRoverResponse (cyclomatic 21, cognitive 24): parseRedRoverResponse has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/redrover.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"969609cf04c8b49c568b2bc0cc333115872fe707909a0474ab4c9977e250b514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeEchojobsJob (cyclomatic 21, cognitive 23): normalizeEchojobsJob has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/echojobs.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffe1df5d1ca56f947dfe5c12512a485ac33d8b7ac39c10e73ae04205fc84f5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeEvent (cyclomatic 21, cognitive 22): consumeEvent has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openai-eval.mjs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afd6a7b17f9bb104ff8380c388fe8d8f2187181c971ebf2a44675611633c4f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 21, cognitive 22): main has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/cli.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a72f72f4767d4d0c1e42fdfcd4c425cd12c7ae6a3d02a517c3a5e6f7555ea0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 21, cognitive 22): (top-level) has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local-parser-field-passthrough.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2f3bfc7c75c7b3549dc151357571cf9b18d74531ba6a463364bfddd0923813"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSessionFile (cyclomatic 21, cognitive 22): parseSessionFile has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18e18611a71574e8264fab918095f4ce7b1ec3ae00984eddd2b39e7397fa60e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeStatus (cyclomatic 21, cognitive 20): normalizeStatus has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"normalize-statuses.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"329c773f4e9748ef614ade94b9d3a1180eed05b155093fc392fce40a4b7af2a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyLink (cyclomatic 21, cognitive 20): classifyLink has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63d97532ec2560cd26311ff86a8e86f942f875cb6859c1e476dbc73cea03064"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRelocationAdjustment (cyclomatic 21, cognitive 20): computeRelocationAdjustment has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44353f60f1f4cea113e76003f5418e3c5f0f807960c99d62c6b032eff9c04df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JobPage (cyclomatic 21, cognitive 20): JobPage has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/jobs/[id]/page.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4107325e5b468015e4abf86b88cb35fec40ad151993894d306fafc5ef8c4ca1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectedEvaluationInstructions (cyclomatic 21, cognitive 20): selectedEvaluationInstructions has cyclomatic complexity 21 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-options.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dd2ffd9497fe0e674218fdf435b3982a7300dd33d1aa067f28ef7011b54002"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 21, cognitive 19): selfTest has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27d7ac6072c4b95faafa9345e4b8d6af9acd31e8ec5332394019b2ffb69a2ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateOrInternalHostname (cyclomatic 21, cognitive 19): isPrivateOrInternalHostname has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-batch-input.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3692e74436e9c2b799119edb47fe9fa3b9f60e72d48d6415402f14578e2d39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function proxyFor (cyclomatic 21, cognitive 17): proxyFor has cyclomatic complexity 21 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3a0f30c14a85693e901728e760a4d28a174008a7b2971fbda0c94eb753e680"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveExperienceFilter (cyclomatic 21, cognitive 16): resolveExperienceFilter has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56029a2945aea3901849396fb99d8325d0fc8ea367c54a6f6d41341026a75c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 20, cognitive 49): printSummary has cyclomatic complexity 20 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"43642e35d9e5adbbe95deb1b3fe5f2f1cc5f71a525e064614303db6dc96345ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromLdJson (cyclomatic 20, cognitive 43): fromLdJson has cyclomatic complexity 20 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-parse.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"277a7facedafa1b6294447255650d6abb7885f4dcc4992838d1b2a0c8c4edf29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setSection (cyclomatic 20, cognitive 42): setSection has cyclomatic complexity 20 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/profile-yaml-edit.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc20c7d2e3f2de03ad3d9d1fc00d66da69cd658848398dc73faa87ad917e8adc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchInteramt (cyclomatic 20, cognitive 41): searchInteramt has cyclomatic complexity 20 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-interamt.mjs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd2c75fcd69789bc22cd478e8d62a23ce286841545ec5ecc733c08b13044deb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 20, cognitive 40): fetch has cyclomatic complexity 20 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/alibaba.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cf1487d6c738dce47792f7ab277d9de7c403dbc51f25145d0ca06088df2a98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 20, cognitive 37): fetch has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deutschebahn.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a7796c900ccc36ff89d5ed7fc5c4842462cc36a09b4b461294f9f0a6c60ad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bodyAt (cyclomatic 20, cognitive 34): bodyAt has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/walk-tree.test.mjs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c3b79d277dcaf185ef40000f8c86d47bed9152463d91509af65b00a4864d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBreezyResponse (cyclomatic 20, cognitive 33): parseBreezyResponse has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/breezy.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1a3a76f00bfb0db66417e5dbc7e72aba94242d058a9b4eb00f81daa7aea42e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function split (cyclomatic 20, cognitive 33): split has cyclomatic complexity 20 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"0425d74c15abd2abe65d9d5baa7ea73d0df4721f5df468ebdb6b6f7f89574a98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeFromContent (cyclomatic 20, cognitive 32): analyzeFromContent has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf153133d1a5d55da04835889d450219388c7d4c155f86ad35b8eeaccde119b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMatchArgs (cyclomatic 20, cognitive 32): parseMatchArgs has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2169a4aaf8e2347564630fea589ebb4d044943c839b195525e127e98567b056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atsLint (cyclomatic 20, cognitive 31): atsLint has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e155ec31030f82a88f88d3f5f0398a03f1c8ae15aaef8bcebd99419c8acf03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 31): main has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c2bc69d5e79c2ea4316d73516ee269c705f720db9eea059b3934a38f07a0c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPdfLayout (cyclomatic 20, cognitive 31): inspectPdfLayout has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-visual/layout.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f78fd4a489a8ee3bb24b4796a9608a3469dd8875945029d36fbe0a4b8d4a9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAtsRules (cyclomatic 20, cognitive 30): loadAtsRules has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4bb9411977e110b940c3c95413d50325219c3989c615bb95d9845153240525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeScanStats (cyclomatic 20, cognitive 30): computeScanStats has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"44121d8fc57fe9a7e50d274f72aac98837e84e127d1adcae4e5e63137e8e6df2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFillResult (cyclomatic 20, cognitive 30): readFillResult has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7314eaaf31db13838d74243382233281a792b6fcb0eb97d5db8a73f13574ca3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseYCPayload (cyclomatic 20, cognitive 28): parseYCPayload has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2356aa4aba0e94db86e7f81178273475672b796ba5b72b5f9ab8eaa7d736f20c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function viewsForMutation (cyclomatic 20, cognitive 28): viewsForMutation has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8c0ddedb76ae6bf6f2045383de2aac8a71056d76897c3b1bd98e3ae957187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBulldogjobPage (cyclomatic 20, cognitive 27): parseBulldogjobPage has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/bulldogjob.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1a071812a5562001cd159aa746587322b4a38cbde826629a2034d97d36216e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startsRegex (cyclomatic 20, cognitive 27): startsRegex has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/helpers.mjs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1792a07c54147bd7b9bed1bc6d5b69908b0f08a6788b53994c89bf3e30057a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boardFromUrl (cyclomatic 20, cognitive 26): boardFromUrl has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da11f2460b3390d39e4d370da671d9ddfd7ed6d9602cd73c429624077cb25d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseVtimezones (cyclomatic 20, cognitive 26): parseVtimezones has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b5eb28f147579fdc475a1f1e876033569087c8e992f3a6c8b40686d4fce370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadReApplyWindows (cyclomatic 20, cognitive 26): loadReApplyWindows has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aebd40eeae545766bcf89aa8d0b0d0ff5030c61e209747f776de1ffbf75672"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateScheduledStore (cyclomatic 20, cognitive 26): validateScheduledStore has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs-store.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f22a5129f24650a2238944b1684c1845501d6d80e21e7ca9ec9eacdb8920b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addEntry (cyclomatic 20, cognitive 25): addEntry has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2597f3308c146992d2da4d0f08221b957f459d5836cf12a531e35e04f8afa85f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 20, cognitive 25): main has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06957ff11df39ec4cd5e92f26c5bffe6bb067b5c19fb611f6c69d7f12225ab6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSalary (cyclomatic 20, cognitive 25): extractSalary has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0034f2c574ba6a4942c2e985a2a33c746fceff9ddd68305b3296fff14fdfa339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 20, cognitive 25): fetch has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dover.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ba7e18a1f964be108523d5bf0249baaf6636bfa89d9d0c98f542ca33806e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 20, cognitive 25): parseArgs has cyclomatic complexity 20 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8f44996e261427056c295cb68ada6a1a96f3f0a8aebf25fba2aa5120e1b69a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdEvaluate (cyclomatic 20, cognitive 24): cmdEvaluate has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"0791c172e2b5da2df187e4471085668f75d5cdc5188ce4f53d583796dd2ba948"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unsafeManifestPathReason (cyclomatic 20, cognitive 23): unsafeManifestPathReason has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"097332f035546f8a7b112b9a3aa2fe1fd38186eef69bd89b3a6eeb6dbe53a039"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeView (cyclomatic 20, cognitive 23): normalizeView has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a79e95b71670ee9771dbf8e3c2ad0d9ec3844f9695df47c8e342e7de6df493e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeArbeitnowJob (cyclomatic 20, cognitive 22): normalizeArbeitnowJob has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitnow.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cd5663b686b54d27d34921ac226e0855c344ed8e685b477416846332deeed0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHits (cyclomatic 20, cognitive 22): parseHits has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dassault.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca8ae676035ea5b097d004d530f333cb34660fd60c654411728c1e2f19a19b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 20, cognitive 22): show has cyclomatic complexity 20 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd245e2be3f23946e5f4a490e337135dbc0c0e28b24a53abbb93be91c58f421d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTorreOpportunity (cyclomatic 20, cognitive 21): normalizeTorreOpportunity has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/torre.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"caebf10dd9b554960c17989c49355d34737aaf5d6711cefbebcf2aa9e3431996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPrompt (cyclomatic 20, cognitive 21): buildPrompt has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-prompts.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"42897b3baf0080df742fe80b20648f87936cff5ef1a5c9b7452d1ba492fbc1df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKey (cyclomatic 20, cognitive 20): onKey has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cec4020b9354b5720518acb2d5db62ab2aded6f624aab7d0992a4df22caefcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 20, cognitive 19): runSelfTest has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-ats.mjs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a13df386aa7680fa7bccf56277806ceb4c0f35b96e31e1e1d91fd8249ded7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMarkdown (cyclomatic 20, cognitive 18): runMarkdown has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"54247e8a52eda0f9b22258a9cf9da60db157f1a2d3c3ffbf3b4cc98ed4250005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 18): (anonymous) has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/templates/templates-section.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458340403583eb253e1e815df65828cd183afc07aa0047c62ea733ec7e47b60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 16): (anonymous) has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contact-extract.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c92e1e5013ec18dc44921e1d3184e5c78ed1b40f88ad893a9f7a622c67ef12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function latinHeadingKind (cyclomatic 20, cognitive 16): latinHeadingKind has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d85b3829ff8d94a39bd4649eaf85f15e88cfc7f4cf1d281bdd56ca32331c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSeekUrl (cyclomatic 20, cognitive 16): buildSeekUrl has cyclomatic complexity 20 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-seek.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e9113710d7e362203c148f000f3240e454d0a4ccd57a292ca9b8697ca2b157"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseYearsRequirement (cyclomatic 19, cognitive 37): parseYearsRequirement has cyclomatic complexity 19 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4de54a4459f89db7b14ad5e6279a407a4b6211da3ec9c9d215635a1e02b1025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanNesting (cyclomatic 19, cognitive 35): scanNesting has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98c96b22601677c486b13958a070beb1387a230e00a1901efceca5bdf7c94d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 33): fetch has cyclomatic complexity 19 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"307d3a1707792bee32ac71681f000a0440afd09b94fdb84fc00e344ef35ee7aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeCalibration (cyclomatic 19, cognitive 32): computeCalibration has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2675e30d56f91282d4fadbd96580f6c91dc7abc8069554352e4e266fc92fff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 19, cognitive 32): parseArgs has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debrief-sync.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"495285ea6495afec56005325b2909adc048c4bfa590af408a70b5d3871857229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function firstEvent (cyclomatic 19, cognitive 32): firstEvent has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4286f8d6b05c09aac7f7b874e33e6a123ba28272d199cff0d484f0ec4f0e2461"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractCandidateOpportunityDetail (cyclomatic 19, cognitive 32): extractCandidateOpportunityDetail has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"696f5cdfe4a09e87f09890ebf4094855b34ea755b2427c0576037b8512f1422a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchTextMeta (cyclomatic 19, cognitive 31): fetchTextMeta has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65ca12baaf44a999066f8534c82ad5958d5670cc37e08b2d3720eec4f77a29c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compileLatexFile (cyclomatic 19, cognitive 31): compileLatexFile has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50e82c9869df01390fc489da1bf600ed57a041ebab0ced01118454e01ccbe9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 19, cognitive 31): printSummary has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"03535c2942d2b0a02b5e415192f3405ddba63d576f52aa44a7d768646c94e91f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processJobs (cyclomatic 19, cognitive 31): processJobs has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda8173c502c2672b6c71e655047e4ad667e198bb6457e17b26c135d8835f28d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPatternSignals (cyclomatic 19, cognitive 30): buildPatternSignals has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"005f2ffb3814f8709f65773294dd5c739eeb1c2a77bf738eb63b3920458a1525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadProfile (cyclomatic 19, cognitive 29): loadProfile has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3917fadcb28f2392fcef9e86a2b638c126972235f1fc05e0e8afeca64c6d41af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSvg (cyclomatic 19, cognitive 28): buildSvg has cyclomatic complexity 19 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-wall-build.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccefc6ae32a16038a857c3a15bb34195b0cbaee67acdceea04556e273e0d958c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planScanHistoryPrune (cyclomatic 19, cognitive 27): planScanHistoryPrune has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1853111d5fdea699d6257e22c86ebe8a560a7fcc5c33a1d9bbe2c8a1f18204"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 27): (anonymous) has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_html-entities.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f0c47599b466eb890414322c29102b30d9a87a954c34ab4caed6a67c59fd7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 27): fetch has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/himalayas.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"94867f3180b7fcfc10e10e4ec82db657e5933f2c3b525aa69b704181d292ce2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseOracleResponse (cyclomatic 19, cognitive 27): parseOracleResponse has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d46ac302b810b0b8185ee898d4cbf33a39e266d966aac49397b7d49984237"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requisitionIdsForDedup (cyclomatic 19, cognitive 26): requisitionIdsForDedup has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d93d718a706d15de6fcbc5e732635c067ea85aea4f7d3e6bf1c4eb7096edee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highestMoney (cyclomatic 19, cognitive 26): highestMoney has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-data.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"715ad194bcbd5e256df0d58d9fd84734e5662c3ac061ad706cbb057b2c253f76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 25): fetch has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee88936fd283dd049cf846f59200250e0eee1932dda6664fc299106a8832589d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrakstarPage (cyclomatic 19, cognitive 25): parseTrakstarPage has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/trakstar.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"06290ac5c4240d07b0109be49277d38bd66a35363958606eb3bfd9d6985a1df2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspect (cyclomatic 19, cognitive 24): inspect has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/privacy-guard.mjs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e32d553c17293df3c266a93f417076176c5b3ad4a6e62bc538eefc3e8e98e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installIndex (cyclomatic 19, cognitive 24): installIndex has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e350ebc989da394fc75d3f2175f6a16fe9c68e58187589ecf658f449c9b05e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHomerunFeed (cyclomatic 19, cognitive 24): parseHomerunFeed has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/homerun.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"974fc4605b24ba223f2ace0d77f2a47d852f1038cbf8f9f101f3b3bc730b5466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListResponse (cyclomatic 19, cognitive 23): parseListResponse has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2bd9cb63b53e2f8793a47b78850f7ab73737d37f9a5ba80640fa36fef5e3d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePageChunk (cyclomatic 19, cognitive 23): parsePageChunk has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/notion.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"150254637868dd580d22ba60f67067c6322d5eb489d178d2fdbfabb445a16965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 19, cognitive 23): (top-level) has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/aggregator-domains.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f828982a65153817bad9ff3ef1732fe6090f492f11c3d1154eebe3918e83d870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildStatusHistory (cyclomatic 19, cognitive 23): buildStatusHistory has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a4e8725222ab73d114ab200d4457750d6950dcae9144363fe875bb5b489fb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildClarificationDraft (cyclomatic 19, cognitive 22): buildClarificationDraft has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd135a2442b8e7b7c9ab66b7fb73f478c3fea648a0ca2b46e74c584b02945fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 22): fetch has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hackernews.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acf24850fdea7340a17e194d310b91d79234d0dd0bd42348a27dd3185db0f07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncIndex (cyclomatic 19, cognitive 22): syncIndex has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f1e43a081a3a071c55a75b156e8681a6d78d8d957e79fe07b494d72980e4e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateRegistry (cyclomatic 19, cognitive 22): validateRegistry has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-plugin-registry.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d010c4111b21889b09d8d1e4082f61ae10fafb2d2019ee275c41a8591be417"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 19, cognitive 21): POST has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c754ec6cc95cadeb418e6dd2e128fe470e9c422b65a98444ef7aeccef2d96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 21): (anonymous) has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee52578308511d9289fb048a4357c9e6943938d7d9726e601726e3874d3c129"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSpeedrunJob (cyclomatic 19, cognitive 20): normalizeSpeedrunJob has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/a16z-speedrun-talent.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4fb589edc69ccb7e3bff0a7741d558043180720a5b81bf02145ba4abebbf87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 19, cognitive 19): add has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bace7e4ef4fc2d18975251b227d28ceb148d1901f7e15c3ef8b0cd8e19b44a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 19, cognitive 19): fetch has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693c770a2f19f56011d1c751d20781d570b349addc920095eb089efbce4c8db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 19, cognitive 19): POST has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/assistant/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"481cf1d0f5c775da0f70815e9a5bcfb849bf8f7a9680ac73559cd89cab467706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWorkMode (cyclomatic 19, cognitive 19): normalizeWorkMode has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-data.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e2b8e39f376d97540a4200f36c6db062470e04e179edc697c3a4bfc7e7b3a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TriageRow (cyclomatic 19, cognitive 18): TriageRow has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/triage-row.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe2385d94271483c5cd15f14daeaf0c0c630bbddf1ae3529400f4273780566c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 19, cognitive 17): runSelfTest has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebd060c8b2c6b3a7742bb3e7ae13009ba72cc3b13244e71402529a19916536c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSubmitControl (cyclomatic 19, cognitive 17): isSubmitControl has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/submit-guard.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"65350118241bb6dacbf09e3666052226ea182113a7b7f2aee3b69f003811629a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveChat (cyclomatic 19, cognitive 16): saveChat has cyclomatic complexity 19 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-chat-store.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6c12da2d18e9ebbeb56fe79e52bc051405dca42fea7c9f836a80cae47bc5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseObservance (cyclomatic 19, cognitive 15): parseObservance has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c81933f5f4f02b5c3bb49d0a741db68734867f45429259ac52be52affa56fc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeJob (cyclomatic 19, cognitive 15): normalizeJob has cyclomatic complexity 19 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mycareersfuture.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"29716631337de39a0a79df73a393817b9a1edd9f61dfb4e1a24c2db7b5dc6b36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIcsDate (cyclomatic 19, cognitive 14): parseIcsDate has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21906834bc80b7af8af8848e94f6fb297b6c3578bdbaf504a97fc5c1a5859e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 14): (anonymous) has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-chat-store.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33d1bf609cf8e687de9b831aadd06d4d8b1dd064c36a750f457c3b04c975b68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inboxCommand (cyclomatic 19, cognitive 13): inboxCommand has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/inbox-keys.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf5c49aad9ca2c2dadb76aa606ff50ee1944157085b07ed25aa56650e85dc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withoutExpiryViews (cyclomatic 18, cognitive 40): withoutExpiryViews has cyclomatic complexity 18 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53e4531482483548a0dca7bcdffe6e6046b0b6127fc6291895575557e3a1e0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptDirLock (cyclomatic 18, cognitive 35): attemptDirLock has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d992a3cb311eb1294165549904a74643682312be88f577fb3fc70b83f25189"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJobviteXml (cyclomatic 18, cognitive 35): parseJobviteXml has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobvite.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"73201ebfee918e9463dbca6af59c6741d5706a7c38ccaaefd2a192ef1d47571c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attemptDirLock (cyclomatic 18, cognitive 35): attemptDirLock has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab101e7fa5fff69d977f934ea1b469b564452175812f0adb303fd89d0bc05f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processFile (cyclomatic 18, cognitive 34): processFile has cyclomatic complexity 18 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clean-markers.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c643990d11c5964b28bc0199d2db35110091c085c69ca54cd929ae0e8d7d4f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configuredTemplateVariantsFromProfileSource (cyclomatic 18, cognitive 34): configuredTemplateVariantsFromProfileSource has cyclomatic complexity 18 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6c40d71153da85db455b12b1c72c1679bb0f35b72c33df7444cf2537d24c40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFreshness (cyclomatic 18, cognitive 32): checkFreshness has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d08e36703f72ebecb53eff0d002a9b2559725c776913c3797d1b9516d3e0b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCandidates (cyclomatic 18, cognitive 31): buildCandidates has cyclomatic complexity 18 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0e4dd130f398ecbf2d401fd7ab5735d777d2f565d3efdd2ea6254beefade44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 18, cognitive 30): (top-level) has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-field-filters.test.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46f7fffc865be19659a236a751a940476b01d4bc135330c7a51cc5e60afe9c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCheck (cyclomatic 18, cognitive 30): runCheck has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-tracker-url-match.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f54a6a669cba9b7ef5c751b52b48478ded17eca02a22e3f0f268477a42dc35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeUrgency (cyclomatic 18, cognitive 29): computeUrgency has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"e153793e67c05e0a68e29bfbab73e31acf44b741cb639d2122a343667c911119"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 18, cognitive 29): fetch has cyclomatic complexity 18 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/glints.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05c3a1901f42c3d7c472d00fa2272856cd77e408e055eb78fa75d5de7d8edef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPredictedDiscardReasonSignals (cyclomatic 18, cognitive 28): buildPredictedDiscardReasonSignals has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba71cd82ee679215a478cd9d95d817aaa81d7efe2c8e5c2e9462e58ed46497c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendNote (cyclomatic 18, cognitive 28): appendNote has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-slugs.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95983e1fea36440defe92ea0f59d61078849643af3432e72346c6c758502b24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchJobPage (cyclomatic 18, cognitive 28): fetchJobPage has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a113143fae7ac5da6117ddb5ec75083d0b63bcb3229f94592d3e0ea27a8b8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePythonOrgFeed (cyclomatic 18, cognitive 28): parsePythonOrgFeed has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pythonorg.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"170888db0f9657595657e22640e875685b36d9fc666efc3bd74a4893bf4eb7bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 18, cognitive 28): (top-level) has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-ats-full-paylocity.test.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3098d34e632ba70f689c167b5035154225bd41db0631f50e8bc618c950a694"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printResults (cyclomatic 18, cognitive 28): printResults has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb170005373cfd2e6ff111cdeeb4fec1693a108109d58981c3d154586fdcf06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchJurisdiction (cyclomatic 18, cognitive 26): matchJurisdiction has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ccfec6510602f9a6f6bde4910273c41c01d5be97d8a3e0b6488d4be5d44cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeTrackerStats (cyclomatic 18, cognitive 26): computeTrackerStats has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a19612d5edd6c6a03f03a4682fcc279fab7906f928c7c38710639f882ef2050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPortals (cyclomatic 18, cognitive 25): buildPortals has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecfb198aa2d3aa3a5bd8b078fb08c035690bfb534ae4c9ae4875edf2de7f122"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGarenaResponse (cyclomatic 18, cognitive 25): parseGarenaResponse has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/garena.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30351f8f4982a76cae81ebc4ca4234ae9113cacd75a81469b51a33c7176c2ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshotConfiguredTemplateVariants (cyclomatic 18, cognitive 25): snapshotConfiguredTemplateVariants has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de0fab7f412dfba4c99111ce3d690b44accbf270aa0e386d75aff050cf5f9bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDate (cyclomatic 18, cognitive 24): readDate has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"closing-soon.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6334e149a1db82d6d19289d4418e0ac7c535464fb2710bc0c715a9fa36248f0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseClearCompanyPage (cyclomatic 18, cognitive 24): parseClearCompanyPage has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a267e45211ca6799faeee11b39a772e6389bbc08ff2994a2abf2c7cfd3e9ac8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUnarchivedApplications (cyclomatic 18, cognitive 23): findUnarchivedApplications has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fe1304207a4e4901875c5447e6b5da306a32cb8df91b7a78bcb719dc1c29f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateLatexContent (cyclomatic 18, cognitive 23): validateLatexContent has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa1ac4a57d1a201c805556ad7e7bb145cdd68691c63ab78899952e4bf5d6c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 23): main has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-wall-build.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3a53ce6d911ca0ccad3e44b994d3d79ad20e9629128a84a6f3af64b6359025"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeStatus (cyclomatic 18, cognitive 23): writeStatus has cyclomatic complexity 18 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/status/route.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05e1ac7fe9f17bfb11de79d8c487f517a8db221a2f97f258021fedcf2d7f195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 18, cognitive 22): parseArgs has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e82becd5d7d91faca7dddbdcff23ae718190aaab9a8eb7c33fe966442b19fc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function race (cyclomatic 18, cognitive 22): race has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/add-entry-concurrent.test.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b009e4edaa1dde22df9077f1c2c41028dd2ca4264d5437e32734c8c15ccd991e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hiredRows (cyclomatic 18, cognitive 21): hiredRows has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-share.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc06db482fc78d6ff19fd7a412bda931614583422e5154ddb2698cc3d89e4c91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQueryResponse (cyclomatic 18, cognitive 21): parseQueryResponse has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/aldi-nord.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67627d4f68cccda2301f427380952b253a89067ecf0f5fa515a8c6a91d78b7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRules (cyclomatic 18, cognitive 20): buildRules has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"utils/privacy-filter.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fd4cab6846b26fd481fa71c040fd85ebab4f130066ab7f9ffed9513a1acea8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 18, cognitive 20): POST has cyclomatic complexity 18 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/fill/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"544dc3ddb09b4e8a00fe3a08a03bcd66dfb6a7e471b501fbca3cecae833bc73f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePayloadShape (cyclomatic 18, cognitive 19): validatePayloadShape has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ats-payload.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"710ba46671b2247d4f773bac1067ceaef28ff22a388334e1693c69e659717043"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 19): main has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8d9e3b861f4e97337277a143554b1131eefce8279d80e3a1817151a59dec37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redirectToMainCheckout (cyclomatic 18, cognitive 19): redirectToMainCheckout has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473192681e10808e0a2726581aaf5127eb4b2c4b40b9de0daa0285fb62f8e28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 18, cognitive 19): start has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/prefill/route.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0658ed42dd50fd8ced871337b359eeaf13471a700c9400b21c018bc00309d951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6ca39b201c33ea15ff2bc50a511af0fbdddd637bfd593ffc47eacdb29db687"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 19): (anonymous) has cyclomatic complexity 18 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41433b5240c06f6fcda57029654b1cf1e18fbfdddfc9f3a2ac88fb1d591a474"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 18): main has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/check.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e699a0f3b35dea49bc62b37b0d2cef2dcac351f26cc573e1998f3c6768b7ffeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 18, cognitive 18): add has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a0a87fd0f38a5e8117374ea8408f990447685549412635cdbb308f0abd95bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function profilePatchError (cyclomatic 18, cognitive 18): profilePatchError has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/profile-patch.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"396ae8a9a55cdb3895dae1d1769e092afb101323cfcaa86f9f375903e5040e92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCandidatePhoto (cyclomatic 18, cognitive 17): prepareCandidatePhoto has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcceebbc828080f7f848306e6e87c07126c930398fb9b334f4db6248e05e41bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeTracker (cyclomatic 18, cognitive 17): mergeTracker has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"68862f276d0fca60cdef16c18cd71c085a583d2ead309bf31596516822ffbcdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function base (cyclomatic 18, cognitive 17): base has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-visual/fixtures.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"698581b9d46f701e1fc747aad0ef0703d06328d9aeb9bbe845e1f449bee2cb4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exportMd (cyclomatic 18, cognitive 17): exportMd has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b5c8edcffa257e022782bf6833931ed913b73222cc38dcd0d0209cb53c0d20"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeJobPortals (cyclomatic 18, cognitive 17): writeJobPortals has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eb17a29f70343f6eaccde36939841177be7cc1dd1485cec380146bfa68f721"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JobCard (cyclomatic 18, cognitive 17): JobCard has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/job-card.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c52ecc478bb30a474d5f10a3826a46b16470d21aed0ee02d43a4115d1cc086a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChineseAmount (cyclomatic 18, cognitive 16): parseChineseAmount has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_salary-text.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1ae589cf416b3949106bb801f49062159e52bbe1fb949f6374493be63b6853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findDuplicateCandidates (cyclomatic 18, cognitive 15): findDuplicateCandidates has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"precheck-duplicate.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab06ed85f0a02674c2d8b752812ca409ab303299db9bf12a03e80ddd4392048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/_http-stream.test.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce98b7a37c2edab0185ed90c716d85aaaa57f476f45e8e3902e3c23d24ffa52b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attempt (cyclomatic 18, cognitive 15): attempt has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/browser-suites.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d78727171c70272e2aeca1dde1c884e0557e2f8b1af7c62cf3dccb874717fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 14): (anonymous) has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f32278733593db25b0ea9896b7cceb85bb742dc86fa313dc5dfcf0b5e5fba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 14): (anonymous) has cyclomatic complexity 18 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/plugins/h1b-sponsor.test.mjs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"78273fe0c60c929cfcb1fb10e9bb475266f6924ab7b7f54fec7e65f1179a786e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 18, cognitive 11): validate has cyclomatic complexity 18 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/reply-proposals.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c272e16ecda3c3363c73d9fdd0d1ecbc04408e42910516da18126518bfb8b5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripNonRendered (cyclomatic 17, cognitive 42): stripNonRendered has cyclomatic complexity 17 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/generalist-world.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda6b89319abe501e8243cacacb9351ecddca4fceda9348bac9adab31edcdb3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 41): (top-level) has cyclomatic complexity 17 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-consent-footer.test.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0503a6b06a8c8d150f406cc8eb245f0666b0e7be14ca95e5e7c11f5faf90ef9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRange (cyclomatic 17, cognitive 37): parseRange has cyclomatic complexity 17 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/web-test-layout.test.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f761c471e880065800183529de77d79d6f5dc2b5af5c7c476bf7025b247afa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 36): fetch has cyclomatic complexity 17 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tencent.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5418a374667d21fc7f00583df7539befec9183058eb6cad1e29d53ba0064fdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 17, cognitive 32): printSummary has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"08360cec6666e5a86a4828d3b571d09b89273b158cbdc0bbbd84d554b286b468"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function release (cyclomatic 17, cognitive 31): release has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6937f48f970675881c83b07284dc1c6a40ce425dac34ac0acd60832229bb152"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function release (cyclomatic 17, cognitive 31): release has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"65037274477b9bf8e752caa0fbef9e68f1ec8dc73daacd95f103941e7e0dcadc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveConfig (cyclomatic 17, cognitive 30): resolveConfig has cyclomatic complexity 17 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/aldi-nord.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3710df5c550cb30c5cfc859e980bcff10e4389d5f1006e3fe0978e3d404f35a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDocumentsMarkdown (cyclomatic 17, cognitive 29): renderDocumentsMarkdown has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be0f0f65e470e68468c2ba47f531246ee35fe03cf1dcae385ac664eb4fb2714"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCanonicalStates (cyclomatic 17, cognitive 29): readCanonicalStates has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/states.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"175c51357445c6ff3cfa8d3947e251388f4e17d0c5ca656cb8d59e3ecdf62c82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 28): fetch has cyclomatic complexity 17 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/agentic-jobs.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"512e8bb4f11070cdc77d7e24835e37af407af612bb427af272b4f2978dd0759b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedText (cyclomatic 17, cognitive 27): readBoundedText has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eb2329bf1647e801db88a1131c6dc64cd68c4a6b332831f7bf1ac617ab5044"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListingPage (cyclomatic 17, cognitive 27): parseListingPage has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/careerviet.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf0c6487f503d3c9ec9760aead897ca25f11111af8cbd1e53ea24553f844346"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 27): fetch has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remotli.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef2381009f128d3bdb9fce3789596ebba1c5dc60df14575b1c796189948f46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCriteria (cyclomatic 17, cognitive 27): parseCriteria has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/talentlink.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187bbe615aebffbeff27aa6814a3d825f4e05173881a48b9cbf0ef6df128ce8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsv (cyclomatic 17, cognitive 27): parseCsv has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-import.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b78b989bf02f788c22a0f2d67477da5b76653ae227309cd885cbe86557685f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLiteral (cyclomatic 17, cognitive 27): parseLiteral has cyclomatic complexity 17 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0c78c62ad657889a951dd7335ff215289bb45057cdcc14676ff4ec03511787"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function htmlEnd (cyclomatic 17, cognitive 25): htmlEnd has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d597dd3c286a82111b76925fea7a26809133b76e2065fdf8b8b2ac27e6cc11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRemoteJobs (cyclomatic 17, cognitive 25): parseRemoteJobs has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/remote-com.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f669f840e8c0ef9431b2aaa15a5d0aedca94fe9d7d37ab2c803420b4ac029b8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHibobJobAds (cyclomatic 17, cognitive 24): parseHibobJobAds has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hibob.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"78115e9ddd6b4f3881385915821117023f78b7eee3ee349924e7155cffb95c22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 17, cognitive 23): apply has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"learn.mjs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"723d30f2e28e4cfa49eac5176fb09815786ba672cb9a477b44dcf3abed48b1fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSite (cyclomatic 17, cognitive 23): resolveSite has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff0dd0526d4b614cb00c7017d5962f4ff40b264516eab91a4752e95d7af9f15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChannelPage (cyclomatic 17, cognitive 23): parseChannelPage has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5450b7c437f4f00496e125fc2d377ceb7be36dec7000b7d584d3758a9585b82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 17, cognitive 23): (top-level) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/contacts-exclude-self.test.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ea95859160aba469affffc86e381b998cddc77e35f3c1cfa3420356c51853"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadConfiguredTemplateVariants (cyclomatic 17, cognitive 23): loadConfiguredTemplateVariants has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e3a5bf63a6bcc3c2bc3ffe10aac81b8dfe725ea1c21f860ffb087a066ac0d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 23): (anonymous) has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038f402637fd00974d354198a336316be082ddfc0ad39cfcce701258b219eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tailoredResumeText (cyclomatic 17, cognitive 23): tailoredResumeText has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"912a94fe6b55f1a9ae7ee2ffe840fd09837fa698bb2a7a6855c1661616721313"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 22): main has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"archive-posting.mjs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5586835e89a626bd43742fbd5acdead68b8f70f9a49391c4a5d04e2664c42d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStatusLogSource (cyclomatic 17, cognitive 22): loadStatusLogSource has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c7f8a0f6fa094eafd77a59ea51f40a19fa82bfedc8447f7bc2c4aabe91f06c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSearchResult (cyclomatic 17, cognitive 22): parseSearchResult has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d88b75d104bc2473901e60f5a37b2862bbc4a090deed0b7eafeab766d8a0684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGermantechjobsFeed (cyclomatic 17, cognitive 22): parseGermantechjobsFeed has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/germantechjobs.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e315bdaa740f88586fa5513de170f4fdfec227ad808eae4f4b5e2be372a71c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 22): fetch has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mycareersfuture.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af37c32639d165f7756cb34e0ee8be9b5a713019ec75af974897f263e61868d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTaleoResponse (cyclomatic 17, cognitive 22): parseTaleoResponse has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b956a41d76a5392f399080412fa61cb2f85b3c66328a3442b87f1b560f2bae7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeAllStats (cyclomatic 17, cognitive 22): computeAllStats has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f653f59708affb7b6c9fff8a4a4a07d315b3406ed89f2947bf4623946eb0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTailoredCover (cyclomatic 17, cognitive 22): resolveTailoredCover has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/cover.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"972297760ad53f709f6c1197029cce988ed5c3d1385480c50cab972dc08e6da0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handoffDecision (cyclomatic 17, cognitive 22): handoffDecision has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/handoff-gate.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e39fc9de9feef318ddb8778905fda706024dcdbacd6935b9032c5d3e116ada"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locateTailoredPdf (cyclomatic 17, cognitive 22): locateTailoredPdf has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-pdf-file.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eaeeb309e5eb9dc60bf1712dc7e4705af0ae23fe43df582437686f434e9d1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scheduleCadenceLabel (cyclomatic 17, cognitive 22): scheduleCadenceLabel has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/schedule-label.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"47047f54e219136f8a3f1945d69c04a4b6acc8ec6bd8f249625a53f736f9f22a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAndValidate (cyclomatic 17, cognitive 21): resolveAndValidate has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_net.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdc226c321da77f0448b1f818156bd3b08cc632694256fbd8f2971b3e2d63ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePolymerPage (cyclomatic 17, cognitive 21): parsePolymerPage has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/polymer.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a4ebb4af9f13743156aba5038d88134a7fa8b46484b3d73bb33acfbcb5b508"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkStatus (cyclomatic 17, cognitive 21): checkStatus has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d0585e4b5045733e08c76956946192eb36574aa2684ee9e733dd1414c5a2b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 20): fetch has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/join.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"806a60c2e6e62ad4f2094fb967f6199c9a3bf7e2b166ed35166598409864e81a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function labelFor (cyclomatic 17, cognitive 20): labelFor has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/extract.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67483de0b3edcd944bf1132ac60f68e533630176f657e92aaf6f7d38d89306c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setListInText (cyclomatic 17, cognitive 20): setListInText has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/portals-config.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"174d2da555ed8e29e1b0aec7283530cda9ff6a1f09e14885e38d5fb9861c3d92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atsFromUrl (cyclomatic 17, cognitive 19): atsFromUrl has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ec4d93c7af7b7537d911fd18297d7b00551ee7bac01a5785e177879c3ec541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTemplate (cyclomatic 17, cognitive 19): resolveTemplate has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aafb855c9f84e64d5ce37443c6f458ea56096301215204b051550782bf680b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseNeogovPage (cyclomatic 17, cognitive 19): parseNeogovPage has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7f315babd79d7bc6204e3f7e3e54b562fe7765876bd431009c7e5a6dd8ad1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function languageVersions (cyclomatic 17, cognitive 19): languageVersions has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"612c0d949207f89c9a3a02301b5fc9c926420a115aa8e54f08560c83d4029940"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDestination (cyclomatic 17, cognitive 18): resolveDestination has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bf215f318e93ffc0fea49a463209f32ea3fbeed68fa5e0a8cbff52b5a1b224"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadLedgerReached (cyclomatic 17, cognitive 18): loadLedgerReached has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"45731978bccdef486821592abd832c27dc2d526f19d12b1ad6ebdcab7cc14e0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 17, cognitive 18): POST has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/apply/session/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0ac8320b2aaae7e326c1e5064745ae75fcf05555ea4b1dd4fe0d6617830dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finalizeDrivenSession (cyclomatic 17, cognitive 18): finalizeDrivenSession has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3f25d848c0a4981608615197ee6c20f9489c160c06e6588a3ee8ede0bb8fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForTimeout (cyclomatic 17, cognitive 17): waitForTimeout has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/apply-unsupported-ats.test.mjs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17f04519c1aa26231d27c367533c552cbd32cc43a7b21658679e1d80efea34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeGupyApiJob (cyclomatic 17, cognitive 16): normalizeGupyApiJob has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gupy.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"343bd713451b7f4d7b853ab91eea9caeb10e195e8644d06f4fcbd92bb1a0f1d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJobstreetItem (cyclomatic 17, cognitive 16): parseJobstreetItem has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobstreet.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6edd146a4b5f461b59bb76a6e2eb319d0168d1c04104bc90651dd44037a1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseA16zPayload (cyclomatic 17, cognitive 16): parseA16zPayload has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f8732a09c5d1e2f25e63ca4980fcf1f170957905aeec24d27cc27d044d1a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateParser (cyclomatic 17, cognitive 16): validateParser has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6fa8237e5247fa21c5febcb7e3959aa33b25a34fd9b39c5dafa2d85574f442"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filter (cyclomatic 17, cognitive 15): filter has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad8e09e8d1c43506876cddcf285cf34bf9c3c91fedef2827f4da827bf7cce7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StatusConfirmationCard (cyclomatic 17, cognitive 15): StatusConfirmationCard has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-status-confirmation.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab11567b178202462615373c508f1dc8182044eae7adb9defccd0bf488d951c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ResultsList (cyclomatic 17, cognitive 15): ResultsList has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/results-list.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a038d6a3feabad2013598eb4b7545e229db97959ff15ccd9cb6ae62f16230981"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DecisionCard (cyclomatic 17, cognitive 15): DecisionCard has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/decision-card.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03b4816a237f5c1d41668adadbc812f2e66d46936a9cded6ae8938eac9152f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OnboardingProgress (cyclomatic 17, cognitive 15): OnboardingProgress has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/onboarding-progress.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a65dd4cc25cb1dd307ff5976632f8dd3ab5ff7bfdd7f85740cd4a57a5b98cdf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 17, cognitive 14): fetch has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/index.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460967ab007527d77756e39da3e100653104972c3a1624f656976ffb62a9995"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function worktreeUpdateTarget (cyclomatic 17, cognitive 14): worktreeUpdateTarget has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39e8e370ebe3335e05cb18c26d59da33ab0b02920246c5e5db0a864c243183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluationGateForJob (cyclomatic 17, cognitive 14): evaluationGateForJob has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/job-gate.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5998350ca1221a9a4751c2c701300ab3c5b5053a74ce0c80056ff15e5a473b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function issueBody (cyclomatic 17, cognitive 14): issueBody has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f41ab54c760395f49d80ffaed3c2049529f033f0b1730dc5a9238af51a8b945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIpv4 (cyclomatic 17, cognitive 11): isPrivateIpv4 has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1b72d2f0f393b010a1f0251cdd2f112ed26c5bf7a1bd0f0ed93d42427805f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateIpv4 (cyclomatic 17, cognitive 11): isPrivateIpv4 has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-batch-input.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1224b6119074ba84c508a8eec93b8fe7ec7edd319b844e9eec15a0e6878fe74e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onClick (cyclomatic 17, cognitive 11): onClick has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/route-progress.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"66daf0441bcbb79bbe2c64e66469eeb1cf5b681505e7e6a733ccce88c5e60622"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PortalsView (cyclomatic 17, cognitive 10): PortalsView has cyclomatic complexity 17 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/portals-view.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa9089d2299d9cb6411a6032b6ba8efe53697b2e99e627233eecd959f57a07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unpersonalizedFiles (cyclomatic 16, cognitive 38): unpersonalizedFiles has cyclomatic complexity 16 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e500196e0ddc38eed023397197a69c06675393667b4744014f9d948fb7f220b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJsonLdJobs (cyclomatic 16, cognitive 37): parseJsonLdJobs has cyclomatic complexity 16 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e696ed6c8250441d504720f432d3787ef7f81b15ea6dc73c87e7b09ab94a376"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchAuthoredCommits (cyclomatic 16, cognitive 29): searchAuthoredCommits has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be747c21e176f34f5d5de16672f4edc7444fb2e318bd14bc31aebb6a6deb2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCards (cyclomatic 16, cognitive 29): parseCards has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/magneto.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ff6f2e160c36b72a71267c44c35505e9a4fdfdbe400632a247900adeefe36e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTracker (cyclomatic 16, cognitive 29): parseTracker has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c3c3446a534b2ea5da9deb7109ea12c6aec477858b4f76ee6c9d635fce2933"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function worker (cyclomatic 16, cognitive 28): worker has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ce0e0b56863da1a90e09fc23bfd3c543f32846b34ee15a0ece5e7ba85525d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function srcsetUrls (cyclomatic 16, cognitive 27): srcsetUrls has cyclomatic complexity 16 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdd79f49f701cf9891348a1ef9c3caa4a9baafe328f96aacf882ee21b40dd59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareStructure (cyclomatic 16, cognitive 26): compareStructure has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e278db3b9c8f6792b903a8559b45b010488e11a54025f06dbd3d4f0c7e1c9c2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 26): (anonymous) has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/employer-preset.browser.test.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dca6e743cbc9ead135a5b079d5f6018bd56190bebe5f79f487112dd512d54eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function planExpiredHistoryRows (cyclomatic 16, cognitive 25): planExpiredHistoryRows has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-core.mjs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"1637be5168857bd99980f78b949fdc9a45e188e0e8d221e284eb53378dc8bdeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 16, cognitive 25): (top-level) has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/run-rejects.test.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4740f8a591c5aff6319f6ddc5da9d6640f7bbf767eeed40ffaf41f57b910fbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dedupeAgainstPortals (cyclomatic 16, cognitive 24): dedupeAgainstPortals has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dfafeead37c09a534df07ff39220b760174c8305f454c2e671f13d105cdcd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatusLog (cyclomatic 16, cognitive 24): parseStatusLog has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce631430c9c237a2ae56ec5589c5a15dd0d3ba3e869737fa20b59b43cded062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDarwinboxResponse (cyclomatic 16, cognitive 24): parseDarwinboxResponse has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/darwinbox.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81ba79037a91652f0a011d2dd8d05a262e24b476561e664fdd43e3be36730c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPortalsCoverage (cyclomatic 16, cognitive 24): checkPortalsCoverage has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-pipeline.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4a58322efae22bf3a443840185b18d7b10834a2ded45bc25fb0bcb6c31d2cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUnclaimedEntries (cyclomatic 16, cognitive 23): findUnclaimedEntries has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d554337dbb5e0749ee62675e85be1cd89361a7bdd27828b8f6fa4313a60aeb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyUnknownHostSeeds (cyclomatic 16, cognitive 23): classifyUnknownHostSeeds has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"branded-successfactors.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4902d74fccab4df4d19855436052aeb7c91d1a58c66dbbb83df04cab9411e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapTrackerCaptureLinks (cyclomatic 16, cognitive 23): mapTrackerCaptureLinks has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cea2096e031a58a629b534b6a0a949ee46737dd26761b3eff65eaebbfb1370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyTier (cyclomatic 16, cognitive 23): classifyTier has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"classify-tier.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ea49284b63ebe4f9d08ff7e47088c60d9fa50ffdee9af3f3ded16e6dc2a42d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function crawlDelaySeconds (cyclomatic 16, cognitive 23): crawlDelaySeconds has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5819a5787b5f8537887b957f7f6a057ce9e33a093417f7548033d7638687df90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseContacts (cyclomatic 16, cognitive 22): parseContacts has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8abd8b7bb909b57b8026a8574bcd5de7b61b4ca62180f58e41f7c0a0771b54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDebriefSync (cyclomatic 16, cognitive 22): applyDebriefSync has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"debrief-sync.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8ed8535134c8c5fa148327e5cdd62505542cb29e0b856627893ec9315b6efd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function auditPlugin (cyclomatic 16, cognitive 22): auditPlugin has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin-audit.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6bf7466b1ee43acf06b3eca0f89908dd6f3d7f3f6c983d55574f808fcddedf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTenant (cyclomatic 16, cognitive 22): resolveTenant has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d521ebab907de38d1b7a67db6854816ebf2b94b8e66ad298728ff92702afc005"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBlacklist (cyclomatic 16, cognitive 22): parseBlacklist has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4034}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdeee3f59c6f3d737db73b803e64edba0618715871f4fbc0d2d524800013f65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function historyId (cyclomatic 16, cognitive 22): historyId has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"782d0473bbb13887114ecd7c4d38db9a4dc94fd09fac979ba21185ba044a1460"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileGitignore (cyclomatic 16, cognitive 22): reconcileGitignore has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be005f96bcc011dbe463f231fe7b2a6db33d21773a196a50487ff8a98380be9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 16, cognitive 21): fetch has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a731d9eb2cbe52b08aa235eecce93ebb7342e81440ce1bcc54faaec74bfd57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanSeekSearch (cyclomatic 16, cognitive 21): scanSeekSearch has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-seek.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb0fae092f6a94dc4f5034a7f6d7f922b01fb0e52f2b2d49f8509af42cf1132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mapText (cyclomatic 16, cognitive 21): mapText has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/preview-html.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d113436cf5d09f7f0bdd4e6e6f1cf92878238ba060a40c1424528367bc00fd16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListPage (cyclomatic 16, cognitive 20): parseListPage has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-myjobs.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"33263edf17a55ea856c7ccb9fa9ce90cfe1ad13553e04e8cc342b34a12e97ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIbmResponse (cyclomatic 16, cognitive 20): parseIbmResponse has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ibm.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68faf2339b93a90eeaa193beba03e88e6f2a216ca8a06c49a73709bd1dcc80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRow (cyclomatic 16, cognitive 19): buildRow has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf92a04f2d94c01a346b9611263e1d3004d5a250f4e81ca69c6bf3b83a08cb6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseSplitFacet (cyclomatic 16, cognitive 19): chooseSplitFacet has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"de149b06b881cc2cea8cc9f188c32396f1776cdc0b3bc16d733534813cddd2b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runner (cyclomatic 16, cognitive 19): runner has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/github-evidence.test.mjs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28cbd1500c96491c57c437b7155bbed95aa454aa5d583325abb4b7ee7085917"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGrokEvent (cyclomatic 16, cognitive 19): parseGrokEvent has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/run-cli-support.mjs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"875ae0be078f9ef3199109363537676da8f18022eefb9b7420df2896ff45ba0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mintToken (cyclomatic 16, cognitive 18): mintToken has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/token.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e756c6f5c033d1b2604dddcf52cc1ddc21ddebf07ae00198dcf67d5fe365947"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function zhCountClaims (cyclomatic 16, cognitive 18): zhCountClaims has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878a546c8834670f7188420fd90e7cfb1c82c58bb7561f078448bc18584f836"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupLabel (cyclomatic 16, cognitive 18): groupLabel has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/extract.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6e8317697cef2260dd3eb08b713e0ca05af58484a38716026d41c2f87dabe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function coercePersonalization (cyclomatic 16, cognitive 18): coercePersonalization has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/personalization.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1432fa6b525b436f6f11b1164b191760ddd5dd17f9f7761ae26c27d58d6d66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeHibobJob (cyclomatic 16, cognitive 17): normalizeHibobJob has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d4793a6ecec643340d73d16d29dd8c7bf36e56f55457a5a6e1c7a37d32335c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSummary (cyclomatic 16, cognitive 17): renderSummary has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc91a45e09adac39bec5c26426d0f47b02e86daac6a37bae6038c64276268c62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeFlowxtraJob (cyclomatic 16, cognitive 17): normalizeFlowxtraJob has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/flowxtra.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c6825910468c26a8da3061bc2343477d1d3aa1044ecbc29e8f8555b23bd0e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function slugProblem (cyclomatic 16, cognitive 17): slugProblem has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"81288f4104e77d0cdeba8c9bfc591cfb1cc44d8caa4d44fe237a2437fd585ea5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 16, cognitive 17): main has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"199dd8417bdd40a60d21f0568bce67dd40ec86632203bf7c78222044b1c65d87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function machineSummary (cyclomatic 16, cognitive 16): machineSummary has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evaluation-cache.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"61005d928ff008fa6ef75a9aec49bb6a02e5da8448b0933d4daa469d68962c75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalJobKey (cyclomatic 16, cognitive 16): canonicalJobKey has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"192dd1c0f4e9f5c5caafc29fecf8155193f97db0b2b9fa350b55225fad2e45b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalJobKey (cyclomatic 16, cognitive 16): canonicalJobKey has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/url-key.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5773837d75f3d8b19988473491cad241009fe4ad8d461a2060ed391d214c7fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processOffer (cyclomatic 16, cognitive 15): processOffer has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch-evaluate-gemini.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb51c292e8aac25eac46350e3d5d07fe832cbbfd5bac9385e391393ae3018e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockReason (cyclomatic 16, cognitive 15): blockReason has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"learn.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"745676b028a1804c42f35f022c4c82d5937fb3a88669c182837415f5287bd3d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/whats-new/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c26e1b20d4434eb01cc38f3666bcfda7606ab2344cb883139958c8966a962"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function column (cyclomatic 16, cognitive 15): column has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/compare/page.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ef2d7e7e0a1d9c1a560ef01bc8cce267c9f750def1f3098f2596695cd2c6b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FollowUpCard (cyclomatic 16, cognitive 15): FollowUpCard has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/home/follow-up-card.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035cdfaffd3142ccb6e870d86dbda1539db80ddd1bc6f13ecf47fe12e838860"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de9286cf71a92a24183419a098c94f8fa1e2524cef477295857d6c6b1faada6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRequest (cyclomatic 16, cognitive 15): checkRequest has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/origin-guard.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a2aeb7ed83ddd5a9d2abde5e80b13b1ec587d11a555020e03e247cd4efcede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/plugins/h1b-sponsor.test.mjs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"be78bfde7a023591eb5385fd254669700ecd5a1248aeaaa5c255a435483d4252"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/portals/verify/route.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e854927908112fcb31197f2ee0f578fe8110001cd2921f2a74398c881265c2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FirstScoreView (cyclomatic 16, cognitive 14): FirstScoreView has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/first-score-view.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7990c0b5d17857b0729eec58b220c028f456516d2fbd635cc8499caaf88167da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluateRunOutcome (cyclomatic 16, cognitive 14): evaluateRunOutcome has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1d5f52a9a3af8267e941a4c27ace0fb0e55a5cc704cf09a1aa018f1bb9354d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkFact (cyclomatic 16, cognitive 13): checkFact has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/career-profile.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"340133806fa7db911954adb2f270a2e1e2fb27be318f6b49d6dce5aacacc99fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeJob (cyclomatic 16, cognitive 12): normalizeJob has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/vdab.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa19f4700c622b67b318dfdadf387b7e1fa60bf937cf05a79a16b05a657eefe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyDetectRepostsInGroup (cyclomatic 15, cognitive 37): legacyDetectRepostsInGroup has cyclomatic complexity 15 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/detect-reposts.test.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a569ffd00c01c9e19bd21d9ff5129ab4969ffa5200bc6fb328938785f7d469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverAlternates (cyclomatic 15, cognitive 35): discoverAlternates has cyclomatic complexity 15 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e8fc87305940a5e69225dbb977f378f45dc0bdf6bc9f8ec85e6b0b42b0b179"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCompanyCanonicalizer (cyclomatic 15, cognitive 33): buildCompanyCanonicalizer has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b7d80e0c1cb579c5ff9744110d6c8b95ac6f17b6a2f0484f8c2c7447037f93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 15, cognitive 29): walk has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e5bd761f1416cf29857af4795cf8ae439fea860fb50b190980b45974e524bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 27): (anonymous) has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/server-launcher.test.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b2448ea42fbec30b6f5a1e8737047156a1e632e371c9eab4c445ea458abc0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authResultsClauses (cyclomatic 15, cognitive 25): authResultsClauses has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/gmail/_helpers.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58b63234c12f496596792e5e986a5c90af09e945daaae279ffc24e1d1f59d05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cardsToJobs (cyclomatic 15, cognitive 25): cardsToJobs has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-topdev.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a0140dc068d606b99bd5a88f03eae2c876b2f1ab79ddbfbb8de95227bef396"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dismissConsent (cyclomatic 15, cognitive 25): dismissConsent has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6986e591f37fd7694e81f7c11ddfbc8a0d9efcd02c47687701f6bdf8816c95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeClosingSoon (cyclomatic 15, cognitive 24): computeClosingSoon has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"closing-soon.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06703e0e23285f2a25fb8142a4eebf0d9904992f0d44fe4ba73b3208d15ab28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 24): main has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-fold.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6d1f28491a8f5fd35d8565bed4ec6c39b2a357da51ddc5829860d376e4e030"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scanMarkdownLinks (cyclomatic 15, cognitive 24): scanMarkdownLinks has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b055d40802ad223f592c0ca21d7776f3a2297d27dbc82315097d5cbfb15fabf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markdownLinks (cyclomatic 15, cognitive 24): markdownLinks has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/posting-url.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d7e9f4111d5b630300f7249c4df09d3e3e8f7f012980ca2f271dddbcd90932"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function templateUserFiles (cyclomatic 15, cognitive 23): templateUserFiles has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4322a9d6009bd60210c3595618ec76b1a632efd72c8ce5f965a118232e8772e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 23): (anonymous) has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddfa91241a0ae7746b48a3b2ad2d2304b8ed64de9fbb39743d6156d18bc3a4e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 15, cognitive 23): fetch has cyclomatic complexity 15 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hirehive.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd429bac069182bbbc2205742a9798f195d5a8b6c068dcc30e2fd492558234a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchRmk (cyclomatic 15, cognitive 22): fetchRmk has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fae1280aeca0a16f89d62ef7a85a3dd95059a5f0da4e2ded185bdfe7cfd7ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unminedHints (cyclomatic 15, cognitive 22): unminedHints has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae099a4012327701947546e8660fc049fa6ef014e503fff586614320f5124b12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 15, cognitive 22): GET has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/cadence/route.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3683a07c06ea3876a5cf24bb017c4d7df25a6d7b5760f702c585739fa8a4c59a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function valueAt (cyclomatic 15, cognitive 22): valueAt has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0cde53d7fcb743a7ccb0ffdf454397466b8e74d3130152287c68de1d262ba0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ats-payload.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6a56af8bb996130d4aab02e885720d639807c6bed18b71fa0cf126bf47c12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function heightAfterPages (cyclomatic 15, cognitive 21): heightAfterPages has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/page-estimate.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e66f6c16288e925a2aa350518d97a1ae2f64894245e4b744e0f7d06cbe4782"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffAgainstBaseline (cyclomatic 15, cognitive 20): diffAgainstBaseline has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f864cf952a1eb4cfd00506b254c615fef65541dc5231cfb6a5b9fcbf60b34e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 20): main has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-import.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c151647d23c9ca8e988722c439be5547ff672ef7b96763ecbca79e1d55b9ae2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestJson (cyclomatic 15, cognitive 20): requestJson has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2327ca4cb874ee9a2e9f63b60c0641e1f50c6f78785fdaa1aadc8daf2f21e346"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTurbohireResponse (cyclomatic 15, cognitive 20): parseTurbohireResponse has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/turbohire.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c609936152ab4865d6b82bba47995528297ac1daa591aa5e6c49e3232c6d73f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeReevalCandidates (cyclomatic 15, cognitive 20): computeReevalCandidates has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reeval-candidates.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b311a4f8fa95b058cd0545afbdf72fb94608755d18e45d34d9f2bc9b17ee22dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 15, cognitive 20): save has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba5f0a830a96db4af0d5ba4672def15879b7d235ba517030f79f2604256cb2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichFromAts (cyclomatic 15, cognitive 20): enrichFromAts has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/session.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5763fbb0342da43183731784df25a909f4c368f4e42015027c3ada65a7de4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 19): main has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7857e170094f604d62819f3855874e9e07164c08ad28cd7765621ded0615177"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54eccf3e8655b025d8bf10f9c1676a14cccea271c8be3f84b50f6b5cab5e3b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 19): (anonymous) has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7941fb6333d8534a840cedd36d159be370f8457d53354a8575f59f18b05674b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeRunStats (cyclomatic 15, cognitive 19): computeRunStats has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"07967c906e481fb0716b781d250065a3690848511f58d329cfbf59fe8ff32627"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDiscovered (cyclomatic 15, cognitive 19): runDiscovered has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3627fac49e1259a9fca0193a858bcb321ec6b6acc9ceab39d4f781b600d95e27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function estimateCost (cyclomatic 15, cognitive 19): estimateCost has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"utils/token-tracker.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bcdb0091776c454f8931960eedd7ad165848d0d3e04454dfc42e5ae0fe2b2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 18): main has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"himalayas-posting.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f59053264f04bd2464bdefc04dfdf81e32ab71d9bd326985260bc7666cdd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jobicyFilters (cyclomatic 15, cognitive 18): jobicyFilters has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobicy.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0807b75fa17e507354b89990cebfabee38ef03938062081384d4be8e7092ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 15, cognitive 18): fetch has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rippling.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47df81672269727873f3fe36c01221a42e42daec0cbb44000a303503d3776bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchLength (cyclomatic 15, cognitive 18): matchLength has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c9eecccfe2a227db5020bd834fc933c217ecbc0c2e0cc469baa1cffae173bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportNumberFromReportCell (cyclomatic 15, cognitive 17): reportNumberFromReportCell has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-share.mjs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"646b0411df2fb82d9ef2486b72ec3b2abb145e951360c1be98d561fdeeadb929"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBoardUrl (cyclomatic 15, cognitive 17): buildBoardUrl has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/ats-board-url.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ccdf2b174ae3ce6ad8820f8ea37c3bdcab444a6c3090b9c9b2863482d08268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/comeet.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708b214f6a17cbc1cfb366ddc6ca66f9a022fa5f3f57cbaa003e5616de6461e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSchoolSpringPage (cyclomatic 15, cognitive 17): parseSchoolSpringPage has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/schoolspring.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fc20e9ef55ded7459bc87be8f6152843731edccb1a601c063bdd76254b5949"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyLeaf (cyclomatic 15, cognitive 17): classifyLeaf has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330a1deb88e99835b3eac3c68eb8e72e23e481809a28ab9b983e250db8d7942"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function machineSummaryStart (cyclomatic 15, cognitive 16): machineSummaryStart has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/machine-summary-section.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7640089b4a6871036dd735ea95add4b6ae55b12341bd18f13a56dcbac5a05b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateListingFingerprint (cyclomatic 15, cognitive 16): validateListingFingerprint has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listing-fingerprint.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0fbdedc65cecb6653daadc115f69d94aff03293d2a382441271b8237c77390"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 16): (anonymous) has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pinpoint.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbc330e5871f659b740734f55eef27e31410bb8b020c2fcd8cda2aff60c572"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function machineSummaryStart (cyclomatic 15, cognitive 16): machineSummaryStart has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/machine-summary-section.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa4abf9a6925a4f81588b0c019e71964575f95bde2bf1cd6236e265308d48aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function freshLaunchOptions (cyclomatic 15, cognitive 15): freshLaunchOptions has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apply-scope.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"901ac11c028bb155315b6f95cae1a2885ec3f2f2e3d80a6cb92e658eb8ff281c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 15): main has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"1601befa43a69df017becbe8db67e96558b2dc0cc08cb42c2f41608fee9e848c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildContactRow (cyclomatic 15, cognitive 15): buildContactRow has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3f14e2a06fff7e91e8555e9f32629ff5a184c906f802d20a15a403cff33b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseApplitrackOutput (cyclomatic 15, cognitive 15): parseApplitrackOutput has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applitrack.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"87726fc1094dcdb82f92a82ec428fe629ae75317132d848658030addf4bdeaa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 15, cognitive 15): POST has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-studio/[n]/rewrite/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"db471781e56e8a2066a7db6ede681f98a0249902501f41ac8c73664bd802e0b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 14): main has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a9108a7d85f1567b17b6d9313742d0022181b8e031e7008b6bd7d9116d3cdb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveApiUrl (cyclomatic 15, cognitive 14): resolveApiUrl has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"068c37aa7ba0801dcdb5708c42d4138ba1bc1511c93186eba940e0a556cb66ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jobicy.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80cabc3353faffbd643b8af46c435b0b36c6c9c987f6f705c322896396a6252"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeItem (cyclomatic 15, cognitive 14): normalizeItem has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pracecz.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ea06f0a68c9575a0be821d2ad041589b0b73bc052c8af798451aec31ed264"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBoardUrl (cyclomatic 15, cognitive 14): parseBoardUrl has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-import.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2a8bb50f67d0f0de1f2379d1a7cdfa085d20467342c81fd0114dcaf6af151"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/run-history-drawer.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"96656961e1fbe1598b3b450ab2fed123e2795b212e955014581c3d34793456c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRow (cyclomatic 15, cognitive 13): buildRow has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"042ef2351559cbfd00e6461716ab1702e35b2f0995830f53208765bd1014a7a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeManfredOffer (cyclomatic 15, cognitive 13): normalizeManfredOffer has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/manfred.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1297f3713d5753a826a431e41a8561b66e662251b27f9be2a9e92fef56d6c39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plausibleEmployer (cyclomatic 15, cognitive 13): plausibleEmployer has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8197df0a92192d512fd146de79c23d7ed49ecc010f40e4adb8c8087d9a5aad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MarkPdfReadyButton (cyclomatic 15, cognitive 13): MarkPdfReadyButton has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/mark-pdf-ready-button.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1809fb777b2c30f04289bb4f1ab4eb04225ca1312140b9871416ec0e0499f1d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCareersOrigin (cyclomatic 15, cognitive 12): resolveCareersOrigin has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae26cf8bc8027aa1123b78bc5a4659d5cea23b363e6d0fe1d234744930075a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseGlintsItem (cyclomatic 15, cognitive 12): parseGlintsItem has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/glints.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d9936c64df7b1d6e9fa428deac03c89b173ce62b9a9a04503e377823fccfa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveSitemapUrl (cyclomatic 15, cognitive 12): resolveSitemapUrl has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2950a5b045b57e5f5e7e864b2b5e2f49778b34f69e8dbd84f4b0fc42bb4dc842"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 15, cognitive 11): selfTest has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9426b3260027e6f2ea3546de04fd25f0eeba7e62052a7c952c41ed5852a63df7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 15, cognitive 11): runSelfTest has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-sync-check.mjs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da8cb59ec99a20b1541e4c4b9348a444843a7f33bbb80dead6a92762fac866"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FilterBuilder (cyclomatic 15, cognitive 11): FilterBuilder has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/filter-builder.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a058ef362585dd29f9d119132c38e4854a67886eead1567178588319317480bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeParserJob (cyclomatic 15, cognitive 9): normalizeParserJob has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/local-parser.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e560be29e42adba4def914d0f63bff135d5124eca6c2bf412aa174e25e99c6e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 44): (top-level) has cyclomatic complexity 14 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/outcome-cv-lock-error.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616247647e2d93b11ff6f3855817e526150dfbc7e900e374543921afbcbf64d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 14, cognitive 36): walk has cyclomatic complexity 14 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d2056151c638300eab8dedbe16d83695155dd9fbe7a2aa68052e2b883b4aae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function audit (cyclomatic 14, cognitive 27): audit has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"filter-audit.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd5bb3ccdf62f09621c4ae67c3fa661fbb4553212e1ef8c3c65c492cdf5ec1d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 14, cognitive 26): fetch has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d38db9a4920ba4c2df63be642c1ce50d17a72a2f21bff61469614902870cdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pdfText (cyclomatic 14, cognitive 26): pdfText has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-cjk-pdf-font.test.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3cc19d1c61ea568d0fa808bd804056712a023dffa79b51177be47ab0d4ea56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function feed (cyclomatic 14, cognitive 26): feed has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore-ai.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e85fc087f7088469d75b8bfd9bd25453dfc30b1646fa225e45ba0df9876d89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visibleText (cyclomatic 14, cognitive 25): visibleText has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cb6c5e0ac758353b57181c4da5eea1c85868f955987f4ee912ef8cef1361e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsv (cyclomatic 14, cognitive 25): parseCsv has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a38f98f3e80f6df6f442291e9817eb32cd8b4395a78e1f312ecacc6593f9b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 14, cognitive 25): analyze has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"negotiation-roi.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0699b47dd696e6f0df7ee9154b454424381ba8eb58b4e358d32111c0ad71cdac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchScope (cyclomatic 14, cognitive 24): fetchScope has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/thehub.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaba39803c428218971ca159ed2854477d8b603160a999ddadaaa0a11d17259"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodePng (cyclomatic 14, cognitive 24): decodePng has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/antigravity-directory-plugin.test.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"316d36beaac12ba88b4c9e2b0b75935e2e35c65d5675ba2271984dbed5c6d5cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 24): (top-level) has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dead-boards.test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"564bd3004aaae81681a0ef4ec174f36acf8d2b901ce82378dd30c7290e84b359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDetail (cyclomatic 14, cognitive 23): parseDetail has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c26fe020354b2512a19c676e1aa02d2d4720eaecfcb05bcc7842c3daf0713"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInbox (cyclomatic 14, cognitive 23): parseInbox has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-table.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cf88ec3891f08a02de29ce7eb97a299aaefce3eb98550445ab9a415b33954f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function voiceIssues (cyclomatic 14, cognitive 22): voiceIssues has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-voice.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186d0dcc64fe8277ecaca5ef4e6614292ffc32c17f54d6108dcda26fe02cf9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBodyCapped (cyclomatic 14, cognitive 22): readBodyCapped has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b00a3bf6dd33c2e574557ae9ce3e340c1f43bcaa809b27aff5ab2425886f36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function urlPositionals (cyclomatic 14, cognitive 21): urlPositionals has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-liveness.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1b7b3eaf9293175011ac6a8d5b7787ae921fdd8eb6ea534d279f8436a0d48c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCompanyInput (cyclomatic 14, cognitive 21): parseCompanyInput has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4290899666f1419c92d65681d34de32015b6597bc2e81d632d89c78152559d48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCards (cyclomatic 14, cognitive 21): parseCards has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/computrabajo.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c73bcafd88e8747ff2eda9e5fc5f52b1d41f1a708541d9a38bb450ea479ef05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAppDomains (cyclomatic 14, cognitive 21): getAppDomains has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c92147def39926e0e7c6c18573ec70072275e2dc8ad6768c240e369d8b2665c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localUserPaths (cyclomatic 14, cognitive 21): localUserPaths has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db1f00e7bee067479eb18f5469429aa572a500ee57772ffd6b0eedc1a2c90c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probeSlug (cyclomatic 14, cognitive 21): probeSlug has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5eb5fe2e5fa21abc5a371e6964b7a374964b06eb5d3c786429e90206ddce32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSectionBlocks (cyclomatic 14, cognitive 20): extractSectionBlocks has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"766e4dc9b107e6b68ab1858e2a4bec03a0de6076ce441949cb63f51f6f04ac0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gcStaleReportReservations (cyclomatic 14, cognitive 20): gcStaleReportReservations has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c325af636b18f9f1ee3d147535940c064185304f503816b0a4a255a375d81e5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releasedHistoryKeys (cyclomatic 14, cognitive 20): releasedHistoryKeys has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7fd9f6b3e722ee092dc815b79ed749282eb60f7261fc173e526e751101a300"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runWhileLocked (cyclomatic 14, cognitive 20): runWhileLocked has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/tracker-writer-lock.test.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc451bd901d8cb183c429c2b657dd35a2c64a913d3c1cce105bb4620fe38c6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 20): (anonymous) has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/explore/ai/route.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1ccfe337538b1f90d0ccde0db7e34075e2a705bc1a707e5cea5771ea18f693"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRenderPageFormat (cyclomatic 14, cognitive 20): resolveRenderPageFormat has cyclomatic complexity 14 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/page-format.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a050667bcad5a2802f4ec153b73157835cf5a22e34718bcd142bbccc86caeee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatusLogStages (cyclomatic 14, cognitive 19): parseStatusLogStages has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-stages.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"754f9bccc85fa7d4e5bf4428a8752dfe3df5503499d9544c13f9da5e300af28c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveKeywords (cyclomatic 14, cognitive 19): resolveKeywords has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"874ff26bbc78c561180bb660062d089644d5d584f266878d162fabe8efb24021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveYouratorUrl (cyclomatic 14, cognitive 19): resolveYouratorUrl has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/yourator.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3dfd1e8dfe618689ea43bf4884885dd034b9cedad9ed74ca3108ce91a4f58a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reserveReportNumbers (cyclomatic 14, cognitive 19): reserveReportNumbers has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99dd89736c3d79d6d7690de6a3fdcf6b47d4136d2ccd657ee51f4e05704e5f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRenderHtmlToPdfOptions (cyclomatic 14, cognitive 19): extractRenderHtmlToPdfOptions has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":2808}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0acef401072d808b57948bd613e4b0462314e8b75cb0490ce6991762d5eb183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testProcessOffer (cyclomatic 14, cognitive 19): testProcessOffer has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/batch-evaluate.test.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cdf486fe524c0d9517d14e1d788e5378d4d6935451c878f3dce8f2e2321d15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkElements (cyclomatic 14, cognitive 19): walkElements has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7d9b32c39c4de23d3f3ac94a791c4e257228738fbaa13edad8ddc81cabcb30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findStaleScanQueries (cyclomatic 14, cognitive 18): findStaleScanQueries has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"audit-portals.mjs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4d26fe02e4ea80f7a4427749f4632ff36227b43cd8f91487502e778da22e52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 18): (anonymous) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528a423b6c3beb2d814d89817187119f686cbf27260e87b550ae4afe4b0417e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOrigin (cyclomatic 14, cognitive 18): resolveOrigin has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce960cb9ef9488bc1a3f80464ec0912e4e0178ab4df96497ef031f6939fb96b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeishuJobsResponse (cyclomatic 14, cognitive 18): parseFeishuJobsResponse has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/feishu-jobs.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d9cb24e49d63a9eb2929de317a6eb91859c1e9af6985c8106a96f98402ec9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStartupJobsFeed (cyclomatic 14, cognitive 18): parseStartupJobsFeed has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/startup-jobs.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"4decf2b119e79e13fd11fa32dd5b689d21ba9d367dcbdecfabd1d8b31185f3f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runner (cyclomatic 14, cognitive 18): runner has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/github-evidence.test.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1472651543b6b6e93499c1b1bc0a1a73a8efcb5f6405cf31689ab91faac505dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 18): (top-level) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-runs-header-drift.test.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9e94b873064bb2e3c8e2baf9f627ad36fdeab451efdc2cba2032454d1cd0ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 18): (top-level) has cyclomatic complexity 14 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/verify-cv-facts-bold-metrics.test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"735393dd3151d258d041ea373e17ba0b8e11e18d290850d7c74a2a529acded53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderHtmlToPdf (cyclomatic 14, cognitive 17): renderHtmlToPdf has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c9ce02acdd67a8d64008996ae827715dc6296d02be6632afde2d830d9e860b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTrackerAtsSeeds (cyclomatic 14, cognitive 17): parseTrackerAtsSeeds has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"history-ats-seeds.mjs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aab1cdf7a7741681d96576f9238ee9945abfbc3da21c550e05abfd2bf2888a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 14, cognitive 17): fetch has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ibm.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5565662a954576a8ddadee53fbc04eb9c0bf3069306f39aac74a22ed26bd5b51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractResults (cyclomatic 14, cognitive 17): extractResults has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pracecz.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503b561478854c3ab1e4905fec69ad2371a016d78905b1b534a7d472f97ce29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateUrlSecurity (cyclomatic 14, cognitive 17): validateUrlSecurity has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58a1f12b3db7ea099a330bccea6291ff701e9d2c303cb45ca91fc0d17f69e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 17): (top-level) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/server.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a510432cf97af3e13ef87352a099190c750681bab8fdffb56b4b568bf6e1bc77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchGreenhouseSchema (cyclomatic 14, cognitive 17): fetchGreenhouseSchema has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/greenhouse.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"73976df5b210a98b1c9abcc3c757c65d53c738ba65a5147aace7045f729f804e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePortals (cyclomatic 14, cognitive 16): updatePortals has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d11aece7fc18e750300301ba6b9e2116b21c6d321e59ec16b633f8c2dbbd7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeTextForATS (cyclomatic 14, cognitive 16): normalizeTextForATS has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ce35f26d9b72d30d060bea8916ce9924cdd83f905a8b7dd760ec3837ff7a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 14, cognitive 16): fetch has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/schoolspring.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db990742fc317df590ffcdfac494e4df064cec05217c64589de611fc393011d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractZohoListRecords (cyclomatic 14, cognitive 16): extractZohoListRecords has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3419a7e98ed56bbb18a1ccad20d3f17fe0cacb80843372d28a20e8398ee594bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pipelineWriterResult (cyclomatic 14, cognitive 16): pipelineWriterResult has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/pipeline-writer-result.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79ecac024f50402c2a675cdd782ad38a8ce606d6c7d6927ad37b8e3c62360c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadProfileDefault (cyclomatic 14, cognitive 15): loadProfileDefault has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bade8fbb63f820f7e6fc715d0bfe702b6ed0909e1e16ec09c50b663e36d04d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retrieveHimalayasPosting (cyclomatic 14, cognitive 15): retrieveHimalayasPosting has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"himalayas-posting.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ca673b4702067447beb9d8f501af0eddccfa6f849d3360a81c7c684e83da27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 14, cognitive 15): runCli has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"session-activity.mjs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb04ebb4b1b6f57fdbfec0cc5cac41b51d7c254e841421ae21a8fb102435557"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 15): (top-level) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/_profile-keywords.test.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b1c0051f704a7fc0cf8cac51106e34a9787ca83251344a5a205fd558823125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 14, cognitive 15): POST has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/cv-studio/[n]/route.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0e4e3d6867604cd5c6efdd8bcbce5c633ac8c183f82d0192a974a882ad2951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 15): (anonymous) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b43f7c32d3f31efdc6cbc64185202658c6e3927f16dd00a19f84fabcca91c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function finish (cyclomatic 14, cognitive 15): finish has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b56f27bc2ab57811ab2e67ffef04329865ae88e3eb45c7cbd48b9c033bb421"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePdfManifestRows (cyclomatic 14, cognitive 15): parsePdfManifestRows has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/cv-selection.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646f83e67e3ec3080f9734af6650eb187db5676d0edde67ad52036eb740ef48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 14): main has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"negotiation-roi.mjs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"906cdbadc312165900b0963cbe04f5675966fe36728efdce53567d011b8431e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function byRank (cyclomatic 14, cognitive 14): byRank has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/index.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ded0571efbd27f373dbe44fd2028a01a03a8bd4f20996b6965fa8921d7d7ec6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAlibabaResponse (cyclomatic 14, cognitive 14): parseAlibabaResponse has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/alibaba.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e1aab71ec0fb0d85dddbda3f5f9792466b97266f2604c6336ba07e9f015b2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function comparableDateRange (cyclomatic 14, cognitive 14): comparableDateRange has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"227661decd29dee3006ad255cee58a13e60f9ed594717b6301fe120b1192ec7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runMergeDetailed (cyclomatic 14, cognitive 14): runMergeDetailed has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/merge-tracker.test.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0b2f8ff5486ba28db7f75f377a2ffc81b0d4aee084fe773dae41155b7ba2d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 14, cognitive 14): POST has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b284cc9949ab75ec08897a6a2493926b6a89df3665e9af74f56dcbeda401098e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKey (cyclomatic 14, cognitive 14): onKey has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/pipeline-view.tsx"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"17086d2b268cc2aa86478987d4d94a75c42f2ae8daa0fbb63f1b3662951ea9f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusBlock (cyclomatic 14, cognitive 14): statusBlock has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d6da1baf0b6bbd6b9f9ab2408d45dfc394170d9abea03844d605af2416414f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skillGapModel (cyclomatic 14, cognitive 14): skillGapModel has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/skill-gaps.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a4fe8fbace1efa94c249ea71dcec3c923f6e39060260726f589affbcb78cb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCoverArgs (cyclomatic 14, cognitive 13): parseCoverArgs has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b8c98647c0ce4f8c2196dfb5e76b1b4177e6e4c2dd16d76e744501bea831ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 13): main has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-latex.mjs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"226b8a26795dc937edb9c68d3f3017a553dc5e47976954caccb2a3f8eb0c14fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAppLine (cyclomatic 14, cognitive 13): parseAppLine has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c786bfed664a04ff4535587ad3b8e8801167ad8eba26876ea9b2d7a8f8e264ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consumeLine (cyclomatic 14, cognitive 13): consumeLine has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca04e3cd733c914ba84803aa69949d0dd45a2b6dfe9ca236d74cd3821a2fc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquirePipelineLock (cyclomatic 14, cognitive 13): acquirePipelineLock has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pipeline-lock.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec5d9768799c1db18b92663f9f0903388d21423287a411e7cd6cef5e470b7ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readCache (cyclomatic 14, cognitive 13): readCache has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/cache.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"de765d5d69c7d7ec971123d239d3e92068d71f5d6ebe55bbb08a2771c9a485e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAmount (cyclomatic 14, cognitive 13): parseAmount has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_salary-text.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b435407ce74c64b87bed07c52f0f3840835dabd0c170b412322415ba7704aa66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveApiUrl (cyclomatic 14, cognitive 13): resolveApiUrl has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/collage.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"740ee9f547880cbb428ed3806ffcb2afa0cd5d10e0b8c91e4d20ca64cf02491c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseColumns (cyclomatic 14, cognitive 13): parseColumns has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/taleo.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0c70ae0d6a9baa478dc2670bc7d2424c492cb56c8599d7cda043aa8edc60c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"36419878d66e15d686dd84b293a1dcaec96f1c1dd2275b9ef5bda9a6e38ed583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runner (cyclomatic 14, cognitive 13): runner has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/github-evidence-documents.test.mjs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"450b0fdeb0658f743cf44573c28d4f8f59f293d1b6087e2c6522f09cd347fc8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyStructure (cyclomatic 14, cognitive 13): verifyStructure has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-structure.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092a8c0efee11cec712f87826dae67b2a3617614d7c6c7cc56aa57a749d3a76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFetchError (cyclomatic 14, cognitive 13): classifyFetchError has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a86cbe328b1f8a100673c482cd250c06f02bc425bd14f5be992df64de1ce0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/cv-studio.tsx"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a985f1bd9227a68672aa9bd0d1c321a942af86d74aa471cef1c8b3de127b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfTest (cyclomatic 14, cognitive 12): selfTest has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3ce32e7dce292763d4f3da3590feef38d5848babe19579e2fc9f039356e9cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 12): main has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"patch-latex-content.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacde8cc08f188e83efdeb8b534addc8e2ab392f85d66e07b7ecf5844cc0a894"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeJob (cyclomatic 14, cognitive 12): normalizeJob has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitsagentur.mjs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c89d7262d4ea3a1673a77b98796dbf7dd4cd8fcba8d03623436ae7c38c81370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBoardEntry (cyclomatic 14, cognitive 12): normalizeBoardEntry has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-dayforce.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"72944d7792c5ba66b4e5ec849fd3391dce82bfc9d565fddd99c114e400883eb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 14, cognitive 12): run has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/actions/registry.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"049fa884b283914af876e9cdc453635b432ccda7c6720c756768cf0478e98a89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAgenticJob (cyclomatic 14, cognitive 11): normalizeAgenticJob has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/agentic-jobs.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6f699f8797febb294dbff8ea6c9a65a10a0a7ab9e4ab8896a8cd7d3fb810d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyFacts (cyclomatic 14, cognitive 11): verifyFacts has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc172b3e9a4a3d2f207b6689cc60a8d0805f08444177dbeb7ba79ddea233bfed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeInProgress (cyclomatic 14, cognitive 9): resumeInProgress has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/scan-ats-full-workable-resume.test.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0fc6871c384e19c695fd19d0b02555280403c774bc9f6992e62d7541b2b70a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fitTone (cyclomatic 14, cognitive 9): fitTone has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-tables.mjs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c8b95e92f31f46ca661db87033c565a2be37a699e5227b1a8aa2baa9839688"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCvExperience (cyclomatic 13, cognitive 37): parseCvExperience has cyclomatic complexity 13 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-title-check.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f264401a9b7cea70aa191ccd640bc92a23dd761e880c57f5913484f64caf60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 28): (top-level) has cyclomatic complexity 13 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/batch-runner-score-delimiter.test.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03beb0e6f76fc873de1fa848a88be101c47ac42f71e90ddcc2d2a8bdb905446"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rankSkipBlockers (cyclomatic 13, cognitive 27): rankSkipBlockers has cyclomatic complexity 13 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skip-blockers.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d2dd18e38d8eecc5c749191e039427f221a704d2985615bbb8c60ce05c5be7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportNumbersWithStatus (cyclomatic 13, cognitive 25): reportNumbersWithStatus has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f291664d853ff3ac6e5d8dfc937a022a2d9ad3c0ad19bedcd4672366fd0347e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function occupiedFromFailedBatchState (cyclomatic 13, cognitive 25): occupiedFromFailedBatchState has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7550f0be5571071a3d6208ba641db300533fd5eaec2998a9cce6afe068c2ef87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectChallenge (cyclomatic 13, cognitive 25): detectChallenge has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-dayforce.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd767c468e2fd154ff26b991f0e80cf859f3d30fa89a57feeed727c2b07442a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchYCCompanies (cyclomatic 13, cognitive 25): fetchYCCompanies has cyclomatic complexity 13 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c56857df38b6c1fbd7dfd3a84fcd981b6c93f91cc3d876ad92ab14763a69cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeBase64Parts (cyclomatic 13, cognitive 23): decodeBase64Parts has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-mail-drop.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ec4d2cb3b6049d98dac8433fbec8e88aa47308f3daf219220ae53144b2f76d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findMojibakePair (cyclomatic 13, cognitive 23): findMojibakePair has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mojibake-canary.test.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9619321b690feade74af386c3f0309f63c58b90fdfb425d6502738f7efd97f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bulletDriftClaims (cyclomatic 13, cognitive 23): bulletDriftClaims has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dcc040b5b2074aa73220868ab68271a5b4a9ef0635a9dea3e30762c1f2e087"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadAggregatorCompanies (cyclomatic 13, cognitive 22): loadAggregatorCompanies has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"detect-reposts.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd835071c05c079d4ddf16a6ada3b0e0315d672d34c5dab7bbdbb3849df46ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readInbox (cyclomatic 13, cognitive 22): readInbox has cyclomatic complexity 13 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcafe45283c2d9be7194a180816270f265d6988019c60d9504b280202712f4de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatHunks (cyclomatic 13, cognitive 21): formatHunks has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4103bb59890922c3fe202c460bdd7c5af4e76e65be9faad2565e11bb10aece3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 13, cognitive 21): fetch has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/themuse.mjs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a454c3ef9bccfdf0355c97e6af387831fbc720e2f47bfdc8b657d7f39c8a0902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pipeCells (cyclomatic 13, cognitive 21): pipeCells has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-tables.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27335f55c0ff7d9455c4dbd0d33a005209ccf5ea1efa424cb7bdd43dd59f568"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headlineText (cyclomatic 13, cognitive 20): headlineText has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfe1884b53d8a31d2e7a3a9f12667a2d00f47c7553ef36a2a00b28655b5e3d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateProcessQuality (cyclomatic 13, cognitive 20): aggregateProcessQuality has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"process-quality.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbb5b09cf6b5d21ed84700dd51f14f87ef9ce1761d1f45d797f213634088c3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLegacyResults (cyclomatic 13, cognitive 20): parseLegacyResults has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/radancy.mjs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aff16bbf9cbd71585c034bb4d27c4c612cee29b15f9bd0124f723e6c4ae6b6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWidget (cyclomatic 13, cognitive 20): parseWidget has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/softgarden.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5298d90e4a904a37d1f679c0ce5b5b1e3a7f2a49dafa49933897ac4cbd51a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stream (cyclomatic 13, cognitive 20): stream has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"1126ff335414026c34933dbe83efa1c62860d19d9f507e3a2c169951f96f6865"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseKekaResponse (cyclomatic 13, cognitive 19): parseKekaResponse has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/keka.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0066696060959177bea3246ea8a5c77c3a8c833b5117a8bbdc269ba2cbe23538"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTesJobs (cyclomatic 13, cognitive 19): parseTesJobs has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tes.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d386f48cf1fd3c8568324444590f15a20cc0abaf16f7ef5dbc35ab7b80abf76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jobLocation (cyclomatic 13, cognitive 19): jobLocation has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/turbohire.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f985adc464d48f29869e2b8d7240b17572c945630f1041c053e3d3c967fb18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkableMarkdown (cyclomatic 13, cognitive 19): parseWorkableMarkdown has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e91a989adf04928193a2f18293f174b04b7a81fc362a9c955593924fd8c29d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 19): (anonymous) has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e8361c1db228856aca5d909e71f3ef017b0ae3c6d0e1eabfff72c749c91d61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTitleFilterOverrides (cyclomatic 13, cognitive 19): buildTitleFilterOverrides has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cec79dd8469e081e8ef4af6963972be9288986fccf132bd842bbe769c0fa57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyWebStaticSources (cyclomatic 13, cognitive 19): verifyWebStaticSources has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/web-core-argv-contract.test.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b07af911c54f799adaad9368fef80a959c9c417c1c04a770eba429b4accc0b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 13, cognitive 19): restore has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3296ce13724a68e9ca4dc7f14be0135b60678e64a7fd8bdea3a45d1d16688262"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function snapshot (cyclomatic 13, cognitive 19): snapshot has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/drive.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd139bf95839e05de4932a0d1a64c11dc7332ab6f9c4419f96f1ec8e2af5f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLanguageConfig (cyclomatic 13, cognitive 19): readLanguageConfig has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d09074652c147fc1134f09ba7d3e17b7d696e5c8c45d262a15d9cf3c7c4684d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyReportsByTrackerState (cyclomatic 13, cognitive 18): classifyReportsByTrackerState has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91bd4f1afbc3835600134a227287c0b66e4db2abc67e0c19fc63c01635d19d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvaluationShape (cyclomatic 13, cognitive 18): validateEvaluationShape has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"788153e06c4a79cc7b15410ad66b40329b3e12dd30aec373f8c3e07031faef03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 18): main has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ade772f014e58ff419e3c271cfe9c15d6561a73b256456ab32da9d9ac0ac7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatLocation (cyclomatic 13, cognitive 18): formatLocation has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c044465bb8eb56b2b58d4d8d724bb706e4f48892d07cafd7df05bbe5178ec8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRoleMatch (cyclomatic 13, cognitive 18): checkRoleMatch has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb271fe2385986b8af7ba31a35a9d30d767d7a7c13bcfaabc3770b788113e6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runUnmined (cyclomatic 13, cognitive 18): runUnmined has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c4e4b092a676ddc8849c7680fe479dc79f4214c221f8cfb8442450901b7332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reorderCvSections (cyclomatic 13, cognitive 17): reorderCvSections has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f3c9f8fde630d61d9deed01105a804df83b1a8c6453d402c2fe605772e395a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function piiProtectedFetch (cyclomatic 13, cognitive 17): piiProtectedFetch has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pii-interceptor.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c1ca8a9b87c28d4769d9bba529d9f45d583161b4b69620bbc49b65e33ba0c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 17): (anonymous) has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-browser.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"044b1f2f996092a93bc3b5e4e5a21720801dde01b323c9b7d5f38f2cef166332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdAdd (cyclomatic 13, cognitive 17): cmdAdd has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins.mjs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3940a6fec9ca4d9817444bb02f93caef1e4bf6762cd1c31a8dcb20d6dfb7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAnnotationSummary (cyclomatic 13, cognitive 17): renderAnnotationSummary has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"540603715a77ab162b94a3757c25e53c803233369cbe85bda9fab6450198fbb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCommands (cyclomatic 13, cognitive 17): runCommands has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/root-tests-registration.test.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce78e98c039035e45129651b3ea1444b68ccd3d62c6db1fd3bc9a3c8ac01d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function markdownLinkDestination (cyclomatic 13, cognitive 17): markdownLinkDestination has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe58754f102846a8916a8781fa84c58543dfb63003703f24e39596522615167"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleDedupContext (cyclomatic 13, cognitive 17): assembleDedupContext has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/discover.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b849dbf49d66e0da24da1f912dbdf5d1a97329830e37e3335a3c06dc051dde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextSearchWrite (cyclomatic 13, cognitive 17): nextSearchWrite has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/list-search-sync.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091c2d5c79140be9dfb2af94472228162413a364682fafa3b338599d8169bfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function linkDestination (cyclomatic 13, cognitive 17): linkDestination has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/posting-url.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23d6ecdbc015a346036b7311e81278e4d216362089bf789dbe2206ac7b24afb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 13, cognitive 16): fetch has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a9bd2068ef8fc96f8ed01ea1ca7fabd90b230a7ae4a4d16769fb7e8face7cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJazzHRList (cyclomatic 13, cognitive 16): parseJazzHRList has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d90b4c64831d22fc4bb71f431d6cbf3b8a1710524debd1907977ce80d0811bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d704d9c6d6e384e73fb1b33fecbc35d317b7967d95fb23a596459ec7c00ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRegister (cyclomatic 13, cognitive 16): parseRegister has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0772b415776eb19955796fb79c33dffbab5e704d3e5f75fb404f253755cc454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCompanySummary (cyclomatic 13, cognitive 16): renderCompanySummary has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdb51cf7cf4d625c80d9bb564fd7f0cc235ef31316ad18a8563534137736dc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 16): (top-level) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/portal-health-path.test.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be786f042ffcbbdb75f413b0facaa646a6edb5bc97637ae9f7a0ce417e4e26f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 13, cognitive 16): GET has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/logo/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93973aff62dbbedf4f2f56f2907ad7cf28b133077a581a1aba86af6f2901c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyInboxSkip (cyclomatic 13, cognitive 16): applyInboxSkip has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/inbox-skip.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a645be939d84bd41c8ab3614a8655cd2dcdd85ca503f984ab944d7c1ed06bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertLlmRequestAllowed (cyclomatic 13, cognitive 15): assertLlmRequestAllowed has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/llm-outbound.mjs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca9b03d4eaffbea5e71a767d42c3c7b5d1758baf1dea1500eed7ef35e6e8736"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function enrichDate (cyclomatic 13, cognitive 15): enrichDate has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6fa92287dc24ade27c771a71c734af5c26ad56d9958c0a5d98fd49de5039ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/providers/_http-stream.test.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ff690f3415a8845c32baaae405869eb6e9234a50a1795fec51cda8d43b8349"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractTrackerReportLinks (cyclomatic 13, cognitive 15): extractTrackerReportLinks has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"47894bb8877a5d0d5aad9c26d088dce92af535f6c66f185055ba73e13feca30a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProfile (cyclomatic 13, cognitive 15): validateProfile has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-profile.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35b3be373f20514e8b973f38b9144548db3397cc09a4cddcc9ea41208a21411"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 15): (anonymous) has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb0fea1a88efc3ae804654750d3e5275eb2f3b41641cae54dca925380f220f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function save (cyclomatic 13, cognitive 15): save has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae9d5599eeb70c90576bfa79a31957fc065081d67a5537cffe2c71b0814a3ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commitChange (cyclomatic 13, cognitive 15): commitChange has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/status-select.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43b8a7409315f70d14626097e5ca142fe957e1a5e2b8cb6c09e8933bb77cdef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cachedFileValue (cyclomatic 13, cognitive 15): cachedFileValue has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/stat-file-cache.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"154bada0dce7051f8ffc36513f4a1a8794ef4c4660eeb695fd1644b129cdf850"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function countAuthoredCommits (cyclomatic 13, cognitive 14): countAuthoredCommits has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4e0b8b78d50547f9f30f92f1aec2b85ce197e80d8f8036d821af155ba096ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addMissingUrlColumn (cyclomatic 13, cognitive 14): addMissingUrlColumn has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e296c237b479f4c093166aeb08339f295804809ffa0d0790fe83e916d07048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExplorePatch (cyclomatic 13, cognitive 14): parseExplorePatch has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a3a57afc70bbcce62d0328fc7c4002c46ec0e62337e054dd6ba3b0f91bb257"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function roleMatch (cyclomatic 13, cognitive 13): roleMatch has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dedup-tracker.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57a8d0efff6732c426fde2df45b6598e1d45097face5435d4e69edcfa59e3c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installTectonic (cyclomatic 13, cognitive 13): installTectonic has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install-latex-engine.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93337ad174533ac0a14cb21bd31ab5dcc427cd70060130730229b7cc15d5c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHeadedAddition (cyclomatic 13, cognitive 13): parseHeadedAddition has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"baba06dade1bfc47edc92bcfa2a178d8757bebed6b4d11e10a27ee9f7c679bbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildWorkplacePolicy (cyclomatic 13, cognitive 13): buildWorkplacePolicy has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a63fcd2ca41b528238b90920440d34b4dc9f94dc1b5eb8c5c0af1ed539331c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBlockedAddress (cyclomatic 13, cognitive 13): isBlockedAddress has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_ip-guard.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcbfde223d9df94527353c287f4c3b3220ddd028e7bb54277642bfb4f54d4f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSearchPage (cyclomatic 13, cognitive 13): parseSearchPage has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd777d3332b7022ff2db300f021d9ee7582c437facd1f12a62ab931139316a04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assembleLocation (cyclomatic 13, cognitive 13): assembleLocation has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/recruitee.mjs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd2383f280d24870e9bd04468467b3f1cd17cc229eb80c65b57264a3ca069a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractClient (cyclomatic 13, cognitive 13): extractClient has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/trakstar.mjs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4c4050744149d2a2ca68fa6044ff67e0fa1a60bf5b6c032bcc7b0b5758ee7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSeekPage (cyclomatic 13, cognitive 13): parseSeekPage has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-seek.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b906d64f2d858cd360e405ff5aaa56c73539e6694f33cb4ef0eaf71fd02488fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSinceDays (cyclomatic 13, cognitive 13): parseSinceDays has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96beefb69ec3d3a7ddca37f8a77d9578090f443cbf27fd586523517fd100fa2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 13, cognitive 13): (top-level) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/updater-self-bootstrap-backup.test.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa8c3e5660732b1a053dc55bb23e14570ac9e77fbc8627955028be4f5a9802d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dismiss (cyclomatic 13, cognitive 13): dismiss has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":6064}}}],"partialFingerprints":{"codehealthFindingId/v1":"7425a554657d7c0dbc6ef6bf86cf9aad2cc425252d32d46dabb2bcba297d8522"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadData (cyclomatic 13, cognitive 13): loadData has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-jobs-view.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3134a4e99393464dedb7327b825042b5a5ccc0bdd4496c0c5732d700c85edbad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7693fe9bea957dae370f3ba9193d7607f1009c1eeae09be4b3604b3ddc3b7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSelfTest (cyclomatic 13, cognitive 12): runSelfTest has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f522989953ed112b7f80f1041a156843e377658652afa3e0125f15fa5c76d46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 13, cognitive 12): printSummary has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac46620b09b7dc8718e0f05dd448fdeee8cac02cd8a5920c56fe03cdb384cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchPointer (cyclomatic 13, cognitive 12): fetchPointer has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/install-h1b-index.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c51e476f7b54dc7d8e02fd84cddadb2c11ebb34e54f8dce7f944dbac8c1b6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveOrigin (cyclomatic 13, cognitive 12): resolveOrigin has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/consider.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"902025516010d696b1922ed36a3169e5e04066dbce0f700bd653eaebf2520a69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getroSalary (cyclomatic 13, cognitive 12): getroSalary has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getro.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41e6085e14da5470fee33774effb14477c0b02edc24f3fbec93b6326dc9c9ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildJobUrl (cyclomatic 13, cognitive 12): buildJobUrl has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/kalibrr.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8517bb025b845e3e2d2197f70c42da96a1a33b806e264538e389cd1f6c57d2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leverSalary (cyclomatic 13, cognitive 12): leverSalary has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/lever.mjs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"375622206d6446103874f5f6c7b83ee632e2c9f0a1c7757de7bb9d493d4d098a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsbDate (cyclomatic 13, cognitive 12): parseCsbDate has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"b529fc6d7cc1b1dc2b1652439c5375354e90a1918dd9c5d07563e9308e314e85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveConfig (cyclomatic 13, cognitive 12): resolveConfig has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/wttj.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba24dafe9c384da80c48eda929385a532018d906d2f8720a4e84abff0630df89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseInboxName (cyclomatic 13, cognitive 12): parseInboxName has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-inbox.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f286e0353000b746b5a3365c5494c2eac93b4b0bb4281e16b304b2161e6904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function role (cyclomatic 13, cognitive 12): role has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-visual/fixtures.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9eb36c0844c4b41a7b5039766f983b22f5226e9ea3a1f4e18a174243014373"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function identify (cyclomatic 13, cognitive 12): identify has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/localized-tracker-tsv-templates.test.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c243323fee0677eaae7da9dc66c2b75682e2260e60c3d7c416ab9ee2066e9dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function allowedContinuationRange (cyclomatic 13, cognitive 12): allowedContinuationRange has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/mojibake-canary.test.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d368fcfb074582ab6d278c40c4d32e22e2941e84b83bc8a7f28576f72c418ee2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 13, cognitive 12): record has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"utils/token-tracker.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a06a4920a12bb07f199c19282d563c3970b9f1dafc2ec6ff8b93478e57838e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FollowupRow (cyclomatic 13, cognitive 12): FollowupRow has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/followups-view.tsx"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5b009657ea4e994c303208906c1bb8ace891dfbba9b9992b5eaf4a17d36375"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteCopyFields (cyclomatic 13, cognitive 12): pasteCopyFields has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d95d9a03cfa48b54a09a14dfc3ae0337cb2da922d34df2d69c184bc76cc96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answerCopyItems (cyclomatic 13, cognitive 12): answerCopyItems has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"38328be1a6d90d640ee6410f0f30420abc027509d9fdfc0a55bb74812a5c21e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveScanTimeoutMs (cyclomatic 13, cognitive 12): resolveScanTimeoutMs has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan-timeout.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42e8406cb6457a64c21f69267aec485982636c745f72c7096ee7e7f1425055b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAssessments (cyclomatic 13, cognitive 11): parseAssessments has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a81554adbfad195c665ceffb19b0e9c135433f70362aa2202f4bba6bc6f65a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isExcluded (cyclomatic 13, cognitive 11): isExcluded has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"50193d2e7be40ed0f14893296d70e2ae1baf74100d6db9e943e6578c63cb2965"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPrivateOrInternalHostname (cyclomatic 13, cognitive 11): isPrivateOrInternalHostname has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2526caa17e2db7cf2c9e78e3dae33b93a9a51910805de8bbb93a6ebb66d2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dayMonth (cyclomatic 13, cognitive 11): dayMonth has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/invite-evidence.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"96be97ff84d2e83b60351151415f66f4a39fb36fd310cd6caecca87a1f83d926"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatUrlCell (cyclomatic 13, cognitive 11): formatUrlCell has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"merge-tracker.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8453fe3e06ab436770d09878bfa6c2359bc8f518fea7a456d7f63502a90cbda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveConfig (cyclomatic 13, cognitive 11): resolveConfig has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/phenom.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d897115561ae49e4a377901d202294afcc454dcee3a416f94ffb29c1c9ded0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeMuseJob (cyclomatic 13, cognitive 11): normalizeMuseJob has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/themuse.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8e0a925d364102aafccebd6e29498031617c501efe05f296d2a18f034962d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkCompanyMatch (cyclomatic 13, cognitive 11): checkCompanyMatch has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reply-matcher.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1214663c26c4eaaf1ce8453781f4740b8d8bc3df0c7cbc15c09f1a068c876"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UsageMeter (cyclomatic 13, cognitive 11): UsageMeter has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/usage-meter.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3dba4c43b39b0973502680462c21e5e14fc9b7051c0e0f8f5b60e929044583"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2542e3896cd074419844fde89e231c45a11495ed3a7233a8ddf2076f3babc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkProfileShape (cyclomatic 13, cognitive 10): checkProfileShape has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2b22acaa16936b088b5633a7a06afce15a212b39b6d687e5cc8140525aadd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSalaryFilter (cyclomatic 13, cognitive 10): buildSalaryFilter has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d794175c68a7735a3aa8ea735d8f9a519982f4889ac4ce1e7e24d519d3af0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccddfc61dd95a46109d14f93129219f3288d7084111d3e21c758b9d5b54ad86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCv (cyclomatic 12, cognitive 30): parseCv has cyclomatic complexity 12 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5698ee518062a8eb8bb6600fc77098a8ab771880e44f51aabbfcec3a15c97c7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function jobPostingNodes (cyclomatic 12, cognitive 30): jobPostingNodes has cyclomatic complexity 12 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"910cdb9e8b82e92ea6a1dc57b1e9914b3a961307f5b82cb61d6c75885a4a4bde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function htmlToText (cyclomatic 12, cognitive 28): htmlToText has cyclomatic complexity 12 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"closing-soon.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7940fb04ab675ad697e42da66a9ee401da3126086abae44c5f463f049b9a5459"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderCompanyAnswer (cyclomatic 12, cognitive 27): renderCompanyAnswer has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"linkedin-join.mjs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"117d954e633a51fa7460ebc42a3ce39bf23c940cba30906bbc53fa4b8ff06e4a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plainText (cyclomatic 12, cognitive 27): plainText has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0600cd6336db43c290b949a7cff85892094a2894390ca894ae8af590eeea82f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderSummary (cyclomatic 12, cognitive 26): renderSummary has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2e93440e86050b6e73810f6a07c1fecdde22dde4ec506c20bd7e8510bef215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 26): (anonymous) has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d88e8750f099d9275f7455a874caea662c876e85c74ab44c5e9392733ba2df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateTags (cyclomatic 12, cognitive 26): generateTags has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render-lint-tag-grammar.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d677db4817d2fbf30f4b57a9e5606c703258231b4c5a718cfe56b7ca992c3c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchJson (cyclomatic 12, cognitive 25): fetchJson has cyclomatic complexity 12 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/_apify.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbc406cf567153253943a758e5574cd0ffde0c749d84e042b6b60fcf432d6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 12, cognitive 23): printSummary has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb452c19f7c44f9c4891376e736ea9705ebd1f7fedc1ae411d3cb6c7832fe11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function discoverIn (cyclomatic 12, cognitive 23): discoverIn has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4cb84171d98fcba42aaefc621f18fb938c5d1d41b4bdb8ed169a4c2815191c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 23): fetch has cyclomatic complexity 12 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tkms.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bebfbafba81a1f32b75c1da246921853d8ea61cd1cf583e54fe04be54d9dfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deadPositives (cyclomatic 12, cognitive 22): deadPositives has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/title-filter-word-prefix.test.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ddb229fc3d1642b0d43f256f461e53083a43820806516ea0888d785a3ebf4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAtsSlug (cyclomatic 12, cognitive 22): parseAtsSlug has cyclomatic complexity 12 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b6e75195726bd9ba35b68939a088e5861904d5d3501af4066cf10f353920b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rawTextRanges (cyclomatic 12, cognitive 21): rawTextRanges has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-pdf.mjs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bfcc0f69486117c14dd719935fc4a7a27634d7d4ab20c9f5261d72909a2e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestWithSession (cyclomatic 12, cognitive 21): requestWithSession has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"854586a4fd9774f02435f87f6b5128aee3d20c6d28417d3e20e402b1d491dfb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uninstallService (cyclomatic 12, cognitive 21): uninstallService has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/web-service-ops.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc799efa915db23e104064f4ea1f2654e6d41cbc1124867ea48f0ea984231c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripMarkup (cyclomatic 12, cognitive 20): stripMarkup has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-parse.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"576d4b274560cf59c659df1a319342fd2619b6cb54903b12667f049042d81e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForJobText (cyclomatic 12, cognitive 20): waitForJobText has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"36807fe1a93b1936aa99615472fba2b4036b36c119bc8c932f08c0bc20a34c07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListingPage (cyclomatic 12, cognitive 20): parseListingPage has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/itviec.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd0dc3342450c3216f7f63474248a146075dcd1ea1eb1540ec70c84db46b370"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListPage (cyclomatic 12, cognitive 20): parseListPage has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d7908b8c13d0b9fcdc637eb6b7bf3009353a3904ce74c670d2b271c8e8630"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 20): (anonymous) has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2b80745af2a75baad5ab4f29821161994953e6a28b4124ed9b9afb861cee89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseListPage (cyclomatic 12, cognitive 19): parseListPage has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"429f3a1e7e487f52a94372dd46b05426f886bccc5c30cbc292425271bfb616ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 19): fetch has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/careerviet.mjs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ea0e69abe99ca31ba53b2e4fb23cd853b07444bd595cebd216d847fd705fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 19): fetch has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/itviec.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b139db3c7ce88c179afed2c9ce59978d6d0940354809c9dbff7400594ecde022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 19): fetch has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/senjob.mjs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bade0fcc524ca0156027f5dff77596d21bd5cefd6b5a9fe11c0ea89a5230da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 12, cognitive 19): printSummary has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reeval-candidates.mjs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f56ed3c113871f23c550c3f7e5c3d60040c3d13cd2c680b8da46cf2b461e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function npmSelfInstalls (cyclomatic 12, cognitive 19): npmSelfInstalls has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/workflow-action-pins.test.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8371443e019c860cebfff193541fc4ac14aeee2802cd1c0567d7a8214da89799"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readHistory (cyclomatic 12, cognitive 18): readHistory has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"filter-audit.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f6a9891da4f4f251fd5dad91a6b7aeb9468e6e696ccc7cc8671b3dd60e790"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCards (cyclomatic 12, cognitive 18): parseCards has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a268c39061036ec59069d7172f1f1ea4f56628ae2ee258ff0ad0f7535b11e090"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 18): fetch has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/gem.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"145483e3120692c92bde6cba56d3387a7dd21fbd9ede24843a40bfe8bb3d6422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSyncReport (cyclomatic 12, cognitive 18): buildSyncReport has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-sync-check.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4986f1371afc7aa378393ab983deb701d98bde5439b5b0f323525e0304cc9d5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dedicatedBlocks (cyclomatic 12, cognitive 18): dedicatedBlocks has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f96c0a4f0b486f841171dbba87d603d6f0fbde435c7dce86668ad45e3e2516d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readJobStream (cyclomatic 12, cognitive 18): readJobStream has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/job-stream.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de54023372fbc8882045f841387106408cfd3020ab624c655adfc8b6f3dd426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchRssDiscovery (cyclomatic 12, cognitive 17): fetchRssDiscovery has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"1842ed26d3bbacc45457d9aa90092fc625bd508cc7d6b08e3bfb3d6962c7b447"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPlaywright (cyclomatic 12, cognitive 17): checkPlaywright has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"713b0b91485f33de1fa5768dffbab6699af5703af68380d6de178cfdfeb4fb52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 12, cognitive 17): collect has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c59d59deaa7173b476bf0a69435e3f15944e8052c5df87f0776af3b1eb85cfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 17): main has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install-latex-engine.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5434ae877901a78535ef6052528f2883bacfdc396b6d7fba15d9267d30af6df6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdPipeline (cyclomatic 12, cognitive 17): cmdPipeline has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f00c306fa4307fd8c9461ee9de5c01397fab1e18bfc2ccef26a5779e11caf79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveProvider (cyclomatic 12, cognitive 17): resolveProvider has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_registry.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"514b211a3eaf5b16bd101f3f26af891db6397b541fa0eb5131950b2232742377"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCryptocurrencyJobsRss (cyclomatic 12, cognitive 17): parseCryptocurrencyJobsRss has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/cryptocurrencyjobs.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f07014747e1a063805e6018876511ad302caae743b889814dc4ace88e77ad2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTenant (cyclomatic 12, cognitive 17): resolveTenant has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eightfold.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2c61565a1ba369b15988052b888a01a85397dc6c9eb32adc2933b2b40bcb71"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHiringRoomJobs (cyclomatic 12, cognitive 17): parseHiringRoomJobs has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93cd4ef92a30ab301498a56636e0f5db19505f6258858b1fe2734864fc34438"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMokaHrJobs (cyclomatic 12, cognitive 17): parseMokaHrJobs has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/mokahr.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe203fac8370f40454253bbe6d23ca92d08abd02867061c76c74756a01baa5ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePersonioListing (cyclomatic 12, cognitive 17): parsePersonioListing has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dffe226b47e88937eb9d4a0bc03a72f900ba639bfbe4ec95ad1de3f1035037"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveRow (cyclomatic 12, cognitive 17): resolveRow has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"set-status.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"571fff0c3e84ba80a74362653b02d0271db21d05a51136eae2e46b964b5def34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPortalsDocument (cyclomatic 12, cognitive 17): loadPortalsDocument has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/portals-config.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b3339ddbcd7ddf37d3df2b4824403619d9abc8c34dd906d598af89f4680ec5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectCommits (cyclomatic 12, cognitive 16): collectCommits has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b42c06b64e1535a13ac701d9249f8923f4d4cdfa1cf06703434ead3757c067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function geographyTarget (cyclomatic 12, cognitive 16): geographyTarget has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_country.mjs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0a18ea240680a3045ac6f78964771346610fd316fa9c0464759afb7c00bef3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cvPageBudgetFrom (cyclomatic 12, cognitive 16): cvPageBudgetFrom has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"theme-style.mjs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d4dd4b9e9b7e8483898a4274ad5c5025473c16cabef84ef48a6e27d8451b24"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc9715c359fb745c36fd902c636494eebb8d90072249e2dac27f718cd99c674"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 16): POST has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/profile/route.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7098e951cb69dc073589aff27802fcfc42952e8b89079adfab5aa8a7d1e976e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCvStream (cyclomatic 12, cognitive 16): parseCvStream has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv/quality.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbced601b53ffd327e5c5d043a517234f12da786b4a1b9cfae62196bc6642848"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePartial (cyclomatic 12, cognitive 15): parsePartial has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"63201ac9f3e221b9453e6ad8b02a48cc1201bc8e1fd2bf4afc748abec14de4a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findPreviousScan (cyclomatic 12, cognitive 15): findPreviousScan has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9c4039ede193c48a039bd5af9850242e0c2aaf4f768388c6db13fe525f75e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffSource (cyclomatic 12, cognitive 15): diffSource has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5425fab73e55008ae061bc057984d7d6ce4cc3c04e1efd1e6759527a67eb1d5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f83d738a8aa0c991bec70f4a572ae99fdfeec549b36e19bcd80f7b383b2485f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSiteId (cyclomatic 12, cognitive 15): extractSiteId has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/clearcompany.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1bee1700c90a01b78bcc6c1b3120b23395052aa1e7c54fca035460cf1da5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRefineSearch (cyclomatic 12, cognitive 15): parseRefineSearch has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/phenom.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"facc0f747c52dab55a1b0db5866db96e7b757d1864ce2ab9e05a798801dc9f6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractLocations (cyclomatic 12, cognitive 15): extractLocations has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ultipro.mjs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6e4361bb8ba48b36f878e12758fb8a5a3ecf5149699dd973a1917ca23d6852"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFoldSummary (cyclomatic 12, cognitive 15): renderFoldSummary has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-fold.mjs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af8d8c0e687e21444ecf6abbee95a27d5dc02cff981c279d1164eb1a718885b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyInboxDiff (cyclomatic 12, cognitive 15): classifyInboxDiff has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-inbox.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d156e38d0d0139b4d186f9dcc6412a9528171cadd2d84a2d346ab35fe3b8798"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeFollowupStats (cyclomatic 12, cognitive 15): computeFollowupStats has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stats.mjs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eae0eceef3be4c17811dc418b81c85f0402b0ec268e86b93025123cad2b163b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deleteApp (cyclomatic 12, cognitive 15): deleteApp has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker.mjs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7199fbb37b65ebef8a6f2b84402de5dd2ccaca3336815123f39ba7fb84248b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function companyHintsFromQuery (cyclomatic 12, cognitive 15): companyHintsFromQuery has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f71d6d65e585c6ce5130eb18e1063d59db9c7997efc0c6fc9664de9f05bde0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keepsStoredNames (cyclomatic 12, cognitive 15): keepsStoredNames has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41f64a163f9d2c19a27546bbb36ed5c0b5ea33c285d148026e644db4961054b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadHeaderAliases (cyclomatic 12, cognitive 15): loadHeaderAliases has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/tracker-table.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0e4a79af480f4853eaaf51a00fbcf69e099934b3f31aad28205aebb72cefc1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printHuman (cyclomatic 12, cognitive 14): printHuman has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26f38da5efd23247ddbb16847a7e0fee3c44ff0d2d79ee7e3d8799c86ec0087"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveActiveCli (cyclomatic 12, cognitive 14): resolveActiveCli has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea081c6e347d75b524ad83d5e2878126d8e2e99ef3ae3d5bdf6b5448181ebb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProfile (cyclomatic 12, cognitive 14): validateProfile has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/career-profile.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcc92ef39c407918e0e383b7bafa35cbc0c66fdc71ccf71a79030c8d8845815"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildProfile (cyclomatic 12, cognitive 14): buildProfile has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"144064d207c4b3b28625eebbea273e5e7005b100b66591482d4708cbadbaea0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 14): main has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"paste-reply.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"994dc4e351dcd20f37f18984ddc3867044101e1b64384fdefe0ef90f90d0f55c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectAts (cyclomatic 12, cognitive 14): detectAts has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"prepare-application.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e44275e9b6dccffb8cfd7313a2ee534893710639f8867dc1879b05f43d376a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 12, cognitive 14): render has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"privacy-status.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc616535ac150cce97f7b7a91574b0dcb63f84c71cd2f684fdddb9145ba13bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSalary (cyclomatic 12, cognitive 14): parseSalary has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hirehive.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"944ff0f94c572ee78598d3b1495e3bfb5eee157335000ecf888d982487d59b17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 12, cognitive 14): fetch has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0caaed4510423e82ef94381f23dfe3174584ccc871de3ad8ffa8ae6b8de27414"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildContentFilter (cyclomatic 12, cognitive 14): buildContentFilter has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"2334a5c408cedb6ae2a26f98f8c61325f2120574730989ba38c60fbef5fe54ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 12, cognitive 14): parseArgs has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-import.mjs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e0744ad9513fd1b0941e790b62a01d3f343d03908389c2097636ff6ad47082"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRegister (cyclomatic 12, cognitive 14): loadRegister has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"34376f9605168d3c45bd1cd2b24060ac05627b09580435ce151adc802f0b9013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectDomLayout (cyclomatic 12, cognitive 14): collectDomLayout has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cv-visual/layout.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"955b23809beae279274af75328795986a80ccfa18bc69aa7bd111de2ce61fbde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 14): POST has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/portals/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1739c896a728cdabf58c8da94d5ffe6afd15c6816190115d8f3827fa67bfa218"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readScheduledStore (cyclomatic 12, cognitive 14): readScheduledStore has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/scheduled-jobs-store.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12cf8c12fc03a65cee8b3a199f22e2109fc196df689e21fdbb371993d5c1118"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWorkdayHint (cyclomatic 12, cognitive 13): parseWorkdayHint has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"discover-ats.mjs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"889c3f47f71148c05f7997ebc586196421bf0a7d4e32cda87bef0e3c87731b12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cmdApply (cyclomatic 12, cognitive 13): cmdApply has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2035113cfbb46b6a972f47c3f967d1cb112f9b1fe5dafbcba395c814f6765fe8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMeituanResponse (cyclomatic 12, cognitive 13): parseMeituanResponse has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/meituan.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584e8541c86bed8d5ddf9cc776cc8f90c939a288760a97945abdd36b9355dd5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJobDetail (cyclomatic 12, cognitive 13): parseJobDetail has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/peoplesoft.mjs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbbf4d32dde1e78d8933b04d322aca743d942b53c91788b71a56df36648e88a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseTencentResponse (cyclomatic 12, cognitive 13): parseTencentResponse has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tencent.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ffb9fb884a886d51aff3d54f9d32163053015b688688f6efc2116cff9598be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tesPayload (cyclomatic 12, cognitive 13): tesPayload has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tes.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9643840fa6f74c7a57f33413961ab4a21d4ac17af7a5ed50f686be61e5c3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findBlacklistEntry (cyclomatic 12, cognitive 13): findBlacklistEntry has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb6e297e9b572ee3d22a98532486a71c6de417ed4fcdbd76aa166c52e262d5f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function structuralGaps (cyclomatic 12, cognitive 13): structuralGaps has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/evaluation-mode-parity-helpers.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f762e7cad6bcedf96257bc242f55cb04edf41179442e55a2ab95b011dc66cfd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runner (cyclomatic 12, cognitive 13): runner has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/github-evidence-named-activity.test.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb1071ed1d34099926af4aeb18df017b1e70c64ac0a78978f94a8624a78d1b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printSummary (cyclomatic 12, cognitive 13): printSummary has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-sync-check.mjs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"001e43bd6b664147a3bf2ea078074b47a243ebadc397815fbb07c310423be29c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Home (cyclomatic 12, cognitive 13): Home has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/page.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90432b5c63a21903b0beb8f7a1de043b34f2d3057fda6a8f44960212c54063a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tagAt (cyclomatic 12, cognitive 13): tagAt has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef2dee99d95163ef35c21af2802d2f77aa6441ed3babe2cf8e88e81396426f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contentHeightPx (cyclomatic 12, cognitive 13): contentHeightPx has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/page-estimate.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490b3a5384ee007f6713a2a048343841aeaf13667e57e55369662c16864be36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadStudio (cyclomatic 12, cognitive 13): loadStudio has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d546a0e01d3603227eec3ec69799dc3a68e6f4b8991ddc984ff87af20a5f2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendDigestBullet (cyclomatic 12, cognitive 12): appendDigestBullet has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"add-entry.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0beff8592871fca44f67d4581cbf234854f3177e4bfd2be34eca6714fb7d3f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withinReports (cyclomatic 12, cognitive 12): withinReports has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"analyze-patterns.mjs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eb66155ea5d8e3abb4db26bcb11e1204e07e2dac9f99ba64fb2043fc451541"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeAshbyJob (cyclomatic 12, cognitive 12): normalizeAshbyJob has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"309c3adc1a789789f66f16d4489adcce4ed933bfcf5c88240fd914251cd990a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadState (cyclomatic 12, cognitive 12): loadState has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hired-share.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6221a3b832f9e3f27cb0ad196f5c1080ac1b030dfe5576239885cb41639f35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/greenhouse.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f854ce1f57be1e3af5fe7eb61a7007745f7db6f33788d7c0f40e087d4a3229"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractSlug (cyclomatic 12, cognitive 12): extractSlug has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/polymer.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f85ee66be014a734b0aeede027142ae191e8a83f334e8811a98dc40edaa7f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCsbJobs (cyclomatic 12, cognitive 12): parseCsbJobs has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"84133d8045df399d3df843abb4dcd370dd6e9afcf7faf1bd31c642ba5d2022d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postToJob (cyclomatic 12, cognitive 12): postToJob has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/telegram-channel.mjs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"147f40a188cdd17bb4f5109943d82a5b9dc5dd75e23527f1a72d400e22590d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3047ee44b3272b7c897f97dffc4df4496e59cd6a2446f4bf52bf492e53dfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseReportNumbers (cyclomatic 12, cognitive 12): releaseReportNumbers has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"reserve-report-num.mjs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a57c834691ae29486794b0e76e66db744280dc5f45c29abf9e0bd0d9c423552"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 12): POST has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/scheduled-jobs/[id]/run/route.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"666e1a7283c3f77f9c74240f33ed6aa7c0dbfd4c9be99afec64c43b7627534ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveStatusConfirm (cyclomatic 12, cognitive 12): resolveStatusConfirm has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69cd4ebce9c9a9a3782ccdc0f83dd843bd74d1e37870bbde714931cc6970b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/jobs/job-store.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"490451b1e4599586dce90e3be7802c3bd8ca59bda8520f8480b013056fb7d703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submit (cyclomatic 12, cognitive 12): submit has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/linkedin-paste.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"75726a898da4213dedd53372f4ab61a319083ad4924013bbc2676d8ec8fc3784"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/scheduled-scans/edit-job-modal.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f45855028a0486c1e92cb2ca34ce873870affa6c31289e55adc24aa0b7b33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleLine (cyclomatic 12, cognitive 12): handleLine has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8a263d643be47d3b94e5f551879654eb384fcac50ae8773b57f34d08520691"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTailoredHtml (cyclomatic 12, cognitive 12): findTailoredHtml has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/server.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ab2b84c8f2c859f92b12f18bfcff2222a4d8e68d77ea5607015f6eb73a7952"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWorkdayJob (cyclomatic 12, cognitive 11): normalizeWorkdayJob has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e1df4c2a696784466bd526767fc4c52e1db47e057679d415fe1fda3b041e44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanCompanyName (cyclomatic 12, cognitive 11): cleanCompanyName has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7bdc393cd208afc1a14b1600fa0981094098289509cfbe7de7cef34827f052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contactToVcard (cyclomatic 12, cognitive 11): contactToVcard has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"contacts.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daefe78fecbcfdfc96866211f0fdddc7bcea6be8726e296206a2a737b36be0e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseExperienceStart (cyclomatic 12, cognitive 11): parseExperienceStart has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-experience-order.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0971a7c21911faa2164bcd5d3e21ddeaa2bc3c8732db558129ab3946acdbd7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCli (cyclomatic 12, cognitive 11): runCli has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evidence-freshness.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbd17227d3191674cbe6bed0ce02c0235b8e11c4faa6e9faa6c1415e2950cb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 11): main has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fix-slugs.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"62744dcaa543bbe6ef469e2f01dfb39d0e467364f5bc5096a4d6a4ff7357de66"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeInvite (cyclomatic 12, cognitive 11): analyzeInvite has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb56a54767a4079414db85f7a11737d46b7fbbcaee6754eb4f10613e7be021c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffPlugin (cyclomatic 12, cognitive 11): diffPlugin has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_lock.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb90bdf6f8010adfed2d96dd2044fc5570d62071cde56f9f1773af917a23cbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function companyRelation (cyclomatic 12, cognitive 11): companyRelation has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"precheck-duplicate.mjs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d309abe9361edebb8247ad228c05c9ea95669460fd846e7c622e8e9330ecf36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cachedLookup (cyclomatic 12, cognitive 11): cachedLookup has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_dns-cache.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cf148096e7aba300dfaf81be74094b6a87a039d42c8bb1cb1fb6d60d2d97cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function annualSalary (cyclomatic 12, cognitive 11): annualSalary has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pracecz.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61dd6419ab91a04092857e73d5022ea42699bda4ca1eee91d818a5d53d4810e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveReleaseTag (cyclomatic 12, cognitive 11): resolveReleaseTag has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/release-tag.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2156b9a91f0df3341b3a403626152f75914ce3505eae300b1438342ee7993ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function companyFetchHost (cyclomatic 12, cognitive 11): companyFetchHost has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef9e4691acd8823db68771069fcffb42633d60a6991012371b8ab27511d5898"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/export-ats-text.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bccbdab0a9bfd0720ca842800706955a789dc94f8e642dbde1266329f7b3a23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workdayBoardProblem (cyclomatic 12, cognitive 11): workdayBoardProblem has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/employers-validate.mjs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a47f9a59a7795f7c10858bb78c18e3066c6655d778b097fb6bb191b317cffa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareLifecycle (cyclomatic 12, cognitive 11): compareLifecycle has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-sync-check.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3506bc225b25a0c080c3d4e4c44b482424cbe84270609da79dc9ea545552f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkpointCurrentResumable (cyclomatic 12, cognitive 11): checkpointCurrentResumable has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3fb382d1ea31718f7a2e3d3b8a8de632e652d6f21a2a1f80cb252b01d8f1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReportPage (cyclomatic 12, cognitive 11): ReportPage has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/pipeline/[id]/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64f8ea34e05b489b7d0e1d387bf9145d275503b7344c13203738e1891c76fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ConfigForm (cyclomatic 12, cognitive 11): ConfigForm has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/config-form.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"712bd373839f193193f8db2b4605f8367a5f66bddbb5a65d4394df25e832e2cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyEmpty (cyclomatic 12, cognitive 11): classifyEmpty has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/diagnose.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da5f9e9201f9eff4cba9b38c045caa79421072624d9d16dd62cf524bc85844b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeAssistantStatus (cyclomatic 12, cognitive 11): writeAssistantStatus has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/assistant-status-write.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3f18e2f14418b7f4171866f75918df102a47ad046bd63ca816c1e10ee81e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasBox (cyclomatic 12, cognitive 11): hasBox has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-studio/page-estimate.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0dba1e845e22c592cb0659a31ed6d3c77ef3a5fb0eab191dfb9b58bceb4062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filtersToParams (cyclomatic 12, cognitive 11): filtersToParams has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fada58949a62c3f1a10b943833e1ed73450233a38af4cf3a89bdb502821c16dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadFont (cyclomatic 12, cognitive 11): loadFont has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"72168ff778e96c83824dcc0bb57a9908d99227f117d252d7ccff96da2700cce9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIpv4Hostname (cyclomatic 12, cognitive 10): parseIpv4Hostname has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94bf9313eb24102b91f7244656241cb527f041622ab141176c307b481ba788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildResult (cyclomatic 12, cognitive 10): buildResult has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/check.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93148f4bb654fdaca01b7dd7f56a92105a8130505ee9690ac92e53d862b6d88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveConfig (cyclomatic 12, cognitive 10): resolveConfig has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/beesite.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"173591f17f244f28fef33a77be39d87e2ba473e3dfc27f0a33093434440af09d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfig (cyclomatic 12, cognitive 10): readConfig has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9839f255c069e0e77bce55b333b689031f4677385ea9a754b72653f6334e08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTarget (cyclomatic 12, cognitive 10): resolveTarget has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/neogov.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"413f0756cefe84c5735906685835069a64096ef0ad0b4af9c57046f3c73eae7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRequest (cyclomatic 12, cognitive 10): buildRequest has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/nofluffjobs.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a87cfeb4815a62ad39e9a3caba2715c306feeedbe6237947fbf4c4901167dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBoard (cyclomatic 12, cognitive 10): resolveBoard has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/talentlink.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bdac36207c91099328512f9e62c9270c96b6d6da49ff916813ed5de1e9afba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseIpv4Hostname (cyclomatic 12, cognitive 10): parseIpv4Hostname has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync-batch-input.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c871ce484f235370b7a96f1ebc359c98a24636f52d5bda7d8181231612550"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 10): POST has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b642a0237a49f05fa2686a516f43cbdb202629681083fc0185398f5dc7f5ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"663b65dcf975e27c001c7f8c55fd0110c0e19297ff8449b4f0563e062ba2f77c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function indexedPdf (cyclomatic 12, cognitive 10): indexedPdf has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eabcd8956dd0686b463ca130c5c92597f23372ffc91ed3e43592621037b98e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseReportMeta (cyclomatic 12, cognitive 10): parseReportMeta has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba83653cb9c5eaa31145bb714921dfd8e67d4acc635d5e856e3fd2ab44833ca7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 12, cognitive 9): classify has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf6c4edc8157425efce4e18450a3aa113584818fbab27c17ffd9fdf4cd6b6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 9): (anonymous) has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/openai-directory-plugin.test.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadebd67ced9e7c6f9622349b200b43108d8fb1177a82a7654755c2d5e290548"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRegistryFreshness (cyclomatic 11, cognitive 30): checkRegistryFreshness has cyclomatic complexity 11 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-plugin-registry.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e001085d064526f539ec6cdb47ab816637cab3469f0411b134e6bc66c78819f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findUnmined (cyclomatic 11, cognitive 29): findUnmined has cyclomatic complexity 11 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac04851ba6e7526716f1ec552f9639abe6b1178ee5bd1b955d5e490376e828"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collapseMarkdownLinks (cyclomatic 11, cognitive 27): collapseMarkdownLinks has cyclomatic complexity 11 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9374d5bcb44ac9e01881a07fb22464bf3f5ad6f2303f73c0ed1812d39af90a80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatReport (cyclomatic 11, cognitive 24): formatReport has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"i18n-drift.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"28361d78e94f61abd0e1b13153fce80e6e80f916bede1c2e6cab1c3a95b4dc2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripCommentLines (cyclomatic 11, cognitive 24): stripCommentLines has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"60da499ea31919e451138a39083ea619a316fb115f4a225a6c777638633ab744"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractKeywords (cyclomatic 11, cognitive 22): extractKeywords has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189eede99eeaa0176165939868548114095f7363b45779f012542dac0c8675e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function aggregateGaps (cyclomatic 11, cognitive 21): aggregateGaps has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcefcc212185433aaa317dd8f696db843a8cadf0c0f70c71a299b82343eb5f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractMacroBodies (cyclomatic 11, cognitive 20): extractMacroBodies has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/latex-content.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b2995ff989c4458f56c4ca68aa650079b529126348383038433987a46b203b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitStoryBlocks (cyclomatic 11, cognitive 20): splitStoryBlocks has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/story-bank.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0324205b6ddaa9aa3c5460997ef5285b713ca45c11cc3f1ee40137959376b5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function guardedFetch (cyclomatic 11, cognitive 20): guardedFetch has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c876085d47265ea19880fcdd3aeb7f1455b87d5666954a3b5cfa0a1cdfa52d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseApplications (cyclomatic 11, cognitive 20): parseApplications has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/tracker-table.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff78ee8509118111f6f4125d8badb8ab9b6c33e316542a3886200e6836b06ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectTemplatePlaceholders (cyclomatic 11, cognitive 19): collectTemplatePlaceholders has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cb8d392cafe3411661fc91847f2c0c6474aea960a8612ed3c8f1ab132e8102"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyClosures (cyclomatic 11, cognitive 19): applyClosures has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"close-stale.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"797168f526cf2263fcf905b50829f61faaebbcb76bf9dd700846da01d811e414"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function harvest (cyclomatic 11, cognitive 19): harvest has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/apple.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"35df8a05ba9e4ed99fa96f0a223f923315b56a6bcd2a7cab2a0ee3a82399cd5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseVacancies (cyclomatic 11, cognitive 19): parseVacancies has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rheinmetall.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"51789fc0b66bb412356231de9d1d0437b324021f5c8e322e2d5204a8e8664ac9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureSkillEntrypoints (cyclomatic 11, cognitive 19): ensureSkillEntrypoints has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scaffolder/bin/skill-entrypoints.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"294920bda8edfe1ed66112e9a7f59981e7e9fa5ea468c196608dc22efd4d2548"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyze (cyclomatic 11, cognitive 19): analyze has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"035e8230a56fed3c257cfb4e87a4f6916c9bb9a7c3f63cfd5d749d2dd1238bc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ldJsonBlocks (cyclomatic 11, cognitive 18): ldJsonBlocks has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-parse.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14d4b471211f72b636d4326cd00b883cf85de374b21495f5b60d50800ef7329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchWithTimeout (cyclomatic 11, cognitive 18): fetchWithTimeout has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60cd7ffccf16e790f801f3f1fd8a124193705baa6ae74468d91a72c8386695d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withRetry (cyclomatic 11, cognitive 18): withRetry has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"241ae21fedeb4e0771ce63fe344eb3fb5b63d32a92970fde8fa39b5683aa44f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseSitemapDocument (cyclomatic 11, cognitive 18): parseSitemapDocument has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f15f73bf3eeb4b618505eaf96ff8c732c9919ab4c8321cd0b987a2e3bfcaa42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function push (cyclomatic 11, cognitive 18): push has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"98072e366e58d95853d534ba82cf25829d65ce7c844dfc3cb34513ff3e2387c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRobotsGroups (cyclomatic 11, cognitive 18): parseRobotsGroups has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"robots-check.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5903e9053f30710d138667672ac654715ea95b8672b58fea72cef1114db96d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSectionPartials (cyclomatic 11, cognitive 17): loadSectionPartials has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build-cv-html.mjs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c063e15041aa12355369f08654c04c418e7c6a84b76fdb59e73c1f36eda595"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNoResponseFrictionSignals (cyclomatic 11, cognitive 17): buildNoResponseFrictionSignals has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-history.mjs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b1695a41260281615e261c63b476d776164b9d437d29885b15c91779aea1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cliExecutableOnPath (cyclomatic 11, cognitive 17): cliExecutableOnPath has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc83894cce0146074c6285793918b13ca88ccfad44b1b11df6fe8d9ee491c777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractItemizeItems (cyclomatic 11, cognitive 17): extractItemizeItems has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/latex-content.mjs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb75e949cc6ea6499fe3dad19becf814f7f56460bce9ff29c67c03c2e089658"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildQuery (cyclomatic 11, cognitive 17): buildQuery has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bb2dce2fc6557dc21c52de8007c549bacc9bb7b48b939859971ea7c0de172f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArticles (cyclomatic 11, cognitive 17): parseArticles has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b4e62397d736f22be70dd151d89ea1505eff1ee24163615492f16f1a542469"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickLocation (cyclomatic 11, cognitive 17): pickLocation has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c898308f11a972e933333cab5fb38ebec095581f54f452642cbd59e4bc8ba36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJobPostingJsonLd (cyclomatic 11, cognitive 17): parseJobPostingJsonLd has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bae220991da0613d61686e099642d9eec652d368ca0d19166cd556df82d574"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectSeenCompanyRoles (cyclomatic 11, cognitive 17): collectSeenCompanyRoles has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":3247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b364dc944f948dd0f72c8778c0d924e1c33e9c6d75c92ab62962bbbc75c5bd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 17): (top-level) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/update-system.test.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcad273a073b52167ea080718b2c4276e2e093c8233be0c6b9c5e6e671f66a09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rejectUserLayerPaths (cyclomatic 11, cognitive 17): rejectUserLayerPaths has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbf7c82a37a163f9e21ecde530266538de413672b8c443d5fffd09c925654f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCliArgs (cyclomatic 11, cognitive 17): parseCliArgs has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":3575}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f436e528433741e4948cc97f7c2fe7a667bccd0e9e7699cb4f6f5a00f47012"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildHintStopwords (cyclomatic 11, cognitive 17): buildHintStopwords has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-portals.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8729b659f4c64a7b38d430efe72a8f6da4555e7d15a8cc546abe3a2089f3b19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractGapsByCompany (cyclomatic 11, cognitive 17): extractGapsByCompany has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"weekly-digest.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c5985ff05a7964666fb7c09cce4c68ea586e2d67abff21370063c85a3e6959"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function printOpen (cyclomatic 11, cognitive 16): printOpen has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"assessment-log.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee4186fe03f60ca2e7f83ace20b74d898f2b04a586a4c5045a8ab674b61a510"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeListing (cyclomatic 11, cognitive 16): normalizeListing has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7437785a89d9ae938165e9be587eaf4026fe985594c9cd120057d644e19604"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractContacts (cyclomatic 11, cognitive 16): extractContacts has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"followup-cadence.mjs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49dc4ef53ad8f465c61f55a1e8b536b7d6113468c0d0cc9bf3e739816aa3a9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireDirLock (cyclomatic 11, cognitive 16): acquireDirLock has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5210cba04ba6c60138ab7cccd622d7e5ec7655e091c06a706de79bf9381c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function triple (cyclomatic 11, cognitive 16): triple has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listing-fingerprint.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab8b9a07447f6ce749413b1a18b904903475f7f7ad1f0d084ecbd06dd9c5ac0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeProviderPlugins (cyclomatic 11, cognitive 16): mergeProviderPlugins has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/_engine.mjs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c4977685258c66570e1cc91b59189e38f49bd2c7ddcb85212abed1b2735422"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForRun (cyclomatic 11, cognitive 16): waitForRun has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/_apify.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b48311d70790726a0024f4b0c0ebc792f3e14b3f297d11880dd338530d2b63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locationOf (cyclomatic 11, cognitive 16): locationOf has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deel.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b20f2c3e1f36c5c7ad419bb099d53b6a2247d4bc8018aa8331c130689f833a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 16): fetch has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/lever.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"83849ef1c2f325a13f3d76087a234d1c6965f02b8f35cfc0d8405d51b91064c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function acquireDirLock (cyclomatic 11, cognitive 16): acquireDirLock has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/dir-lock.mjs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc39c9f35633ff3f6778689b29073662b98fad0a75ad57e244230f44dbd0c47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/report-persist.test.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"885508584dd13c4ec418d317b24d1bbd44d3175c5e3f227f1ea33a8231c6c069"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/lib/report-print.browser.test.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b5038fdd2c67899c38f13997135ffe3587e7f6d04203f2856c32f39ce76ed9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractRows (cyclomatic 11, cognitive 15): extractRows has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-table-freshness.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dfc3dcac0a09db11e00cbad5578c9210265d952f6f441c21a51cfe36aa00a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadContext (cyclomatic 11, cognitive 15): loadContext has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd348a84d2f355800e5c30e4ada9a9a4ffd490d7a93d364e3642a0fa3d38732c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPlugins (cyclomatic 11, cognitive 15): checkPlugins has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"23367da468c84868fd66516023ddd630bc122e47b5632d08a2d3edb5c0b9ee48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLatestScan (cyclomatic 11, cognitive 15): findLatestScan has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evidence-freshness.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118281a329086121d36e2b715e8785679b9ddae5b9fa3f8aa741bd00cc7ebd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildRecipientBlock (cyclomatic 11, cognitive 15): buildRecipientBlock has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generate-cover-letter.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c519194391943acd1788d15d8510bf058b149207d46ecd5c24feea396fe83a09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sweepScratchDirs (cyclomatic 11, cognitive 15): sweepScratchDirs has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/scratch-dirs.mjs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7cf45ecb5b8fda3d0fb943fb75faa6a491f8770177a3808f2cea4cb8d17ad5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http.mjs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2a062a786f57b5123ff3eb13e1af5f3a5a465e51506d10a5364498783bdba6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 15): fetch has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/atlassian.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d981aa8ca0c49a05cb96f1c8df4a27dbcd0b9a7374022219c540871176dd9d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEploySitemap (cyclomatic 11, cognitive 15): parseEploySitemap has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"79409c64b0c9aa5f113577fcb338887a3a05c53c0b98ace7c077559e46ab10ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pickClosesAt (cyclomatic 11, cognitive 15): pickClosesAt has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bebb9acb734d9a774bd9398a62825d30c1073518de94325c1d74f8bae0054a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-ats-full.mjs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e77eb4457c5963779cd20248103eda688fb8d8160cf6cd3d1625bfae24a3dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 15): (top-level) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/pipeline-lock-mkdir-eperm.test.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccac2d2a44c9be765ddbc2a4f5db2e768dc73e6355404593c58065ab914bdc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keepsPendingNames (cyclomatic 11, cognitive 15): keepsPendingNames has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-views.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fb9b5d8600f47f2b6b49e3d5884ca45407713c434610c05fecb5ddf1026956"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doCvSelection (cyclomatic 11, cognitive 14): doCvSelection has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"career-profile.mjs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8506de99eb3d4bec70a31685db4f2dd54ba03cf771ef53501535bb641958a440"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function describeTime (cyclomatic 11, cognitive 14): describeTime has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ics-interview.mjs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50e396774cd732be41fa7644ab5ea292f5c3f02b74cffc1ad16bc89a38f0968"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchHtml (cyclomatic 11, cognitive 14): fetchHtml has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac57111093734c5b7cb4a7f672d2411efe30de5b7cafcf69e9085076035f886"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAtsApi (cyclomatic 11, cognitive 14): resolveAtsApi has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"liveness-api.mjs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"717cd582c7f80843a1cadda730c53ef05897f4ce0dde7079bc7b4f9500f61d22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRecords (cyclomatic 11, cognitive 14): readRecords has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/index.mjs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"319c25089eb02e6addbb1e255e5a754676613f744bd1bf1b623bb78b38f5a5db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLocation (cyclomatic 11, cognitive 14): buildLocation has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/arbeitsagentur.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e4850ea9eac7711df06eb62ef1cffa105cf75336d3de5429872b1fc5b11b39"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cleanLocations (cyclomatic 11, cognitive 14): cleanLocations has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/csod.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ba9874a68e68d954bef38877278f38158b54406fd4794b3c0204954fef638c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCollectionRows (cyclomatic 11, cognitive 14): parseCollectionRows has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/notion.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ebc1ab83a82d94aba93eec7087e8b9fe9765c15092b5b77296f69399bfc75b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFeedDates (cyclomatic 11, cognitive 14): parseFeedDates has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe8c3893fd0519504d175016ae3169cd804cbaad9990dfe71a59e51d33146eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 14): fetch has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/successfactors.mjs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a955636c92139a8e5ad0be0d82cf7a8fac2e1f9edcf062661b98560c6f1e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQuery (cyclomatic 11, cognitive 14): parseQuery has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/tkms.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e975237cd015bf64c2ef1b800eee5b02062f1b99d7450b64af14005141b7df9d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atomicWriteFile (cyclomatic 11, cognitive 14): atomicWriteFile has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a3f36c7e1828ce6b032d06c2b2dde1fef03d594a8ca595c5f39eebc772ddcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseYCNextPage (cyclomatic 11, cognitive 14): parseYCNextPage has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"95618a6a09d9eefef1e56f4d776b17b6ac27b120ff8f929fccd1bbd2f6cb2359"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 11, cognitive 14): check has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/story-provenance-data-root.test.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f80ca0b3aeb7eb59aad070608e95dacf3c3648cf9c54bb916e279022739e779"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 14): (top-level) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/theme-style-dollar-pattern.test.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5febfcd4cbbbdec92cdc834ccd0804f08630158dacc2e359b4e92bb7193d9252"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/log/route.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c223e78f122d2781108a35a091bcdfc5df80a98735a1f3537f40a1614e0df9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readReport (cyclomatic 11, cognitive 14): readReport has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-header.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cefcea6fbeb0474d19d0a8d128e646754589069d48af41541de7e20e02f58e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readThresholds (cyclomatic 11, cognitive 13): readThresholds has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evidence-freshness.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e242ccf0ca6fc0e4d4bc4d70b59718cfa16dd468b62f2abae56300f51a5a3d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function boundedDownload (cyclomatic 11, cognitive 13): boundedDownload has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install-latex-engine.mjs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc62de8233398d403dc4f77ccc03e9713c41af7dc146296efb0059b958f74b0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCliLaunch (cyclomatic 11, cognitive 13): prepareCliLaunch has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cli-launch.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"376d166a78611c31c82153fc9a68db24da124cd99ee79fb8987083810ec97da4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function populatedContent (cyclomatic 11, cognitive 13): populatedContent has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/cv-payload-schema.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec15c495d14c73e9a4fb59cc51102e1eada143174c7932b7f505f554ec447c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseActiveInterviews (cyclomatic 11, cognitive 13): parseActiveInterviews has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"process-quality.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ac25c7848a9b67d0bd45e0c62e30aa86b0381c22e58f136c87e3fea53bb54d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appDataSource (cyclomatic 11, cognitive 13): appDataSource has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/ashby.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"657a9948be5042dbd57bfe39cd158ad11df175d7cf518642bbdf89781246da07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseLarajobsFeed (cyclomatic 11, cognitive 13): parseLarajobsFeed has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/larajobs.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b0d7e913bb608acfde003ef42ce862ea9e466c94fa1c2a03d7bd2ca113984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeLocation (cyclomatic 11, cognitive 13): normalizeLocation has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/nofluffjobs.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fdd623c8111eb8d18bca3f3711e99702a7021125b1560c6f4e64ab2ab875f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractReduxJson (cyclomatic 11, cognitive 13): extractReduxJson has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-seek.mjs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"298470a0594019e64dcd489599b1b51ce2f5e62b38f3a83eca1abcb95896a1f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalValue (cyclomatic 11, cognitive 13): literalValue has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/depends-on.test.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c33653ae40420a6a7ab99ebb07d70d656c1ea8390f197f451512b3c49d2139"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function linkInheritedDependencies (cyclomatic 11, cognitive 13): linkInheritedDependencies has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/helpers.mjs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcaec3d0170686a3ece3dfa0b77d3b930e600acc503bf843685da30aaee583d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function literalValue (cyclomatic 11, cognitive 13): literalValue has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/record-fixtures.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82bded8b14f19f29282a7897b0a824f3ff92c137f6592ced5a0c4047789fe23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseActiveInterviewsWithLines (cyclomatic 11, cognitive 13): parseActiveInterviewsWithLines has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-sync-check.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c66e991bd625ac01ed8972aa1d99aaacd62a1a44c045b1e94ead510167c5b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function apply (cyclomatic 11, cognitive 13): apply has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"362c5861f5d9bc778520d4821062104afb6a6bbd4d8268b7a4da3b60a22a4d09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 11, cognitive 13): POST has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/templates/default/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a232445c68688fb08206b6807f89fb28a2fe9ebab4415305f1fc0d56d15e9762"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function consume (cyclomatic 11, cognitive 13): consume has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/fill-stream.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3aa12f036663fc79ef5e2ec6313e65cd28617f856359fd4322ed8fa4063591"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCliLaunch (cyclomatic 11, cognitive 13): prepareCliLaunch has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cli-launch.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f4aa0acec501362e25e11cc55a098a7a1237a7b911b44c2b3c32eca297aaac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDiscovery (cyclomatic 11, cognitive 13): runDiscovery has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/scan.ts"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"243c1a947cdba4944122e28f8261dcf090f7a45441544c235b31794ac8ee3c2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTrackerRows (cyclomatic 11, cognitive 12): loadTrackerRows has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"calibrate.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d6cbc4e3fa994ce7cc4c88cbd931d0f5e56f96397427fece1efbc22989b27d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ompConfigBrowserState (cyclomatic 11, cognitive 12): ompConfigBrowserState has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9a98f64e612c4b6451acfe01624ae00cb0afcd416c1df9eabab84f68eb7242"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeWaiting (cyclomatic 11, cognitive 12): computeWaiting has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"funnel-velocity.mjs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc28fe650471b6f6073bf93b069f108b29f2a19ab8c23459257937c2a6c42f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTrackedEntries (cyclomatic 11, cognitive 12): loadTrackedEntries has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"127630e7350ff5e979388abf383bb5c9a7afcd663dc4a02ea42f4364bad4df0b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isMainModule (cyclomatic 11, cognitive 12): isMainModule has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/is-main-module.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e140eac26388526ac78a61c894405b7215f5139b83db3377d746f88ca7be2466"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchJdFromPage (cyclomatic 11, cognitive 12): fetchJdFromPage has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4080ec2b3e8c196566ec4ac6a8da221a801a0ccb918f01085f9cbcfce615c50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeItem (cyclomatic 11, cognitive 12): normalizeItem has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/apify/index.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa13abc938976f10564adb767396e81c0ab182b2c9e99fab82048e9a7a917c0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatLocation (cyclomatic 11, cognitive 12): formatLocation has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/dover.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0588222ff80d37ce5d2881d1ed3d547b0c9ee5036fb80899c169756fed08e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCategories (cyclomatic 11, cognitive 12): resolveCategories has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/getonbrd.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f03d5faeb5d2fe77cd1f993c991fb65d3ce4729f497e6d12c73b916ed261f69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveHomerunFeedUrl (cyclomatic 11, cognitive 12): resolveHomerunFeedUrl has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/homerun.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1263f2ff098285cfc2fd827649b3812068067661ca9da7800ff8e7eec10bdc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postingUrl (cyclomatic 11, cognitive 12): postingUrl has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/polymer.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"99460a4f0efd21074ca0c156b2c029f779fe8679207545a955a4daf58c882fce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postingUrl (cyclomatic 11, cognitive 12): postingUrl has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/trakstar.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5da44f982fc4a27a088f4b502498d440340cc0af3157ae6b7ad8e7e1e58072a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bracketTax (cyclomatic 11, cognitive 12): bracketTax has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a52cee0bb31f5bae6934d1c305b0165e328212f0b66a95b54b751ac215c3c96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function callArgs (cyclomatic 11, cognitive 12): callArgs has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/walk-tree.test.mjs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf27447b34c528ba74532fa54262508ad2251badc27064fdc41a67141102d47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseDismissMarker (cyclomatic 11, cognitive 12): parseDismissMarker has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8a0b17bc027a7a42d4da4e7fff90f145b3a487fc0626d706c4de9464f1461f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withinReports (cyclomatic 11, cognitive 12): withinReports has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upskill.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2701ccaf374029e360686127daa9bc70b5baed3689c0a10058a2f32395061200"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function looksEnglish (cyclomatic 11, cognitive 12): looksEnglish has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"verify-cv-facts.mjs"},"region":{"startLine":3141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b24dca51a8ad3104e18f6474f328871abc32d8f306ed5a57af62a191f3678ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claimQueueItem (cyclomatic 11, cognitive 12): claimQueueItem has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/scheduled-jobs-runner.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"65daddb9d4e8461b469ce2f2b702a941bd52cd142f462bd6555a76f710492d1e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTailoredCv (cyclomatic 11, cognitive 12): resolveTailoredCv has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/apply/cv.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1384f0fba04bddec2e972c5d1ee9a312208c4b582389186e235ac528f2ee951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCvEnvelope (cyclomatic 11, cognitive 12): parseCvEnvelope has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-envelope.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa01d2b0d83c3dea66c8d6aa2ab5ce079cb0958a0fc93e6a9d93158708e5e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyHandoff (cyclomatic 11, cognitive 12): legacyHandoff has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/evaluation-gate.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9ef09442a92f3fafc49478ae6c78bba446602f5ce5d584715793ae8175a79f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scoreTone (cyclomatic 11, cognitive 12): scoreTone has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/format.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eb27a64dba8b16806cb6ca5a04b4d2cb3922854b022da95d13a7559a58a9ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseStatusLog (cyclomatic 11, cognitive 12): parseStatusLog has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/pipeline-sankey.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2955e98ec464eb793d7b0128e0248ce85e525938ed5f6e67d01dbb9e76924011"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeWorkableJob (cyclomatic 11, cognitive 11): normalizeWorkableJob has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0cf1e6cfce1eca992af4cdd3b20bb99e528f2ef5f1fa0318664c960f7dcbae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCandidate (cyclomatic 11, cognitive 11): parseCandidate has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"learn.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8157dcb946788a85341a3a641ba448121ee2597d4d6ed7ed6d463f7f2503b5a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tableDataRows (cyclomatic 11, cognitive 11): tableDataRows has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/story-bank.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"821df6d77ad829ad5411d02a9d1b081225bc594953f2ca4e00d341cbce59aa2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 11, cognitive 11): add has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"panelist-roles.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"294d09b3ee4008f3500b322f40369b19b2bc683a96c3af1689b6539a870fb488"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractLocation (cyclomatic 11, cognitive 11): extractLocation has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"830ef08f7d52a82b3a3bacbe18b78ca8f9e151bc8e1bdd2d925c11ff668c3ad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseJazzHRDetail (cyclomatic 11, cognitive 11): parseJazzHRDetail has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jazzhr.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"071552e86915ba9ae6a52a1065f260c54cdbecb7c11436d048ffd3c3b8521fa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 11, cognitive 11): report has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test-all.mjs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdfbb67fd7b489f965a96c07506ade3c79637d94d7e9fa9595107ce3bdd64bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveAllowedExecutable (cyclomatic 11, cognitive 11): resolveAllowedExecutable has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/helpers.mjs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7975b1e769a3b031b6dd44ae18deff1506a78db07779ca521c8a6fd05362f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readLockedSections (cyclomatic 11, cognitive 11): readLockedSections has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"theme-style.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0799057a35571c7f2f3b9b02371b8647758d1f947ee1be7c4e70364648ae3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeUrl (cyclomatic 11, cognitive 11): normalizeUrl has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d58e24e38d45473593fbfc4dbaec63d9734c31e601bb8d622f88a461e76c48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 11, cognitive 11): POST has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/inbox/skip/route.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e619883774315bcb98fcf24835ed07d049bcdb1086b72374a0916abdbf0d6afd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rememberFact (cyclomatic 11, cognitive 11): rememberFact has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/career-ops.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"726d5d08fb6932b15009d48ff45a2f31d51276c9c41d2d4f317e5d0a142a2f14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeUrl (cyclomatic 11, cognitive 11): normalizeUrl has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/url-key.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d5606ddcd95d714466b26620d79a99e6f57925cef8dc918b0d9b1858dc75bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prefetchJd (cyclomatic 11, cognitive 11): prefetchJd has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/jd-prefetch.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d70646b311ccc8527cd08c7dc04cae3d96f6ebc2d19f0c0b323cf4c15d1a5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCliId (cyclomatic 11, cognitive 11): resolveCliId has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/saved-cli.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51e1660d4d338d6c8b62a0b6644ca35e2caea85c2ea10771d85fee5a7ba3ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceHeldSave (cyclomatic 11, cognitive 11): reduceHeldSave has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/status-save-hold.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b5b801f60b94583c3770cfdeec4421ebaa68ab2e50acb27068f255f563f09"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeZohoJob (cyclomatic 11, cognitive 10): normalizeZohoJob has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf180032638b7fc3b1f8137e8507b6007fa5d5ee10df419f4c3f981cd1073fbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function siteVerdict (cyclomatic 11, cognitive 10): siteVerdict has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"coverage-check.mjs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d3be8bd0f4f14c5ece1e46e6221ae872740bbe47695879a081c2d5260d1482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reportRecord (cyclomatic 11, cognitive 10): reportRecord has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evaluation-cache.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c514034621c259593d066cd4c5b0578d9271c46ba65beb2ef7241faab1b8af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderNamedActivity (cyclomatic 11, cognitive 10): renderNamedActivity has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64e10248d00af057c2c2051372cbc2a435ae4f0cd944ae72b4d029ce4cc3107"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hiddenRepoFailure (cyclomatic 11, cognitive 10): hiddenRepoFailure has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"github-evidence.mjs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bd75d2654961128960ea12d31961b1b67b53278178b1202ceaca0e8023901c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchInvite (cyclomatic 11, cognitive 10): matchInvite has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"invite-match.mjs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa7034366cd335a2584a27f924d082f5e283dee9e35d41e7473f18c4729286"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function headingKind (cyclomatic 11, cognitive 10): headingKind has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jd-years.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d20e61918224afe1dc8afa576814a1bdc4775ab4ecef463ede8d94fde18ec0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runKeywordMatch (cyclomatic 11, cognitive 10): runKeywordMatch has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"keyword-match.mjs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c2c6d1328f72e3dccc5a525329a86d45715522dca798f988f2218ddcca7ad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postingNamesOtherJob (cyclomatic 11, cognitive 10): postingNamesOtherJob has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"565b32c4a630aafbe6505fff8958b1d66666bf36aadeb27b3430b51cd4d36339"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inspectPage (cyclomatic 11, cognitive 10): inspectPage has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf3e3f5eb1289e677b5c25c4a1c87de0258edbb2cdcf29893852f50145be8d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBase (cyclomatic 11, cognitive 10): resolveBase has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/h1b-sponsor/lib/api.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b053d5965dfed4ab5c3d0097119b78f484eb3d94c195d5b6790c561aa6c559"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 11, cognitive 10): fetch has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/apple.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"03be36a97f6dd3061d5d7c3d7b4ec4bf2026d819c698fda8ced2b96ba78e1938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveTenant (cyclomatic 11, cognitive 10): resolveTenant has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/inrecruiting.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19b15d1f4bf27c1f45c79c0b37606180ffe972249cdecbb16834de44d88755c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function locationValueScore (cyclomatic 11, cognitive 10): locationValueScore has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workday.mjs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a903c3178550843bca69af9179e89b5c7d9826fcdc17cf916580a9a9ab562bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeRecord (cyclomatic 11, cognitive 10): normalizeRecord has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/zoho-recruit.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3063eb144be91eefbde0acb1ce87903758272d48e7dd3b40a3c4adc22b8d1e53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeSearchEntry (cyclomatic 11, cognitive 10): normalizeSearchEntry has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan-topdev.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca330c40648917cc7601d00d549b15ededaee881a86fa2f18d004b0abab82b7f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fixture (cyclomatic 11, cognitive 10): fixture has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/evaluator-stream-integrity.test.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee02df84f52ba0ab17b2a47dc1dc0df9957c076c614026e8364f0144724182b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function topLevelArgs (cyclomatic 11, cognitive 10): topLevelArgs has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/local-today-gates.test.mjs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40c077a8434fa7397c01cf755c3a46d100d23cbdc98b45d5065e39e81326d96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 11, cognitive 10): value has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/render-lint-tag-grammar.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ccf68c0e3a0f1c9bb6833e72c49fadacc7836108bc1f8db2bfc4533f403ed4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 10): main has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"validate-portals.mjs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dbbb69374f5c477135ad3e780ce25dc90acde88610e2ef6bea785bb36af613"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function patchToProfile (cyclomatic 11, cognitive 10): patchToProfile has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/profile/route.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ba40007265563ee0f54c0f799f391d69599f1b571491e81ed63248f3411f22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply-view.tsx"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8699c7fa586e59927f205da1164a99ac9ae3c40bb3660c0effac943f7b16d3bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Studio (cyclomatic 11, cognitive 10): Studio has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/cv-studio/cv-studio.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9298e613226d123e11aa5ce1cfb49c61bc987827bb9c2c4feb996c3bf8f9a95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SourceChip (cyclomatic 11, cognitive 10): SourceChip has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/explore/discovering-state.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"715d4bd247721e83e128d1941e31cfd215aefe940cdedff11d2536481e2fc426"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CadenceSettings (cyclomatic 11, cognitive 10): CadenceSettings has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/followups/cadence-settings.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfb23ede6534453968ffbe231d5d70f9580f9a3b4c1ede27ff5bbd682c7ca53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function editorStatus (cyclomatic 11, cognitive 10): editorStatus has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/cv-editor-state.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1c854d05a91ef1393e5ed3092672bfc5a4fa050646282e7bc2784492743982"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postingUrl (cyclomatic 11, cognitive 10): postingUrl has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/posting-url.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"736ad1c06e5c03788ae5ac41c352e9c03bf22f4062ae02182b4a156491b59e90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function skip (cyclomatic 11, cognitive 10): skip has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/helpers/report-print-pdf.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a4fb06f5e894e94297a21e4842dd66c4392772999f753c9aa85b6ad943ba04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidateFromItem (cyclomatic 11, cognitive 9): candidateFromItem has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"company-funded.mjs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6133e8e17317f0eb881507bbf2bd764349aaad1f0cd859b2be91c525e61e14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonical (cyclomatic 11, cognitive 9): canonical has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/profile-cv-selection.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf7d006fbdd6d3abdd1ccf42a5a97ac0da288a18f8a28b2e9ebcce717b02462"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHnComment (cyclomatic 11, cognitive 9): parseHnComment has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hackernews.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ee2d7de449641fcdf9f3bc22687ab3b62fd243432bb18884c10a4682d82d14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/jibeapply.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bed0855acfaee64ba859b2b1fd83503b618b4a1bf1a25305c9ef389b126808"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkAggregatorRepost (cyclomatic 11, cognitive 9): checkAggregatorRepost has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":4153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a52fafa81b2552b9c90cb9b0c125aa8a00d70a52f7a4b2ba293cf2746122eb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runGeminiEval (cyclomatic 11, cognitive 9): runGeminiEval has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/output-language.test.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c263426b4ac2c6f6b5b5e945a0f6ce53fcdb2d7055cac60e9291cc277f6a844a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localPathsLeg (cyclomatic 11, cognitive 9): localPathsLeg has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"upgrade-tests.mjs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d61e2ad9e1415fda1f976e8c09134a10366185d9fb699ed3124794edcb02e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function relatePostingLanguageKeys (cyclomatic 11, cognitive 9): relatePostingLanguageKeys has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fffd86b67b27056fcd3ba2b82ad200ab9883ab93b38995f1405aec0753449d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canonicalizeLocation (cyclomatic 11, cognitive 9): canonicalizeLocation has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/analytics-metrics.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c7a0d498a32f4d0895670fa06c54c9e36a4ecfb5ddddd0f50c2557ff8569ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postingUrlRelation (cyclomatic 11, cognitive 9): postingUrlRelation has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/core/url-key.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e2585fc380dc7721aab9dcfecebca9a245068c752a25aba1b46f262fe0bfc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toOffer (cyclomatic 11, cognitive 9): toOffer has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/explore-ai.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8267ee2ce126f139c7443a56d75bd41361508052977486343fd8cb4fe69ec3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function yamlScalar (cyclomatic 11, cognitive 9): yamlScalar has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report-persist.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22c4a48783f0234334ffbcb0bf2d30e2898ca649dd35a34d0a6863c13f54290"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collect (cyclomatic 11, cognitive 9): collect has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/report/report.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1872cb400ca1ecec5310a9097294e32b265ce6f2d4f45ca21b471b6586c673e"}},{"ruleId":"R3","level":"warning","message":{"text":"update-system.mjs: 5860 lines of code: update-system.mjs has 5860 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":"dd15f7eab86a7fe4b1c36f0d5e646a7d4ae861e977bd3ab5ce237bd7f734fc11"}},{"ruleId":"R3","level":"warning","message":{"text":"scan.mjs: 5707 lines of code: scan.mjs has 5707 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":"94ff572e7951b3a1f8f2f31633dd40bd09f0ed7b4520b45edb4166de6105abd8"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-cv-facts.mjs: 4208 lines of code: verify-cv-facts.mjs has 4208 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":"a3a19f8e3b596874f270e7b060c2f3dd66bfb11c6d013d787eb5843a367f9b98"}},{"ruleId":"R3","level":"warning","message":{"text":"generate-pdf.mjs: 2652 lines of code: generate-pdf.mjs has 2652 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":"bc5fc75195b7fbc435ca7df0f35db4af052ee94b22bfe658410883e18238e1fa"}},{"ruleId":"R3","level":"warning","message":{"text":"scan-ats-full.mjs: 2502 lines of code: scan-ats-full.mjs has 2502 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":"d951f66a5edce8017fea4e81d596fb1444f8b7817958430419352ee6aa7ac2fc"}},{"ruleId":"R3","level":"warning","message":{"text":"merge-tracker.mjs: 2429 lines of code: merge-tracker.mjs has 2429 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":"9656915cdca3233ae8e83eb4e39c7246c265c1c65dcb1b27e4c3e50057dfffa7"}},{"ruleId":"R3","level":"warning","message":{"text":"analyze-patterns.mjs: 1906 lines of code: analyze-patterns.mjs has 1906 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":"5d7c17e0495cae2ee25707a5bebdf9591744091a4035c23fa58f7736f9cfc307"}},{"ruleId":"R3","level":"warning","message":{"text":"doctor.mjs: 1890 lines of code: doctor.mjs has 1890 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":"36ea612897cb61ea6cf05dd54868bb0b9273435729aa1e50417504fc09466f1a"}},{"ruleId":"R3","level":"warning","message":{"text":"salary-gap.mjs: 1651 lines of code: salary-gap.mjs has 1651 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":"99f26ecd4b90d0b11f6d2f6385c381d6e2b97c497fb41d213ea0ee8c2724496f"}},{"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":"build-cv-html.mjs: 1516 lines of code: build-cv-html.mjs has 1516 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":"cee173448cd2ca841c9c8934799b6b4485f9079e2c85a347d08eeb4b0a9813ce"}},{"ruleId":"R3","level":"warning","message":{"text":"cv-templates.mjs: 1492 lines of code: cv-templates.mjs has 1492 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":"bb1ba04fc29eea33b95d54afa2e1260c4b0417602b83fdbb8798c06d6d0c28c8"}},{"ruleId":"R3","level":"warning","message":{"text":"sponsor-check.mjs: 1436 lines of code: sponsor-check.mjs has 1436 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":"sponsor-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3728b1f4f625fd3ccdfa4e6e63df316c952f7328a823095bfbe8f80e8cd29975"}},{"ruleId":"R3","level":"warning","message":{"text":"browser-extract.mjs: 1374 lines of code: browser-extract.mjs has 1374 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":"1236113bc09bad423bb4fc145f76d3cab13b7bac29b2c208087548576abed474"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker.mjs: 1365 lines of code: tracker.mjs has 1365 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":"d66ca653d610fcc57bf81ef5447220cfea9ba7b00b0a7c32309cd60365b6a47c"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-ats.mjs: 1335 lines of code: verify-ats.mjs has 1335 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":"008f2cab15bbbcbee5e18f0a69a5f920e66d86d75a95ba0709c3b39e4d5cc864"}},{"ruleId":"R3","level":"warning","message":{"text":"github-evidence.mjs: 1332 lines of code: github-evidence.mjs has 1332 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":"db25ac0b3f87195c7ebd5bf96729f281185599f2ae969840622a9a064aaece78"}},{"ruleId":"R3","level":"warning","message":{"text":"harvest-buildlist.mjs: 1308 lines of code: harvest-buildlist.mjs has 1308 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":"harvest-buildlist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3c028ecc138209b57a5121f7ddad6b7207b54d10ff066d3c0de059434a000e"}},{"ruleId":"R3","level":"warning","message":{"text":"jd-skill-gap.mjs: 1297 lines of code: jd-skill-gap.mjs has 1297 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":"d770375463742d4a6617f70e2bacd38a2e690406d02419353fd29296d1862327"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-portals.mjs: 1277 lines of code: verify-portals.mjs has 1277 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":"3b41ba66840ab30a2e8247e8c14cc537cde770b6cd86c4ffa45b4529bddc5012"}},{"ruleId":"R3","level":"warning","message":{"text":"openrouter-runner.mjs: 1271 lines of code: openrouter-runner.mjs has 1271 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":"b68c927584a9503a13b4b8e6a60bec426a7e095486ee0e3c1a11acd3cf316777"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/workday.mjs: 1242 lines of code: providers/workday.mjs has 1242 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":"4cb7a67be4330f9a69d4f6d76d0a06d6a3a6cb304bff4067c24a1bbdd31b2ea4"}},{"ruleId":"R3","level":"warning","message":{"text":"liveness-api.mjs: 1224 lines of code: liveness-api.mjs has 1224 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":"d05fa358acbeebb71b8684864e6637de61fdb031ceaa7236f714ab711e7cda57"}},{"ruleId":"R3","level":"warning","message":{"text":"discover-ats.mjs: 1223 lines of code: discover-ats.mjs has 1223 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":"21a0a4d3709ba92db3984cd705e4bdb18da13c00925142af498742ce88d9a0f4"}},{"ruleId":"R3","level":"warning","message":{"text":"invite-match.mjs: 1218 lines of code: invite-match.mjs has 1218 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":"4689ba9fb3455675d377fe8dc4cb979a97bd061feff5d05055e39ecef70da283"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/pipeline-view.tsx: 1188 lines of code: web/src/components/pipeline-view.tsx 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":"web/src/components/pipeline-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23470d85a64627fa2d656333dd4a82a0485f2f3aae9391f65bd970b5d571a232"}},{"ruleId":"R3","level":"warning","message":{"text":"check-jd-archive.mjs: 1182 lines of code: check-jd-archive.mjs has 1182 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":"f934467c7e5a08a71edb253ae007547802a44b67ed61a64d6dc9190ecde11fc5"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-utils.mjs: 1126 lines of code: tracker-utils.mjs has 1126 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":"48e589dc74133c539a87d4f7d2151ca36beeb872007125c3ae9210781bd5d55f"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/assistant-console.tsx: 1094 lines of code: web/src/components/assistant-console.tsx has 1094 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":"f2df148a371ca97436ee624834f53a4f47b6e06e914836c40311592a287afbcf"}},{"ruleId":"R3","level":"warning","message":{"text":"seeds/employers-validate.mjs: 1074 lines of code: seeds/employers-validate.mjs has 1074 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":"seeds/employers-validate.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6ebba9969f2d5ccc077a0daac2b9a419ca99b48f20a3eb598cb17fdcc78819"}},{"ruleId":"R3","level":"warning","message":{"text":"followup-cadence.mjs: 1061 lines of code: followup-cadence.mjs has 1061 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":"80bcfd103bdc059f2881234c53a09b158b703b932b4c7a9f88113d70b39320ed"}},{"ruleId":"R3","level":"warning","message":{"text":"set-status.mjs: 1027 lines of code: set-status.mjs has 1027 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":"e46672ec7f5573f7d2fbba6babb80489bb35859d0702885d24c44f90364749f2"}},{"ruleId":"R3","level":"warning","message":{"text":"detect-reposts.mjs: 999 lines of code: detect-reposts.mjs has 999 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":"504db5dce01cb7432f77b23ee0ad80ce22814c2787e292ced93c71372c693b2b"}},{"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: 941 lines of code: upskill.mjs has 941 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":"136aeb8a38923716691ace49de6843fd8b21cc7f62624636ab0e8be61a5d837c"}},{"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":"keyword-match.mjs: 900 lines of code: keyword-match.mjs has 900 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":"097fad58f0be1f120e00bf633baad48f3067796ba857324ffe06a664605c72ff"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/_http.mjs: 881 lines of code: providers/_http.mjs has 881 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":"c867941ef10cc36a2107bff86e1cde0e5c133ef46e9f395a0aa09e614a97bf4a"}},{"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":"liveness-browser.mjs: 871 lines of code: liveness-browser.mjs has 871 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":"ecce628dda584bed72b9fef756cad463a0f3503d9fae80eb1512cda50a5131e1"}},{"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":"upgrade-tests.mjs: 837 lines of code: upgrade-tests.mjs has 837 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":"327942ad77e03577f8347076fe766e3bce1acd0c3b1a92c371ebe06847e00ac1"}},{"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":"plugins/_engine.mjs: 830 lines of code: plugins/_engine.mjs has 830 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":"a528db0bfa4edad7b6e214638c27135da102743da87e4d438d693802a650b896"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-parse.mjs: 819 lines of code: tracker-parse.mjs has 819 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":"72450a4c74d48c6fe0dd819fbe2ddeea97493ce6feb0f0f228ba01e411442ddb"}},{"ruleId":"R3","level":"warning","message":{"text":"verify-pipeline.mjs: 817 lines of code: verify-pipeline.mjs has 817 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":"cdcf151e2ac2f9629d8c59460a37233ad14f8a5dd991ec43fa3a24f6f0da64a8"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/privacy-guard.mjs: 805 lines of code: lib/privacy-guard.mjs has 805 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/privacy-guard.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea56bf4fd899266218ad906327c2d1efde88acc8a801f720e6fbe05f8ed91df2"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/career-ops.ts: 795 lines of code: web/src/lib/career-ops.ts has 795 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":"e069f96ef19104394eb13b6a62b7f1fa0ff6b178074baf4b88b7f4d583c7b502"}},{"ruleId":"R3","level":"warning","message":{"text":"stats.mjs: 762 lines of code: stats.mjs has 762 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":"02631e5e07df817f4bd7bd40a6615b22f500ff56c75e7a221746d15a3ae888d4"}},{"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":"intake.mjs: 736 lines of code: intake.mjs has 736 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":"fcd34764d227be33e7ac50d596600b3bb61044e03e6ef0f9824e3c621efec46e"}},{"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":"web/src/app/api/run/route.ts: 723 lines of code: web/src/app/api/run/route.ts has 723 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":"07263b5a20e221a3dd0def4a6726299c4aa5303e6b037f9744dcd087724dd46d"}},{"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":"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":"reply-matcher.mjs: 711 lines of code: reply-matcher.mjs has 711 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":"aa85c1a94149c3c71c22f0c70a136d717bc49ffce33caa23062f1cfbd72c6c0f"}},{"ruleId":"R3","level":"warning","message":{"text":"scan-dayforce.mjs: 711 lines of code: scan-dayforce.mjs has 711 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":"6718b156c437be1638f1b753315c4cbb8c1496a503ff2af92c3a3466f1fe1808"}},{"ruleId":"R3","level":"warning","message":{"text":"jd-years.mjs: 705 lines of code: jd-years.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":"jd-years.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e25c6fcc202c396ce040ead31eebb078b997d16d2f5e5e8faa6f07eeeaadfb3"}},{"ruleId":"R3","level":"warning","message":{"text":"tracker-sync-check.mjs: 704 lines of code: tracker-sync-check.mjs has 704 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":"4cd1450efe376a31a8bd5cd06a6e3ff501a49002ea800aa7bd7c1c571aff0bec"}},{"ruleId":"R3","level":"warning","message":{"text":"generate-cover-letter.mjs: 703 lines of code: generate-cover-letter.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":"generate-cover-letter.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd2760c9f4903b8cfa662582942136ad2b5e5fc8905593b6c081bb7dded63ce"}},{"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":"dedup-tracker.mjs: 699 lines of code: dedup-tracker.mjs has 699 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":"dcba8a15b512c77c4cd06e6f2b9c4ace2265d43be78b01a222148ead2f278173"}},{"ruleId":"R3","level":"warning","message":{"text":"backup.mjs: 694 lines of code: backup.mjs has 694 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":"backup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d871783479e8cdd3cb0eff6d4b33b3ae9c71d07be7ca2fa403fc9d9a5638c19"}},{"ruleId":"R3","level":"warning","message":{"text":"validate-portals.mjs: 693 lines of code: validate-portals.mjs has 693 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":"3d7ba69fd56ac7d224824081833e97e9a10f4fb8cef253343bda328f50d8a6ab"}},{"ruleId":"R3","level":"warning","message":{"text":"plugins.mjs: 685 lines of code: plugins.mjs has 685 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":"49fd64c156099467617eef2f4c9e6858416c9cbcf0c0823d64a6e26566177f08"}},{"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":"weekly-digest.mjs: 672 lines of code: weekly-digest.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":"weekly-digest.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe7a72ae9e950329c4b5e84c68a4c2c926a08204a98339199f496bfa432068b"}},{"ruleId":"R3","level":"warning","message":{"text":"outcome.mjs: 649 lines of code: outcome.mjs has 649 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":"06bd5910565f65cc46c236909e74734e5d0ede0d356b47d1a1f195c62fa3e038"}},{"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: 647 lines of code: web/src/components/explore/explore-provider.tsx 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":"web/src/components/explore/explore-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f332b035151a3a7e303c37af877331752c932f70bb33aaa31405efe21a4af5"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/telegram-channel.mjs: 645 lines of code: providers/telegram-channel.mjs has 645 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":"f443aaab3a288a33d90f800e0bc6ba60faa55ecb1b58b066c5edb45c5e26a93e"}},{"ruleId":"R3","level":"warning","message":{"text":"openai-eval.mjs: 643 lines of code: openai-eval.mjs has 643 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":"ffaca0a8bf2183b00c1c9d245dec2aa753153562319232a063109034a63bff91"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/apply/session.ts: 643 lines of code: web/src/lib/apply/session.ts has 643 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":"41bcd96ba20fb9ecc0afff815f21fda2b975b2e9e3caaf9772bc0a230561fb7c"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/workable.mjs: 640 lines of code: providers/workable.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":"providers/workable.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21ab385bdcdf49e39f1eaa8752da8baa82b44d1a4af583317d18d070e242d93"}},{"ruleId":"R3","level":"warning","message":{"text":"liveness-core.mjs: 638 lines of code: liveness-core.mjs has 638 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":"ae87d0bf68afe8a37656d7a2366c26c287cf733e4ae0499ee8ba7c21b6decd2e"}},{"ruleId":"R3","level":"warning","message":{"text":"gemini-eval.mjs: 634 lines of code: gemini-eval.mjs has 634 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":"e9b92d80d8d3f527317c7da91d38cca2641808e9d6a8d5338b4e7b15058a0c29"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/apply-view.tsx: 634 lines of code: web/src/components/apply-view.tsx has 634 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":"3bbe2ea7e7853f599376087e95cac40c3bc0a77d4fae522d20a310dadf979abb"}},{"ruleId":"R3","level":"warning","message":{"text":"ics-interview.mjs: 626 lines of code: ics-interview.mjs has 626 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":"981ea9a49dbfd6465a1cfa7200beea72f7172199fa6d2bb6ae11a1ccbaa22763"}},{"ruleId":"R3","level":"warning","message":{"text":"rank-pipeline.mjs: 615 lines of code: rank-pipeline.mjs has 615 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":"4a438cc04d6867684ad5dfaa38638e4c5ac6df084a10beac51869905bd825e36"}},{"ruleId":"R3","level":"warning","message":{"text":"batch-evaluate-gemini.mjs: 607 lines of code: batch-evaluate-gemini.mjs has 607 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":"103ae7474085c74a5fa0af56ce9b04e0d9aee98b4d79b5abf4223b125a67cc88"}},{"ruleId":"R3","level":"warning","message":{"text":"scan-topdev.mjs: 601 lines of code: scan-topdev.mjs has 601 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-topdev.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8cbfc7b3110c916b5a91aaf5ccb238c6ae0077efe7455ebdd48c48bf4f1b58"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/ashby.mjs: 592 lines of code: providers/ashby.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":"providers/ashby.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bba664b191a27f704ee211a86230836e4cb532b275609bb3610614e21cf1071"}},{"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":"build-cv-latex.mjs: 570 lines of code: build-cv-latex.mjs has 570 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":"c20c4ae3e6216c4c804398072ef5e89b7ec1606c78086b08b24aad1b4ff305d9"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/successfactors.mjs: 569 lines of code: providers/successfactors.mjs has 569 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":"9485cf58565656f97ee69fcadb932767a1c652f771c760a3b5c3fb6e569f8a20"}},{"ruleId":"R3","level":"warning","message":{"text":"url-key.mjs: 567 lines of code: url-key.mjs has 567 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":"68d5bdecf6d7509927820fccaa6240309f7684aac13192a2cd003c14907d4133"}},{"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":"closing-soon.mjs: 542 lines of code: closing-soon.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":"closing-soon.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1203be55dbafc22d461233fd25f34af2e47174b7b7252af75da2fd494bf82fb1"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/components/followups/followups-view.tsx: 526 lines of code: web/src/components/followups/followups-view.tsx has 526 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":"66bd93052f026bf0f3bda26d577e33bd9ef58d048ed4d8bc8e0d8b7e6296f012"}},{"ruleId":"R3","level":"warning","message":{"text":"audit-portals.mjs: 522 lines of code: audit-portals.mjs has 522 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":"c888a73ffed2fe2fd11ef53581f8dbe4d5f34389f18add3178a7b51f1946ad83"}},{"ruleId":"R3","level":"warning","message":{"text":"robots-check.mjs: 522 lines of code: robots-check.mjs has 522 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":"robots-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbc87473bf48b4c85a4329fd6f9965bdb4e181c64c07f2aeb91242af9c1db60"}},{"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":"ollama-eval.mjs: 507 lines of code: ollama-eval.mjs has 507 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":"9171b69da52ab01a5aa0b9ad65cbcd541df27db6ef6d4bc634edc1be6234c6d8"}},{"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":"archive-posting.mjs: 498 lines of code: archive-posting.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":"archive-posting.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba30c3784c59a3bf920493754a361630fd37eb7d2e4bb0dfd2e8cbf016a43f5c"}},{"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":"web/src/components/inbox/inbox-triage.tsx: 495 lines of code: web/src/components/inbox/inbox-triage.tsx 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":"web/src/components/inbox/inbox-triage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad15ccd8ed8eebb30ec3c6384b99a77dcb95a9fb751ff7425f25bf627c784a92"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/jd-page-fetch.mjs: 493 lines of code: lib/jd-page-fetch.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":"lib/jd-page-fetch.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8346b8fcb793c340881d3ee7ff6964f10cfefe33829ec4428776e6665d6548f"}},{"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":"seeds/vc-portfolios.mjs: 482 lines of code: seeds/vc-portfolios.mjs 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":"seeds/vc-portfolios.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09771e32adc2b46b88124f6bd94353a66c908d5cfa99f00c67275733f69b87e7"}},{"ruleId":"R3","level":"warning","message":{"text":"contacts.mjs: 481 lines of code: contacts.mjs has 481 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":"09c4cbb1e047386f78dd3cc7a3e71198c48679e2c1d691c056f2bfe6559f73da"}},{"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":"providers/adp-workforcenow.mjs: 462 lines of code: providers/adp-workforcenow.mjs has 462 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":"ca8e3e320df775c10448e68d0f06e81d08f12cb40ecdba9030dad272f38b21bd"}},{"ruleId":"R3","level":"warning","message":{"text":"reserve-report-num.mjs: 462 lines of code: reserve-report-num.mjs has 462 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":"d64516e641b9151fa9ce3a9747a89c15dec81f0b1991bde5a5e0c05cdeb97a7f"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/sitemap.mjs: 461 lines of code: providers/sitemap.mjs has 461 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/sitemap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26f228a01684edfe1e2a2b7bbc1c9234346f3cea7dc472dda7a3100d0cd58e5"}},{"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":"web/src/components/cv/cv-ingest.tsx: 459 lines of code: web/src/components/cv/cv-ingest.tsx 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":"web/src/components/cv/cv-ingest.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d6ad29d37db89d82ada19b4ba4eb643702f118876813a7d4fd2f4256f530d2"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/run-cli-support.mjs: 456 lines of code: web/src/lib/run-cli-support.mjs has 456 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":"fafa26bf36d41b2acf311e2b4488445fce6b14739ce96ae0fd2d54ee54f4acc3"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/gupy.mjs: 453 lines of code: providers/gupy.mjs has 453 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":"073cc8a3f51004f3b0efbf60a697714ee0ce1766b80ee1829ed16ddf9b3cbd86"}},{"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":"web/src/lib/apply-checklist.mjs: 450 lines of code: web/src/lib/apply-checklist.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":"web/src/lib/apply-checklist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a5454a6029edeb21716319697f911c52951e9dab605f72a4708ba4955b1a64"}},{"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":"web/src/components/apply/apply-provider.tsx: 444 lines of code: web/src/components/apply/apply-provider.tsx 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":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa3ee749c84b1d1b4b5e99df47d5fc8f4d1683656b7a6af8fbb7e59cbec014c"}},{"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":"providers/talentlink.mjs: 438 lines of code: providers/talentlink.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":"providers/talentlink.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b7013178c10c15c0f4cc0b2b9585ba5c5bd9ae497b1d12896619823d396c2c"}},{"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/jobvite.mjs: 432 lines of code: providers/jobvite.mjs has 432 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":"f509e3570bd2506c31b4fb5aceb4a855a05594edf469c30133563216c6dc9a4b"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/cv-studio/studio.mjs: 430 lines of code: web/src/lib/cv-studio/studio.mjs has 430 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/cv-studio/studio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dbf189b28d154980f987f92b103ec83e156819e6c9e0c7c95dec977dcbae3e"}},{"ruleId":"R3","level":"warning","message":{"text":"check-liveness.mjs: 428 lines of code: check-liveness.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":"check-liveness.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae78fc3f437cad48dbbc367cfc41367017cd1cca3f0a79db86db46427e53891"}},{"ruleId":"R3","level":"warning","message":{"text":"seeds/employers-import.mjs: 427 lines of code: seeds/employers-import.mjs has 427 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":"seeds/employers-import.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67f0a49d956f47b89295b2c4224885ec822eb03435529f2266f6967389f50bc"}},{"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":"hired-share.mjs: 423 lines of code: hired-share.mjs has 423 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":"hired-share.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79de5ff0f1565e315e4dd30b7dc46ef869ce8881a150939762ebf13817278bab"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/pdf-server.mjs: 423 lines of code: lib/pdf-server.mjs has 423 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/pdf-server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67d894657b78df879d208a61efe67272c1082a2efe05f3ef56ede661597e576"}},{"ruleId":"R3","level":"warning","message":{"text":"providers/_country.mjs: 422 lines of code: providers/_country.mjs has 422 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/_country.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c2ac8f12c19a6955cc80b5471d5d8cef049d0a704abf195cf09f2237a063f2"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/lib/core/scan.ts: 418 lines of code: web/src/lib/core/scan.ts has 418 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":"b8af1c57bcb90dcca1f864e42b6d036e7e3404e8c537ae7211c530eb0ca0f863"}},{"ruleId":"R3","level":"warning","message":{"text":"reply-watch.mjs: 412 lines of code: reply-watch.mjs has 412 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-watch.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e5293576689969dc5ef71fc1b928b45293fbb8a9510ff50d139a5623fd1c86"}},{"ruleId":"R3","level":"warning","message":{"text":"generate-latex.mjs: 408 lines of code: generate-latex.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":"generate-latex.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8942c9f8ce1c221ea2a22eb9a9f1478ea1ec0927f7f6ea1beae38d21b249d880"}},{"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: 403 lines of code: web/src/components/explore/explorer-view.tsx has 403 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":"c45602492e95ac1af4fcc79988bb6ed832bc6e7706054ae8c44fedf6d7bc93ec"}},{"ruleId":"R3","level":"warning","message":{"text":"lib/eval-evidence.mjs: 402 lines of code: lib/eval-evidence.mjs 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":"lib/eval-evidence.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a1b4b380df227ba359de42688315a8b7b04f8415c72f29bd51d3bb4fd24ab9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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":"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":"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":"backup.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cf97f5dbd8fd89499fe1913d296af788440887569523a336d0c3fe79c6e231"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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":"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":"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":"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":"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":"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/sitemap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93938aa258e52f4ecca05d1db6b870d5cc75938b981bcd9a5294136c01c3db71"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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":"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":"import-tracker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36a5f57489631ee23447aace420c5be436276982b423759ffd012e775864e28"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"providers/rexx.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"782b1404a2ae72937baa2326e4ba84c93be88a5bce3219cb91e3e5b8d5295855"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"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":"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":"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":"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":"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":"providers/tes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27138f316c0f97e122668d1ed9328146157a62795b4a0f900aed8b2b6d36b005"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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-myjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2363ae41064706822e3dc174ce460e1c257206bb922da4dd4291964fd1434"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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/_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/applicantpro.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74fcd0b9963bb0b7b9d3ac88dcbd683ba8e51813c2ee94164b36372c3afe1de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/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/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":"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/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":"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/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/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":"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/turbohire.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bae15802816e7d99cad5452bf1346a38f8422521194709e1181d1fc697b0fe7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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/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":"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/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/deel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d27487ef2ef08cd2c899005025e1d14dd93898a0b166d50fda95f17adac33"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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":"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/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/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/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/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/polymer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc613d021d7aec4462dd600927bd2ac443993e02f3d7e9238244ddceb98c18"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/trakstar.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be4aaebda8491ad13b138fef5adf5ac7e1299c988ad140125c8ab425cfe1eb5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/germantechjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed3a46c9bf0452f9991c48770403a05fe60c6ed8bd50779c82fdab2a3fa29c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/darwinbox.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7067ef7d6fcac40937b4d2c21a3709756750f7e436b6a61b8f87cb8074e0c77c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"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/bulldogjob.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"101068d482194f01fc17ff9986229ea02a23574690d0cc50e63e96477759019c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/factorial.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625ce6a043f7917cc023697f5e9fc580cf739664576b101e9b8d504dd0d9aca5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"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/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":"verify-tracker-url-match.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e5c629c7d79e594d4c5338395a01ec6c5d5a16915401ec9c3e5aeff7de759d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/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/keka.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a297da25e32c50d6da4ffd7f133e0d0eb6b7fb5bd78321758de206444986041"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"providers/remote-com.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86d456caac2c96c9f0a309251d76c3a68d32393e517fe5c4fc2c2b751dbb637"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"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/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":"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":"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":"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/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/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":"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":"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":"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":"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/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/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/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/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":"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":"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/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/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":"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":"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":"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":"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":"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":"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/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/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":"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":"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":"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":"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":"linkedin-import.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f894a1e868c401a74ab54edd816b10d9f4a842e7bae783cec23dab110e2b58d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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":"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/_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":"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":"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":"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/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":"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":"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/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/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":"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/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/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":"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/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/lib/core/aggregator-id.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f6dae04c4a1f47f42d2c725aa5de74a800b883d7042f501cb55d7bd9b2da61"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"web/src/app/api/templates/manage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9b857b87a6aa8e2a3a6acf21060f6eb3819cdcfe78591736b744600b6e5740"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/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/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/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/api/templates/file/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3e0cfe54d49efde74fdb553a28f122f6ff177401489b81b4d8a0e11caa635a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"linkedin-watch.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d811625f79c8e64023eaa8b0c492949a180bd42c27b27c0421c273de9610566b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/templates/default/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41094296f90d88fd4a60341249eecf53bd7fd8fa973ad60e80467c2b8ec10896"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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":"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/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":"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":"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/templates/preview/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89573259123e51b40b95dc74dc9b0fa25e4605797219aacceb210ae635e9d104"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/pipeline/[id]/not-found.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe98670e2b2a79e9e3284fbc224aafe3e00adb2b8bed3b461482b92a49c866e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/api/templates/rename/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6efb04dc3f6b1954e67d75b7edf3c37c09b6d9e2703561f975ed449f0a3020"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/jobs/[id]/not-found.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c13842c4c87a5f3417ac7b397c997677192a62b044363171aebda54fdcf915b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/_city-slug.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bc78d3460b7ee3acabce310da6fd9904b73104532a4f29b8776474d995da31"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/templates/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e91cd41fe9a4ac52fcf51b8f087f0c9c289be6ee96c680c6d753de9677ea5c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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/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/api/templates/delete/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80662ad6e872aa102e26718bc59ea4680839cf59186ea57b282b681c15aaf307"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"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/templates/duplicate/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"859977bf0e4d4a5ba79a5293a419a8327cb4d356042189823493ef06e78e64e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that 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/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":"R7","level":"warning","message":{"text":"Dead file (~945 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~665 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"322edda73c33f9f116cbb08c1161bbb6cbfa6b2b7004ec5a2a2b0f41a5d086e7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~528 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~499 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"ac03000699933d87ee9f24cb59091a34429afb54e0f844cb9f2533be5906983a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~489 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"bd23edba8f6610df74b7312dba0bf5d36cb537c9912428c44bca97e11a2fec01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~489 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/sitemap.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b6f1c9fb6d45791ae1c58f4953acd0724db5f465a0fc4e7eadc765617cca3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~464 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"2bb7def257b8efcbdaa4fc2224f81cd43d8cf003caca64f2601a09e9b18ab2eb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~446 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~417 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/rexx.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b75d38f76d7cb13f96a0c36e8d312d4c21a223f6116665c316d252096d63773"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~383 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"05851c7823ca4e5c44c5cb0321fe6bcc99019bb1384471391e33c55a7f425b68"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~366 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"13a280a3bd89607701c6f9f53be6cbf4be1dc48647c6a63063acff6dc42bd6a9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~358 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"75e9bd2f6581aaaf991ce855ffdd4224a65d064fee29387c58242ae0674a19e1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~353 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/tes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b6294a06ed69d491fd142f5fcf5bf67588cf987e3a2e4d73973de995bffb8b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~349 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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-myjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"037dc43a8b113dbefe9b4b7bf794bcef86713f496946eca936fc4a79608101b4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~343 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~328 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/applicantpro.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f107440cf041feb9d5373c9acfdd1d92b5499a037808d23b5dfa8810ee5797"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~326 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~321 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"34989753aca9ae6eed959d4a6879c9ef93a6fb39be68bfc773456ccd175e72e4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~314 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"c83f801d8e9eaa8302203c328b2e2282631e2c18f7f035875732a51d8b8fab85"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~307 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"cf0f603e31f54d3e29d76fdc5c39a5a60b9e6f8f5f4137ef99696e4cdc8a1a99"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~304 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~303 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"1d6fa40915fdf563cf210edf5b67e12f83770e6b4361c766d329c1313c7f9bc9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~300 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"6d52fe3b69267a2d0bf9f4c6d4bdea0e858c4b0029b164fa6060312f9dd17e61"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~299 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~296 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"cbde0ddb5f8e9522f051549b46d1d827792c7e69c34f24962cf9287b79ff17af"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~295 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~292 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/turbohire.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bec5de40bee0138692f106ec0eeab10a6c5458cd8ef403c74a7ebe092a61a8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~290 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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":"a014ddef29cd2edd7d2fbc779489f2f9a8850bf3aacb6ffe8b501986d8cb592f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~279 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~274 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/deel.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3d920163b49b96ac6cb832dfb58dc1addc36dbbd8d2730badc0a41d9e504fa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~273 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~260 LoC): no import path from any entry point (540 application, 185 tooling, 1660 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (providers/sitemap.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/eploy.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9de2cf9cb1194e4de2241eadaa5810bff98d375cca7882f3b85e285d984b54b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~252 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"843af63814a76fadb1d726f5ec06500360706e8d6787277fd12958cbe1195fe5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~250 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~242 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~241 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/polymer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d133b0424c828ad915f9dd3941e3d4f2068715983f03996194120210af57b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~238 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~236 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"483acbf03a295163abf242636b689a5185fc67a37fef826d80f4b0c23f47cc27"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~235 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/trakstar.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e8ca982f667825fb13c37e16a4d089b72cdc293b35714ed4d2976a4e2b999"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~234 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~232 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/germantechjobs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd66e6899252b1e519b1bd191f7f798c2f707bbe0c4d75d6bb99fbdccebf8c95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~231 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/darwinbox.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bcc6fea55c0970be33317abc8ff0b0d214f06567ae428767fb2cb112880fe3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~229 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"2bdb573a8c65e464a12efe48dcf52a5b69a90b93774ce1a345cdf3513798444a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~227 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"3c135d90f40c889e11893b8ff10ecc73a2f955c58d8c1cb1c34212cbb0332edf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~225 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/bulldogjob.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cc90e8e4c6e25bd86188c69170be90b39d442f6fcf376600704721fed0befa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~222 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~218 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"d5d93a34e6ffcc336a227ae99e7e8e9ea0d102de8bcbedfec1b838752563dbfd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~218 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/factorial.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a941281d29b964d4662379c0f857507a8852da6f5185574bb88649befa4aa667"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~216 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~213 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~212 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"8d0943f6df47f1d1dfc6e902ed3dcd593a8f41b7bee473755c771511b25f8e97"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~211 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~207 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"96e911dd6af8ca406a74357ed6aa265289ddaf1c5d64cc999a17137c565a9980"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~205 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~197 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~197 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/keka.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6cbcac7a61bc13f9b29a32435de09bd09e37f4d1c3b15124bb23dde475b40d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~196 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"c5f7834b4d0fa4d11fd9ea0b8b2e6b26e5146592ddf1e5c558f74a4dc2b72077"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~193 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~190 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/remote-com.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b312e79955c9ea493d34edb6e7e260ff950353f0a30deefb5815ee2e1eac5c2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~188 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~188 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"1f17248ef411288f62c67ebf064997f712fcb6de03c6ad1f120884c2d7596914"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~187 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~179 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~159 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"c471e1be3cb7821be3ee268a74dc84d35c6dac21b2df070390ffd95000c9002e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~158 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~154 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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":"1d3a71780e01ba04928d4d122590f0af186fc10100bc5cc6551ab41601bf6e34"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~146 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~142 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~142 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"a29c05637cfcebae495fbdceabbbc622456ab29fc0ea49d308e4aa71c48abce7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~140 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~135 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~113 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~104 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"67c4130e208647b0ffd64421a23b8bdada9d9dc0aa77a4abe0f2699c981ae315"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~103 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (540 application, 185 tooling, 1660 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 (~82 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"6f7818860814bc6fe461af3fe0308d84ead00736e7c1013a3b7d9b2772d75ddb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~72 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~72 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"22252be1961a0ddf5ab1da9f47698c68d5c960ba67b1d9d9fda03affebd164b9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~67 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"5dd887d90c573ed1abd16b863b4beadf526f17d62fb83a20d1b7d709babc5733"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~63 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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":"392596248773e7046ed84039ecea130ac984ee65389088768f9931a0020e200a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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 (~22 LoC): no import path from any entry point (540 application, 185 tooling, 1660 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/_template/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7345661e0dd79a33283536a54cec3d2ad765c4bf5e5e8df7ac7b5280aaf9c187"}},{"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 \u0027BANNED_PHRASES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-voice.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ff4b96166ade4d5591a392a615eb0feb8d99219f2d5e719beadc1ccba42c28"}},{"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":455}}}],"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/arbeitsagentur.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4635e275de45dfa792a1f2e9e5fb1e0781348e938dc40f0d762845f7ce6057"}},{"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/cryptocurrencyjobs.mjs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"04147b6a1c72afa17b91833caf9ed746f9da91e68d64f047f85cd3f15ca63fc8"}},{"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/jobicy.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce6c0100e7e883114c098d5094a7591abe2bead0298c60387d7544ead547b3c"}},{"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/startup-jobs.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98da6f61b9686f61377fb8ad5a969f0055d9af6b0f1bb7a47b8b2a0d35164fc"}},{"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":184}}}],"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":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73bbe1ca6478d3c68c8be654710f12949bcb151a260f6e1eed02a89dccf5dd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WORKABLE_FEED_TIMEOUT_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48c5bcb3b68565a29ff2b4d6ddbd810b6dd9cd18a84e358abfad5a1bddee3d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WORKABLE_FEED_MAX_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fde1c0253b9673829498914a0f7dbc570eb93e67de764d9a0ef8e4b087609d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WORKABLE_FEED_MAX_KEPT_ROWS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/workable.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"491dded14a82f8f71ef5ad7bc772ce58a4afb70e58d40fed8061de9478a471a2"}},{"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":49}}}],"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":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"3339670bf5f2102ecb7e4dd729fb3577324a8bd1c27730c0dd83f832f1947862"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027toPortalEntry\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2135b72b33fed2c3a7f3e3e5759591993819f2c139fe0c8822e9738d1ad384e"}},{"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 \u0027postingKey\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"url-key.mjs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4c191ed73a11f2706e812abb59b0971ef75220537a7bcd539526e69d3d6d9b"}},{"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":605}}}],"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":411}}}],"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":170}}}],"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":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3266fea9118e74d994f32d822dc6dbc2150aef8f58ceaacd59a0d89c9c453b3e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027URL\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/posting-close-refresh.test.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3dc4e327bc77599bd4545e775bad2bd98e22629a0f44f584040a23e75f0177"}},{"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":2218}}}],"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":57}}}],"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":21}}}],"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":218}}}],"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":80}}}],"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":126}}}],"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":298}}}],"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":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"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":26}}}],"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":703}}}],"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":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74c72f8ad91fcccc8003df3445fa545b3f106921763b364d8772992f24f43b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(maxPages) || maxPages \u003C 1\u0060 appears character-identically in 2 files \u2014 generate-cover-letter.mjs, generate-pdf.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":"generate-cover-letter.mjs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7298a36e3386a2b2d10989efb3a3e4fafb6a0cb187eabb449d8ca4dd97b2e77"}},{"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":4726}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ea07c5d5deacff321641db53c4d787e177c1dd2d74f33161a2eea87195105c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isNaN(d.getTime()) \u0026\u0026 d.toISOString().slice(0, 10) === value\u0060 appears character-identically in 2 files \u2014 seeds/employers-inbox.mjs, seeds/employers-validate.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":"seeds/employers-inbox.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92721c4ea804c2df1597552aee2bcc81683749647dd19658a2ba6ebec20bad6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(timeoutMs) || timeoutMs \u003C= 0 || timeoutMs \u003E 2_147_483_647\u0060 appears character-identically in 3 files \u2014 ollama-eval.mjs, 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":"ollama-eval.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa87fbe0aac8ca1fe53d6fe3f447235ccb495673907c9676f2ab309d7774e5e2"}},{"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":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"749b6b40e38d748b7a4044e7a9dca7c06cb36216456fb7095d55505753682908"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!afterArchive \u0026\u0026 SUMMARY_HEADING.test(line)\u0060 appears character-identically in 2 files \u2014 lib/machine-summary-section.mjs, web/src/lib/machine-summary-section.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/machine-summary-section.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc38f083c6efd9bd04dce830ff3028c592eaa0efd3c75344e41cad21c5cc703"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!best || points \u003E best.points || (points === best.points \u0026\u0026 ratio \u003E best.ratio) || (points === best.points \u0026\u0026 ratio === best.ratio \u0026\u0026 phrase\u2026\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78e2e8b0255000832dce925cf9c76d58243955db15ec9c2f21ef428c8224300"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!doc || typeof doc !== \u0027object\u0027 || Array.isArray(doc)\u0060 appears character-identically in 2 files \u2014 evidence-freshness.mjs, lib/page-format.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":"evidence-freshness.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac7e23fa44daa02657410db8afebbeb5e8b80be8dcad753614b6fd88ee2905c"}},{"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":"93f7803082c2286487e62945bc1692890876334335e8e2e9141d1c30e509f4d6"}},{"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":"6e06ef1fef67076310fec34cc7eaafbdec742f2d6d1d13cb5e3f7ccac6db95e2"}},{"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":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"08550999a117cd107ee0756ac9b6016fe83f821a685dc7a7560a45fa0386fa8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!fit || typeof fit.score !== \u0022number\u0022 || !Number.isFinite(fit.score)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f73a68162c4e804876360e765d23ccaa5e242cc9cb423e28b58e5c6370984a"}},{"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":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b8f0f62c57782ff222bc9fa4ea5326f0478f3d4115ed96933a1ffe4f7c2585"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!json || typeof json !== \u0027object\u0027 || !Array.isArray(json.jobs)\u0060 appears character-identically in 2 files \u2014 providers/himalayas.mjs, providers/tes.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/himalayas.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c364d381f7caafca6c258107998bbcd29c35724c4030c3dd02fcaa6fd65f25d5"}},{"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":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d687c91dc4731e64f8a959211a759ab679bc03587b9f6fa5d5e438c6a3dd27ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!line.startsWith(\u0027|\u0027) || isSeparatorRow(line) || isHeaderRow(line)\u0060 appears character-identically in 2 files \u2014 hired-share.mjs, verify-tracker-url-match.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":"hired-share.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9cb554c72bbf5ba6cfdbd7ea7e700ea2d665a489023884ede9b5c670ee88a"}},{"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":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca56863d60198a8d047f9b1cc322507e5c2dc6915353262c612b86cdce44f9b5"}},{"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":"5b5d340f958e33405a6cb87c6913037c59cdbabc33dcbae3689082bcf193df06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!raw || typeof raw !== \u0027object\u0027 || Array.isArray(raw)\u0060 appears character-identically in 2 files \u2014 scan.mjs, theme-style.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":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f18e2ef1b89cae4a920662b1d490666b9b236c5ee7f3b02bcf7099f8622a49"}},{"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":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dba3091c5d1bcc28d97872c1c7d633ae53b8632d38302552ef971ba8491532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!titleTokens.size || !Array.isArray(roles)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb53b6e73af3ee7d93d99d2959efecaa6b539a5df8ef813c643dc851b6b58f"}},{"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!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 learn.mjs, providers/_country.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":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd205f98319484f084d4b74e9451d33207c2f4083675dd198cb0eef0b947e8"}},{"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":"9dd445c10b5fca2543c4ce6b262fcffe344013b48d31c5613c5a7c7fe1580851"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/^cover([-_]|$)/.test(name) || /[-_]cover$/.test(name)\u0060 appears character-identically in 3 files \u2014 generate-pdf.mjs, web/src/lib/apply/cv-selection.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":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11b0362e528abf126078d817b9a84652652101424b69493cfb89c19e4d7b26"}},{"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":"1f39db5a32935e15e8645ff60beb6ecca917711f4dc813670556e0e028038259"}},{"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":"e6186d814d370a38a81ae1b948aac368850c03c33286b330ddeb7be1a42cc22a"}},{"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":24}}}],"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 2 files \u2014 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":"reserve-report-num.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"6123fdfd786d8692131462f6f85882949a394f63efd4ae9e28b7ecded983fc47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(process.env.CAREER_OPS_TRACKER_LOCK_STALE_MS) || 10 * 60_000\u0060 appears character-identically in 2 files \u2014 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":"reserve-report-num.mjs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a08715fb40328a824289dd6c5d3f177c24c1005b39041a2fa299e17ecddcae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(process.env.CAREER_OPS_TRACKER_LOCK_TIMEOUT_MS) || 60_000\u0060 appears character-identically in 2 files \u2014 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":"reserve-report-num.mjs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf6f09ed26abd030129929c3bff1e96116dd57c541dc4e2085c4a0d0d949462"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(process.env.CAREER_OPS_WEB_FOLLOWUPS_LOCK_TIMEOUT_MS) || 5_000\u0060 appears character-identically in 2 files \u2014 web/src/app/api/followups/override/route.ts, web/src/lib/core/followups-lock.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/override/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc28b84a772c322072e63b2dc78ef0a4bd0fcde4b74459bae649cb7b38c758"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(configuredOwnerlessGraceMs) \u0026\u0026 configuredOwnerlessGraceMs \u003E 0\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":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d27a1f477f5f367de6c08a475e757ea5ac9edf0d4fcd0b132d4c511e055c5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(declared) \u0026\u0026 declared \u003E maxBytes\u0060 appears character-identically in 2 files \u2014 plugins/_engine.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/_engine.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7ea449135fbe96d9e916f6c4ecd71e78d8f744434145ace67db0da083cf532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(first) \u0026\u0026 first \u003E= 0xfe80 \u0026\u0026 first \u003C= 0xfebf\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, sync-batch-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":"company-funded.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3765ad29b6c8efd00995ad907c2f5d80cc174760c58b18b39b0e7c414bf607fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(ctx.maxPages) \u0026\u0026 ctx.maxPages \u003E 0\u0060 appears character-identically in 2 files \u2014 providers/himalayas.mjs, providers/taleo.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/himalayas.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d6960621458321300b1ef4c880f92e0e0bb2a2c7618d7bdc26487e985b8a67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(ctx?.maxPages) \u0026\u0026 ctx.maxPages \u003E 0\u0060 appears character-identically in 38 files \u2014 providers/adp-myjobs.mjs, providers/adp-workforcenow.mjs, providers/applicantpro.mjs, providers/bulldogjob.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/adp-myjobs.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95ecdb436191a109ae1a1a0dd1f127a0fe9b3705ce93a590ed375512a3ea835"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(ctxMaxPages) \u0026\u0026 ctxMaxPages \u003E 0\u0060 appears character-identically in 4 files \u2014 providers/aldi-nord.mjs, providers/clearcompany.mjs, providers/polymer.mjs, providers/trakstar.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/aldi-nord.mjs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce1866d8d3fad4c6a1311928f59c795221decbea6e6cbec9c76bbd401c6534"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(entry.max_pages) \u0026\u0026 entry.max_pages \u003E 0\u0060 appears character-identically in 3 files \u2014 providers/himalayas.mjs, providers/occ.mjs, providers/taleo.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/himalayas.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfdf9f237b5e2cd553a1180cbb26533600415c472ada23013556c108d206153"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(entry?.max_pages) \u0026\u0026 entry.max_pages \u003E 0\u0060 appears character-identically in 10 files \u2014 providers/careerviet.mjs, providers/itviec.mjs, providers/jobbankca.mjs, providers/jobscz.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/careerviet.mjs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c6f7acfcc6ae3ffa60d98cb86fe75899fd9964d74b877bf39517767b5c21ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 2 files \u2014 himalayas-posting.mjs, web/src/lib/followup-id.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":"himalayas-posting.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f086e86747d2b3a43b4a9158bf5a8c34dfeca782ccd2237354c8e76e52a89f3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060String(title) .normalize(\u0027NFKD\u0027) .replace(/[\u0300-\u036F]/g, \u0027\u0027) .replace(/[^a-zA-Z0-9]\u002B/g, \u0027-\u0027) .replace(/^-\u002B|-\u002B$/g, \u0027\u0027) || \u0027job\u0027\u0060 appears character-identically in 2 files \u2014 providers/phenom.mjs, providers/tkms.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/phenom.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0396820e4d4d9fa42c7d1ed5d54f68e01600c8791ff59ccd183fa5a4a1a11a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a === 0 || a === 10 || a === 127 || (a === 100 \u0026\u0026 b \u003E= 64 \u0026\u0026 b \u003C= 127) || (a === 169 \u0026\u0026 b === 254) || (a === 172 \u0026\u0026 b \u003E= 16 \u0026\u0026 b \u003C= 31) || (\u2026\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, sync-batch-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":"company-funded.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39044ea53fd3e344cd932e027696a4f989f655dbabb3789d1943947f6e2d1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.language \u0026\u0026 a.script \u0026\u0026 b.script \u0026\u0026 a.script !== b.script\u0060 appears character-identically in 2 files \u2014 url-key.mjs, web/src/lib/core/url-key.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":"url-key.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"062c4822581acc7670a097e22c9c726de2ab228f736968e308e3da5c24015639"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startsWith(\u0027-\u0027) \u0026\u0026 !KNOWN_FLAGS.includes(a)\u0060 appears character-identically in 2 files \u2014 find.mjs, jd-similarity.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":"find.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fae64e7407a7d717224d21626a86686d96dae7e0e6c03bf37e3bf17c66832a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.status === \u0022idle\u0022 || a.status === \u0022error\u0022\u0060 appears character-identically in 2 files \u2014 web/src/components/apply-view.tsx, web/src/components/apply/apply-backdrop-mount.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/apply-view.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb0be714db3ae0e94e8ce9d37a74087a9ebf511b91b63c5202fa62dc5fe4927"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060afterArchive \u0026\u0026 SUMMARY_HEADING.test(line)\u0060 appears character-identically in 2 files \u2014 lib/machine-summary-section.mjs, web/src/lib/machine-summary-section.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/machine-summary-section.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad17ca0e374602efbde3916047d2d789c1f873016ea8fce41791f1e9209a34d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060application !== undefined \u0026\u0026 typeof application !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 web/src/app/api/apply/fill/route.ts, web/src/app/api/apply/prefill/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/apply/fill/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"441c8cd88128ba50a108d02090c5023a5167fe7d75ce5b54f063f71a94b6fe69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.includes(\u0027--help\u0027) || args.includes(\u0027-h\u0027)\u0060 appears character-identically in 18 files \u2014 apply-scope.mjs, assessment-log.mjs, batch/jd-rescue.mjs, contact-extract.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":"apply-scope.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"87851b32ad50eca0128309c41e50ef0d7cfd7d3bf67502d730d2f6ace2af0a28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.length === 0 || args.includes(\u0027--help\u0027)\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":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44f4cb3699b5165c33253f68e4c9787a146febcc9342050dba2d219349d433c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.length === 0 || args[0] === \u0027--help\u0027 || args[0] === \u0027-h\u0027\u0060 appears character-identically in 4 files \u2014 gemini-eval.mjs, ollama-eval.mjs, 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":"gemini-eval.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a9d70ae52d6f0b02c2af5b1fd183a934a95fe5bed6ebc4f25480df41f82b87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.length === 1 \u0026\u0026 args[0] === \u0027--self-test\u0027\u0060 appears character-identically in 2 files \u2014 verify-cv-facts.mjs, verify-cv-structure.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":"verify-cv-facts.mjs"},"region":{"startLine":4311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3a3e81e3687b085a1433aa762f75dc0a5be52435a302a130c6eab6e3a3eae4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args[i] === \u0027--posting-url\u0027 \u0026\u0026 args[i \u002B 1]\u0060 appears character-identically in 3 files \u2014 gemini-eval.mjs, ollama-eval.mjs, openai-eval.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gemini-eval.mjs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"9901e4026b15dd8a4a5eb5a3a74239664e0457be7b40db7cfa9fba0480dac06a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argv.includes(\u0027--help\u0027) || argv.includes(\u0027-h\u0027)\u0060 appears character-identically in 5 files \u2014 .github/scripts/readme-badges.mjs, keyword-match.mjs, learn.mjs, scripts/claude-plugin-session-start.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/readme-badges.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5596ed476d8d2f94777adab5704061f01bd100febda76551a75436b641032002"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt === MAX_RETRIES || !isRetryableError(err)\u0060 appears character-identically in 2 files \u2014 providers/themuse.mjs, providers/workable.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/themuse.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7585655656d8482c73e840fe9d355340a4d745c21b984fa58835a63ea39fb2cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060boardSlug \u0026\u0026 typeof j.id === \u0027string\u0027 \u0026\u0026 j.id.trim()\u0060 appears character-identically in 2 files \u2014 providers/ashby.mjs, providers/lever.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/ashby.mjs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f7bdfd6e00c8d50db6080b2385a00b16bd0e59a8c172a47648572136ea87f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c \u0026\u0026 typeof c === \u0027object\u0027 \u0026\u0026 c.enabled !== false\u0060 appears character-identically in 2 files \u2014 audit-portals.mjs, verify-portals.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":"audit-portals.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"866033cfda2cd9cbb4d05a121075c540acd3062fce28a628d34232958a91a57a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cells.length \u003E 0 \u0026\u0026 cells[cells.length - 1] === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 normalize-statuses.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":"normalize-statuses.mjs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f27a6b657045684269de3b6d242cc4e4853a72e0df528e8de74357fe89f817"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clean.errors.length || clean.warnings.length\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":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2b8722312e6f5a8c7b1582ad7dc27f41b6df859705128e3fb7d82b7b83cb8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060close \u0026\u0026 close[1][0] === fence[0] \u0026\u0026 close[1].length \u003E= fence.length\u0060 appears character-identically in 3 files \u2014 application-answers.mjs, i18n-drift.mjs, lib/story-bank.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":"application-answers.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b14c0e30fb179883b75535031fef2cdf0b614243b1fe66d03a0aaa433456e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060company !== undefined \u0026\u0026 typeof company !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 web/src/app/api/apply/fill/route.ts, web/src/app/api/apply/prefill/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/apply/fill/route.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b3f6fd6bc7a321a2f8188066f6794dd98b8aedd23834292ea9e3084531ccc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060created === GONE || created === null || now === null\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":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d6a7092786452f0c230b4bde82bdaf4ab97b46f79070647157c98b1cdbd478"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data \u0026\u0026 typeof data === \u0027object\u0027 \u0026\u0026 !Array.isArray(data)\u0060 appears character-identically in 3 files \u2014 provider-id-cache.mjs, providers/consider.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":"provider-id-cache.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaae06df9ad2c53e20c7ed8eff9a9fba6a4e15ffd9e156033387caa51cc8b0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.candidate \u0026\u0026 typeof doc.candidate === \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"529707d8ab3581d97f0a3a84769b93a8ad08fd95a168087cc4a8af3eef9fdc23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.compensation \u0026\u0026 typeof doc.compensation === \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4328073f36789046dbda02adc830a187745607e52854d247c721b5557c7e237"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.location \u0026\u0026 typeof doc.location === \u0022object\u0022\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5481b4088c4c786aab2d0ef17c1d288ec51c5fba206932274c092eb45e51c022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.getElementById(id)?.textContent || \u0022\u0022\u0060 appears character-identically in 2 files \u2014 web/src/lib/apply/drive-action.mjs, 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/drive-action.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a36b2f1f6b5683525a99960cf98a8b6eed850e068eadc0ec48f01e280dbad70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.name === \u0027node_modules\u0027 || e.name === \u0027.git\u0027\u0060 appears character-identically in 2 files \u2014 plugin-audit.mjs, plugins/_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":"plugin-audit.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48e214ae5e36ffdf95c45a93125927f6b1e40fe67184779ae477f53dfe049c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.shiftKey \u0026\u0026 document.activeElement === first\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":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c7dd81abdc17a92c52ec6b7f9953b9707c174a1cf37bdce98bc53df3232e36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060endpointHost === \u0027localhost\u0027 || endpointHost === \u0027127.0.0.1\u0027 || endpointHost === \u0027::1\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":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a068ec7c6ed5a4b1af37c9eaf79985c4df7897b34f4399aa9e67059c1a948c4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.enabled !== undefined \u0026\u0026 typeof entry.enabled !== \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 scan.mjs, validate-portals.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":4885}}}],"partialFingerprints":{"codehealthFindingId/v1":"28db4e5ff25ba2b6c8237776f7122213bd0eeec30fe0ed4addbf904e32b4b6a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err \u0026\u0026 err.name === \u0022SeedError\u0022 \u0026\u0026 err.code === \u0022LOCK_TIMEOUT\u0022\u0060 appears character-identically in 2 files \u2014 web/src/app/api/followups/override/route.ts, web/src/lib/core/followups-lock.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/override/route.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddda7531a52bea6537461c5bd70a30d85e280a06c0b244dfb6da122e6f6f700"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.code === \u0027ENOENT\u0027 || err.code === \u0027ENOTDIR\u0027\u0060 appears character-identically in 2 files \u2014 analyze-patterns.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":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c08d1ac99aff2d5553dd41623fb63560f01d3ea3dfe7bda6a2cdd266efad73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.code === \u0027EPERM\u0027 || err.code === \u0027EACCES\u0027 || err.code === \u0027ENOSYS\u0027\u0060 appears character-identically in 2 files \u2014 analyze-patterns.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":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3fec667c994e242b29f28c3b8620fbe6c32e12305de402bf6b5e8f3fe05d12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.code !== \u0027ENOENT\u0027 \u0026\u0026 err?.code !== \u0027ENOTDIR\u0027\u0060 appears character-identically in 2 files \u2014 find.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":"find.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f1e2518744615ac210f240d3fdc31a39571ff924adbf9bb485760f241d5eb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.code === \u0027EEXIST\u0027 || err?.code === \u0027EPERM\u0027 || err?.code === \u0027EACCES\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":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8764cf3f809764eeda4dd4ab5ccae642a749d580fa7e8725eefdd817a5c7d2c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.code === \u0027ENOENT\u0027 || err?.code === \u0027ENOTDIR\u0027\u0060 appears character-identically in 3 files \u2014 lib/dir-lock.mjs, update-system.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":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9a9c31a20201387fdf502667b286dd32c30d90813076004ad10349ec0ca8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.code === \u0027EPERM\u0027 || err?.code === \u0027EACCES\u0027 || err?.code === \u0027EBUSY\u0027 || err?.code === \u0027ENOTEMPTY\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":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e8cf60a80ef3e88fd5d2e5699036d48e87cceac3ddcadd4c24d35f9aaa53e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.code === \u0027ETIMEDOUT\u0027 || err?.signal === \u0027SIGTERM\u0027\u0060 appears character-identically in 2 files \u2014 lib/run-bounded.mjs, update-system.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/run-bounded.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bc34a785a3e45f69a77a3ba9f2c1b65bddc127f3cb69a4f8d90033ff2841db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.status !== 400 || typeof err.body !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 providers/jobicy.mjs, providers/tes.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/jobicy.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8c02dab38f8b5b7e0e35cd591d96c1f99cdbbdfc03862ad0336733989f9000"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.status === 404 || err?.status === 410\u0060 appears character-identically in 3 files \u2014 providers/applicantpro.mjs, providers/join.mjs, providers/talentlink.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/applicantpro.mjs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"446122316d727837080f34a4e20a673b64e9f180583b30a71c90686ff280a03f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof Error \u0026\u0026 /lock timeout/i.test(error.message)\u0060 appears character-identically in 2 files \u2014 web/src/app/api/scheduled-jobs/[id]/route.ts, web/src/app/api/scheduled-jobs/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/scheduled-jobs/[id]/route.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9b5c935ef5c4e7342f62f37896b0d437bfa0ffded79e0d504e6100d99381c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.defaultPrevented || event.button !== 0 || event.metaKey || event.ctrlKey || event.shiftKey || event.altKey\u0060 appears character-identically in 2 files \u2014 web/src/components/back-link.tsx, web/src/components/route-progress.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/back-link.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4068cf939666b0971fa3f7c23b53c7a075a12434ea8c3737e2845ea3854fb651"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.isComposing || event.key === \u0022Process\u0022\u0060 appears character-identically in 2 files \u2014 web/src/components/inbox/inbox-triage.tsx, web/src/components/pipeline-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/inbox/inbox-triage.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3070e4cb5c2228e2f055f7337728f3101c59ff2a31987b3ba00c7d8824cf22c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing \u0026\u0026 existing !== \u0027\u2014\u0027 \u0026\u0026 existing !== \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 close-stale.mjs, set-status.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":"close-stale.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a776f7ef052553e92fb35ab55c8a37b63fc8365c95afa3104bcee15c35100"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ext \u0026\u0026 ![\u0022.cmd\u0022, \u0022.bat\u0022, \u0022.ps1\u0022].includes(ext)\u0060 appears character-identically in 2 files \u2014 lib/cli-launch.mjs, web/src/lib/cli-launch.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/cli-launch.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8dcae2be093b932f5f1fe2f7a6dd51f103ae73256151c496e52dad03e0760c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060f.endsWith(\u0027.mjs\u0027) \u0026\u0026 !f.startsWith(\u0027_\u0027)\u0060 appears character-identically in 2 files \u2014 providers/_registry.mjs, validate-portals.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/_registry.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"706e16c9b0d2cc10eb9df13e0950f62f6e2827ff913ff635f5face95ed556325"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fingerprint !== null \u0026\u0026 fingerprint === lastFingerprint\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":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4018e044ed8f8b8b46637bc7a9888013620c87ba7b057ef0cf49cd3df0667338"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060h.length \u003E 1 \u0026\u0026 h.endsWith(\u0027.\u0027) \u0026\u0026 !h.endsWith(\u0027..\u0027)\u0060 appears character-identically in 2 files \u2014 lib/linkedin-url.mjs, url-key.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/linkedin-url.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca619d9c448d63dd2246273dc050ebce53953d5de1a2e6ee7d7ff08065a5a53c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasFlag(args, \u0027--help\u0027) || hasFlag(args, \u0027-h\u0027)\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, rank-pipeline.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-funded.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29002e4e19d5742c585a509cb35464d3d57b64bc3727a9137c1c17c349d0b4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasFlag(args, \u0027--json\u0027) \u0026\u0026 hasFlag(args, \u0027--summary\u0027)\u0060 appears character-identically in 3 files \u2014 close-stale.mjs, closing-soon.mjs, reeval-candidates.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":"close-stale.mjs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe277a9eb9d7cf772390e3fe28ff9bbec2c0c93ee5ff0adde10d421e186bbac8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host === \u0027::1\u0027 || host === \u00270:0:0:0:0:0:0:1\u0027\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, sync-batch-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":"company-funded.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d23b4eed6d493d2e8cd52e6f085051fba274ca606113e9ead9e79dcfca821cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host === \u0027localhost\u0027 || host === \u0027localhost.localdomain\u0027\u0060 appears character-identically in 3 files \u2014 providers/consider.mjs, providers/eploy.mjs, providers/sitemap.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/consider.mjs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"def62144a0c47a1569e3a4eeae67abb34bddcf047428ca28d49ce55ca611e8da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host === \u0027localhost\u0027 || host.endsWith(\u0027.localhost\u0027)\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, sync-batch-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":"company-funded.mjs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe8c7a6cf057f76edea79a22dc2edcf484639e1ba963e16edad57e3b24eb4a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.endsWith(\u0027.local\u0027) || host.endsWith(\u0027.internal\u0027)\u0060 appears character-identically in 3 files \u2014 providers/consider.mjs, providers/eploy.mjs, providers/sitemap.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/consider.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a13e1259216ece8dc759c8706aa19fda7cc6b893a05166478acd212e8a533e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.startsWith(\u0027[\u0027) || host.includes(\u0027:\u0027)\u0060 appears character-identically in 3 files \u2014 providers/consider.mjs, providers/eploy.mjs, providers/sitemap.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/consider.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"16297f19b59d7dc58755cc670313f0b038590fb8f5e34df261c67bba3d26277e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostname === domain || hostname.endsWith(\u0027.\u0027 \u002B domain)\u0060 appears character-identically in 2 files \u2014 providers/_trust-validator.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":"providers/_trust-validator.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a02f7ba76f97e2b273fdc4680983a458d7d025cff4040f5a108802cda13b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id === undefined || id === null || id === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 providers/polymer.mjs, providers/trakstar.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/polymer.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"779548dcf6b8d74de745626c8294011287e2ada5c2058996bd1fbaa5f205485c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060idx !== -1 \u0026\u0026 args[idx \u002B 1] \u0026\u0026 !args[idx \u002B 1].startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 discover-ats.mjs, scan-ats-full.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":"discover-ats.mjs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d9bd27974e3b5725dcc3b503be9a197f90c1b177229280dc9cb4d21dd8da26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060issue.code === \u0022required-empty\u0022 \u0026\u0026 Array.isArray(issue.labels)\u0060 appears character-identically in 2 files \u2014 web/src/app/api/apply/drive/route.ts, web/src/app/api/apply/fill/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/apply/drive/route.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"187dfb419dfb2fa90578abefe395a729db2c2a8fa5f6eca995d457af26ef4a96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u0026\u0026 typeof j === \u0027object\u0027 \u0026\u0026 typeof j.title === \u0027string\u0027 \u0026\u0026 j.title.trim() !== \u0027\u0027 \u0026\u0026 typeof j.url === \u0027string\u0027 \u0026\u0026 /^https?:\\/\\//i.test(j.ur\u2026\u0060 appears character-identically in 2 files \u2014 providers/remotive.mjs, providers/workingnomads.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/remotive.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c63cfe0594493ae52fd864a1a0c6650cb285f5f9098d17243935a37404ddbc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j.company \u0026\u0026 typeof j.company === \u0027object\u0027 \u0026\u0026 typeof j.company.name === \u0027string\u0027 \u0026\u0026 j.company.name.trim()\u0060 appears character-identically in 2 files \u2014 providers/4dayweek.mjs, providers/thehub.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":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b87a9fd0ac7a33ea7643f60c08be661094c5d6396791e90d620fb2ba344f36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j.status === \u0022gated\u0022 || evaluationGateForJob(j)\u0060 appears character-identically in 2 files \u2014 web/src/components/jobs/worker-card.tsx, web/src/lib/worker-feedback.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/components/jobs/worker-card.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08d3c9e07b3869ab588083aa3f52c7fa63fce546b3013f4ea5eec829d94871f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060json \u0026\u0026 typeof json === \u0027object\u0027 \u0026\u0026 !Array.isArray(json)\u0060 appears character-identically in 2 files \u2014 providers/turbohire.mjs, providers/ultipro.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/turbohire.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"141a19a0556e6d169aa4065dc52814ea26e92f4e0ac45c036e9fac25cbb00939"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060json.meta \u0026\u0026 typeof json.meta === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 providers/polymer.mjs, providers/trakstar.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/polymer.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83f7f420b13fe4d1862139e65c6eb0469f57f596ce1aadfaaaeee91a40b6049"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keepIfInstalled(remembered, clis) || pickSoleInstalled(clis)\u0060 appears character-identically in 2 files \u2014 web/src/lib/cli-pick.mjs, web/src/lib/saved-cli.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/cli-pick.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68d725eb550a706259bfa74ef861568ecb8b3a9a6b87d124064b87f264b0ee3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kept.length \u003E 0 \u0026\u0026 /\\p{M}/u.test(kept[kept.length - 1])\u0060 appears character-identically in 2 files \u2014 cv-experience-order.mjs, generate-pdf.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":"cv-experience-order.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b383645cbbab0fa0b54d35f67d7651c12cd6fa738b8e10d009025e25f1a9564"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last === \u0027,\u0027 || last === \u0027.\u0027 || last === \u0027;\u0027\u0060 appears character-identically in 2 files \u2014 tracker-parse.mjs, web/src/lib/core/report-url-token.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":"tracker-parse.mjs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b6786bbf3f1b5b729ecb7dfbf9ec7571fd397da2db7e3993d423b68b4a37e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lastContentionError \u0026\u0026 lastContentionError.code !== \u0027EEXIST\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":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"575877340166a516e326edbdff5a7f692a1e8ed57eedbef43b052e54ff3d5d26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.dev === right.dev \u0026\u0026 left.ino === right.ino \u0026\u0026 (left.ino !== 0 || left.birthtimeMs === right.birthtimeMs)\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":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f70690cecbb0aedede10410dc3e2c70e3e9ce5cd411f5cf3f1c65ae576714b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060leftRanked \u0026\u0026 rightRanked \u0026\u0026 left !== right\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baf16db280f765fc8417d0df8ea3565d3c8cba9d510d3bbfe3381a6a8e548f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060location.remote === true || /remote/i.test(remoteText)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"22565925023fffb90408b4b52925c52843b61cc7f90b629cb3dee713c84b8180"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mark \u0026\u0026 mark[1][0] === fence[0] \u0026\u0026 mark[1].length \u003E= fence.length \u0026\u0026 !mark[2].trim()\u0060 appears character-identically in 3 files \u2014 evaluation-cache.mjs, lib/machine-summary-section.mjs, web/src/lib/machine-summary-section.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":"evaluation-cache.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce041c90b24a9d819e4965a05ed42ed919448d9de83221a9ae4612bfe75ab70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maskedChannelBody.match(/\u003C\\/item\u003E/gi) || []\u0060 appears character-identically in 2 files \u2014 providers/germantechjobs.mjs, providers/startup-jobs.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/germantechjobs.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96c14e0b0020ea689ef34bd1cbf527d55bf5ce2f153fbd68a0e1c32ba9e2721"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maskedChannelBody.match(/\u003Citem\\b/gi) || []\u0060 appears character-identically in 2 files \u2014 providers/germantechjobs.mjs, providers/startup-jobs.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/germantechjobs.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"258277eed2f63606dc259b6e5fe021bf4d23e359278591ebc8e78a953f3b5146"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maskedXml.match(/\u003Cchannel\\b[^\u003E]*\u003E([\\s\\S]*)\u003C\\/channel\u003E/i) || [, \u0027\u0027]\u0060 appears character-identically in 2 files \u2014 providers/germantechjobs.mjs, providers/startup-jobs.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/germantechjobs.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f40dcf95db65e39305432dcab25149da533db183a2d444b31cd9d6722cdb76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060money.currency \u0026\u0026 floorCurrency \u0026\u0026 money.currency !== floorCurrency\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec032d9b8bf52d5689881c7e0c10cb3d56d9c1dbd3a10b43f8f61ad6d65f5004"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060month \u003C 1 || month \u003E 12 || day \u003C 1 || day \u003E 31\u0060 appears character-identically in 4 files \u2014 providers/beesite.mjs, providers/csod.mjs, providers/peoplesoft.mjs, providers/softgarden.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/beesite.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c4c064c31bf6f8146c786814295872b73ff4946736c910563084ce97553e4a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n === null || n \u003C SCORE_MIN || n \u003E SCORE_MAX\u0060 appears character-identically in 2 files \u2014 lib/score-action.mjs, web/src/lib/core/score-action.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/score-action.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5bf117a9737a52954a00b38753a76602620394a81e7673a39cca49689b7053"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060named || (money \u0026\u0026 money.currency) || null\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e6513d2ff55c44d2473c54a1f3b0ce9641804bd445423c01184f6dec24c7ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalizeCompanyName(raw) || raw.toLowerCase()\u0060 appears character-identically in 2 files \u2014 company-history.mjs, detect-reposts.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":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144457851535eec6ac5bfd4dd9cb4edfb0f1f065ba8cf75dcd4bbda46a81b30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060open \u0026\u0026 !(open[1][0] === \u0027\u0060\u0027 \u0026\u0026 open[2].includes(\u0027\u0060\u0027))\u0060 appears character-identically in 2 files \u2014 application-answers.mjs, lib/story-bank.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":"application-answers.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd2c76ca97b00fdab21e0449ec2e0bf9fafbe2f5e30aab32726060bd8a34b15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.workspaceRoot || getCareerOpsRoot()\u0060 appears character-identically in 2 files \u2014 generate-pdf.mjs, lib/pdf-server.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":"generate-pdf.mjs"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd2ed91428597f35f0afdd7667a196012bd574a55487c0c5c52f9527addb172"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outcome === PASS_STAMPED \u0026\u0026 settleSync(confirmStamp(lockDir, state))\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":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17a41c86500fa4bc0ca0b7c355c783abd053bfe8816a8affea0fd5a4abfa8e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outputStat \u0026\u0026 (realpathSync.native(absOutput) === realpathSync.native(absInput) || (inputStat.ino !== 0n \u0026\u0026 inputStat.dev === outputStat.dev\u2026\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":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ebfc471a834eeceb2bbfad2c5a4b6c556132ea6caaf32afa8dfcc58c457c97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner.pid !== process.pid || activeTokens.has(owner.token)\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":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53f4115615ac25d43ba1307e366ad92e1a06d3c00bc306ca0f445b2a06d228b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ownerErr?.code === \u0027ENOENT\u0027 || ownerErr?.code === \u0027EEXIST\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":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da9592d2eb3011f6aa25342bdd5846e8ba52179d618cb1d34264c309a61a69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page === maxPages \u0026\u0026 Math.ceil(total / PAGE_SIZE) \u003E maxPages \u0026\u0026 !probing\u0060 appears character-identically in 2 files \u2014 providers/jobscz.mjs, providers/pracecz.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/jobscz.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aaafeeb52006b47f0d3b3cbafa152ecf194b68195ed7f919ad3c6ceec6cc5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page === maxPages \u0026\u0026 probeMaxPages \u003E entryMaxPages\u0060 appears character-identically in 2 files \u2014 providers/alibaba.mjs, providers/tencent.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":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6f8e944af3c18bf9044a6fc59b282419a4adcb89f34e84b5481afb8a1f176"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed \u0026\u0026 typeof parsed === \u0022object\u0022 \u0026\u0026 !Array.isArray(parsed)\u0060 appears character-identically in 3 files \u2014 web/src/lib/career-ops.ts, web/src/lib/core/scan-json.mjs, web/src/lib/status-cli.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/career-ops.ts"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84ed029f8beb99684956a0906981a86b2f741ff5d43af94a62ac6ace85581c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027http:\u0027 \u0026\u0026 parsed.protocol !== \u0027https:\u0027\u0060 appears character-identically in 3 files \u2014 liveness-browser.mjs, providers/_trust-validator.mjs, robots-check.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":"liveness-browser.mjs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e57f6c612d70bb54badf59e9a7aa74669a2843b32e5bc256cada96e44fe9e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027https:\u0027 || !HOST_RE.test(parsed.hostname)\u0060 appears character-identically in 2 files \u2014 providers/jazzhr.mjs, providers/notion.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/jazzhr.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"19190fa447e4468a1f28e476bfb8a87c56017f5fa7a2cc37fdf52265ec32fc99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol !== \u0027https:\u0027 || parsed.username || parsed.password || parsed.port\u0060 appears character-identically in 3 files \u2014 providers/eploy.mjs, providers/sitemap.mjs, providers/wp-job-manager.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/eploy.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5aec9fa79cc959a9a74a877edfe2291f2b8c292584409fbbda9be7ee1c3861"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.protocol === \u0027https:\u0027 \u0026\u0026 parsed.hostname === TRUSTED_HOST\u0060 appears character-identically in 7 files \u2014 providers/4dayweek.mjs, providers/a16z-speedrun-talent.mjs, providers/arbeitnow.mjs, providers/getonbrd.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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535c964e57ff98e545b99ab95c08ba06ee7130540ca09fde0e838daaed723d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.searchParams.get(LANGUAGE_PARAM) || \u0027\u0027\u0060 appears character-identically in 2 files \u2014 providers/personio.mjs, providers/recruitee.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/personio.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7650ed5b462babadab3918bbd26b6c6c2e8fdfa898964284be9d2d97be4aac54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.dirname(reportPath) !== reportsDir || path.dirname(tsvPath) !== additionsDir\u0060 appears character-identically in 2 files \u2014 persist-evaluation-report.mjs, web/src/lib/report-persist.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":"persist-evaluation-report.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d76867226f11ab4685c1899f3d95c9945e60a14f6602eb55ae82d1cd25ccd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.argv.includes(\u0027--help\u0027) || process.argv.includes(\u0027-h\u0027)\u0060 appears character-identically in 4 files \u2014 .github/scripts/docs-only-change.mjs, batch/aggregate-tokens.mjs, validate-plugin-registry.mjs, validate-untrusted-content-coverage.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/docs-only-change.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43bbfd336584d65b7311f6ada695b11c4a4d05b11fe0ef3007b68d68147575e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_BLACKLIST || join(DATA_ROOT, \u0027data\u0027, \u0027blacklist.md\u0027)\u0060 appears character-identically in 2 files \u2014 discover-ats.mjs, discover-new-companies.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":"discover-ats.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e897cc3a5ef6deed4390eada8426425d8466e4a32e4e1df9e707ac5fd5dd900"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_PORTALS || join(CAREER_OPS, \u0027portals.yml\u0027)\u0060 appears character-identically in 2 files \u2014 detect-reposts.mjs, verify-pipeline.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":"detect-reposts.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d681a8cf9a2d0d391fef000db8a78243b24762250b10e7dd209b9661d987fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_PORTALS || join(DATA_ROOT, \u0027portals.yml\u0027)\u0060 appears character-identically in 3 files \u2014 discover-ats.mjs, discover-new-companies.mjs, verify-portals.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":"discover-ats.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f10ce8299f39d632f64d7a7689e88f55aab65e17ecfee09dfa896a24b74f0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_PORTALS || join(getCareerOpsRoot(), \u0027portals.yml\u0027)\u0060 appears character-identically in 2 files \u2014 fix-slugs.mjs, validate-portals.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":"fix-slugs.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77a0b625aaea511b515920de1b5524cbb6b2d53946f92f1567074fb680bbf0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_REPLY_CANDIDATES || path.join(DATA_ROOT, \u0027data\u0027, \u0027reply-candidates.json\u0027)\u0060 appears character-identically in 2 files \u2014 paste-reply.mjs, reply-watch.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":"paste-reply.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0cd0ced990a823ab8b97ae6bb14a785e911431ad63d6ce0e0cdbe2c9dcdfbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CAREER_OPS_ROOT?.trim() || process.env.CAREER_OPS_DATA_DIR?.trim()\u0060 appears character-identically in 2 files \u2014 docs/recipes/gojobs/parse-gojobs-html.mjs, path-resolver.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":"docs/recipes/gojobs/parse-gojobs-html.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad5aa6df48db4d65b91240569203c3c3c69e82f2c67858ba1d8bcd1eade309b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GEMINI_MODEL || \u0027gemini-3.6-flash\u0027\u0060 appears character-identically in 2 files \u2014 gemini-eval.mjs, scan-hn.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":"gemini-eval.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7029652999d12ad443d224eb4ac9b25d7b5b43d85be4c9a04aecd7fbdb4603a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.OPENAI_BASE_URL || \u0027https://api.openai.com/v1\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":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9369b4790fb5cf27245b9a984690bb090b7584ce035834251e97c5629412670e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.OPENAI_TIMEOUT_MS || \u0027300000\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":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe9c74e1f71be20efcba7615dd5a74ec3288f57da185b71651a350f342271f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prototype === Object.prototype || prototype === null\u0060 appears character-identically in 2 files \u2014 providers/_country.mjs, web/src/lib/portals-config.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/_country.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c00e10f8e03c3077f53de61dbc37a948f033c1ef4bcbe81cef73e1b1c0a6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw === undefined || raw === null || String(raw).trim() === \u0027\u0027\u0060 appears character-identically in 3 files \u2014 providers/_http-cache.mjs, providers/_http.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":"providers/_http-cache.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca956da64d465060953913ba12ad3cbb3eac744d8d7e77362d10ac0c6138d2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw === undefined || raw === null || raw === \u0027\u0027\u0060 appears character-identically in 3 files \u2014 providers/builtin.mjs, providers/jobicy.mjs, providers/tes.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/builtin.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45aed3396ef4d5733a228d7c0c26339a450532a3440b43e14a3fea127678468"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readBack.owner?.token === state.token \u0026\u0026 identity !== false\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":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e322a5b469fd8b7ca9dca236a59f7e200fca66560adeab483460efd5149121"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readFileSync(join(ROOT, \u0027VERSION\u0027), \u0027utf-8\u0027).trim().split(/\\s\u002B/)[0] || undefined\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":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"33709e0c7f919ee40cf34e557639b6f6d7c059a0baeafc352df3d1fafda91c3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060realCandidate === realRoot || realCandidate.startsWith(rootWithSep)\u0060 appears character-identically in 2 files \u2014 analyze-patterns.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":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8d2c9db91a5d506f64772c0e02b554f5bab6a16b932d667a38420a1d1424a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requested.postingId \u0026\u0026 landed.postingId !== requested.postingId\u0060 appears character-identically in 2 files \u2014 liveness-browser.mjs, openrouter-runner.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":"liveness-browser.mjs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b059a390821d3974b7e2c976f90c35e09d8d9947f4e8ae56ce00135fe51d60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rescue !== undefined \u0026\u0026 typeof rescue !== \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 scan.mjs, validate-portals.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":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"9506a7532befdf7799418260fb7f802c407ae2f5fd908827470cb912318c9599"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rolesBlock \u0026\u0026 typeof rolesBlock === \u0022object\u0022 \u0026\u0026 !Array.isArray(rolesBlock)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd899b1869761e108e3d40ee9ac5bbf01e33b133eef5efa2509f1f89cf3c8eb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stopReason === \u0027cap\u0027 || stopReason === \u0027fetch-error\u0027\u0060 appears character-identically in 3 files \u2014 providers/bulldogjob.mjs, providers/inrecruiting.mjs, providers/phenom.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/bulldogjob.mjs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"716c2ec3034970b3e3ab55f27c90e33a2405d27069fcb26f3f436c756c216457"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stopReason === STOP_REASON.COMPLETE \u0026\u0026 page === pagesToFetch \u0026\u0026 pagesToFetch === maxPages\u0060 appears character-identically in 2 files \u2014 providers/dover.mjs, providers/rippling.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/dover.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46c3aa1d11d2f8dba5af5008b29b0e1804ec780e15190b8be671620547192f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060str(record.Posting_Title) || str(record.Job_Opening_Name)\u0060 appears character-identically in 2 files \u2014 browser-extract.mjs, providers/zoho-recruit.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":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c085620cb71a1cd7dfde52242d2ff13f04792f2cb4b21f6c98f36e77c05dc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style.display === \u0027none\u0027 || style.visibility === \u0027hidden\u0027\u0060 appears character-identically in 2 files \u2014 browser-extract.mjs, liveness-browser.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":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b5f26f8334e54903e66b9a646240bdf78dacfc1145d75eb31ed87d49a6e75d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060summary?.company \u0026\u0026 summary.role \u0026\u0026 summary.role.toLowerCase() !== \u0027unknown\u0027\u0060 appears character-identically in 2 files \u2014 ollama-eval.mjs, openai-eval.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ollama-eval.mjs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9262e57a83ee48e0a07ce4b92c53c663accaed903f5b4b0fbc4348ed1a73995"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060symlinkCreated \u0026\u0026 withinReports(escapeLink)\u0060 appears character-identically in 2 files \u2014 analyze-patterns.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":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b129df5061b5dda8026042b9ef559564f5631f98effcd38672d80b0b9ba7e03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tag === \u0022input\u0022 \u0026\u0026 [\u0022hidden\u0022, \u0022submit\u0022, \u0022button\u0022, \u0022image\u0022, \u0022reset\u0022].includes(itype)\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":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb201bcbd2a4d2e19ffa250069dc040cf3cf552ed666a3b3d9ed97c756013f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tagText(item, \u0027link\u0027) || tagText(item, \u0027guid\u0027)\u0060 appears character-identically in 2 files \u2014 providers/germantechjobs.mjs, providers/pythonorg.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/germantechjobs.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda674189bc70d45b851f43dc4e55d2cb5003f4796b42537b4b9a54f308c7cfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target instanceof HTMLElement \u0026\u0026 target.isContentEditable\u0060 appears character-identically in 2 files \u2014 web/src/components/inbox/inbox-triage.tsx, web/src/components/pipeline-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/inbox/inbox-triage.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8d52199f309eac4c16f95ce88830f0bd92277ff269f4421f5cccfbd0ece04d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060targets.payFloor == null || !Number.isFinite(targets.payFloor)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d4d2410b2032690829dcaf604bd7a24ad02937141c1b927bdc64fd8347c33e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060targets.wantsRemote \u0026\u0026 /\\bremote\\b/i.test(text)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"544dcd78b0f57220e4cebae61b82ea990e278044c65a444065b7b37d4d34afcf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text === \u0022USD\u0022 || text === \u0022$\u0022 || text === \u0022US$\u0022\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb558de3b469bd38836849c5244002dc32ccdc05f7c98e913e7f455b7e2adc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text === null || text === undefined || typeof text === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 build-cv-html.mjs, lib/latex-escape.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":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d815b7ff5c8e2e5728e01f6c1e0fe5bc9e9708b5803d086629d0101e49fd49f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token.length \u003E 1 \u0026\u0026 !SENIORITY.has(token)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f243121130b4d4d5a68f6d482d55bcdb39b936e55d7ab814e7a355eab53e3d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total !== null \u0026\u0026 (page \u002B 1) * PAGE_SIZE \u003E= total\u0060 appears character-identically in 2 files \u2014 providers/beesite.mjs, providers/phenom.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/beesite.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"646be7ed4baeb9b711d18d31a20e396c1a36d8eb36ce7ba84f541cf88b9940bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total !== null \u0026\u0026 page * PAGE_SIZE \u003E= total\u0060 appears character-identically in 2 files \u2014 providers/bulldogjob.mjs, providers/csod.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/bulldogjob.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0bf4bf301b442e88487662bd7d297769d007a051db40e6613d45518e3bd078"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof body !== \u0027string\u0027 || !body.trim()\u0060 appears character-identically in 2 files \u2014 .github/scripts/depends-on.mjs, providers/applitrack.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/depends-on.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9019153833b7cbc32083ac56399178e94b1ad76eced0f5644efd91b78b60edcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof candidate !== \u0027string\u0027 || !candidate\u0060 appears character-identically in 3 files \u2014 providers/a16z-speedrun-talent.mjs, providers/gupy.mjs, providers/recruitee.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/a16z-speedrun-talent.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6bde93ddaf9045527b1666a8d7bce5fd9cd159b99d56caffd83357b218911e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ceiling !== \u0027number\u0027 || Number.isNaN(ceiling)\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":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd6d3a5877dfeaa2f5311785227fd0b168eb8481c97399dbb3621e11b49b578"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof cfg !== \u0027object\u0027 || Array.isArray(cfg)\u0060 appears character-identically in 2 files \u2014 plugins.mjs, providers/aldi-nord.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.mjs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"923bee6b09d5830ddc15bfe4974b2d3304b4e43c5e168978dfd36c5fe0601860"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof content !== \u0027string\u0027 || !content.trim()\u0060 appears character-identically in 3 files \u2014 process-quality.mjs, rejection-latency.mjs, tracker-sync-check.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":"process-quality.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6b2dfa9fafd68cc72d664aae768c04a095f1db35f6642f529fb79e343954e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof defaultCompany === \u0027string\u0027 \u0026\u0026 defaultCompany.trim()\u0060 appears character-identically in 6 files \u2014 providers/higheredjobs.mjs, providers/larajobs.mjs, providers/nodesk.mjs, providers/pythonorg.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/higheredjobs.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a1b0c52204ca29d0e070bba95248906a1a8b4e5c9ccca5d9e30f058d7dc51f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry !== \u0027string\u0027 || !entry.trim()\u0060 appears character-identically in 2 files \u2014 title-keywords.mjs, validate-portals.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":"title-keywords.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7deecebb795aea7043c9f63d06e0ac5e346fb686902c07209352805738a5c671"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry.name !== \u0027string\u0027 || !entry.name.trim()\u0060 appears character-identically in 2 files \u2014 audit-portals.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":"audit-portals.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7981e2a899c15a412ee9e533c8cf6930d49943d44f990bd7fccae0f566927fa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry?.name === \u0027string\u0027 \u0026\u0026 entry.name.trim()\u0060 appears character-identically in 6 files \u2014 providers/higheredjobs.mjs, providers/larajobs.mjs, providers/nodesk.mjs, providers/pythonorg.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/higheredjobs.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e83302106697d918a7492900c490c5d980c43cbfc321fcff1bddb91f5d2e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof err?.status === \u0027number\u0027 \u0026\u0026 err.status \u003E= 300 \u0026\u0026 err.status \u003C 400\u0060 appears character-identically in 2 files \u2014 providers/bamboohr.mjs, providers/homerun.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/bamboohr.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"662259b07c34d6becd779353d4d90af51a39b84c86a117d6750db6a2833988b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof fallbackCompany === \u0027string\u0027 \u0026\u0026 fallbackCompany.trim()\u0060 appears character-identically in 4 files \u2014 providers/4dayweek.mjs, providers/a16z-speedrun-talent.mjs, providers/landingjobs.mjs, providers/thehub.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":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06ec527b210742870c582d1f3cfce536d050a3dfd36e9890662e059ddf73a82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof html !== \u0027string\u0027 || !html.trim()\u0060 appears character-identically in 6 files \u2014 providers/eploy.mjs, providers/generalist-world.mjs, providers/neogov.mjs, providers/sitemap.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/eploy.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e295d830cd1913c7e5bff7da7759cecec3a00a8e2475373e29eba0ba1fd53812"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item !== \u0027string\u0027 || !item.trim()\u0060 appears character-identically in 2 files \u2014 theme-style.mjs, verify-portals.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":"theme-style.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55864f2ecede204fd61e7291fa43711501a2f990e4ccbf8cf4eef628f7f4113"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof j.company === \u0027string\u0027 \u0026\u0026 j.company.trim()\u0060 appears character-identically in 2 files \u2014 providers/a16z-speedrun-talent.mjs, providers/remoteok.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/a16z-speedrun-talent.mjs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0ab2d9f3f25f57f5e1077f0b45b54147a5e7dd8845d296a94ad3fe6b096830"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof j.company_name === \u0027string\u0027 \u0026\u0026 j.company_name.trim()\u0060 appears character-identically in 5 files \u2014 providers/4dayweek.mjs, providers/arbeitnow.mjs, providers/echojobs.mjs, providers/remotive.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":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b70c53285db5f72b61e094625c781ad406ee1b326fe3f22b9faf270b900a24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof j.location === \u0027string\u0027 \u0026\u0026 j.location.trim()\u0060 appears character-identically in 2 files \u2014 providers/ashby.mjs, providers/recruitee.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/ashby.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"726f11be30244e9b9176d2f92e0f4c7f14b0f0a3b09056fb7a90c82c57c04532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof j?.id === \u0027string\u0027 \u0026\u0026 j.id.toLowerCase() === target\u0060 appears character-identically in 2 files \u2014 browser-extract.mjs, liveness-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":"browser-extract.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b65961118bff338cd07d0580c81a26ec1f9588ceaac1b41e92275d07c7a7eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof loc.name === \u0027string\u0027 \u0026\u0026 loc.name.trim()\u0060 appears character-identically in 2 files \u2014 providers/breezy.mjs, providers/comeet.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/breezy.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"562fe1a72564e158465b1261962bc98c43d47fa43aaf3a7c7719e89ddd55a205"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0027object\u0027 || Array.isArray(parsed)\u0060 appears character-identically in 2 files \u2014 lib/privacy-guard.mjs, validate-profile.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/privacy-guard.mjs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d69effb63165e6fe7b1e02ee555cfde67c77a7dcab56b39339d4bfad894b3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof place === \u0022string\u0022 \u0026\u0026 place.trim().length \u003E= 3\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c386bc0feed82d7838f251f34f076aeeb3d134e938e0ea7534fac0db14252"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof rawMinimum === \u0022number\u0022 \u0026\u0026 Number.isFinite(rawMinimum)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8295f0a6c17b49065aeb1f1e8d27d1d3c69a04bf212ff11a948f69ebf51fcdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof role !== \u0022string\u0022 || !role.trim()\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b05b2abb8b2eefa78a31282cdee758c1c58f2ae99b1014cc066684d9618deb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof score !== \u0027number\u0027 || !Number.isFinite(score)\u0060 appears character-identically in 2 files \u2014 lib/score-action.mjs, web/src/lib/core/score-action.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/score-action.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dc2f93b96158d3cd95f674696cdd38cdca2b52a0ef4d5f482c9dbb0729e286"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof status === \u0027number\u0027 \u0026\u0026 status \u003E= 500\u0060 appears character-identically in 3 files \u2014 providers/_http.mjs, providers/themuse.mjs, verify-portals.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/_http.mjs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6356d46b15c6a278d002acf1ecf39e9e8e8325efd31d75bac234047db02c02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof text !== \u0027string\u0027 || text.length === 0\u0060 appears character-identically in 3 files \u2014 lib/context-budget.mjs, lib/eval-evidence.mjs, lib/linkedin-import.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/context-budget.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cf398120e53f910a0c5e7a7d950de8ec72606c3364614908f302d2d2130097"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ts === \u0027number\u0027 \u0026\u0026 Number.isFinite(ts)\u0060 appears character-identically in 2 files \u2014 providers/polymer.mjs, providers/tkms.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/polymer.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43107705cd61af6b84aef8ac64f925ffb10b5e2c5dc7064bc51c424115db536"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 \u0026\u0026 typeof value !== \u0027number\u0027\u0060 appears character-identically in 2 files \u2014 providers/adp-workforcenow.mjs, providers/gem.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/adp-workforcenow.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc67d74a11c2271521c10027ab1babfe7f9d2049e7002c45a99b59f60fd9d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !value.trim()\u0060 appears character-identically in 12 files \u2014 providers/aldi-nord.mjs, providers/applicantpro.mjs, providers/bulldogjob.mjs, providers/germantechjobs.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/aldi-nord.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5b56d15509ccdbc0e9678de1a414d8a1a29671f036635febf1a81ffd37645"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E 0\u0060 appears character-identically in 2 files \u2014 web/src/lib/claude-usage.mjs, web/src/lib/run-cli-support.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/claude-usage.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0c6f979da93cb498745d4b88e6f2680439db5856ed7c72a9d41448fc92a5be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 /^\\d{4}-\\d{2}-\\d{2}$/.test(value)\u0060 appears character-identically in 2 files \u2014 lib/inbox-rank.mjs, web/src/lib/core/inbox-rank.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/inbox-rank.mjs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"315cb43d1b9b68d396d4cb7420b897bba52d7226bca534918ca37fa351b91a98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 4 files \u2014 analyze-patterns.mjs, company-history.mjs, providers/collage.mjs, providers/himalayas.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":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bcb6017095c395d381df15cccd938bb9432d72329f6a45a59a4dc401daec8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 value.trim()\u0060 appears character-identically in 4 files \u2014 providers/collage.mjs, providers/himalayas.mjs, providers/workday.mjs, scan-ats-full.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/collage.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c912e623738d8eb7434e9d8a2989646ac504d7d2538f632c4e1e72163663fb70"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027string\u0027 \u0026\u0026 value.trim() !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 lib/cv-payload-schema.mjs, validate-portals.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/cv-payload-schema.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caa82e8e328ebf0cdea70d0bd6094195ec1959d5e75c6a917ba82b2b787e4fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol !== \u0022http:\u0022 \u0026\u0026 u.protocol !== \u0022https:\u0022\u0060 appears character-identically in 2 files \u2014 web/src/lib/core/url-key.mjs, web/src/lib/posting-url.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/core/url-key.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d3d66278b88d1c0ef485199f9c2ce769351cf35ff7e80e39c03c59d2ded60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol !== \u0027http:\u0027 \u0026\u0026 u.protocol !== \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 lib/linkedin-url.mjs, url-key.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/linkedin-url.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fb8a039b8dcb14f123ec7265e0ce953bdc9af51decb95affe9055bee95ea59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol !== \u0027https:\u0027 \u0026\u0026 u.protocol !== \u0027http:\u0027\u0060 appears character-identically in 13 files \u2014 harvest-buildlist.mjs, history-ats-seeds.mjs, liveness-api.mjs, openrouter-runner.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":"harvest-buildlist.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b88e7659a2c8e37bfc85af5f78a1ade45f70132bd024bfeb50643c9e61459f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol !== \u0027https:\u0027 || !hireHiveTenantOf(u.hostname)\u0060 appears character-identically in 2 files \u2014 history-ats-seeds.mjs, providers/hirehive.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":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"315188470835380704f9c73e374896b074a053e493e31f093474090bf3f174f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060u.protocol !== \u0027https:\u0027 || u.hostname !== API_HOST\u0060 appears character-identically in 3 files \u2014 providers/alibaba.mjs, providers/meituan.mjs, providers/tencent.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":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ab4d5cc26c109c1840b505bf1d2982782ef73832445b6a2922fc1ffa6951d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.protocol !== \u0027http:\u0027 \u0026\u0026 url.protocol !== \u0027https:\u0027\u0060 appears character-identically in 2 files \u2014 lib/llm-outbound.mjs, providers/local-parser.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/llm-outbound.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff511ce72e38bd56d8fdd393466d9ba8a95dc1435f842e9b905435041dffd4bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.protocol !== \u0027https:\u0027 \u0026\u0026 url.protocol !== \u0027http:\u0027\u0060 appears character-identically in 2 files \u2014 company-funded.mjs, sync-batch-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":"company-funded.mjs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0a32e761a6c9b766fb48ba925dc888041ae53163540c8786bdf13ce29a4581"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v !== null \u0026\u0026 typeof v === \u0027object\u0027 \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 3 files \u2014 check-table-freshness.mjs, evaluation-cache.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":"check-table-freshness.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"555da6483dd9bb56b28bc028330ae9ee1d8282ab83bff1798e367ff5cd1559a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060val === undefined || val.startsWith(\u0027--\u0027)\u0060 appears character-identically in 2 files \u2014 contacts.mjs, outcome.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":"contacts.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e4c6e3885e09f5ffab51580789f7902ce1d118db02dbe06c85d97c26bb1699"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 web/src/lib/json-body.ts, web/src/lib/scheduled-jobs-store.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/json-body.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"815db5e916ae61626590dc5ca2b1b3d0fda637325b1eae2b0adb0be22e58e236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0027object\u0027 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 himalayas-posting.mjs, validate-portals.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":"himalayas-posting.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa393a30d97961b155b6c753a2ddab3e060cf6bd2056abf9b954ce776c91462a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || value === undefined || value === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 analyze-patterns.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":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f196fc974b434ea1ad2175e9f7de4ff7ac79b52ee7253f97a20ebce5a520e62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060xml.match(/\u003Citem\\b[^\u003E]*\u003E[\\s\\S]*?\u003C\\/item\u003E/gi) || []\u0060 appears character-identically in 7 files \u2014 providers/_wp-job-feed.mjs, providers/higheredjobs.mjs, providers/larajobs.mjs, providers/nodesk.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/_wp-job-feed.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a52e5b6d45bb04434baf45c426d73a0c842bbf103c012e025f2c95d4cad983"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseDetail\u0060 is exported, takes a document from its caller (line 246) and hands it to \u0060flattenJsonLd\u0060, which calls itself at line 210 (\u0060flattenJsonLd\u0060) with a piece of \u0060value\u0060 (and at line 212) \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/applicantpro.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4e1fc2e68af2b8e89918add02df2834b0bc59c5808c3b5cabec977cc6c0005"}},{"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 180) and hands it to \u0060walk\u0060, which calls itself at line 198 (\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":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f41ad905383756ef2353df170a715ff80f4a51421dfd91e367ce7e7d9574704"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseJobPostingJsonLd\u0060 is exported, takes a document from its caller (line 315) and hands it to \u0060flattenJsonLd\u0060, which calls itself at line 304 (\u0060flattenJsonLd\u0060) with a piece of \u0060value\u0060 (and at line 306) \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/sitemap.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477e5bc7313f1a32d5989387e4d69297fed9659b97b879b76fa6c72f993b305"}},{"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":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flattenScalars\u0060 is exported and takes \u0060node: object\u0060 from its caller, and it calls itself at line 256 (\u0060flattenScalars\u0060) with a piece of \u0060node\u0060 (and at line 260) \u2014 and nowhere in \u0060flattenScalars\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 \u0060flattenScalars\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/privacy-guard.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"175a7c6457c2432c315775a7275aae156b424f03eadfa933c82d2674422a5596"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 25/34 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: 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":274}}}],"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":802}}}],"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":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"104071a41126da6a11c8aeffa20470b21c4b38f97c656b5c24fdd803f93c591f"}},{"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":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fae936dc9a3a10b36c2270b66be628a5790f589b0a9e0f2e23981750c549935"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: POST: \u0060POST\u0060 holds an AbortSignal but calls \u0060spawn(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060spawn(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/tracker/delete/route.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"af02c16ba8124b90ac071d2b446fdf90c0b10db24445b24188f31c7f6a80663f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: GET: \u0060GET\u0060 holds an AbortSignal but calls \u0060fs.readFile(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060fs.readFile(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/logo/route.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0739d79046634060ec264ad1c9eeded150b54d5ad319b20c7f7650831c6368cc"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: GET: \u0060GET\u0060 holds an AbortSignal but calls \u0060execFile(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060execFile(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/keyword-match/route.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"892cdefeb442a9749a36cf732cd810f8bfab8b5a6359988b0072f984823f2639"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: GET: \u0060GET\u0060 holds an AbortSignal but calls \u0060execFile(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060execFile(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/followups/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b01f7ff481cc2631a5fde9ddf7071acd8ec8169be24479ef1ae3f017bf8c405"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: GET: \u0060GET\u0060 holds an AbortSignal but calls \u0060execFile(\u2026)\u0060 without it, so its caller\u0027s cancellation never reaches that call and it runs to its end after whatever wanted it has given up. Hand the signal on: \u0060execFile(\u2026, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/api/company-history/route.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0757f41270363750284481aa288ea2d15978fab9222511d9b8faa8d0124d7ff4"}},{"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 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":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b094617e3a5a67044a7b5fbbe5dfec03d8ae4504cf3ba8210d02511841746"}},{"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":774}}}],"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 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":"generate-cover-letter.mjs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9272f0953d4d67c71531f2ce19099558bbcc522b1ce6d53f14fa6ab3c6e41f"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060Object.entries(COLUMN_ALIASES).map(([f,a])=\u003E\u0060  ${f.padEnd(9)} ${a.join(\u0027, \u0027)}\u0060).join(\u0027\\n\u0027)\u0060 is text this program did not author, and it is written into the text of an element 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. Encode it for HTML at this site, render it through the framework\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"import-tracker.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a140725ebace0f967736c75e6bed4b59f08aa28d0b6292d7e1566522f24661"}},{"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":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbeabaa1cd9cf54c7deae499dc6eeda9c3d3fb4aac2bd43aee305cff9e8cf79"}},{"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":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32870d41fc3d1935c4308ec8958ceeb6eccf489e43fa0db8fd9e9c3ffae0f7b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"backup.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6864d73e5dcab10ddaa71912d46f16cc53420ec47454b3e495950d2278f948"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cca8a9cc059118f4b642d06c3550709145f635967c0ae8566813b40455364bb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"backup.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b070c18b25b22f476213d7cbf9aadea50676e97facfa6409b904c63cb629cd0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56ecce16a5c15e2eb0d1cd70c3db809fa7fa88f1c1328a4449de8b87bf2d22f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e69c424bdbbb0a3f8685954583113e0aa1c648c53bc6b233e851f7888ad4da2"}},{"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":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbf5f89efab042204f7c8e214e45950b094c0220680e1db43ffcbeda6edc206"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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 (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bf50ee40f200f9299c28a04c5c497d1a96e27456bf921614372a8bfc3c32cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"695f209f4130a20977a8d7f5746c59a58579152282f3620c78457e832c380670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-extract.mjs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0f652a1e8f284f86328c20af1738651836b544f617fac610e55e2c5abf5f5"}},{"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":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b25c9c9c2365db5077b3f15af91921d3ca446f42ce7fecc34ea781f85c8b1"}},{"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":1641}}}],"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":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e834a4c324ce30d81f9ce54fd5a6cae3e35e85291165b86582af50698e5159a0"}},{"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":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5afa1427338246b70222a3a7bf45e8e10ee7f2cf25e9004183e908321a8bf94"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2509e937e6c41977cbbd43528d2e88b3c856e4ab71ef558af9bff860f3a68667"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"check-jd-archive.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"220f8fe0821cafd4b076053a4f896d0d29a5fa881ad791f0524d895fa11b3e5e"}},{"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":331}}}],"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":"community-asks.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4bdd8264348d58dafe25d98867b6ad5056299b0703ae728fbd1dc5550f7a9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"community-asks.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b91584190ae672eb3f727964e9feda88eb06bc3c2b0ebff6534490f14dbbbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":294}}}],"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":"33fa4ba128e66a5d346877e02ade62469f70dd35da34f02342dbaf17da38957b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"e3c25239a3e8c18366d0716b45ce78aeb75f65de6a6763a92dcb7e9082fa2eaf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"b2ce5d9e8372b29e7d4cd372c771a9d64ab3399a8bcf675a78be1ab81a111459"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":340}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"552f1bec4f42b211a83bb2c9fff7fcc38fe2c53631ee16abeb8e8908f3b9922c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa013acc877491efc14e97867629da5485df40e288850a2ce82dc4da92304a77"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cv-templates.mjs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3388759f3d01cd139974336b8376a71852e07f30b9fad7053c7c2a78f16bf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":431}}}],"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":101}}}],"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":212}}}],"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":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"03923d0a3f48ec29bf98f7e2d24589ae2727e58691477cb423556da1db2f0a91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb46e62880cd99efcdcee8e28241f65ddedc9f088dffe08da1d0887e41f8abf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56427109c1d5ea94d738dacda7af0bcb5c1c70b08ac7215f31098bc367daca9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e4b6d1ab1a7af635780d9f93481ae4f6d93616d38337df3d173ace8e23da6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bb0621e026944d6635823659ef589eaf9681cc1fdd3eb2ccdc8a6eb15f16dc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doctor.mjs"},"region":{"startLine":1787}}}],"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":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fa6834f1a1bf25419b3f7c250e61467a09965bdbd1bb8169846581b0c877b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evidence-freshness.mjs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d876655e2298bffb8b39e16756eceea96d7f6530b0286d4a2e29dd28179177a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"evidence-freshness.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0116d5d1464e6ea3ced4674b6bfbb87aa3586b91c4e9d2f26fcc977206016979"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"298b01abe83f678104cc17f2361d67792957a424fdd664328b04c2d1f9c08949"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"888446bfe317c34f0bdab1522586fb28d45ad2866dcf48ffb10cfebcf0642254"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc15645671b1ad3c0ab6ed908d0f56f28603b44972b57e6afdd3f06f6c531b43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"b99929608676631d3115a72ff63850f32534606f9610340aa095f9f119c9a831"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"449dca861ab2ce4bc8f337f24ccdf7ce18788ac429df2e0c9a5cea0a4f0a00f8"}},{"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":"5aa21880e86fcf1899a05e474248c57e70f9800eed06cf9efb404f292446ad2c"}},{"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":"70fe1e90501cd814256da761a053c976f34b2f53383d69fe9d52302da3114892"}},{"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":"f6bc77e588af66fd0946104f964782e503ee872d872246ba8d3f10dc547ad83f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eaad0cbaeefb59e3127224ab3a49549bb3ea60ea40d955902e9791f86f0d5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4746e9c40f66d8942ed73dd2076b5351f462ef471da3810765f887e4007e9a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a09535308a9a273ed1e5ff7bcb6c3b6e9768b4b19a1313fd87d8a94bec5515"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e088a9004bb600f4733ff80378ccb8115954af8af9dafc3ebc11f46bfc1e335"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"dead08e754107a1ba2f0a5549e25aeb5389d5018cd048e1d74c8319e9c689842"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harvest-buildlist.mjs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"38acc4cfb83c40c3300b45c38834bca126ce16bbbe898953e74cdc43c483438a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":594}}}],"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":"d8c647b0a4f24b28176fc5f906909b6b5c3b07251243f490116ac81e889720f8"}},{"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":"f5e174200519e707c01d0fc7b535ca42284ed9ac5d861a6e9d818f201cec3ffe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8904bb9df1c9097badca3c68ec8bbdd0daa246e7fb959b3c0be804d7b729fd98"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0557af72fcb438c12a0be646c2ac78a4cd39328ca70208424116a5c817e8dda3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"503491a8f5639aa50937ba08d66661d488bee7ba44ac11d066cfa9bef51c48cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"intake.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f6f8069857a36ad2818960e65d279f46cd1b67ade43dc8ed1bfe1157e5c3e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"979898367a10c2efae6c4b20958f039ad4678488dc047e0130853a6a95177077"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"426c37bb2dca8580d9b51ccebb9dfd9eed3888a143d945504c648b4e4e5af889"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":125}}}],"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-api.mjs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12974ec9098d6218e3ad3179e505acf7ba9c19185638e547bcf3af1c0a7b40e"}},{"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-api.mjs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afaac72d060d13a946e1814ade26596d86d4734fefdba9e8e386c56bef9c605"}},{"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":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eae5b3fad8d32dc3f0063d8c6bfaa6fb46d4cda4b10d17ee2ea17f613eb5e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab162bf753fcc27097a16583e0f2e76eb4aa99143855a4f221ce6e72d82f5e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d55be32badbee39c4559bfa310a6db7d13fd81d314f8f32a85c177d31e35da7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4214e1f78cb15ba710c6ab2a69defb42d8f1b6deb20605568253ad2e31e0762"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbf19a20befd1ebf8bc8d6751624e8913f78af4753b34fdcf558196b79c77fc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c6fd4a5f38e66689605418884ee3a726e2eda26de0273673a082f381c639c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":178}}}],"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":59}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"onboard-write.mjs"},"region":{"startLine":296}}}],"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":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c355e01a5fbac4dd76e5100edf7146a533f249d65df0164298a406c933271f3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3427d41899ff92d54c00996ea5843e10c84d203cac8ef3dfe6a05b709a33d3"}},{"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":"openai-eval.mjs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f3f345629ebec64320c77da1c157709873f62fdb6d6e91024b5b0b7a98ed04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92bf155267c1b348d245694b4f00c778c834b1db0724175a6a478485eee26b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df0aaa3fd6bae37b68dc9b3325fc15ce23be111d9b70f1ee7e9f4932cf56e4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd76f1f504e46cf629b914d731a1ca00a2fe049dd1c841ab825bea20cb215f2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd418cc0e966a49ec83e2979b84bdd77f2e14d18bcab01b9b6501dca53bb3dd0"}},{"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":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"559d5c24af02bcc1002c6cb5345e6eb41d835c89d34eb3ccdff7be5e0abd2a27"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04cfe447a67a537e611722b9a2ed015781bd754a928d70a7931afa7575170da"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"534f1188286d696b77bef1b83b2de1cfd00cc0e563ca126e9652eaef06edcc4d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"32ce83ddd5c5b8f3457c379ccd9e8fef1c664444ac1819f4fa9661c0fc08f934"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"9ee02d1907fb23431dd74ca9a9f0d10011b6680547d30a3d411da8d4b549f3a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"363639ea8aaf78cb6f3cfd5e9b6cede493ee6177a56416632c97c5c5f5125642"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"51aad8b5f1a3b6425647c5639e36e3b409fadd7e8657a1642f7e7ddc7d000e1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"a7231a97328372d011555c256c795cd8a2150fab5a10d360c5e54932b8353ede"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"466d1d21a3dcfa8208ed9cf352848bb7790536b7ecad9347c58c240268513196"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":129}}}],"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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f78a38d7e77ce8f7bc483961470c9a2cf1db4e61d3376d80f35279113304f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"937661c0156f7401e795e4ffea9b224f0979881a8b810192c5b4ae30168ed03e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"salary-gap.mjs"},"region":{"startLine":1464}}}],"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":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb73fec3528f98e5cebc9642c36fe8800a841e02bc9df177ccb3987ca739b92c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d6b0f8b896ee4944f207f952418a4a24c4440c0c08f62bfbf2a963b49daa87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af0334e0d6f3976c04aa42145db7f9ac0e12a55141f98761341aafbce1e6302"}},{"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":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c689c3c4290b7c5e2a93394b55527f3537288ac2e6479668a0a2b5ddf9521e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb9b9e85ae4c36fe66bc2a3403495e7399d71134fd36f62245147e5fcebfed5"}},{"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":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc8869a4785e3c11a1a4da9dc1df53df10d23352f6ef7e7c6a5a5193f015c7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1591226fbd17001a72b81dacad5aa6e2d2fb498c09250e9be012a7bf73a8240"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2073}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d5d0e30f9555d6c4575f42d57d4a3a0b696485c8d0c7b7f09c80d426e5b540"}},{"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":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6855cbbdf7f87b26582679f316721e05f476810bba3202af314915e32495ee05"}},{"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":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c151a1eaffb1df5f1f330b9bf40509b38acf03e4e43096abc23360a48cd13c8a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-seek.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"64244c2dcece86f9dcc3901c89f0ed2f1de2b2eb69cadc0de332e2f653336a0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab952569fb543aa16623291cd814d289e930f81fe77b541dd07db87f3af7d74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f41bc6f12b8b0e0a5811117285f2ba5d46ab337bbdbc5032b848e6638e932d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"730510b4f577164caae5ac843efe1f05c5866f8e94b85e01a57c9f786f978e28"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c8e17f284fd631c9597130786d23e38fb6204dcd1ca3b7543a89582becfeb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan.mjs"},"region":{"startLine":1796}}}],"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":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c74a324ac96fcc36d06e4421bdc77d33149c53320c6ab490bcd400012f4960"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fdea58abef116b5613b2e9d0d1ec375caab3271258795d03f071d7859acd22"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sponsor-check.mjs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"81628b1c84fc6c68c61859e587f532ee88da802071b3e6fef9fe5306fcd53195"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tracker-parse.mjs"},"region":{"startLine":860}}}],"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":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1fb911ec3d4e385e3cd26e355f96cf45d5eddd3cb572a91ceffafbb94db089"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"32703b32626943bfbaebdd70dc96c931f47dacff11d7feb0666f01940f5309b8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"943c2863d8a04a4c18fcb8e596255d7ddff254563236fc6fcc1316f30e0e26ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"594ce052b0915b72b42795c55ea43c9660c20d3aecbeff1d75339a11a2fe3947"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"408f36b09c354e5e8e52d1530a6c0eb92204e07d9f6de4be0239911728755371"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16fba9ce3a36b050a7250f6161cc53b10800ddb9ecbd488f23e270890fa1ed9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"780ce50bb5dd760a6dfbf8ff5322316c3efa91de68257b9a2d6d978d78bbeacc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7866f4a4a937b70373c5c598c6a608530489970f6186a0a82c166f6113eb45ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d5b44fbe8cc45e5064be782c8bc02d929d307ec607d9d1e5e23ed6f0dec151"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f118b6bfbd389778cafd02c1b6a5a47658471a8cc20f39b195ab0918044d5e56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c629b5b053b837475e9f451570463cf2ca1d2973b6da4dc55948dd45125b229"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25044137a8713b75631055f8f4dc090a3154d140697ab90c563260647091065"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"594fedc3e440c634f47b66e07d214b88d970619556dcd9dcb563a47af1ba8f44"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":2707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3166981c279aaa1898665ef3e4baf91e7fe715fb8871dbb7afc9f2daeae13d99"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":3021}}}],"partialFingerprints":{"codehealthFindingId/v1":"9574451fc91aa843951bfa2f8e428ba73253c23e635bdc9f7b32ed53612831cf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":3022}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc1374c2f2383c85d6f2e36ed15b0391f5bb58238d2c8934fadcf8d97ba632f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dbe1308fe09a9cffd4f736c90063a4d240d9712ce6a29662db3e7c9f9ea632"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0415ffa5b0615fc6db97a948f01ef3d7516ce705945c072996d37da17e64f7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4032}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe73a032cac315bfb52e6be9c7f0fb06290c69e4fde9c6bd0a884bccf6cf58eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4097}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52291730c1020895418cf444c9a4619562faa960fb98944c1371e6ff274f03b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d796b2f6b55f87cc9b4a14fd92780f36f34354ea4379ab9c023afa80b6fc3fe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4181}}}],"partialFingerprints":{"codehealthFindingId/v1":"35233c10fda7a5aea6765111d783bcf48ae3b6873cdb1aa252694249df3dbca4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf37f69a3b884f333ba2773bbdb8ecddb7d59068591f860f3c342690aebd5d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6758678f0e2ef2e9f8ad47d61c65be94fb57eb3eef54dfd8bf4b241605555a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4525}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eb5c3362eb134152bd90038a8974b36b218b62d0fa7d7be352cb030ef32c54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc99f39336df5bf3e794dac11ab4bf3a4b508bca00c9432ba3de65415d1708"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a606a0682367dd08bfdfdd162c84520c1e50cd803382f39a42ceffe253e0fd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"update-system.mjs"},"region":{"startLine":4650}}}],"partialFingerprints":{"codehealthFindingId/v1":"520fda39c8e64763a7284e454d208cccba3e8a1a247c0451838c3a7172f0d104"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f19ef18b140480b293728d8c293777b680504d215d9ef403a2252668423dca"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":4832}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef4fbe4c3e2fb1af0d9e1be0950a04665c20aa43dc5f63baae35fb0fa8c574f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":5164}}}],"partialFingerprints":{"codehealthFindingId/v1":"25378e5bc192e6c42101c2b6c7558b0d2144a493a990d83d666e5b3c2229c9b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":5172}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a40047a612f2b7a8cce4cc62c10492829271e70bda6d051fca5a3d24d123a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":5214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26edfadeeec72153c1e43a2feb69ab19aac55c055760ed74462f16fff7bedd0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":5285}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc77a45f0a63b5ccdefe750f68143dd17327aebbc6a01860f38b0227470eb29a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":940}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8394e978f7e30466c12211d916807be2caefe6d786bd1323c5d0d870af09de"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"413d619a6cb96429f4bdabe642770e42509763359a13f5e6c1a12b7541ee5c65"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3624b5c4b704def66822dab628b6a07624780710b207010d1d84fc69530d86"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"276f7a2d259063786b60f14d1ed2ea73d52f557836d94ddfc51b967e8ec6999a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-tracker-url-match.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bba9c0b0420a4abd0a0cedfc4305d722baeebc91e62fff13f6f4ba45dd6469"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923f99f28a29d4e4fa136497f985e91c892e72ee9b1a959a8dc0363399dc099"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2724121ed7a31651a2429b930c18011a60af427d1cb10732cf44f6bf2f1c9c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":133}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cfcdb4805a7438589fbb3f6b1fd63feaece49a9951956756d2af0084566c37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/documents.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1862e82719baf2c52ffb2a144689a767a1745ce17bd5aa06925d113e21d7fc1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"1afcd9cc8b60d6021a40ce1a9811b71695ee359e8d65bad62b0c3fcb053f1f8b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"528eaa0621c65f5b76b7a7dd3d85293ac453b6d7ab8c7880447096fcbaa59f46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-plan-usage.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6be200f1d9fcebcd2d7d3c4e34684b3a03125d799884c554b4c92c9a16ba504"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-plan-usage.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f14968c85ef8d7ff4acf6b2504ec1947842e3121bf1a94496f6b81798147b7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-plan-usage.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8733c527c1e6e99db3d9f732bc835608692f0773bc5c831c8c50f465ab1c230b"}},{"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-plan-usage.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"441e4a3f1fd0c94234ea26269c486c1a4a1656cab6a2d7842f0adafc476f813e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-plan-usage.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9100f40ff0a44588e84054e31fb6df44d2991143b73accc0354a083c1ee2e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dca97e09537e4ec250021d186f5b274cc4ec5739a78586024dc22ab8f6437b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8fd9dc83738c8fdc35b681157e72af378fd0adfe8ab8526da9208778f6032d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b145d69576e1f98d222910b32a3ee27aaf06c17212816e2c82c58ce20b07b444"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/lib/claude-usage-scan.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30cabe876819e80749a0857d07caf2a69438e18de2fa93b86c6b66cd88a6020"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c376254fca30de4ce76d6d6ad2d85555d74bc1fa535a27f8992c4da48580905"}},{"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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28eae002350d54fcbfc65ed2997e52395f5958b78bbf5afea7db5acb7d8518e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"54ce3f91463efd75c079b5b4acc2f2d5bbb9b8b1e2c8b7d348000f9f74d20c64"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"85c5a6fffa7627298e9715d3edfb8c3b208ee3453c40a5fa5298023ea6aff330"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"3b72b63e467cc84cf3de5b922f5cf5ff501de79d7a8f6591260a04a9a909f2c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":79}}}],"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":90}}}],"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":230}}}],"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/web-service.mjs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f6d911e7d044f74347c84e4b6a7731421c41636699122d6231b646944e033e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"e9876dc2b04ad5d153c444324ec046cc4381b68aee0d9fce7d2d65836634e4d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"5397b978d15a5623f7343d81cc9eef6193df0d0ac1523b7aed42c0dcd27fe0e2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0d668506f1b318c6f47122d3baf121dcb81fdd7f316f4de6a8d3c1a8a9361f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ef72610ee22805bbfa762a30e1b9e67da585bbae6104d23aac1cf48c46e517"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"66176dc8126da900502c1c31529f5cf0896a84fbd037d4b83ddeca4ac8ad1cb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"111814ae643082f01c5f7bbe1670822ee97ffaa739a6988cd8a35da7a751abbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c80a251ab82c5c9caf498b993befd266b84e6f06f701995c32b9b467534c895"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd188a1fa74b68ab452960b1e7b8822bb81633db39089a103a3355322ab675eb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/ingest-output.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9e382e1d30752b979906f1983953da1e38e8a5afec066c5d95115ab533c2c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":63}}}],"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":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5e6e4f91e59a4f4f0a83dfd8bcada330a7ee2c2e5e0767a8e6c0db285b191a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5288f542b7db3215c8fa413838548496bf78c7c63512d4d73c319f74646fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"5c9674317f4096d0b7d682c49925c90e0e8cfc7a2fe2db051115731e1a45fa84"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"05eb56aae98109efef00d220bb39396945aacbbd278f6b0795ff6edcc703c695"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"c19f483acf1452bd70dc3997121697c33053fb83af904b0255b6ca328b3eace8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"97f4e5208763dfd08c31b3db526e0f1445e3285291e6a102380119e21fcbd225"}},{"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":"feac4de480c57a15fd0305a987f1ce7d9b845c0e9dd5af0e310b92456af8443b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/cv.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e75ebbf2ae33d978fc4d61022065fbed2eafd25085e797c8bd332a18d104b5"}},{"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":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e6e8f9125f399a2e5c959fe24ac25517e70f069629a4f868b08ec09e703e65"}},{"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":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b272b8339a5998e7f08c91757339f41b51ee0c85b45570a631672533da949"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07745f526230c12ecbea27bd3674b4c56030c3cfd50ed0b07548ea4bc3297a9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac0996b64b51a7971727a0dc7dda0cf210ce968da5a718b7fa2dd113133b8f6"}},{"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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8df1b17f26eb4e5f34d4c6524c4661865753efc82fc7e257cd65ec615577fd"}},{"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":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ccb1d3fc4c5547ff8d50f3af1ecb1c5c247392f2171f543056840b782935b4"}},{"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":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf9c6543a298bc869ee70edcdfb17dbd614a613024f294ac513e8105410c2c7"}},{"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":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e219a055d0c1f8414618145875fc99d7cace7b7c586bc445bec3c0b7e69802d9"}},{"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":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f638ee7b3e88e151d19928ae6d1a8ea672f3b370d5a397f2518564a09bcc52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9026c1acbb39e466272e2569e0cde7cd3dd411b143bfae78b85f67b3fea033"}},{"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":"4471e27851cb6b9b973fe3f58b65b547661565b49ef60f514351bcdf23e8361c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"04bb2caf1aa59b5a971bacd0b85c5db11ac459e34214f9b9394c094e39a0e209"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"1ecf3ec7da639de6a7236c25216fecdc87f6619d3aa366f82a9e19f16c09241a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15c961743b65cb424028ff25bfcd1007dabac758a3209010e053655afd1193a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"990d85321b6d3c4c457041fe119b837bcc5c8fa13d23d99ff5bc4d7ecc852788"}},{"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":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"830e1cc44570326c6f073fc57477abc1c1c757ef2fcbeac399c7b5d3a6cc1fdf"}},{"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":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efcebc7d8f827cca2e5e3b5d2129d707ab64167b9c7df0e35a80e3086453b1b"}},{"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":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17c9e7abdca5fa811f81547414dbae19751d2abe2c16a5a0b07661fa0c157a"}},{"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":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2707bfbc43b9c08fa52adafc50612372e2c565e93717472f75fa437ff809f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd926367118f0f8828edbde79a0f7b73747edd60b81b71ff6375822f9f806823"}},{"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":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed1447dac306dae26526afca953fbcf71dd1530f023d62247e24fdb9690ec58"}},{"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":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bf0c6b150d9b8127ece322cbde866180dbce2cec47d9ed44392a9caa29ac32"}},{"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":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4d1dc03e976c7d7a5cab1cf7a382f00eec821226ec6d17181e957dec5c6ee4"}},{"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":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"666661369923de3ae8750fe865fe0548524edaa1a610b191388764ab1150a1b1"}},{"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":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"392c048169c8c01b8ce8621b1277b081da9a0ae8419538a2cf0ab1d4b045d8d1"}},{"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":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc3f1068ecf513e26a07ed40f65be2d77d4948664802c535ca054232f787d9"}},{"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":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45fa5b5538642de14b633a4d1dd1671a248c127c12de6e9f2cc03c961fc1ee3"}},{"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":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a16d8215327e950dd9a4f9b26b5e15bdab47d66d069674cd93567b61451765"}},{"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":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f88440d4b9a8c62281e6b869de00589d219e8e6841980f889439eccd4f4ece2"}},{"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":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"095ca729cf5ef89d088dc6f6ac34941b946f22fb85fbf27b375a91b2fca9d63a"}},{"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":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91f87f8be6f1c6d871756205d7db748f12d0e59587c9ab16f18dbd5b4f0f4e1"}},{"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":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a85a83a6863e45633da3d81eb60e9103e281a4fbc3cd87bd264115070b9555"}},{"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":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4df210c8473b342da8abfd2f59b0a2e5c7b9c0ec04b141e405d71178590c24"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca57a6e8a5a809147423131f139fbd7f98c7b725f02d4fe8da27ab46300388"}},{"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":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9e913b194cf1a76cecc186a9ed8472667796da278cbac1a42d9689fd63f3a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"0553420406bf6b728f0f697b7f6a632f1c0b9826127c9bf3c154149a5969cb87"}},{"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":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"e014c6c7feb4ff888a6d648e39018aa573905bcf2d4fea406044f188f98c3aff"}},{"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":"efdcead97d9d200b6244cd5d66533c7b3104ad6e5c9b7d352901652166948414"}},{"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":"645ed38d8c2bea5cbaecd0934203d8c73af02dabf0508612629fcdf0e9469a6e"}},{"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":"b9256b8ecae7aa1648dc2eea1b949c0c1581738da4911630f960a6a9ad0e7fb7"}},{"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":"f5bf7a137e4b3ae47879e6b5cbfaa67816ef773de7bc62c79c24e640f9fe155d"}},{"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":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd693e9f159d540afe8a58b578a47803bfe3b1fd76813b6e8f60270abdee9de9"}},{"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":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9f31c4ddee743d8b39e801cdb774b5cc6a8cb5464477303afa677afb94b6fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08120e2552969310ac062c4381a4957f80c4b02a27399dbd5dbd1993a5f0b35"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe18b04289eac7eeac71aedef1c069d0e2a08d51edf7cb1979ee3d39eeb30b7"}},{"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":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51d7d387f716ddd141412ee4779fcaeb1d921e2090bf8b156328057f072886b"}},{"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":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8259ab58783aa355b6ce37c91ff0056c2cc1b2b640476adc083f6187c5665b67"}},{"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":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6da510c4ca2f7aef566949a681a83febef23c0dc67b7f6cf59fbdefe55b0d38"}},{"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":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2904cb7ae14ec1a903ff86f60f74c36df6084954dd56cca254fc9d0dcf92956"}},{"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":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d86ec920e3dfa708b73b9db3ee2eebfe73e3511bd4ebcbb2cf7958bca404cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ab25090564badd4a883453690ff2413301b3592fda2df3d141149eaf9fa2f"}},{"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":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"543a21696f50dd24eaa7abfbc012cd5d411f5afb37f03b35c0718521d75d5030"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/assistant-console.tsx"},"region":{"startLine":740}}}],"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":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dd8bf43013784d40b56d8de24f98d7c78e449a91fcb30dcf52aff4daefab14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":59}}}],"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":"2a7ec42669c52769f3484d1d41825b3f779464d74ba8bc22bc5ee6d76bb7e5ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"4247cb1ab92fc168665a3850540f3623bc33a6e58cba4c7c59c1c46b49fb6166"}},{"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":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b969924480c0a16c27ae8ded5855a94f8fe31819ccdcc87dbb314f400aad8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/onboarding-banner.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada29c0ddf6fe366908cc1773a151ed4c77be18f605aa53dcfe6b74fd5aacbce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2c52bbf149a0c2443cf8e4afc0bffce97b8faf2f7fdad70260dd8624c873c8"}},{"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":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc90bfd3cc4efed6f84e488c9d955c626acd519478e43330cfbcf6355f41995"}},{"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":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2933b5af0881e9baaa832c61bdda903bae41b4fdec333fb1db594849d70a99a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1bd62b1e8d8f00545a6b37e6d9f577e7c380406b1a0ed3be7b01ca3ab2af30"}},{"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":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ae17a2c70a6d04fa48c2a30157cf19e5eff27b0bcec7b3221ea6156f1d6022"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a8f5b5e21f95b9123a6e8b099992c82918736c6db530e58705a10003bbb765"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d73a75f1f4055ff8fa3669ed10d8dd4156d0a7adc9f43ffb55e4b95cbc482d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2f3c67bddc9ab9c8675ed916a42368af0e46affbee33e2cd67513d43961862"}},{"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":29}}}],"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":"0dff17e455024440036c3dba19a1c0d7e3af2b4725d3160422f9f42eac8a78c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8900d0cf067b61b90e8a3055020ad4fafb21b5b6e96d86a730d2dc892d9eebc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1012d363da1081e4a76ff345acfbb75abbb9ffaaeebc0fd0731c75496e1cb7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"54190eb026d38a4a0f8483d0be8bbdb9047dbd014b34631c4af17106f36199b5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07b245d0eb60d2b23503b9e7afba2e794fd9100028113725609cd17ed1aa805"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":121}}}],"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/cv/cv-ingest.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"35345bae20b5f309af6b09a7b07b13e50709d7d5b3104d3e0d2247a48462dcc9"}},{"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/cv-ingest.tsx"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f966a872306da5ecacc677346a428aad67a167ac68d6f5002c7175bb7352a"}},{"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":64}}}],"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":55}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":143}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/apply/apply-provider.tsx"},"region":{"startLine":295}}}],"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":"9da4d48b1558baa300dee0c6bd907b4b58a3fc6eaa5fb53de6d30d29a0d82e19"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"609672cc60a2bb2ddc9497d8b0a7bbecfa3f7dee86538d45a472320468af1fb9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":74}}}],"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":"b333853615360799d0d4b8addc56d54f54e47a0d30bd2237c2933a890d034d9b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"a327506b1e6327c2d56557dce6cd4f1b55beefed4b0f601dd4e8867ee5169486"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc6940aca8ab741ef95fadf4dd5995d80ffa672df39da8a19f56d37f456c262"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c13f0a7869947c5bdeff1978a4dc7968afd14f1682176de21bc037829f6cb3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95480526c19d37fffc9e6b428e4f0a023524699f83c4c09e92c48a325e6d7c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/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":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47282b27a27e36aadd9619abdce102fa40d4cc3c74c4adbaa8aa9e04bc2fa3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b430066921e9f13ca32171e20c28359f82725be24af13bc272c8244fbc7ce5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac64abbca75a0e178a287f813743b50b6a2a80b9f1397f017ce562deafc598c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1aefd271b708e01a8ea7587113610362c866aa59893851951b13e2a94f8c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d074b427ee4eb525c58fb6aec53cf3555688c7319c8b3b2eed925e41bd027511"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f852096cb04b1f2a0308dc43c4f1ee810659727f1a728b2c44a8c8627a18ba02"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d1149378866f4386bbc2db92c162f7408780b4df6cebdd1eb74b2c3f9e69c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab04070d4d21ef5ec2ec47ba5a07d89de021be9a90b1f1571bee40a0d0854aa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae7dd79ea419b3eb5f61693de8c3925e7110f6cdc5a636195357b0c1480eee4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"8f09b0105f465bc82fee7b33072423fb6411c12ba25ec4eb0a5e57f9af87ad5b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"b9110d6591654f71d0ac4a8f058bca099e177ad8aa6b0f3e47f1a68d0e65d230"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"d2158a05b28a77f7e9c07d02b24943365b1088dae58195a036c772caa6ad51a4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"3348fca7137c3fb1eb9382fcbebda025ca479d269f63532500b8b961b9b1086c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"1cf04f5e5be589cbe896a8b0858acc3cf78d58b84a0cb1b446ee41e248380e60"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"39c460edf9f4c616a1b4ed5a146923d8c9848fbedc8c7d4c0afa3d9c9fbb955a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"554ad5afeec412bb9b05282c5b5f44f8e0619dff090cc823ee55da66d2a8ac54"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"c7f25fb0bdec1965df01a893586ef73eb045b8c1a21842d5c4f2eafef06f0280"}},{"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":50}}}],"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":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7df5d323ebc38426af6165a115ef858a5aa741e6a35112b45783f190a95531"}},{"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":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa78ddddea893e0ee7dda197ccb504791e16381c82cd6834d6967066f7e4be"}},{"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":380}}}],"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/employers-validate.mjs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b883dcc774ac9166198c4d7a29bc1307cf1c231be0c68deca74df408d2c35c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"seeds/vc-portfolios.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"871c809e9319b02f037672749cb60e0235eaebea621296a288deb02e4b51ac6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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 (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/_http-cache.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1296c849040461407b70f6397446e558a9d1cec4bae95b2a2f81105d10b156c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-cache.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e5ff6aa14024e5bc1f281815e098d2e634dad05538600d1a879e6593d54253"}},{"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/_http-cache.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"330e7477969768f539accf15883849d89b4a7a2976f2d12809ab484f7838c7ab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4af03d78b6e8b4af3b52916b19f3e92faf20d38d07f088dbc0b236901416b0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb35d12260226eec6688121a40316ac256c531bc5d7232831fdbe071722a82c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd03dc9163e9b74abf6250ddc9f41209339dd60ee9e043aa4e54673526a6bbf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efab7697df9d953eaa73cc573f5a4bdaec22d9b063d308da616b1f93f50f4d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0328f84b40c4c1cdb430baae1af8ff87de6d8370eb36d729ef0353f8e2787aef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d461289fafe7f340bc3e1d51df36c79d9bc7c331367fe2e5fa3d883d991e8841"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"15107b919fae687083b8fbea81627cd08746ebcab85dac8548567fbfc8fc0f1f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-myjobs.mjs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1594d9b4d058710262be6aebd56ea92a0b326bc5831a35a1c20c8bb1922b77f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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-myjobs.mjs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2a17b9fd7b4bb3e81c9c2ae3a9dda0d6dd07b41520ed9f5fcbf287b20bb964"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/adp-workforcenow.mjs"},"region":{"startLine":102}}}],"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":482}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/amazon.mjs"},"region":{"startLine":78}}}],"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":102}}}],"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":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e94ce0ca8b57cb7f5d9a8a7e046d8d98f000c4175eec2e0d43afd9af660b48"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73c5867ba1f490f66f65878b36b5bcd37fe68a6fafbbbb977777f76ce002907"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/applicantpro.mjs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b842ebb9a699245e93e43adf53505589a6da3d2c20010a9016c90486a2682cfb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/applicantpro.mjs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"97611b36dc65ae98f74fdbec38e79ade8e5f3d126ff139741c5a44bc0585875b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":86}}}],"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":"699a06580abf6baea9b36aab44140ee7efcf20dd67578fbfd0c422b0650968bf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"95fcb8b4eabab15d57b2ed6cacf89d137116f0d6b2fc3cc752f9ce5f0e8f7a0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/avature.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ddf83d5f5854bbca2f0b9d113e071ebab079efaab5eafd9105da21d43a112c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":209}}}],"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/bamboohr.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2770ef3258a6faffd953c94c7bdbb1ae8a50cd451f9011b9c4eee6d5c54626ba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":144}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fb61c15c8ffe534100a3227f25516508324740047cc49b47b8c6f229d48154"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/builtin.mjs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033d4bcb0d14386d18e0919ba47e790138f4e6b732e0c3ab3131134c35e59ce"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"81a07a34341aa3bb85bc3c654e43ff2c80139f103c8bbeebfe42daa7c5ff51c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"a694b5090eee798b5c6caf0e9e38fbb66f300832f37176323cd978fbe61c7b08"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/careerviet.mjs"},"region":{"startLine":221}}}],"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":138}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":198}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/darwinbox.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4ac407fa4d1c7d028d473708ecb0e44b54d542695357115d46f6c385cc00e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/deel.mjs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff8a8cb692f5fb7eaa6a2ea3aedbc636cb9367c15bb18eed03fb4991dfdbc34"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/deel.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77b9d9a31f57b52aa51d74a885b10ae3a770f72bf02aa81e8a1339e6a34a40f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2a845908833c146aed5cc81d25bb2492cb576572ba0c5e348ecc20bb5cd073"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/eploy.mjs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e159f9e3aba2fc0cf2a92eae0bd3ed2d1f6206be08ebf6270deaac15991fb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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 (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/factorial.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbb3f961ed7980a28f0db95407146910b1cbdd3406b405929a8e28ab375f084"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c63e7b821e30f4b1174efecdda6aea522788b985a81b020d5356c932e630217"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752ec5f097dcd1ba69ec612f1a61e8901ed73927243b2b08647ed4c5523076a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e718b11bc3cddf8b5d03eef8cb9e959c63b41078f0124c38137e7b819a1cea2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":354}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"888a58eae9209ed2f3700967a7e21a76fd4d060a4e2cf832003369699c8dd9c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/hiringroom.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b571d7a2297e5a6086b09cf46f991b03c3b1caa9273c1a26712ae68032809ec5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1641ab1a8961b1de323e250ff92c355a0d25b67bdf5ffc247243268eb953ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f115b84627797ab5c94f60f34c91dad561b6bc8417769a6bc51937f48355ad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/icims.mjs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"9704fd40f8421aa03afce8d08f17f153cad1f9a1ebc8a66e986c7db459f20ba7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"fadd7d57f21c3a47106e578e558571411821f49b91280bcd99789ad6fb8087bd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"59e3bfc3feffc0511fc3f1d6cafaaa8f43231412eed48719f6c25ffe21c99cbc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e4ec9949a88ab8c63239b491b1fae617ec83a18401e1814d6c87360c210e31"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc80dc7621261c1708acf9e8bd6265ed742c13a6bc308d53ac8ebda56dcb51d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":263}}}],"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":124}}}],"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":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a124063a5e4a0368bc13600dec57ccfa271c0a501b45f3b2a64668e9a7602d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/keka.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2b316d3081952ec8738b7ad768318849751cb8c57a22f26d33150efafa9ec2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/oraclecloud.mjs"},"region":{"startLine":103}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5556edd9392b970e87541c2a82306a84e3a1a961449c3f906d3ed98dc4de6a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/pageup.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc7fda00e337dbdc1c2dcaba152968e6938154ce857038d2c76984823b431e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"5cac6de4695f9871e20385c2ad8352ded1eb4808ffedce2c74727efce4c6e5ea"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"333a0f527dbbcff84d5f5d4f4f9857f9c49836f25aa4c9708c972a13309b920e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"e8a0e34c1d17526bc664d156562a80ae0336d2536ef3326877ed97507844a46f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/personio.mjs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90bccab5082f1281b7ac8261504b1c5b1e550ed44d2bc27a86b7761c3794da2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":147}}}],"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/polymer.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6778624d8feedc6e162e2c9c5e66d94e778aff1f1c9689f720298b38f70bf7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/rexx.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f300a99c1b7939c922a2fad0dfc3e6ac64d957e524d3a30fa7ec54bfce3140"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc30e941f815596abcda2e2e61b28b7f1d5e4b30ce4a441993a5a2b36c84e52"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"730e80d5f1a753eeb4d1c1f7e0e6d963701b9a3f79740d18d76e95fef45372db"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/sitemap.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0b2a1799f2b912234eb0a9a5e7e2f3fc0e5980af1d9273f7c2161924878491"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/sitemap.mjs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df9e8c5bdb28ef36551e7bb9c6f6fdded4ca3f462d1b46bd71a6dd726b3e32"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/smartrecruiters.mjs"},"region":{"startLine":130}}}],"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":235}}}],"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":381}}}],"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":"d7202d7cf305e8e67a161a9f265f9a940febc88229c50d34512a0978d79ccf87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"14017c6dfee1e53c5cb53f1d548f5dbec353451d6f8f10bc7ecfe1ea9ccee276"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"972bbd752b824d3428aacafe55e74d6d58ac08c4fb664c645f185024f256ff06"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"30da4a411135935672a451bf492e4f6e32b9b5ea0f671d803987cdc4867d899c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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 (empty catch): An empty catch block silently discards 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/trakstar.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"53284d5912b11fce3074d58983f21b3e5ad73850e726ac03a84d4d36530e4fc9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"providers/turbohire.mjs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0a8fd57c3a4a6f62e8b429e8c7d0e557fb8a50d34787e33d007f0f22bc8f69"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":308}}}],"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":"b638aaaf3976851e654f195bd00882fa3009d4b7592c4deca8a67e8de063b9ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"cc574c7fd99b22fad8bebd73487de4c9b06c7fb962c35e715847c34bd7d7ed8c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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): \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/_engine.mjs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eacad2736477dd26abab149c2189a93f4aef9b2a1954d7fe9dc1096616df59"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90b8639d26098a479fd409ba742566c67ec5ce24aa174e06462a966b0a4286d"}},{"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/_engine.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d76a6442620c7217c579345c8994b97ba6599db145632306acfbd7cfb097f95"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b5e7362c8ac16353601ee6713d592ca062fa3593c15004e5e120614444efbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5160ad2362af5e98beb46389dfc391660c1c338cf58e584e7a394adcf3874f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c075fc3ab57d585fdd19816da73591a4f74369a75448b944111654c63cf8cca8"}},{"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/_net.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"17175c5a77dfba7d0f5bb7d62737604e6130b65d1acbce37e61d58ddb4bd8d1d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"5d6cba24dcc72e959bbdb70743fd25a0079fc4773dac2ff5537a71455a4c6374"}},{"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":"3a4958045890165617e3135f7946029eb9e95f42c06bc0fb6a92c2a0f13f097a"}},{"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":"dc4e4e64917cfe487d7d9efe449607aa107e7f3095451882790cb0ed957e6a25"}},{"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":"a7f99098f26ec20d53b0c87e8d693c5846d1831392169b5902900240b5c4d27b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"8814b71037fa2db101a85e87ff72b932540517ad7ed1c0f18605a87162719129"}},{"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":"d2499ae920a918b79d0f1012794286d5cd27262e6d71c57d7e45cad0a2a4a84e"}},{"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":"b94231cc8a147230aceb01e62b9b6d55764da89ebc3dfbcff9cb8b2590ac193a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"4ab4b28885629788f9db39d7072a3387b8d98009c2b3d8944239fb216185bb7f"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"c3a83679e0c5f88f1ad475414c6059a5e09cd81bb301fa45152799c62dc6b7a3"}},{"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":"f9dc4e764b983bd95b170bef55f3143556b74b231efcf84a7925c7c8a5b6fed2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/browser-launch.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7d15c4afc8e4716924847c560893dcbe4778fdb29e48c886cbd3ee1636581"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"08c38df4e3ade61ef84b87653de3c740fe67f0dcdd445a04159ef77cb0e22f6c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"9598e1b52c176e32a74db3003ac7bf3caa56ff85757e701b1fd57f8f6205e681"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":"f4f02e9aad456a047259c553859d51f8e127b93100b05d738ff4c7121a723839"}},{"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/jd-page-fetch.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"24264a9834736e06de8d5c627a054490ecfa82b86b6f4f37e95e239052e738b0"}},{"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/jd-page-fetch.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274a979611346e086bc6e6b67860bf3dcda6a0271fa7c7f8131cf126a6f1cb1"}},{"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/jd-page-fetch.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb64be176546acd062d097396244c16650bd66c652917d21c82bd90fe026b920"}},{"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/jd-page-fetch.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"009636f7e0ed5b07dedf4a39c426299d717e16a761ecfa12ab0c59dc3447f661"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-page-fetch.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc5035a1b5e0d76713f45049527acc9715b8714cc063858f1aa3e7fbca6198"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/jd-page-fetch.mjs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d7c88a3776720f35e3c10380daa20f4d5553464574132786778ac27a8f248f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/jd-parse.mjs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a85cd685fb6f5e18031a3919ead66dbd8ce31ac4b3deff4f4165ec4bcfb5aba"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/linkedin-import.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"20368fe34bfef075afd455f161b34af3b8a793f13ef26b764b02cdcc7fb84b1b"}},{"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":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b82436e4cb306c1092283e428018300fac8251f30e1508978505bcbdb307661"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f649c134ba09e51a87064e8e23fdbd5ad13bea450035f9294e3c076f5f96be88"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/pdf-server.mjs"},"region":{"startLine":433}}}],"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":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"375caa926354752ae80443c0cd5b8ab8ab1668f7fc6ed7cf5cf14103aaba7eaa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cfe0615892b393b0d262c03adc4c2e4e037784d2bbc0402642cf91d74dc4fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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/privacy-guard.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d287e13b0efdba44075c71f37a23ff3002310ccac3e31323a015273959f11f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83afd1b0144becfe81c3626c26cee4e51cc9810edebb760f5e15d18acba8107"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/walk-tree.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a927a04f86942b74e3ac90773d98a143c0f3631913efd2d1e40bbf9e031fdb92"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := clipboardLookPath(c.name); 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/clipboard.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"75813a0e27c200772042b6fdae5e4c24b1a8935bdd995807792c94cf91112da5"}},{"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":480}}}],"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":794}}}],"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":1233}}}],"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":647}}}],"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":292}}}],"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":330}}}],"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":395}}}],"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":436}}}],"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":479}}}],"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":511}}}],"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":581}}}],"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":1284}}}],"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":1333}}}],"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":235}}}],"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":277}}}],"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":319}}}],"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/pending.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b6414046fdee72cb4f111dbbde7964353d4a04bdff22d551c5e29bc0be76d"}},{"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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"batch/jd-rescue.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca149b59a4ba898ff83e92437b6bdeb38f19b30f1373b0b4687980029b8b599"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards 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":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"08af85a2419aee3c729d212c8c9b424a1e2339f59b7798a8ee1e1e0af4915f3f"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.4 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 13 assertion(s) across the 32827 source line(s) of the 256 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. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This JavaScript/TypeScript code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"openrouter-runner.mjs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b112f0fa03002eb92314a291eab0b0559ee6fd38ba1e6de93dc8731666410db0"}},{"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":"openrouter-runner.mjs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1828bdbdb3a928236d31b7a86a32b1496a5266444d91997b19240ad55faa5d16"}},{"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":"openrouter-runner.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"762f114203c2bfa43520faf07646269d171e722545c903bb0fcff2de615844f3"}},{"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":83}}}],"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":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45706d213ecd6b801fe32565c672e8a92ec45d1c6886e756439aca84f78f572"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading applications\u0060 under \u0060loading \u0026\u0026 applications . length === 0\u0060, but \u0060loading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/command-palette.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d05c97dd575fedb2e7a7a24be3a8146543a43dd6acd80f8ea54e208bf775f3"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 class=\u0022size-3.5 animate-spin\u0022/\u003E\u0060 under \u0060busy\u0060, but \u0060busy\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/components/delete-from-tracker.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4cc3d300e01e7f0cdb556d06c3ddac9a92c9935ad8f643004fa3b37d460fcf"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CJobLoading/\u003E\u0060 under \u0060! ready\u0060, but \u0060ready\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/app/jobs/[id]/page.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"39675c97985fc562be330dee4a8b3d14b4818f2ad7b89c0057063efbea546fbd"}},{"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":277}}}],"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":319}}}],"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":1233}}}],"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":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0affd08bf85244176b4b84d375e5e7599ebe4a952ed537c4fb2820fd7e7022c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linkedInCanonicalKey\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":"lib/linkedin-url.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6775a746c03ad093e17d3375f9d90b61fada3fb7e0aef4a6d122955dee917632"}},{"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: \u0060canonicalJobKey\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":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3187333adca910259633169878c2d3122ce24ddc014a655f7923894752bfdb2d"}},{"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: \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":845}}}],"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":2034}}}],"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":2795}}}],"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":3055}}}],"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":6114}}}],"partialFingerprints":{"codehealthFindingId/v1":"69172ae83e54d268e8277336f46aeb13885a64874b3737579925bc6729465eec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060subdirs\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":"backup.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c59214a071b7f0e771bc3dc8463ddbb5567d6f2f16867e14d4f49f034d4f536"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060jobIdTokens\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/jd-page-fetch.mjs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f929d8e2881dc20c8602fed8fbe77ce9aadd6514129496e7006c6fd797b4035"}},{"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":80}}}],"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":136}}}],"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: \u0060readCvPageBudget\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":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82a9c409e5b31459c508715f6396a497fbfa9557c11b3f1ad0d57a3a510033f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060wordingFromFacts\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":"cv-voice.mjs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b0d3b410b044c81e0d41ee34bda8a9df76e40f6096f0ebc08593d9474d1ebc"}},{"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":150}}}],"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: \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: \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: \u0060linkOn.\u003Creturned closure\u003E\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":"lib/invite-evidence.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"566db828e2ee2b1880057a86416029d5ed4b06a45f370bdde7b7df7a2f40c444"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060companyFetchHost\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":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eeb1b9910aff7036bf76971540681062fa401f6241dabd93df6fb137034436"}},{"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":674}}}],"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":1640}}}],"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":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b9797a880dc8c339a8e7d587294da81767d841ccf5fbce60df058fb024bbe8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060historyPolicyFromPortals\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":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"10df46347e11f903808febbe7d646b267e5f0e4ca3dd65801c66955bc669aa3a"}},{"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":2130}}}],"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: \u0060countReports\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":"community-asks.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"360dc3b367231ed6aec04655b1692effc50e8f2ca49d54a77fba17063e60f73c"}},{"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":1263}}}],"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":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"042c8b828f18aaa88f659fff2d9c0983c7ff81efdeaaaa9a9c3d671870f0c62f"}},{"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: \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/germantechjobs.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5f9ef89a67704dbefc9c3d0e438ebbfd8de74f534294f908ec900aff299e4"}},{"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":150}}}],"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":78}}}],"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":157}}}],"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":106}}}],"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":181}}}],"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":182}}}],"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.\u003Creturned closure\u003E\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":297}}}],"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: \u0060readGitExecPath\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":"tests/helpers.mjs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fd93de845ebb8fbfce65f95a40491ce0bf6b93ad374ccad12f858968bfc354"}},{"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":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4cfe0218082ec2e793ab789cb459ebe6281834bb2f0e84162922702510e67"}},{"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":138}}}],"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: \u0060pageUrl\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":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"973d0963df247b1db4b1c2201aaaadea1e0f7c4954907a1a606307959ff22f95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060contextPages\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/apply/diagnose.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"453c7513e87b816cf359cc184411b97d4da7836b528ea70a91b2733dab843bd6"}},{"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":446}}}],"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":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"433572862055419605c00a7fb0b66ae28f4d3faab804d6608997bf4e94c9a4be"}},{"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":"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":62}}}],"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":"474f8584958c1c810457aef66bad821d9fe3c2f2ad9ab8a484a4729ed3d8d5ef"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060postingScript\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":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"af90de7c9c68722525ba2461bbbb6799dc07338c6b22103e69884931b26ba242"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060linkedInCanonicalKey\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":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbc2e9d6174936a852d9fae8dc4dee9f6f382825c91c422a17d7b57183acaff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060canonicalJobKey\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":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5d1e8dd550cacfa2d76fefedb4beabcf94106126a37b84c84b02974ab3a782"}},{"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":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7ec696c259846002329e6a46538634e4f787899fcd1c036fb422859ba37133"}},{"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":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8689387dd802f85e0822999d5216f7efc17c5df47c193dc2fb3e9a2851060db5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseViews\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/pipeline-views.mjs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c41ae8d8762b091e99c1acba2a4586145956af12f000bbdb7ad7f5e8e686eca"}},{"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":722}}}],"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-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.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-457","guid":"b62874fe-6222-8b5b-8ade-9527ad1cbb4a","name":"CWE-457","shortDescription":{"text":"CWE-457"},"helpUri":"https://cwe.mitre.org/data/definitions/457.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"}]}],"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":152,"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."]}]}