{"$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":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"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":"bend.compare_go (cyclomatic 82): bend.compare_go has cyclomatic complexity 82 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6be71fe31d58ee770472832c8f5e365b1c532d70cbb6dfb95cacabe4d35355"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_wnf (cyclomatic 69): bend.term_wnf has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72c3db7dfd865a9c0ac86b9d8590760a01d711f1662ba2c7e7b9ab9bc3c78fa"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_term_base (cyclomatic 62): bend.parse_term_base has cyclomatic complexity 62 (threshold 15). Of this number, 61 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d9bbc915e0f06fb38e1dc41aebd991dbc6296640f29262a5f52285df83f09"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_check (cyclomatic 61): bend.term_check has cyclomatic complexity 61 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"028ddce0eef4e1dcb29453654d4b486e2d5a81f1acdae23e447b488c7fb95c3e"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cli_file (cyclomatic 55): main.cli_file has cyclomatic complexity 55 (threshold 15). Of this number, 53 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":"bend2/main.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d121a64ed62dc0daf7e80ba7c26aaa39ca1d96febd21b56d33d528285f529c7"}},{"ruleId":"D1","level":"warning","message":{"text":"safe.tree (cyclomatic 54): safe.tree has cyclomatic complexity 54 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 21 belong to 8 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":"bend2/safe.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"3513e636f4aa21f0fcd0a7e84029a916a8eae119e3da711f362b61a5d7c31981"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_show::go (cyclomatic 51): bend.term_show::go has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"0257d2ac3486eee3bf6049400cc25c9a3adfc27ef073e4fefbc4e6539c97f152"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_term_ops (cyclomatic 49): bend.parse_term_ops has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f51578540aa1da1a687de338f6c720169eecf010a9abf84a48973f46e7a960"}},{"ruleId":"D1","level":"warning","message":{"text":"film.split3d (cyclomatic 48): film.split3d has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"701a3f463f8dbbfe08b5fb5a5e818a33462b676b2e6d8ec77d11e99daff3760f"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.needsSpace (cyclomatic 48): formatter.needsSpace has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1ab285a287ffb18c7e7d9767aeb7f8c80e7875b24d161cd62217919d80c91d"}},{"ruleId":"D1","level":"warning","message":{"text":"film.net (cyclomatic 47): film.net has cyclomatic complexity 47 (threshold 15). Of this number, 44 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":"bend2/docs/film/film.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd923349db606f35b573f0ae1f1c2935339b00f61979e7d49dff4f4688a2899"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_infer (cyclomatic 45): bend.term_infer has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c233dfc3c603238434bb60795328232972d708003d72ca96cc351e4451223ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"format.format (cyclomatic 43): format.format has cyclomatic complexity 43 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ac09ee0d8523eea3fbe2c4c19c885a179584e83e3646b2f949513df7622bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"film.game (cyclomatic 42): film.game has cyclomatic complexity 42 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 15 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":"bend2/docs/film/film.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"0633b4e4a26845c7d3b6fadd2cb840d466858ae845b499721958e16b91acec7e"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.splitLine (cyclomatic 42): formatter.splitLine has cyclomatic complexity 42 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194a55da7c6c1795a094f86efd2e58bdf57c1ed8e97e51655ec4c0203c5feac"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.inlineBodies (cyclomatic 38): formatter.inlineBodies has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to one function literal inside it that branches (line 191). 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d84853894e7c92529f4951a4158c23aa89031b2a49ff079b0296d6e158012"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.book_valid (cyclomatic 36): bend.book_valid 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9f209b4cfcaf08e1ded4f29ff19d29c95e8a8bf450b141795aad9e16b27388"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_body (cyclomatic 35): bend.parse_body has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5058da9c9c77922d80aaf21cea7a9e85c5634c5e4a122e9d78b436527ddbfd0"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.anf (cyclomatic 33): comp.anf has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 9 of the 33 points are its own statements and the rest belongs to 5 function items inside it that branch (go, go::spine, cut, \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":"bend2/comp.ts"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c262f921186b22c8ecb39838bd77239af6a2c84733bcbbce18bacbe48e46e78"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.indentDepths (cyclomatic 33): formatter.indentDepths 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a5a1a6454da814cbf163ba76267af68f96e32fa72f6aa1981190b094bda87e"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.lint (cyclomatic 31): lint.lint has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 326, strings, a function literal at line 382, \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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587de8dc4c62b706b5473e31dfb620e5327c8641ec89918503256d6fb272230"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.emit_body (cyclomatic 30): comp.emit_body 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":"bend2/comp.ts"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7250fe82fa9396309cc931d6eef93a87920f4d3f801346ad04fe31b9340f2e4f"}},{"ruleId":"D1","level":"warning","message":{"text":"film.ask_net (cyclomatic 30): film.ask_net has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1614, at, a function literal at line 1611, \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":"bend2/docs/film/film.ts"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892a94eb9fe847a27163c83e1a7d89f836e66eece465d29bca66a2d16a33be8"}},{"ruleId":"D1","level":"warning","message":{"text":"safe_diag.lv (cyclomatic 29): safe_diag.lv has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_diag.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2ece2c0808def21ded9f145de973dd0a16fe806059cf1d79f6b06425a18340"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_higher (cyclomatic 28): bend.term_higher 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d05e01220eaba1dc75fcf8d013a328be847cdef15a80d391df9b312c6def34"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_book (cyclomatic 28): bend.parse_book 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fd4e138ebda442e328584cd5d81d203ca4b8bfb761f24f600b5d8f94fa45a5"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.match_flatten (cyclomatic 28): bend.match_flatten has cyclomatic complexity 28 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 8 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66b063328b1300ae6b86f351585e1cbaa31dfd21341532dfa864467abb5067b"}},{"ruleId":"D1","level":"warning","message":{"text":"safe.term (cyclomatic 28): safe.term has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"793b620720524b1df8f4b5ca410ebcc1af0bf257ad0c6ad172d136420dd73641"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.book_load (cyclomatic 27): bend.book_load has cyclomatic complexity 27 (threshold 15). Of this number, 26 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1db8363b619eee702dd42b1ddd3e8a2c6ffeb3e9cff6ead32c7e593f599c49"}},{"ruleId":"D1","level":"warning","message":{"text":"film.bitonic (cyclomatic 27): film.bitonic 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":"bend2/docs/film/film.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a75d18091e4af1aa48bbc41a10cd86b4f0309ab05a5ac85d66bd42dad43aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"seam.sameDeclarations (cyclomatic 27): seam.sameDeclarations has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (header, spanned, seed, \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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"512691306e0c5ea0be4c82a0498cd051bb70c09302e17d53eed5c64ccdfaee9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout.line (cyclomatic 26): Layout.line 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70693e4767c21687a565280e0596f7ec29198e4a9c22e6026a2255031bc2b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.facts_hot (cyclomatic 25): comp.facts_hot 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":"bend2/comp.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"be629717f5c1e8504b5daa7bf7e4258f87cef03f503290694a574b67b86fb85d"}},{"ruleId":"D1","level":"warning","message":{"text":"safe_diag.term (cyclomatic 25): safe_diag.term 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":"gates/safe_diag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a61e7ddc1af279ab5bb4229271885fcbfbb78356c3b86229e5a2f0781e191"}},{"ruleId":"D1","level":"warning","message":{"text":"format.separator (cyclomatic 25): format.separator has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44fb2500f782a3bd8c1673587e1b24e01c6a8a406270a6650f75f91f2a69e84"}},{"ruleId":"D1","level":"warning","message":{"text":"film.logo (cyclomatic 24): film.logo 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":"bend2/docs/film/film.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8725a5d597d3f6f6239eb5861d2477fb2f151705eebdfe32db49b5ab62e9548"}},{"ruleId":"D1","level":"warning","message":{"text":"film.lwire (cyclomatic 23): film.lwire has cyclomatic complexity 23 (threshold 15). Of this number, 14 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":"bend2/docs/film/film.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf145b4c68c93e564dbae119f45b4d662ba1087a62052f24e844ca3045306a5"}},{"ruleId":"D1","level":"warning","message":{"text":"render.S.reduce (cyclomatic 23): render.S.reduce has cyclomatic complexity 23 (threshold 15). Of this number, 20 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":"bend2/docs/intro/render.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7098ca4733c8f3bd89675825e8162416d62a8ee1e0c77259071b3d84d6ef1ca"}},{"ruleId":"D1","level":"warning","message":{"text":"safe.model_at (cyclomatic 23): safe.model_at has cyclomatic complexity 23 (threshold 15). Of this number, 20 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":"bend2/safe.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"94988fe454843312f03bc4a1522ff78dc85a25da01f47b2e76c09c1c95bcc403"}},{"ruleId":"D1","level":"warning","message":{"text":"safe_node.one (cyclomatic 23): safe_node.one 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":"gates/safe_node.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f992f88ff4b5c403877f678b626c1aba335fc9269e538b01d6c1cb25118a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"formatter.formatBend (cyclomatic 23): formatter.formatBend has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 6 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 325). 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e27cfcfdcabdf2304c337796e821b85b72575d66e70dc6fb7a4b2f98cdc87b"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.file_book (cyclomatic 22): comp.file_book has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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":"bend2/comp.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6ad8409653581f16ad395e59138acd360fe74d3ada2d82de4ed1e344a666bd"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.js_expr (cyclomatic 22): comp.js_expr 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":"bend2/comp.ts"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"3031db7a088a0e0d9a207505be47b9c02df4831957fa0ac3b8810a16aebec18a"}},{"ruleId":"D1","level":"warning","message":{"text":"gen_anim.parallel::draw (cyclomatic 22): gen_anim.parallel::draw 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":"bend2/docs/gen_anim.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3c9dd22e064e25e1dd46480689ebd2e89f8ceb47b66ff2e42d6395baea54a0"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.trace_valid (cyclomatic 22): cache.trace_valid has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 8 function items inside it that branch (hash, note, refs, \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":"tools/bend-cache/src/cache.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4917016c2bb806bf18ef575590ab3c35bc9dda07b39b176578551bb7580ff170"}},{"ruleId":"D1","level":"warning","message":{"text":"format.tokens (cyclomatic 22): format.tokens 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b2ab65ce464c16f96380dd8803aefa1da39acd2ba7781d8334e5cebd2c8e39"}},{"ruleId":"D1","level":"warning","message":{"text":"format.nodeDoc (cyclomatic 22): format.nodeDoc 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bc52c9cb0cb3cb0903fff5a121ef87ebf1e8a19d9ab7577d9467e12e8e4e02"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.ty_holds (cyclomatic 21): comp.ty_holds has cyclomatic complexity 21 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"940954961a28ce57dfee9739a4e52df3250f3493efdfc588638263a7a08e72a5"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.emit_unfold (cyclomatic 21): comp.emit_unfold has cyclomatic complexity 21 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 8 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":"bend2/comp.ts"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"180fcdb880f7eb5930b8d20b001f62cb86862ddfee7a9d13c2945e9d1963fb85"}},{"ruleId":"D1","level":"warning","message":{"text":"safe.root_emit::go (cyclomatic 21): safe.root_emit::go has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: safe.o_show::go (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"53444a8930f2f8cf12ca9b6bdbb2fe0c97704093a37113b4ee0ab4096536dc75"}},{"ruleId":"D1","level":"warning","message":{"text":"format.sequence (cyclomatic 21): format.sequence 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8dfebea649b0c9cc02d4765f959605ed4477dc389265068e09742f7022705b"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.emit_expr (cyclomatic 20): comp.emit_expr 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":"bend2/comp.ts"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e79458ab057350272a1ba4877ff09d1ffe5c750a7e58bb8da86082d2e51a43"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.bendRule.run (cyclomatic 20): lint.bendRule.run 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 12 function items inside it that branch (spot, table, span, \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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e1b4e3f31d29fe7a465df83674d45f8a897809f0f0f87c8e0b774f0124f718"}},{"ruleId":"D1","level":"warning","message":{"text":"format.print (cyclomatic 20): format.print has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea88dc93e6a5626a7195b9b2791c9e65cab9e91d5af22c4d37c4731c1f7e0d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_def (cyclomatic 19): bend.parse_def 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d21efeed73d5b87a9d7df3ab097dbc9f520cad2eec2905c92df4b2f40622b7"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.term_descend (cyclomatic 19): bend.term_descend 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e64e261241010a0a6b4adcaec88a08fd33b61146401be4827fedd615d45f7c6"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.term_spine (cyclomatic 19): comp.term_spine has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 441, 455). 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":"bend2/comp.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca51105d90cbb4a7b5335ad266bbcc714ba1530d2db1640510e12c5a011f9034"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.arm_self::go (cyclomatic 19): comp.arm_self::go 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":"bend2/comp.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe30162667dde8da82b4008f6b008690559df6508352b7da456ef2f01c0fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"seam.compile (cyclomatic 19): seam.compile has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (texts, value, args, \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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de0662cd45e26127b50998a7d23daa07b84c7514ac15cd40dfb5aa8f146d65"}},{"ruleId":"D1","level":"warning","message":{"text":"lint.cli (cyclomatic 19): lint.cli has cyclomatic complexity 19 (threshold 15). Of this number, 16 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c713563c64f1c2335901e8e3514a80acc585164d8544fd482edf33f3a99495fd"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.u32_from_term (cyclomatic 18): bend.u32_from_term has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c1c61f9243f41cf06a00b7732dbf1234105277bfa816d9e868d3ae68a1e605"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.emit_match (cyclomatic 18): comp.emit_match has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2581, 2570, 2589). 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":"bend2/comp.ts"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc7b876d3c354aa8176c0b107bb368cca2abae1864232da7528b683a808bf11"}},{"ruleId":"D1","level":"warning","message":{"text":"gen_anim.game::draw (cyclomatic 18): gen_anim.game::draw 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":"bend2/docs/gen_anim.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b22028d275b9d29d2f2814a9eb122dc93456633cfd9f5d2a6b7226bea5332a"}},{"ruleId":"D1","level":"warning","message":{"text":"safe.item_ref (cyclomatic 18): safe.item_ref has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: safe.o_show::go (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e5af8d96e0366b58c2728872295b4fc855123231ad438e2e52c8f528b3c0a7"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cc_find (cyclomatic 18): main.cc_find 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":"bend2/main.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeca18df0439e2a0b29b55e30f3f3b28d1664b2aefa8e6ddff5dfc5ad5963fc"}},{"ruleId":"D1","level":"warning","message":{"text":"seam.checked (cyclomatic 18): seam.checked has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 6 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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5cec3e3e53283b0c26b1de27fb30c8416afd0d1456c3cccec5167f4c8bd857"}},{"ruleId":"D1","level":"warning","message":{"text":"bend.parse_term_do_stmt (cyclomatic 17): bend.parse_term_do_stmt has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: bend2/bend.ts holds 17 of the 79 methods over the threshold \u2014 including the worst \u2014 and 419 of the 1050 points over it (40%), 3\u00D7 the next-largest file (bend2/docs/film/film.ts at 141). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a7cc74d9442e19d0328064263e6efa73e1e95721f608cd1249cbf5e5fb59f"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.mat_lits (cyclomatic 17): comp.mat_lits 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 3 function items inside it that branch (walk, a function literal at line 877, walk::inst). 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":"bend2/comp.ts"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a4f1576b6cb05cc6acfefd756725aa72243be5d0a6fcd17845e265266cf9c3"}},{"ruleId":"D1","level":"warning","message":{"text":"film.induct (cyclomatic 17): film.induct 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 2 function items inside it that branch (a function literal at line 1169, e). 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":"bend2/docs/film/film.ts"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d8ff61919c18b3e29a88dac675e80ade2fae9167a58ae01067e59eacd16747"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.term_same (cyclomatic 16): comp.term_same 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":"bend2/comp.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc12f00c6ded70f8774dde5b1c04ef1d64cb6e10eda3b8ab239d09b599c56ea"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.main_pure::show (cyclomatic 16): comp.main_pure::show 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":"bend2/comp.ts"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"167ac876cf4dbe2f863fe3250dd5bf3e793c36f565fe945c39b8e0da0f322197"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.emit_args (cyclomatic 16): comp.emit_args 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 4 function literals inside it that branch (lines 2019, 2011, 2015, \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":"bend2/comp.ts"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"555a2421ce2f7f6db2e71974a46665421e31f0a811b7bc97b7cee5183cf8a25b"}},{"ruleId":"D1","level":"warning","message":{"text":"comp.js_func (cyclomatic 16): comp.js_func 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":"bend2/comp.ts"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"3236328eeb5c7ac5858ff0809ac39b2230d3a7736850c714771cc64d0c78e28f"}},{"ruleId":"D1","level":"warning","message":{"text":"film.mandel (cyclomatic 16): film.mandel 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":"bend2/docs/film/film.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62e3b762b5b32e37b0571713ef9c1729c686c1912ade9a4c8acd347aa07d54c"}},{"ruleId":"D1","level":"warning","message":{"text":"film.lstroke (cyclomatic 16): film.lstroke 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":"bend2/docs/film/film.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5504250392d4941aded9e33e25ebcb4ca9ae2245e288886cb281ce83a5526e98"}},{"ruleId":"D1","level":"warning","message":{"text":"film.rules (cyclomatic 16): film.rules 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":"bend2/docs/film/film.ts"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3025cbf94113274207ddc047ade3fdbf1a9859f344a0092212028c5407d1b54"}},{"ruleId":"D1","level":"warning","message":{"text":"main.cli (cyclomatic 16): main.cli 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":"bend2/main.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"954a4703de7c05ad35f177d87d51230b141b1af43b5e75b58c88c14e55c64669"}},{"ruleId":"D1","level":"warning","message":{"text":"main.pkg_files (cyclomatic 16): main.pkg_files has cyclomatic complexity 16 (threshold 15). Of this number, 8 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":"bend2/main.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bf16d912ecfb9beed5094d9befcbee4bc07073d173178f9534a21e99940038"}},{"ruleId":"D1","level":"warning","message":{"text":"main.book_promises (cyclomatic 16): main.book_promises 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":"bend2/main.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"105d30fcb4dba4dd04d81f66443b8f0ef64d0b56a3efd2809e9c08226545ba98"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_wnf (cognitive 144): bend.term_wnf has cognitive complexity 144 (threshold 15). Drivers by points: if/else 27 (89 pts), loops 5 (21 pts), match/switch 4 (18 pts), boolean chains 11, ternaries 1 (5 pts) (nesting depth added 96). 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":"bend2/bend.ts"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"99357e520d239ad02131ba99920e2e51cba84033ca103ef183d7a93d21e59d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"film.split3d (cognitive 102): film.split3d has cognitive complexity 102 (threshold 15). Drivers by points: if/else 14 (43 pts), ternaries 14 (36 pts), loops 9 (16 pts), boolean chains 7 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7a7831995c8b69d6f785bf9691ccd70bdf377bbb918df528098174f1f7131c"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_term_base (cognitive 94): bend.parse_term_base has cognitive complexity 94 (threshold 15). Drivers by points: if/else 30 (67 pts), ternaries 6 (13 pts), boolean chains 9, loops 2 (4 pts), match/switch 1 (nesting depth added 46). Of this number, 92 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":"bend2/bend.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be6ddc48182c5538f3e09413304c9847d84aeaaa468738615da91b5c6a7fe6b"}},{"ruleId":"D2","level":"warning","message":{"text":"film.game (cognitive 92): film.game has cognitive complexity 92 (threshold 15). Drivers by points: loops 17 (43 pts), ternaries 7 (28 pts), if/else 12 (18 pts), boolean chains 3 (nesting depth added 53). Of this number, 60 points are the body\u0027s own statements and 32 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":"bend2/docs/film/film.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"9518cc9168f68d0cdb3166a327b2e2cd9d80f28d124e6fc4ba4b8a83d5414ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_check (cognitive 91): bend.term_check has cognitive complexity 91 (threshold 15). Drivers by points: if/else 24 (52 pts), ternaries 8 (22 pts), boolean chains 10, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 45). Of this number, 77 points are the body\u0027s own statements and 14 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":"bend2/bend.ts"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af807366a8eeeac14c686da95c0022152171a9b86ea575cc4aa9dfe273c4dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_term_ops (cognitive 79): bend.parse_term_ops has cognitive complexity 79 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 20, ternaries 4 (11 pts), loops 3 (7 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a01bbf9c94eae62e4f40a9a992fdeab079b5048e3a4d2a60a81f6dfdf399a"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.book_valid (cognitive 76): bend.book_valid has cognitive complexity 76 (threshold 15). Drivers by points: if/else 12 (43 pts), loops 8 (26 pts), boolean chains 7 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecbd7cc86452f40c45c889b8da2ca0a91f14813f354dad6aea6401547511865"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.indentDepths (cognitive 76): formatter.indentDepths has cognitive complexity 76 (threshold 15). Drivers by points: if/else 18 (58 pts), loops 4 (10 pts), boolean chains 8 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ab5ee4ff2c9895fbecf8430b3b58279b11951ad81a10bdcbebf10c685e68a"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.splitLine (cognitive 71): formatter.splitLine has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 7 (21 pts), boolean chains 15 (nesting depth added 33). Of this number, 68 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"983ca27f0598e862ee1672c1bedb74c1782cb70b3bb64b76ed2692501734360f"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_book (cognitive 65): bend.parse_book has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (39 pts), ternaries 4 (15 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 41). Of this number, 62 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":"bend2/bend.ts"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"4351257f2de62093f7c209089a6e0e3562da08d50e3ae6aef9ad2a617b52a6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"film.net (cognitive 64): film.net has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 13 (23 pts), if/else 12 (22 pts), loops 7 (13 pts), boolean chains 6 (nesting depth added 26). Of this number, 62 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":"bend2/docs/film/film.ts"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eac30008c2a638658f517f3a6478884a7c0d272854d9123b0a55ea529ef13f"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.compare_go (cognitive 60): bend.compare_go has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 28, if/else 17 (27 pts), loops 1 (2 pts), ternaries 1 (2 pts), match/switch 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":"bend2/bend.ts"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"32548938252fd3603fd61baa16615ead2974d735957c62565aad4bef1e866f99"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_infer (cognitive 57): bend.term_infer has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (32 pts), ternaries 4 (11 pts), boolean chains 9, loops 1 (4 pts), match/switch 1 (nesting depth added 28). 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":"bend2/bend.ts"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90bebdddd06f927a798a837967fe20868681535bab5be207e6a49bdabbe6887"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cli_file (cognitive 57): main.cli_file has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 15, loops 4 (5 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 10). Of this number, 55 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":"bend2/main.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"246616d61267d8cfb54d20aba9d03626d1788c1ef4cc6398b6ad809a43ace9a1"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.match_flatten (cognitive 55): bend.match_flatten has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 5 (14 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 28). Of this number, 34 points are the body\u0027s own statements and 21 belong to 6 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":"bend2/bend.ts"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee51196d459350a3a94d5c37072732739e7bfa899e1406c1a0cae7ff27f99598"}},{"ruleId":"D2","level":"warning","message":{"text":"format.format (cognitive 52): format.format has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 15, ternaries 5 (11 pts), loops 2 (nesting depth added 18). Of this number, 51 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe0aa7167bb2f3e55c8b1cb32d1c8842a057168fe23202c7cc1d6332a4f9d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"safe.tree (cognitive 49): safe.tree has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 15 (21 pts), boolean chains 15, if/else 11 (13 pts) (nesting depth added 8). Of this number, 31 points are the body\u0027s own statements and 18 belong to 8 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":"bend2/safe.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"621404d3c78b875034a7a84830b241ea1973c5696bdb25462d96a4191ee933cc"}},{"ruleId":"D2","level":"warning","message":{"text":"film.bitonic (cognitive 48): film.bitonic has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 7 (14 pts), loops 8 (13 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":"bend2/docs/film/film.ts"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e28b7818cabf10c5aafe21d92289cb69e4d5f4dc08f5d270ded04017fa5df23"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout.line (cognitive 48): Layout.line has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (35 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 27). 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f4d7c72e13df0032cfd9462bb245457d5d630c0f526751852b9f8ddbdb0224"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_show::go (cognitive 44): bend.term_show::go has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 10 (21 pts), if/else 7 (13 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (nesting depth added 19). 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":"bend2/bend.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17848dc451290fdb8b8269b363b8b63f1207b57f2ee1690665f04f47634419"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.main_pure (cognitive 44): comp.main_pure has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 14 (19 pts), boolean chains 10, if/else 8 (10 pts), loops 3 (4 pts), error handling 1 (nesting depth added 8). Most of this is not in the body itself: 5 of the 44 points are its own statements and the rest belongs to 10 function items inside it that branch (show, seq, a function literal at line 1796, \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":"bend2/comp.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b873ff986aef2a389f67723de3832e2da4291196b1731930947924e329f7b22"}},{"ruleId":"D2","level":"warning","message":{"text":"seam.sameDeclarations (cognitive 43): seam.sameDeclarations has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (12 pts), ternaries 6 (8 pts), boolean chains 6, error handling 1 (nesting depth added 17). Most of this is not in the body itself: 2 of the 43 points are its own statements and the rest belongs to 7 function items inside it that branch (spanned, seed, header, \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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6f6919ff4af3fc53968865a0a28d6158a9ee161230cf19c9744873c2759e56"}},{"ruleId":"D2","level":"warning","message":{"text":"format.sequence (cognitive 42): format.sequence has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (10 pts), boolean chains 7 (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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8da9b7d34795b5b3d54f829ce4a0701ac42e95c0ac666e069dba55a413d1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.file_book (cognitive 41): comp.file_book has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 3 (11 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 20). Of this number, 25 points are the body\u0027s own statements and 16 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":"bend2/comp.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f08106d74ab7e7de6d708a1ea0d2b013fd095440ca566fc6ae42eaa33481c87"}},{"ruleId":"D2","level":"warning","message":{"text":"safe_diag.term (cognitive 41): safe_diag.term has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (30 pts), ternaries 3 (6 pts), loops 2 (4 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":"gates/safe_diag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21b6644186c9fb5a85f3471a46e4cf0fd7bc6536486a579b47497a37baf0e55"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.needsSpace (cognitive 41): formatter.needsSpace has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21, boolean chains 20. 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b0d7713bf64a38166c9c87b5e1169d944fb26c51935a107f32eaa39ea646f"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.book_load (cognitive 40): bend.book_load has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 4 (8 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 15). Of this number, 39 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":"bend2/bend.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"c763278e4ad5fe9de387e4571fd151245c2d7b8127673c60f09769d913d02b24"}},{"ruleId":"D2","level":"warning","message":{"text":"film.rules (cognitive 40): film.rules has cognitive complexity 40 (threshold 15). Drivers by points: loops 7 (24 pts), if/else 8 (14 pts), boolean chains 1, ternaries 1 (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15421ef1ac21ed77c91cb52a48b4afaee067c6b8ab2996ced7f7632f840b1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.inlineBodies (cognitive 40): formatter.inlineBodies has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 11, ternaries 2 (4 pts), loops 1 (nesting depth added 10). None of this is in the body itself: all 40 points belong to one function literal inside it that branches (line 191). 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b8bbe1062bef2169beac3fae7b3a6963fbd21cbb86877992271747ac40ee0e"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.anf (cognitive 39): comp.anf has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 9 (16 pts), if/else 9 (14 pts), boolean chains 6, loops 1 (2 pts), match/switch 1 (nesting depth added 13). Most of this is not in the body itself: 9 of the 39 points are its own statements and the rest belongs to 5 function items inside it that branch (go, go::spine, cut, \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":"bend2/comp.ts"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbca9eb2d7e8d1fce118e6f0e8098af95f2ba73569ee66be18b3c042ca8c4981"}},{"ruleId":"D2","level":"warning","message":{"text":"render.S.reduce (cognitive 39): render.S.reduce has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 6 (11 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 17). Of this number, 36 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":"bend2/docs/intro/render.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed315a7276afae04d2a51122b436217495c5c2e91acc660bc267e9750204055c"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_anim.parallel::draw (cognitive 38): gen_anim.parallel::draw has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 5 (13 pts), loops 5 (12 pts), if/else 7 (11 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. This shape REPEATS in the file: one other method here (gen_anim.parallel::slots) 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":"bend2/docs/gen_anim.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"137b0d5651c0b5f1fcf1b962d037e8f8d7782dfd5274f1f72c24743a0d46b5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"format.tokens (cognitive 38): format.tokens has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (7 pts), boolean chains 5 (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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae741c4cebf4c69318691df5f426ab36d95d490e0145c899e53d9ffa5723234e"}},{"ruleId":"D2","level":"warning","message":{"text":"safe.model_at (cognitive 37): safe.model_at has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 3 (6 pts), boolean chains 5, loops 2 (5 pts), match/switch 1 (nesting depth added 18). Of this number, 29 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":"bend2/safe.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"de601edd8ae3b70b8e6fe4542b05a351bba1a00f28f867c90dcaa8cc10e555ee"}},{"ruleId":"D2","level":"warning","message":{"text":"film.logo (cognitive 36): film.logo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 8 (13 pts), boolean chains 5, ternaries 1 (2 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":"bend2/docs/film/film.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7e039f8d42feb8c19d3ff1996a78fbe13d44df4f128f70a2e1402a3cbcbfe3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cc_find (cognitive 36): main.cc_find has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 9 (27 pts), if/else 2 (5 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 21). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"bend2/main.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c1bb7096ebaa0e42c78be426b90466c6a0724a04b5dcf24cecbade18a2332"}},{"ruleId":"D2","level":"warning","message":{"text":"film.mandel (cognitive 34): film.mandel has cognitive complexity 34 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 4 (10 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6083023c3db653e6d4e792c5a3aecd2e55c8212f35230bfee50b97b5c65b379"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_body (cognitive 33): comp.emit_body has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 12, ternaries 3 (6 pts), match/switch 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":"bend2/comp.ts"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1bd99f0f4d925d8e5264e3e43fa2922769b8074920a73fadb5380129cd9746"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_anim.game::draw (cognitive 32): gen_anim.game::draw has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 4 (15 pts), if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). 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":"bend2/docs/gen_anim.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5e53e823e2e0991cbb13e7e00ef971921e47ed44b4a5e0094c870cc2408021"}},{"ruleId":"D2","level":"warning","message":{"text":"format.nodeDoc (cognitive 32): format.nodeDoc has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (9 pts), boolean chains 5, loops 3 (nesting depth added 10). Of this number, 31 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33597b5c2ebf37f08568bf2f4cf669a57d96326a74b2216af2e9a757e760b56"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_body (cognitive 31): bend.parse_body has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (11 pts), loops 3 (4 pts), ternaries 3 (nesting depth added 5). 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":"bend2/bend.ts"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ec40e48909587acf4adacfbe85b6a98cbd50bde2374415502c618ca4e03869"}},{"ruleId":"D2","level":"warning","message":{"text":"film.frames_pipe (cognitive 30): film.frames_pipe has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (21 pts), if/else 4 (9 pts) (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":2649}}}],"partialFingerprints":{"codehealthFindingId/v1":"e092460fcb5f2cf2c2fa9d40250b7b30f73d7fa2760a6bfb818fbd90f65fa62c"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.arm_self::go (cognitive 29): comp.arm_self::go has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (19 pts), boolean chains 5, if/else 4 (5 pts) (nesting depth added 13). 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":"bend2/comp.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0774e8443310c05f87ff37f6186574f9754bcc37b803385290569cc63af79f"}},{"ruleId":"D2","level":"warning","message":{"text":"film.ask_net (cognitive 29): film.ask_net has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 8, ternaries 5 (8 pts), loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 12 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 1614, at, a function literal at line 1611, \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":"bend2/docs/film/film.ts"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf781666f0169945c7d70a24a95471fa45f54e4552f2176360500c168e86cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"safe.root_emit::go (cognitive 29): safe.root_emit::go has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 7 (10 pts), boolean chains 4, error handling 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":"bend2/safe.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f13c6af9db2b99403db8a7ce92478392146d91c5edc0e1e68a13053bb2061a"}},{"ruleId":"D2","level":"warning","message":{"text":"safe_node.one (cognitive 29): safe_node.one has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_node.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c2eb6db5a87eeb88bbd1f49a484cce344710812f76f886d02e258f530d9819"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_match (cognitive 28): comp.emit_match has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 6 (9 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). Most of this is not in the body itself: 8 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2581, 2570, 2589). 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":"bend2/comp.ts"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4c290e9d7944a5af34e14a3aab0f211b65996f32ce5e8f3becf627e3142bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"format.print (cognitive 28): format.print has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, loops 2 (nesting depth added 8). 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 into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfead63d2ff7fb25ca0e99115b4364a801f5dad716a127332d53cb794b52771"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_def (cognitive 27): bend.parse_def has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (5 pts), boolean chains 4, ternaries 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34fab1fafa2344f44a1118d372df203c2591d317e3960ad0eba4d642c865d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.facts_hot (cognitive 27): comp.facts_hot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, 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":"bend2/comp.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c734e77b2698763b78546199664b8f44ea839e0cd84555df91f74aec19e6e88"}},{"ruleId":"D2","level":"warning","message":{"text":"film.lwire (cognitive 27): film.lwire has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 764, add). 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":"bend2/docs/film/film.ts"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"096a368754d9da647bfd80a41229c2fcdc7b3c6735159b63125b89842c63d21d"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.lint (cognitive 27): lint.lint has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 10, if/else 6 (10 pts), ternaries 4 (6 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 13 of the 27 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 326, strings, a function literal at line 382, \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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c868063b77b7e178f8c9a08a1fbe2ee7ef4aab0e6e8ce9bfad5fb02b2ba31e9"}},{"ruleId":"D2","level":"warning","message":{"text":"film.lstroke (cognitive 26): film.lstroke has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 4 (9 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daddfd044154b3e6679cd64aa10ce1c7f2531edfe4cf0a06b9ab42575a33bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"film.echo (cognitive 26): film.echo has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 6 (13 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":"bend2/docs/film/film.ts"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"881b0e5e1fd7e926f47749ac1d8b7e424326c8f5bc914e0885b42cd8d030b946"}},{"ruleId":"D2","level":"warning","message":{"text":"main.book_promises (cognitive 26): main.book_promises has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 11). Of this number, 24 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":"bend2/main.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dea7f9b7115a7d1503479b3317438c9744509d1c0273fddd096304f72d3517"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.trace_valid (cognitive 25): cache.trace_valid has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 7). None of this is in the body itself: all 25 points belong to 8 function items inside it that branch (refs, note, a function literal at line 282, \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":"tools/bend-cache/src/cache.ts"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e44519b72c74e1b7e3684e0fb7167ca26470231f66c822bbe2acdf10106d88"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_descend (cognitive 24): bend.term_descend has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 2 (5 pts), match/switch 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":"bend2/bend.ts"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"955ba5aee247c159a32f901669ac2f8254c36d3448a6eb2c84f07ce39e07f71c"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.term_higher (cognitive 23): bend.term_higher has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4085a95b6384da782c5dec196505a07c14485ff396ec6a828e8627b2b78e7a20"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.js_expr (cognitive 23): comp.js_expr has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 10). 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":"bend2/comp.ts"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"3356f06460f29340a67176583d9e6a707babafc6adcd291df63f0b9d58f02ead"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_anim.parallel::slots (cognitive 23): gen_anim.parallel::slots has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (13 pts), boolean chains 5, loops 2 (3 pts), if/else 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gen_anim.parallel::draw) 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":"bend2/docs/gen_anim.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"16697c98f0ba2a03a364baeea09685cf58721a9acf72871e515c7a6170eae8b7"}},{"ruleId":"D2","level":"warning","message":{"text":"render.S.eval (cognitive 23): render.S.eval has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 3 (9 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/intro/render.js"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3658de46ee790209e3465a77eb81dab470cce816ba50dcbf4146b96cc53ab9de"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_ctr (cognitive 22): comp.emit_ctr has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 6 (7 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":"bend2/comp.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8047cacae1906ac39cb7a1ef9775955015fada45585a46b404513de9ac12cc66"}},{"ruleId":"D2","level":"warning","message":{"text":"safe.item_ref (cognitive 22): safe.item_ref has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (6 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21c54c78b573789b3a997e17bb5eeca03935cad53a9cdbb4915afb9ed75c22c"}},{"ruleId":"D2","level":"warning","message":{"text":"formatter.formatBend (cognitive 22): formatter.formatBend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (4 pts), ternaries 3 (4 pts), boolean chains 3, error handling 2 (nesting depth added 3). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 325). 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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7219ae497a0e23bf056d14239a2b77525f6c2dab6725dcc51894bcd091673"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_tele (cognitive 21): bend.parse_tele has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (6 pts), boolean chains 4, 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":"bend2/bend.ts"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7a5e37e53d323948887f47313c7d6d4a08d4e623ce78ddc9ca07c4400eccdb"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.row_val (cognitive 21): comp.row_val has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (18 pts), boolean chains 2, if/else 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"823d102ba34756323b5482dbbd80317074616e8fc00e489af86f2ec4b20d15b8"}},{"ruleId":"D2","level":"warning","message":{"text":"file_read_with (cognitive 21): file_read_with has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 2, 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":"bend2/effs/file_read.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aec2853e04bb8d71155443932b796267fc739b67294f968a132e08aff3af1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.mat_rows (cognitive 20): comp.mat_rows has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). 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":"bend2/comp.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cac0063b66db4ab1078117303eb39bca7cfd2c32cb8ef8dbae8c94c67ff41b"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_unfold (cognitive 20): comp.emit_unfold has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), ternaries 4 (6 pts), loops 1 (nesting depth added 4). Of this number, 13 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":"bend2/comp.ts"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"91290e4c735b79547aef5d67ceb8a1de57e5931e845f1890e29f8174b020cc61"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.js_func (cognitive 20): comp.js_func has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6 (7 pts), boolean chains 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":"bend2/comp.ts"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"4876de8f04625ae5a53c6279f8f78d9a7963183abaa3364a1ed4f4f8a613b5b8"}},{"ruleId":"D2","level":"warning","message":{"text":"film.induct (cognitive 20): film.induct has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (8 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 20 points belong to 2 function items inside it that branch (a function literal at line 1169, e). 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":"bend2/docs/film/film.ts"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e5c314224cf3342f7b8bfc7f7501dd0be80af45e6e92aab3ed3ee95535b89"}},{"ruleId":"D2","level":"warning","message":{"text":"film.hive (cognitive 20): film.hive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, 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":"bend2/docs/film/film.ts"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2ae60f0235de6a95b9f56f77d0c5e29e974eabd602a9101323dd1a2f3dfbf5"}},{"ruleId":"D2","level":"warning","message":{"text":"safe.safe_pass (cognitive 20): safe.safe_pass has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (5 pts), boolean chains 3, ternaries 1 (3 pts), 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":"bend2/safe.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac4a2c906534a7f28b6fba359772d73f5ab0a7c74e48e531ff7b51496325524"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cli (cognitive 20): main.cli has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 2 (5 pts), error handling 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":"bend2/main.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"df83fb290ec3b49eb31acae3ca37762bbeb2d006aed90bcfef3297495250b65d"}},{"ruleId":"D2","level":"warning","message":{"text":"safe_diag.lv (cognitive 20): safe_diag.lv has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (6 pts), match/switch 1 (nesting depth added 3). 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":"gates/safe_diag.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2259df3c7adc3c8a66835d2b1ac439e2ed1a1f5f108769f53a6172beb27ba8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_term_num (cognitive 19): bend.parse_term_num has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 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":"bend2/bend.ts"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c230db1243aed4227e4842d24ab57eb52d8e1ac7d6a77b1f8c7f951b454b98ac"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.ty_holds (cognitive 19): comp.ty_holds has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 6. Of this number, 16 points are the body\u0027s own statements and 3 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":"bend2/comp.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"47654e94591cd225ae5d8455f1570a30802d00557940e476de89ac817309f226"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_expr (cognitive 19): comp.emit_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). 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":"bend2/comp.ts"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e8d020fadbe4472532d900792584e10746d79cf61ce88739333d9ebe651f17"}},{"ruleId":"D2","level":"warning","message":{"text":"film.sprite_load (cognitive 19): film.sprite_load has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d54cccd93d5e4fda795822864dc008e24c514a2a06d27b7c4d27696d9ec7f"}},{"ruleId":"D2","level":"warning","message":{"text":"film.refl (cognitive 19): film.refl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1724, 1731). 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":"bend2/docs/film/film.ts"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a32157ec262e755ae518dfe8e5b383c68c149d4975928df228a0b3110fd1d67"}},{"ruleId":"D2","level":"warning","message":{"text":"film.phosphor (cognitive 19): film.phosphor has cognitive complexity 19 (threshold 15). Drivers by points: loops 9 (19 pts) (nesting depth added 10). 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":"bend2/docs/film/film.ts"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dd497d7abdf21f24c4d76dfa8833ed35e92a60a37c50eaf8cfcf46b2824596"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.load (cognitive 19): cache.load has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-cache/src/cache.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"984de1d976893624a90784f10a2d594a621dc12532d45ef30e68d9719e7b5ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"format.separator (cognitive 19): format.separator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d01e8972f860cfce0c72d489089dcaaaa7065e2dd24bb6195b754c79ed0d5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.term_spine (cognitive 18): comp.term_spine has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 7, if/else 1 (2 pts), loops 1 (nesting depth added 2). None of this is in the body itself: all 18 points belong to 2 function literals inside it that branch (lines 441, 455). 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":"bend2/comp.ts"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e8881385cc8e66eee84d01f973f9d567195c61224c237aaec4d3cb4f2db4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.term_kids (cognitive 18): comp.term_kids has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 2, boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da374cf2bd592dff847aad6a2f6d15aab80cc4d56d37755bc87b5eb7c7e3ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_pins.checker_rows (cognitive 18): gen_pins.checker_rows has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/gen_pins.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea69218cac73ece6095112eeec8c700f85653e349bebd07fd16db39fbf5cb1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"seam.checked (cognitive 18): seam.checked has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 5, if/else 2, error handling 1 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 8 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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6af9d664d0f938678b79d5426fe33a83a833737d94675b506a8d0b5434fd9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"lint.cli (cognitive 18): lint.cli has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, ternaries 5 (6 pts), boolean chains 5 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 3 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad711b90e4e03f1b114bd407d93c46b3333b56e4b90de6b4cb19d17b65d9e03"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.js_match (cognitive 17): comp.js_match has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 3015, 3012). 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":"bend2/comp.ts"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f68dc978841fbde2020a6f63b49febd0e7a7bc794a1f761f5b1d55e0a548baa"}},{"ruleId":"D2","level":"warning","message":{"text":"film.blit (cognitive 17): film.blit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/film/film.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"1511d61e4215b139e667070d046034bbe31da6bbab04d3c53ae6ae6a2c0bc91a"}},{"ruleId":"D2","level":"warning","message":{"text":"bend.parse_term_do_stmt (cognitive 16): bend.parse_term_do_stmt has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 5, if/else 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a923b9c8bde62b987a7175e84eece5f98c08155b40f82f980a4392958d5abfd"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.term_same (cognitive 16): comp.term_same has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), boolean chains 5, if/else 2 (nesting depth added 4). 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":"bend2/comp.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1d420d3e3bfaebd628adf72d06f9884740d5c9f3ee969698bbd2fea582b8be"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.emit_args (cognitive 16): comp.emit_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 2). None of this is in the body itself: all 16 points belong to 4 function literals inside it that branch (lines 2019, 2011, 2015, \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":"bend2/comp.ts"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3c6b645449ccd9b76fa12f471feeaac5ce4f8de111778b487543007adaedc8"}},{"ruleId":"D2","level":"warning","message":{"text":"comp.effect_src (cognitive 16): comp.effect_src has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 6). Of this number, 8 points are the body\u0027s own statements and 8 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":"bend2/comp.ts"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1470ecc1bcd7b713bbbffe8d20bb1aaf79a9ed7236dcbd48c034617fe6c844c3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.pkg_files (cognitive 16): main.pkg_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). Of this number, 10 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":"bend2/main.ts"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fc46602776253ed1ada18799f8598a8f9e51d9b86dc77ec64410482db0e340"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bend2/comp.ts: FileTooLong \u2014 4482 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3982 over it, 8.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa48c47b2a94b1fe11b8ef48fd3cdeeb66731f2df5fd170cd64b163a33db9bcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bend2/bend.ts: FileTooLong \u2014 2481 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1981 over it, 4.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f543fd0d6fb76a7822d0242dea972a1ded515528bd918716534f3d0c10b02d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: film/film.ts: FileTooLong \u2014 1746 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1246 over it, 3.49\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":"bend2/docs/film/film.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c93eaaa252030f42d0462b3a057b21ae48b259204dd8c0622718d990e21ec3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bend2/safe.ts: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 520 over it, 2.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":"bend2/safe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759e866c1b46b1d921db497fa4894221c1c7faa82f038f6d828a1470c110f3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gen_anim.parallel: FunctionTooLong \u2014 parallel runs 160 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 60 over it, 1.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":"bend2/docs/gen_anim.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8a1e6a12fe6134f4ac1bad77f0196c36f919d9557e621882cc44daf8386d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bend2/main.ts: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 274 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63a320351c302272ff27f5239f4f4752a655b6a717c0425af99a8cf4c2be8ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/seam.ts: FileTooLong \u2014 756 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 256 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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b31b7f27b4ff00f94ab19b3dcd09458727893e5c1c4f05e83fefc8555ac4d75"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gen_anim.game: FunctionTooLong \u2014 game runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/gen_anim.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d518261a152f3d76a698923f7948f2d89a516ecc089f49b8aaaa178470e96cd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lint.ts: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18\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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9502975926e72c6458654ab76cd4a358177b8a92fdd61d7a9197363ccd189d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lint.bendRule: FunctionTooLong \u2014 bendRule 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45072b832718fb5fa23c4f11d6c13793448ad01411a2d6ffe356c811ba6f628"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gates/ping.ts: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 79 over it, 1.16\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":"gates/ping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"383171d2d64ac3ca46ba4f1b09e8b3931b3850e1eb1dc6bf4ce242eb94672476"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: intro/render.js: FileTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 52 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/intro/render.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f301c5c29b2493bc10fe13a65cf1562197a4c400b393b0bdab65884df09c65f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: lint.bendRule.run: FunctionTooLong \u2014 bendRule.run 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2215246a722ffad97d06167c97a7d44385a9c4c99ca364fc8eaa9f2d47b4500"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bend2/comp.ts: 20.4% line coverage (1057/5182)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08824ee78cf0227197ae200f218e24343928b98a7dd39d07714322e8a9dc462"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bend2/main.ts: 17.2% line coverage (154/894)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13853259e2ba7ed4d47e1afb80ce02e084b75e110e6e7dc23dc6edebb707a3"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: bend2/safe.ts: 9.8% line coverage (114/1160)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb343a89641075276b9b62f589dd99d1174250d29968df0554af7f4bd3bf748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/comp.ts: bend2/comp.ts changed 383 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in comp.main_pure at line 1718. 61 of those changes were fix/bug commits, and the other 322 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/comp.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":"bend2/comp.ts"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e5b052f8090b9d04107ccc6a9c7906d28c8ab903953c61e41f0fbfe971d748"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/bend.ts: bend2/bend.ts changed 158 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in bend.term_show at line 1240. 36 of those changes were fix/bug commits, and the other 122 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/bend.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":"bend2/bend.ts"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cc54bc67e70a09905ee3d5a44856b96885bf1376ea19236f7a63956c854f99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/main.ts: bend2/main.ts changed 152 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in main.cli_file at line 240. 31 of those changes were fix/bug commits, and the other 121 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/main.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":"bend2/main.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4004b418c38e3a6fffb547f870d9e2b22dc21805d5595b04c7fe06bf94203371"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/docs/intro/render.js: bend2/docs/intro/render.js changed 144 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in render.S.reduce at line 657. 9 of those changes were fix/bug commits, and the other 135 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/docs/intro/render.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/intro/render.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a62ad1ffd1a0931fde6ad952198be53d88ac2bf8e8cf09966563d6be91f8e7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/safe.ts: bend2/safe.ts changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in safe.tree at line 768. 16 of those changes were fix/bug commits, and the other 29 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/safe.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":"bend2/safe.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"635399c46158f5d594eab9b47890c1bfee81836c1a76cd50f41a826ffa5db71e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/bend-fmt-lsp/src/formatter.ts: tools/bend-fmt-lsp/src/formatter.ts changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in formatter.needsSpace at line 120. 17 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- tools/bend-fmt-lsp/src/formatter.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":"tools/bend-fmt-lsp/src/formatter.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e509691e0533762b9ccdbc58e951e985a2c8b8797e87119a46ff9270d3b869d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gates/test.ts: gates/test.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in test.shard_parse at line 176. 3 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- gates/test.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":"gates/test.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"344f818656a9143e5a3f189e851399c22abec6226a8d7ba96c848597097a216d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/docs/gen_anim.ts: bend2/docs/gen_anim.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in gen_anim.parallel at line 137. Frequent change and high complexity in one file compound: schedule 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/docs/gen_anim.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":"bend2/docs/gen_anim.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fbacc2c93ee8d98ca7901ecbf884b313ef40986af9630b902f8602738956e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bend2/docs/film/film.ts: bend2/docs/film/film.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in film.game at line 1056. Frequent change and high complexity in one file compound: schedule 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/docs/film/film.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":"bend2/docs/film/film.ts"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"55359da02e93d219aea461656265e9c663692c473b5d61dd9741f3009ef59b3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/bend-lint/src/seam.ts: tools/bend-lint/src/seam.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in seam.sameDeclarations at line 841. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- tools/bend-lint/src/seam.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":"tools/bend-lint/src/seam.ts"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eda0732741a77a895609a7ab1873e1fe94c02cc61d9fbe071c439fea77655da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/bend-lint/rules/format.ts: tools/bend-lint/rules/format.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in format.format 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- tools/bend-lint/rules/format.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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d36dde9fb1a9cdb81e6cb21451568b70582b64678d5d9e7c77e05ca5addd0df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/io/bundle_inline.js: tests/io/bundle_inline.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in bundle_inline at line 1. Frequent change and high complexity in one file compound: schedule 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- tests/io/bundle_inline.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/bundle_inline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96023a1d72fae8ed74dd42899804bf4765824a595a9f195a26f5eb375386a98"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gates/safe_diag.ts: gates/safe_diag.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in safe_diag.term at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- gates/safe_diag.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":"gates/safe_diag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1604cbb30c54db26e4c42d71475cc3a8d30f068c554c092bc040131abcb3d461"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/io/output_input_links.js: tests/io/output_input_links.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in output_input_links at line 1. Frequent change and high complexity in one file compound: schedule 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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- tests/io/output_input_links.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/output_input_links.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe3a11aa9b1ec291899005dff140dafe88b8afbae5649a3471078e63acd6a13"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: bend2/effs/process_run.js: bend2/effs/process_run.js 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 9 (its worst body is process_run.process_run_now at line 82), 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(io): park the JS File and Process effects so io_wait flushes stdout (#1899)\u201D; \u201Cfix(io): Process.run of an empty program answers ENOENT on JS, as on C (#1860)\u201D; \u201Cfix(runtime): support module-mode process workers (#1842)\u201D; \u201Cfix(runtime): a Char holds any u32 on every lane; U\u002BFFFD only at text edges (#1411)\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 13:21:25 \u002B01:00\u0027 --until=\u00272026-11-13 13:21:25 \u002B01:00\u0027 --full-history --no-merges -- bend2/effs/process_run.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/process_run.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7097fe3966a99e51639ef700a8301012864bf79ac30f14bb8b930b220583ef"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: bench/runtime/histogram/main.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ab05b5f604567ddd6a24bddb6c7dbb5f9c188805e59bdb0a2fe9ae1b55535ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // is a TODO at its law, which may be skipped). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-cache/src/cache.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"767571d47cb5940d5ae650ee60cbcaae13dfe99feb3a59783587fd2ca04a7ceb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // shown against the goal; ?TODO alone checks at any goal and marks \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8254c6af4b1b5d95d40550440dc4294c2668dee50325d3d1516824bf1b9cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // \u0393 \u22A2 ?TODO : T ~ {} \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"599d1d9d3b62f661d163006887b8e8b498f42a65fbbe7a00ee991eedb88b50d9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022A term\u0027s kind, and the name a Var or Ref points to.\u0022 repeats the code it sits on: 5 of its 6 words (term, kind, name, var, ref) are already in \u0060const kindOf = (t: LTerm): { kind: string; name: Name } =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e192af85a070f9b3db6ddb46ed0ec3d9d94316533713055c1257f57c02d13c5"}},{"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":"bc770917546e3c8842764ca9e70b28d587fdcbb25ce734ea30eee45305641f33"},"taxa":[{"id":"CWE-94","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":"64500851b3751b83e6610153cd652724e2807430d2edf163580eefe12956e335"},"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":"0b4a3442dce3e5e1fca137abcf06ccfcef4a8edfb9711c85c25f0e4b6354f8c4"},"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":"280445c68b004b6cf68a8716dc4d683439badf2353c215653b00743380daa994"},"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":"684687790ee93b4265e6287711c268b4c4d09e1067e6a24ad00fbc0e5827b96c"},"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":"ef4398923d6ee5c69af166bad54fe533e0f9ded5f81eda3ec168859fcabffa15"},"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":"2200aede580bcc10f08bca7e3ccd79d249374bf72f4dfc7a55e1b33df191f857"},"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":"9580b90191ea621ec799e824e5eb2b84794fb9ce00743327b110af47d31c6bfd"},"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":"b2377ab1c161800181e8b9ebc95ac69db8a5a520ab6840a7325647bfcfab9db5"},"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":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: main.ts \u2194 ping.ts: \u0060bend2/main.ts\u0060 (context bend2) and \u0060gates/ping.ts\u0060 (context gates) sit in DIFFERENT parts of the tree yet change together 65% of the time (26 of the 40 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 26 shared commits counted here, the most recent 3 are \u0060ea66e004\u0060 feat(publish): send the README.md beside the entry (#2033); \u006026b2c4ec\u0060 fix(cli): print valid aliases for hyphenated published files (#1849); \u006005d33b3a\u0060 fix(cli): keep published files inside the entry directory (#1838) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d54a26c15b20be9f8143afc426e56d0dadf27ce054b91ac0b633425c674f2c"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"note","message":{"text":"CI test execution not evidenced: A CI pipeline exists but no test-runner invocation (your stack\u0027s test command, or a test job) was found \u2014 changes may merge without the suite running."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"860902100b1c048f49c648730bdf23459de2d8ca6af82ef0ec593ecb3995a80c"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 57 JavaScript/TypeScript production file(s) this check read across 2 module(s). Each was searched for its ecosystem\u0027s logging libraries (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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/repo-gate.yml"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060bend2/docs/intro/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/docs/intro/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cef9295529d823a7c8a7087c105c434f0321c37952e5789c95063b7d0d106c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060name_hash\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b224c0a48060b2b7611596a5a58587f61657ca8550f2c4a8a31e9a5a47b9ab2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060name_hash\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"045779925607e931f532c264fdc384b7b790dbde4d656587868d7f5c7cc82688"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060name_hash\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"700a2cde92be7e47115daf55584a5714dfba21e29e223b0dd93f97dd9cffeffe"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060name_hash\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"710de6d23dc4d1980a8b6b20ac0f5f9ed05e2d4926fa3a76b3138e8f9f08373e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060book_file\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf436710ebd434c8a76a861a089237696005417f0f6013a3dfcf9e3fe2c6853"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060callback to fls.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c80a6aa9aa812d768d2c715773a8015952055a3881a879f02ebf65d8a98f9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060callback to fls.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"332f4c54372cb7fbdbbe27b44d9e3d39da1882416df4e6be5835c585bc79365a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060book_file\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"807912bf8ac42ff1d63e95e62beedaf88d512f439a1bbc76b467131078afd06e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060book_file\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bb18d06d8b02632cb7e7a4ef3cde5adb66eefde9af4b083af8ecc04b1408db"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060book_load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"329f35b256179fa7ca1a224e3819ac4a8bd4a07d012a050b390ae333bf04643b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060book_load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1985ddc0a6fcb0d64b3ba3555267c5886a586c1fdb7bb3f036b4e2dec949c4"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060book_load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7881d83356fc3ce24873a8eea54b75afa02d5263808f8f1c76ae78c4914c6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae8b8cfea189af247baa96436e95b67ad3bc5c07ef6c8a2f2a06210eea1e45a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"819eec17ff8f51bbb04a6f724ee3471c11ded43186ed851ea31707061eb08fcf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada319937c6c6589800d0ea16ffe64997c3868cf67d6af3e45b48ce579855789"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee14ec7d8c241f10cb607b5c9401e0f57d8c60bd12bf9687bfd359bc16b02e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060cli_checkup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2969604999536e29ef901b1aac5357414e52c16ce6a3783fc1d7e9ca70967c9b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060cli_checkup\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b561836765d51ee519f937b9e7e1b91bc6d7e5ac1d0b0239684af3877cf1a8e2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060element\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ebbe4f8737b924638bbc5c55c105d454d1635b5788789ffe62ac3b8fbcb140"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060hub_check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c048e00fe699bb9d851c276136e2d9cc45bf8c6575660cb4db349422de5a08"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.renameSync\u0060 in \u0060hub_check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cf71fc108f623d94f228360286461cd93c483d9c1d5ce289d4daf7b9328416"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060hub_check\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4da92634b793646f648848e3d3a7a88e87ec350ba95bf819a23223228d3428f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060cli_login\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1c26c70731fce67afe6232ada2667086675491e2da7f98e28dd0b580444d52"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060cli_login\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"514eabc66a9573bc2b027dd7f1dc17018a7ca9c1dbc8ef364c595b5725703576"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060book_read\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d33eff6bd2aa0d70a3a02e4630533c00c31d89d49a3aba0ed3257d5ff9a769f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060book_read\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd89b1329cfb4f5efcce9e72cf8460e3133ca72cd1df983654569f4cae7cd118"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdtempSync\u0060 in \u0060one\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_node.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"446a3d047cec19433cd00eca204cbd606b5d71a3f6464ebd07edade1b1cf566f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.rmSync\u0060 in \u0060one\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_node.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"81664a431b0c207994bbf9c9ed4a775dedce38e3cade224f3640e8b9bddc910a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060cli\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/lint.ts"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9206e3c74fc921102215e6c444c027667960a7512fe71c1e361febffc95316"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.existsSync\u0060 in \u0060latestTag\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc2a32b7084a5760dec1c1caed64151798b8abd90af3973cdf61cdbd44fc51"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.readdirSync\u0060 in \u0060latestTag\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebd0002825f4d170548325e5185ce788b48d0fea4f3602ec03faa664caf5231"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdirSync\u0060 in \u0060latestTag\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"585bc2d65928ec5150394d57c6f07db75dfe208f351b0a6e4209a709389462ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.writeFileSync\u0060 in \u0060latestTag\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"9803d92b089f1a294338da8d37a7a376cc4b18937488e059871d7e65b16ada85"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdirSync\u0060 in \u0060fetchBend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2c918cabcc5249c530b883f624d78306c914a4ff9ffea44cfb69ad86afc66"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdtempSync\u0060 in \u0060fetchBend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7d9ce21e082627967bb90f950417d378ffea94fb3ca24cd3e8a01df8539ceb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdirSync\u0060 in \u0060callback to files.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109f89d625550f498bb7346631f981b8f13cc6729d77e9df3a9758bc4cc8fa6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.writeFileSync\u0060 in \u0060callback to files.forEach\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8278497b4925a887030155f6a16b3c02ee548779529933c6cf0d08f6517d4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.mkdirSync\u0060 in \u0060fetchBend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5902fa88dad38e56e69bab79e264036d84bb4c154c773ac85ddd7280d671131"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.renameSync\u0060 in \u0060fetchBend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2078ab57858b7d33909465ce78c244a54b9246c041b00ca93d4293e77b7e81a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.rmSync\u0060 in \u0060fetchBend\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2a9c7792c2c0f5c354cc08e8c3f90ff1c294053fbd182a6c9db8737bbb9252"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.existsSync\u0060 in \u0060callback to find\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2afa2542fc55069829bdf020228ac7e05e847d81ae34dad363130bf67e1b10e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060bendDir\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2182d88875f0cea6d1dbad108377fa20082e7285c39cde5afe34d4540a9f51a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060nodeFs.existsSync\u0060 in \u0060bendDir\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"80760ae02b82038e8a2608a2b20d68f29779bdfd0caf8ea22d723fdaea611a21"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060bendDir\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c8a1c77e313b571847bcad3a8cc5213ed9d63bf33b33df6960ae368d10ccf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060checked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6944d0691a5dcc2ee2f2b1f425a3271acb620347eea7577d7cd82401b3dad4eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060checked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc4b5af076d1d2cf314d4136c0e550e941f7d26746145180332c77495f1d212"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060checked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"7984bd64a4c1ecaeb465d90ddde0f501e4017c7ffd84bdcad442f62966614590"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060checked\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc409db8a48ab961ededbf661303c95e737741f33466460521146a74c0bb164"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060callback to filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e782e647b3403e3c8a20e434de1b0ec51dac187b5990081f57952439287d4e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"798c03b511aef428bc8f3645fdcb4b1e47e0434bacbe39aa6b6363d98c369d27"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060callback to PATCHED.map\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ad5324b51103b53758b95a8733eca16f5cfd71c44ffa160abbd396634b94b9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.realpathSync\u0060 in \u0060callback to build.onLoad\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8917f0c78994cf8ec39ac17f62c78f61cd3c5e1396176abbe4ff7b3cd50ca8"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 21 typed \u00B7 144 plain JS \u2014 the untyped files are bend2/effs/args.js, bend2/effs/audio_close.js, bend2/effs/audio_open.js, bend2/effs/audio_write.js, bend2/effs/chan.js, bend2/effs/file_close.js (\u002B138 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): bend2/effs/tcp_recv.js:10 \u00B7 bend2/effs/udp_recv_from.js:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 409 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_recv.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c14c46d231f1a15f91c8eda7018f2052abf14f6de20ea4dd1e8e390f187932b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): bend2/bend.ts:780 \u00B7 bend2/bend.ts:829 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ae2f7db06695274d1c479696ee2b749f17df3ecf6dcb544a549fd8600e1d92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): bend2/effs/tcp_accept.js:15 \u00B7 bend2/effs/udp_recv_from.js:25 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_accept.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"35da5333c315784bef27a246220cec8da02534930d2a03bf333f23a348ef6919"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): tools/bend-cache/src/cache.ts:157 \u00B7 tools/bend-lint/src/seam.ts:1098 \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":"tools/bend-cache/src/cache.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f069fc231abc3d0ce450beb96825a03e4715844218639267638cb92a2f026c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): bend2/bend.ts:761 \u00B7 bend2/bend.ts:807 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa42d61d0b9d5d408b6d1296a014b819eeed9c9663a45c98fa8f3f62d430e8f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): bend2/effs/tcp_connect.js:6 \u00B7 bend2/effs/tcp_listen.js:4 \u00B7 bend2/effs/udp_bind.js:4 \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":"bend2/effs/tcp_connect.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcb1fc0faeafc4671af51e00dbe335749a9cbf05afde24865577f1c11be881b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): bend2/comp.ts:1514 \u00B7 bend2/comp.ts:1536 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa567720cf486611e5d3f67e0c5e382a5738d9ae0be9fd7174d34504539558af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): tools/bend-lint/rules/format.ts:352 \u00B7 tools/bend-lint/rules/format.ts:366 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa793454d35b7d3b681fa3acfd58cd604c5f82c6674884cd096e2217b136f1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): bend2/effs/tcp_listen.js:18 \u00B7 bend2/effs/udp_bind.js:15 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_listen.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b3f30c5e1de2ebb02bb72164212d5db615a2f5604979c4303a92b22336aa0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): bend2/bend.ts:3306 \u00B7 bend2/bend.ts:3315 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18e99e18ae81a5c078823f6c86876bf19f513983943299b618c2bc7001b83d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): bend2/bend.ts:824 \u00B7 bend2/bend.ts:3129 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"378945b14ba81701858d8995654ac3ef1fedcd35f815e213898c88f51c8047d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): bend2/bend.ts:3397 \u00B7 bend2/bend.ts:3619 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2502ae1742ab02b1897138ccf6c72dff067903609d12ae41fee4efb5893d0b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): gates/perf.ts:177 \u00B7 gates/perf.ts:238 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 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":"gates/perf.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"850108f59e93a1a3885924b21474ebf85231c0a20f8a84500e82115ca5356d3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): tools/bend-lint/rules/format.ts:298 \u00B7 tools/bend-lint/rules/format.ts:402 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b34c5299456269b6609747aa4527436b487bd7a7a19f8f96f8e00cc303ec992"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): bend2/bend.ts:986 \u00B7 tools/bend-lint/src/seam.ts:849 \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":"bend2/bend.ts"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb526eaaba77b4411899cdac6d10b81bc1dee0ee14ac8d579c811f6671d79f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compare_go (cyclomatic 84, cognitive 69): compare_go has cyclomatic complexity 84 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 sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a3dfb1f978f67fd0e1227625a14c1ed21fcfbdbe0b6652d15fc137da0f99d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_wnf (cyclomatic 69, cognitive 154): term_wnf has cyclomatic complexity 69 and cognitive complexity 154; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fd30c5cadc4e6f976004e6781f9cd1423dda1dc4e0d6ece9c49ce3cbd64b17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_term_base (cyclomatic 64, cognitive 97): parse_term_base has cyclomatic complexity 64 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b368683bcc5bf7c29232e9e8a7b809aa46abbe7d1d874c3746ea0d1fd8586f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_check (cyclomatic 59, cognitive 82): term_check has cyclomatic complexity 59 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":"bend2/bend.ts"},"region":{"startLine":3619}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feed426ce4963c539a577a97d9a8cf59db0f571b9fb0999412f9149ed526a61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function go (cyclomatic 57, cognitive 60): go has cyclomatic complexity 57 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcdadbe3e34a18bf8ef361a8483a14b27cc3e0e1e1a58fe37f93078ced9ddaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_file (cyclomatic 53, cognitive 57): cli_file has cyclomatic complexity 53 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":"bend2/main.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79189c41a3fd04ee65791ec6fbfcff9d7658135909c533ccc0d5e101ff12fda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_term_ops (cyclomatic 51, cognitive 83): parse_term_ops has cyclomatic complexity 51 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e6f7751cde310f0819d72f98a36874c32b46a97e4d30f8a851b251050a5f65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_infer (cyclomatic 46, cognitive 63): term_infer has cyclomatic complexity 46 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":"bend2/bend.ts"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"20027fb6d8ea8ac04814769f73a0256705e6293672b835a5a560761f53308ea7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function format (cyclomatic 43, cognitive 53): format has cyclomatic complexity 43 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"09099959f7f2cf9943100dc5f4e7f046f63b7c90ead244150441a76aa4dfc5b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tree (cyclomatic 38, cognitive 41): tree has cyclomatic complexity 38 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":"bend2/safe.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9c2405a79147e96d9466e29da1aa1c312f9c8a5f4b0a2be9322383d721458"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function book_valid (cyclomatic 37, cognitive 81): book_valid has cyclomatic complexity 37 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6d6348082fbb2a620abee884ebf789fead6f14ffa3bd75f6ccabf188903178"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_body (cyclomatic 33, cognitive 38): parse_body has cyclomatic complexity 33 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa59714536a3aaace821f19ba77cbc24a208ce289ba6a8aa99541f866f9e9296"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit_body (cyclomatic 31, cognitive 34): emit_body has cyclomatic complexity 31 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":"bend2/comp.ts"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd20306c0e2df08d36c9827d85e50a64beab5f8dffad3a8ad5acde3d574be657"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lv (cyclomatic 29, cognitive 20): lv has cyclomatic complexity 29 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":"gates/safe_diag.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"502a19b933af6ebbc97df3fbe6c8076baf47f3743391650f93423108125b7de5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term (cyclomatic 29, cognitive 11): term has cyclomatic complexity 29 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":"bend2/safe.ts"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0f1b330bb8b69b7a4a9804e99f974ec4ffc35e91e37be6ade090d049fc166"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function book_load (cyclomatic 28, cognitive 44): book_load 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":"bend2/bend.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"661056ce875b39ea0c86961aef74524acc813782505a5178fe938f394ece0d42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokens (cyclomatic 28, cognitive 42): tokens 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc0ce55ba647e91e8014cde5bd3ab054ebd6f536f867a6108e1966fe0757533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_higher (cyclomatic 28, cognitive 22): term_higher 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":"bend2/bend.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27dfb0d357c63c1d1babe5532b07888d9ce9b355cc45885a5cf36b203d62b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_book (cyclomatic 27, cognitive 68): parse_book has cyclomatic complexity 27 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":"bend2/bend.ts"},"region":{"startLine":2593}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebd5efd55f2972b3e40a2de48cb3397179aa4bebda9523fc26255cf6498a705"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function line (cyclomatic 27, cognitive 60): line has cyclomatic complexity 27 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6401885e2fa0ef82e9f8ae51e3e6612f74078c4388ff1b86d10f12ccbae646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function one (cyclomatic 27, cognitive 34): one 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":"gates/safe_node.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb6dbf1c67af54172addcabed140ab6ba3433735f2d6efb2588c1e7eb0ed8d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function facts_hot (cyclomatic 26, cognitive 28): facts_hot has cyclomatic complexity 26 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":"bend2/comp.ts"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae2724fb83afed4f16a39ce0a76b6c343288fc29c89bfcf51f0eb0a51da5070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sequence (cyclomatic 25, cognitive 47): sequence has cyclomatic complexity 25 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7171738eafbe5fffd8760cee3a276054c07de15334f007bee46585c90e6dc9e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term (cyclomatic 25, cognitive 41): term 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":"gates/safe_diag.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"214c6ad1e6f4f7917d482c6180989a9889d42a7c68ca303cc872762182da6fae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function separator (cyclomatic 25, cognitive 19): separator has cyclomatic complexity 25 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"641f0dddbd974591b512c2b2a8f4559f04362208f938dfb407293e65eb3f314c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function js_expr (cyclomatic 24, cognitive 27): js_expr 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":"bend2/comp.ts"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"4beadec4ca6cda329c8d975e9e66fe4191913b14659689c269d734a53dd1ab3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function output_input_links (cyclomatic 23, cognitive 20): output_input_links 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":"tests/io/output_input_links.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3475a761f572e31d7e59dc0ed4586ffa9f181936b734e52a24866b3500b03ebb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function match_flatten (cyclomatic 22, cognitive 37): match_flatten has cyclomatic complexity 22 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":"bend2/bend.ts"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"80eea16216cd9bc67f5397afe8573cda3c610686b1e13917b7482b2cc100014a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeDoc (cyclomatic 21, cognitive 29): nodeDoc 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd71a5781549774e52c3cdde87f2fa7ffc4ab08080136284cb12d71708e13019"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 28): (anonymous) 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":"bend2/safe.ts"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"82629a334b5df57931d7c197339476a6d1e3350a612feebafddd86d7e88865fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bundle_inline (cyclomatic 21, cognitive 23): bundle_inline 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":"tests/io/bundle_inline.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04be74a26744354dc8d0f1079965160f71b7802a7ad3a9953252a15f4ffc72a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit_expr (cyclomatic 21, cognitive 22): emit_expr 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":"bend2/comp.ts"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"653e0569eada8ced68677cada22e1b414d0daf100a91e244a133c030eb0eb09b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function model_at (cyclomatic 20, cognitive 29): model_at has cyclomatic complexity 20 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":"bend2/safe.ts"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a87c5cf8b4442785232968cce508b4bbd2de572dad3412353fabb10618673b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shard_parse (cyclomatic 19, cognitive 33): shard_parse 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":"gates/test.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec6d04ee7586f12990654da21b21a8cf4894474630ffa65a19a96eeb9cd40f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_descend (cyclomatic 19, cognitive 32): term_descend 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":"bend2/bend.ts"},"region":{"startLine":3356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7860fde0c771ddd6a78c574b7c36323d3132a59c056ee8784a1a35945af9a926"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_def (cyclomatic 19, cognitive 29): parse_def 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":"bend2/bend.ts"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"837bda49f79a26e9a19fe0245c01bc084fa327e23f9cd6b6d29235d767a1ab83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 19): (anonymous) 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":"bend2/comp.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcfad98ed427c372312841c5c15562ea4fc5f66143c5212e50d3b1094f337f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cc_find (cyclomatic 18, cognitive 28): cc_find 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":"bend2/main.ts"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c885f1727ac35c5fe80800e9f5b65537a5dc79bb2a6d7b560e1c023ddae2331b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli (cyclomatic 18, cognitive 25): cli 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":"bend2/main.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f80ebe17995c2a061db1f1cd7b31d007a745d4ca37ab973d0a4746d2627d6c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) 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":"bend2/comp.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4888f84f447700430f09e191d71da1bfc7d3ac9799550608572dea606cb9e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ty_holds (cyclomatic 18, cognitive 16): ty_holds 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":"bend2/comp.ts"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab289a6a03e5f90cf7a777780d8addfe452ec1d4763705e39804a76076c2f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function u32_from_term (cyclomatic 18, cognitive 15): u32_from_term 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":"bend2/bend.ts"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd68c473532d3d7a411919de3de6954e265e40a51943f68095c0d9b543e32cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit_ctr (cyclomatic 17, cognitive 22): emit_ctr 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":"bend2/comp.ts"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e74fe755aa68b1d20481f18f242849607e5d2aaf14dce8a660c452c549955e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function js_func (cyclomatic 17, cognitive 21): js_func 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":"bend2/comp.ts"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95b4b0f216c9fa55dc059b4ff3b2d31e87bc3a320ee5da1cf958213b731190f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_term_do_stmt (cyclomatic 17, cognitive 16): parse_term_do_stmt 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":"bend2/bend.ts"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c92153a4078e7b221a6831770d3902a025ca61b7573bcafcf440e9cf30521"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli (cyclomatic 17, cognitive 15): cli 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fcc1c7c0e9965181835f4c481fb8f80898d883ed2a041efebb63ddaafebff7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function item_ref (cyclomatic 16, cognitive 21): item_ref 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":"bend2/safe.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0957c892a29d61a739bdfcfa3bbf4b15373e388ac69cee5c7b45c14dff079e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_login (cyclomatic 16, cognitive 18): cli_login 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":"bend2/main.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"986b2166bc4e6e1f54bdad956e4f1701ef30b5b3746cc528134db09b63d2c009"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function show (cyclomatic 16, cognitive 16): show 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":"bend2/comp.ts"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae11fe9e1af9bcb651c5312513da8e7d75c5658acd80527eb587439d34d8c7b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_tele (cyclomatic 15, cognitive 22): parse_tele 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":"bend2/bend.ts"},"region":{"startLine":2487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3ef118538abeaafe986d38c5e75f6569bb92b26132febca2ff14bc4d4092bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_term_num (cyclomatic 15, cognitive 19): parse_term_num 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":"bend2/bend.ts"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a82307b84217c565dfc4846504828ec8653ae45b4cc7c14bf72326d0e46a42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function swi (cyclomatic 15, cognitive 18): swi 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":"bend2/safe.ts"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd695080ea2caccee9f7bd280873e9814709459ab99df1b8eb1380b6e40525"}},{"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":"bend2/comp.ts"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"123dbb3a38f0da18190ffd84bb7249b69237f227f2e66e1c6c7601f2615d9b07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tree (cyclomatic 15, cognitive 13): tree 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":"gates/safe_diag.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce024a5e17723e8d38ff061b048d30c347d25a7713eb08b5ea326376dde57401"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function uses (cyclomatic 15, cognitive 9): uses 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":"gates/safe_diag.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc820417233aa0ca624a747f3c3168d0c5d71d95960bc18a85f4c09b37276e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function book_promises (cyclomatic 14, cognitive 24): book_promises 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":"bend2/main.ts"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f5212c315ad5e74b57d78d1b9374fec096d22a21b1f15a435864b879897690"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mat_rows (cyclomatic 14, cognitive 21): mat_rows 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":"bend2/comp.ts"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacdeb2dc2830002bfa46db1bf1b7d121775ac129e661798a6671d3aea8baa6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function file_read_with (cyclomatic 14, cognitive 21): file_read_with 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":"bend2/effs/file_read.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b119e76aec553495537b162eff7c1f3b7ddf3acf54a956564b50d2242f2589"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_patt (cyclomatic 14, cognitive 18): parse_patt 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":"bend2/bend.ts"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecff167a62578c556b09842ac182060f37ef1c6f66999cc8fd6973ef1709b0e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settings (cyclomatic 14, cognitive 18): settings 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7abe3700cc1473d92dfae504eae47740e9b86f65fb916c3fa806000802c25f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function emit_unfold (cyclomatic 14, cognitive 16): emit_unfold 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":"bend2/comp.ts"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc11073dc1f9ed2328911f1438e5a72c07e2d7913bf39146ab68412e6811413"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walk (cyclomatic 14, cognitive 13): walk 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":"bend2/comp.ts"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"618a24ce7dcb986de479d72c0c22d87717340bb966571a56700a7b601e58f6d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process_run_node_module (cyclomatic 14, cognitive 13): process_run_node_module 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/io/process_run_node_module.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac09e033419cfc8b66bc73badfcf97942aed947fc20934f8c21f616b35cdfd40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function term_same (cyclomatic 14, cognitive 11): term_same 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":"bend2/comp.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd46198dbc72e8c916f4375cc6948d7c0165a69fe8e7d41fdafee8ce3548bd3d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safe_pass (cyclomatic 13, cognitive 20): safe_pass 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":"bend2/safe.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"562eff6661bd47a9cc431359fe1097925cb26dfad986f879fff36a7f3eef2071"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function row_val (cyclomatic 13, cognitive 18): row_val 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":"bend2/comp.ts"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8f31541425fe9178eff18b8cd0895dfb0f76e83afbd5a6653d556ce96de323"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function called (cyclomatic 13, cognitive 18): called 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":"gates/safe_diag.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa695cea83104d188b8663c8f386d1074b1a8633c1d5b4cb9cb812c14b38e9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function print (cyclomatic 13, cognitive 18): print 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":"tools/bend-lint/rules/format.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42a0f4ff0a2d2f7a0683c8b06e12d763b426af5d9c4a7346da9dda88cf60195"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function options (cyclomatic 13, cognitive 16): options has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-cache/src/cache.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"134f9c37658a76b39617b81ba420f8351dd0fce4efa0cede3496d2b4bfb2a80a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ctr_term (cyclomatic 13, cognitive 15): ctr_term 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":"bend2/safe.ts"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a4b4621201274566937bf9212cca5d7359d2afc50a04ae87db5442f8b9faf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"206d6794c2eddf2c8a9722c9e89be49ca4accc5627fb9409f9fab5424effd900"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_build (cyclomatic 13, cognitive 13): cli_build 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":"bend2/main.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd24fd1d59275bbfb3c0683ec65340aa0275b223e62977ee7ca035c06dc42527"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_publish (cyclomatic 13, cognitive 13): cli_publish 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":"bend2/main.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea420d1e2bd6d18a3e411c30c469d8c2a63e7ebe2b49ebacc4d250838c0018c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judge (cyclomatic 13, cognitive 13): judge 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":"gates/safe_node.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0c4d7ff93181548c20a8b6177416454df95136e34beceeb1ab68dcf63be783"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function def_inst (cyclomatic 13, cognitive 12): def_inst 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":"bend2/bend.ts"},"region":{"startLine":3878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652861129fc14597b6f4422d4b482a17377359842a73daaf49fffe3e86b4e01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function state_run (cyclomatic 12, cognitive 28): state_run 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":"gates/test.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2169875c49a9e524a9ef3b9f451185eab5b6f1a48abc183ad76b9f647292861d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function file_book (cyclomatic 12, cognitive 24): file_book has cyclomatic complexity 12 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6292b6818d6c897a1998930114eb9867d95f09b8e84b38753d77f2d10a6ae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) 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":"bend2/comp.ts"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cfd19878e51b0eca1dc0da07214bcfead3f877a9eefe878402bf467906e312"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exit_status (cyclomatic 12, cognitive 12): exit_status 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":"tests/io/exit_status.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ba1adcc98fde675032eabc934cab601514404ed9e1cff84356ab2126a9bcbb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kernel_check (cyclomatic 12, cognitive 11): kernel_check 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":"bend2/safe.ts"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42d583259358c24437db96afbe598cd245365135318f6d08fe9ef1c178d09ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor_interchange (cyclomatic 12, cognitive 9): constructor_interchange 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/io/constructor_interchange.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51530ad242e42dd1219ef61c555916fec6351fd13848b86f12580bd81a65fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_checkup (cyclomatic 11, cognitive 17): cli_checkup 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":"bend2/main.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"8880fb2768a1088bfdaae3dd3028d28a4ed5384c82d44bf15ac04ae8560815b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lint (cyclomatic 11, cognitive 17): lint 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":"tools/bend-lint/src/lint.ts"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a40e41c7984821e14faee69be63aa0d5b6d90d17d7fb9a68b8e1943786e3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cli_base (cyclomatic 11, cognitive 14): cli_base 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":"bend2/main.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4679d9ed7929b5919053eab79889ed7910a97e65aae807e8ed99cadc311af2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arm (cyclomatic 11, cognitive 12): arm 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":"bend2/safe.ts"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98e7ee637eb1729eef3dbfaee7371e3e1d1fe1a4aab9ddfeb93e13980ac4322"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) 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":"bend2/comp.ts"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"2956abf92114c8697033be469bf72cb8beb835a453adb2f8485c133feb9aa066"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function js_call (cyclomatic 11, cognitive 11): js_call 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":"bend2/comp.ts"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef01037361f3ce932517f49627f3a9279da437c1b57609a2339d3d0f30418d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function node_fields (cyclomatic 11, cognitive 10): node_fields 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":"bend2/comp.ts"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4531a3622a4e3b17c7f71f7c39e2fa76d07ff5ec0f23556fcac096f89c896d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function arg_term (cyclomatic 11, cognitive 9): arg_term 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":"bend2/safe.ts"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6cc344ec5dde8a5c46c1a5874582a2e999b245e38a5a2e053af7457cac9745"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bundle_page_input (cyclomatic 11, cognitive 9): bundle_page_input 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/io/bundle_page_input.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b665a65592fca6e0390ccb5bb0e0829865c63316797ec8b04a5d15818b82545"}},{"ruleId":"R3","level":"warning","message":{"text":"bend2/comp.ts: 5797 lines of code: bend2/comp.ts has 5797 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/comp.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a1e01cd5522b8082883f422798d8626ee76116068a76396545519c9a44b5ab"}},{"ruleId":"R3","level":"warning","message":{"text":"bend2/bend.ts: 3805 lines of code: bend2/bend.ts has 3805 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e68d2f86062d371193e66fcafbc1cf51440eb086bf9184ff8a41564cbd529d"}},{"ruleId":"R3","level":"warning","message":{"text":"bend2/safe.ts: 1601 lines of code: bend2/safe.ts has 1601 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/safe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7747a08987caccf159fdc1d1881ee32cf4e200045c85d95705d44c0ba2303f6b"}},{"ruleId":"R3","level":"warning","message":{"text":"bend2/main.ts: 1088 lines of code: bend2/main.ts has 1088 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"312014f5b826ee13451f2c4b8b39abadb0c502c510f1a3ff3ccbfa443d8dc973"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/bend-lint/src/seam.ts: 1040 lines of code: tools/bend-lint/src/seam.ts has 1040 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/seam.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd996ab2a93b686af7cd337560e7ae91d595e898e8455f88b0cd770937daee3"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/bend-lint/src/lint.ts: 792 lines of code: tools/bend-lint/src/lint.ts has 792 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae35edc00fe5744c9c75eeef057e233eceb390dfe1902ab92bb30f11aca5e0b"}},{"ruleId":"R3","level":"warning","message":{"text":"gates/ping.ts: 673 lines of code: gates/ping.ts has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/ping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37992175789724f7e0881a289e9d8ebdc27c256751e185b77f46b129feb0396c"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/bend-lint/rules/format.ts: 487 lines of code: tools/bend-lint/rules/format.ts has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/rules/format.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc52823dea30bcc2cdee743e54ac195b64cedd7da9bdf48834646bfbc87704e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/ping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fedeae007d138421b2a2ca20ce0a99f52649a105f3e8ce99b9bdd1c3d4777d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/perf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f6532ee3532430d2d97e79a552f10584152899e56b01ae86ee362637d1f7f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fd02d631fc2757d6400ccc7f8b65edd1f0d0dc14c088d6b7967cc7658bc98f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/_lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6591baa88df752a598c7baa21a00f455bcefaf299200adc766148cd362593302"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/chan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7d74549245589c1e8a10888210f537babd66daecbbe2ebc7eca44266ccfd41"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_diag.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60259f514760890cfbcfa1f914131ade5bc7cedf1de10e44ddaf4e210e3e1932"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe_node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e859dd2ae5dc3614d444c65c62c80e9b93e7cb661fdfef94171e1c48ca0924"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/bend/effects.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a921fbd9f085426eb7193f39845aa728a8afa92084879788d3127f8cc9911d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/repo.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bf8bd0460c94286d133477c2163bfe5a72ad7ad959eee2e41e28984de43442"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/process_run.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc0594733dc541065b4909a89cfff417e52015d6fd1eac1d886b083d3e2dd92"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/safe.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d4af41a412bf274a7ab6d0265728fe424763656bc02ead943395e3671b87dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_read.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cb031557eb3f375716ecbd596b1b9e5294869449bb120585286401c434c84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_send.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69d359209ec4626497385701824572d44e890867a3e3de0cbcda13c2b811d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/udp_send_to.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a630f23e97b79bf8ad6308279b053eb91a47081477766a11e378f860ee4831c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/udp_recv_from.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"714021c1691db6dd63304a8de95b1639beb3f11b448646dd5a9d3421fbe5dad3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_recv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae629849bfb57ee86726c0ccac0575626cbecf3f902507ca45ce464d6fba1d4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bace7f12119444d3c05bf8f39f60be83c2a16a28bc3e773edf351e62f73a0b9a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_accept.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e3ed0a9a8cf8e1e81c8e83ba1f35f192fe45fa13189c79197f927ad8e0e709"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/_run.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c36f9d5c6f077b0102356ac0f9da944fd1e0321346091f95ab10a91d6a58b64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_connect.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4f5fde6898a941157951e9b531c6196b58eb71a1ae4ad31e733a7c54464ddc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44226364117320ebc97d29837b7f09c206aaa1e6cc0a3957d03bd5576dc13aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/tcp_listen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98965aea928126af21331be420b00e0c4d250893113f3039769d1993d1501e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/audio_write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42328b1a5c31ea32cba54c6f73fffbf0832dc99602ff921ea2d281e7684084e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/args.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e416cc4f0707d853771f949c3c6fca45e846400714017030f008e763d42e23e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_size.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6e2873e40908cbd0bb442ff42cf40034c6220e407afd260ed0ed679f98e131"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/udp_bind.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e03668211eeb75b1ada7dc20da4cde5d18d6887077ea8811f5cdfcfba291fdd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/random_u32.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8812edb02b8839b6a35152ec8ec87e29f1e067d57d3b69db352873b0bad093a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf33fc853cc4c2b8cddce891465e1fecb306f91199d9ae06eb533930b384ca9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579133a1cc6ac8613d07dc89cec0d34c9b74ebcd362deed9056b049b586c4300"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/audio_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0e8524c1210512286fbe5e05818beaddb71b144541ed109561654c6a3540d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/get_env.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ee86a592224b85fd0d6661e225fd2325ef16e6200f4fd62394efd0c8eb1ead"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/sleep.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd6d6a1285ba6b2f070501103b4b64adcf6fc0a32df8e06046251de6fc0973b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_fullscreen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ecca7f05fd6a380f58efe88c565f9ddfc175dc3872c274417acd21b8d145ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/listener_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01cc9c3cf77f179ec414f0a754c2789b3487075fcee93367bf9edbecb9263ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/print.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db23dd51df6c28fa180f7bfb77fed83531857c9a336fb0eae33abc2e8c0a244a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/print_err.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db007ffaf5989c37abd5fc302e15b5cc67529ae06ad17313f01c09f8a5ecc83d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/socket_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ea55a0a889ef6c08005d5ee47c44cacbf1093d7d1732316d348cd134b7d53d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/spawn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f79e318359336c4c55a49f6536ead956de94c9be2a5dee225756866f6449b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/thread_count.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd3e698403f9e9c58022813f734ab8ed79990fd425a0fddee4bb528546a9971"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32df1ce9ee4af242e77012293b0ba246989ab602b033214e9a5357f899e9dc6e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/audio_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf612bf250e3d8283acf86193bd333659d53d1c27936fc6c7d14d7c220da8e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"684ca72b06c7064349b661dc27b81c11973082bce9d4937447ca4a2acab7f8d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_frame.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db6e85fa5030c8367a72509214e9c0e30d90636238efcba7272220761741b97"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_grab.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21a280bb828cf043b673bd8142f290c5cadb072be06ef165641817596dfc132"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/window_set_title.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acabac2617c9b0328044d27b026dd2d92812adac4d786c822285299278267f9"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~150 LoC): no import path from any entry point (13 application, 9 tooling, 113 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bend-lint/src/bend/effects.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d791926cfeec591f120a9190e9ea17f14885094f7f5deaf39f97dd70656a3e05"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~123 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/process_run.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc66d3545de52f20bcd8956f57039b85f49cda14ec2d1282a17727a3bc8be5c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~85 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/file_read.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3b7645a06fbb07a71b6553fc2d47148e1c873c7ca5bcb166c435e5b47dcf19"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/tcp_send.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258006d9a608d1524adf8b0509fcc823e5df86e1d8d42e65e5ed8bcf59cf42d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~71 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/udp_send_to.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc708d5468b403c4533150d71e58d888e722b2459f0df022f6fa8ade65f2da02"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~68 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/udp_recv_from.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"522eb481bef4a2d854f802557228d779b1f92d1a7c3bac8f7947a41ae6265e6d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~62 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/tcp_recv.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"958b41c47fbe93a4df8f9f9d87812247f2c37f6cb356c238e14c5caa53b5feee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/file_write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66bf87d1a169610e59dc8acac8cd35b5280b498160c4dfe4d0d1e1f7b15d48f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/tcp_accept.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66f9d2f73b9e26493e0571e7e192b5212d1a77c99002f1cd48730c1f156e3bb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/tcp_connect.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed53d1d4646f6fb123e0adcdc71074799faadedecb82b5ff34e5fe80c5563be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~37 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/file_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c49db0369fb4ce328b40b9ae5d9b72f4a93a5dd85694150bd3ab35d24d7127"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/tcp_listen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cf5cfb86f456132786c32b0b968a2a36f54f9e6e356bec3c7cd66c7d14e538"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/audio_write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22065a30025862d22a21f4f8943830648558baadd1d2dbca07c8d0122f9247f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/args.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4b88d77d6480613bb6dbaa11dd946eb433b777b2d8691611a34d24a1062153"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/file_size.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b149fd7c579cb0246244441e38130fc866c80f9b0937b82dc7d9dcd82f357201"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~23 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/udp_bind.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a36493c6295c2823c326fbf5f818aba1b17eddc6185a3d7d1cf14c54c5d5e12"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/random_u32.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29313c903a6b442ec45303bf661d50da35dcb66385ee7e82f9ed3a086015966c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf7afec0b740123f446562a06716ddd0bd5f3cf2890e18b57b0a5468d43d5b2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/file_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d876bebce6e80989070925beebfba052e794b365ca196fefa56b7347cafc01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/audio_open.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c61dc901221acfa90b25c229f169d215398992d06153166a7d397d62c006e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/get_env.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab6d126dc3684e54912a79efe54a759d1fc34cad6912d19547d26d79e5f56a5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/sleep.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14585a5a266e0831c6203ee3489e5b2d5e41cb5db8a5cba3c8c1e3d3a8f4ac5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_fullscreen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c30464ad1dde2bc193c2c35116778661c37dae426c29c7c94c898401f8d839"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/listener_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"686729ca3dd3ffb58a83445c2604dfd414a1649253f47609d1d7829c3ac09fb2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/print.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d35c0f0fa51b05239791c75bf6bba1211c584df909f0c284998b8990234a58"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/print_err.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e432e3e09a257237caa6c30f96ebd1818648ee8a2775def395c589f4dc460e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/socket_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c58b9799db4b95a274f10534fc9dd8500d0960654e558b4004207aa12742b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/spawn.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19664abbe8e435e314b958af958b901384d0090485ba2114219cece711621fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/thread_count.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62365a61210362c4a500faec6c0be873a4ec585c26cab74f07649eb767699dce"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/write.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c5f60c8f31aa1970761c626578612c03f21fc8eae967dbc377609eb3f50b11"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/audio_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a64f8b5cd549c7f849e793deae6ee72d6cad9a7d7d420782659ee113eecf1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/now.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0b3a346a0909dbcbdfdce17d582277a42c9df727658678e8d0346a4571e5ac"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_close.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c09a078046133718463faec85cad6b16331af3db9996f75eddc7adc1bbe96df"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_frame.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4718f1bdf93ec88b4d2cfdb01408551a9c621d2e1e179ff9ba5c30aea2ef631"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_grab.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f052798297976bffc8f3b737c10c5d920b1a905a17f68d0c604e8c73bf7126"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~8 LoC): no import path from any entry point (13 application, 9 tooling, 113 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":"bend2/effs/window_set_title.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8118e6a18f2fdb11dd2c52f3ad4665a841e64fbe1159d0206275c7771237fe34"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: bend2/docs/intro/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":"bend2/docs/intro/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d0af47c45f29f3b2a934c1337e0ecc8f8871840a401f52a2c79c9a86d41b1f"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tools/bend-cache/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":"tools/bend-cache/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d828acfb0d4c5c91529a4ae50a105f09e0078e877bfa59a0a6f0f443bfc9ff51"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tools/bend-lint/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":"tools/bend-lint/package.json"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58488e06d803d0ed0e7f068c78058d9e981b90c45d5e5644039466213bcdadd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m === null || (m[2] === undefined \u0026\u0026 m[1] !== \u0022Base\u0022)\u0060 appears character-identically in 2 files \u2014 bend2/bend.ts, tools/bend-lint/src/seam.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":"bend2/bend.ts"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32834952a405bbcc7647c8721926c8853c9ef798dafb591fe6c49ac6d0ac1b7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pmap_set\u0060 is exported and takes \u0060map: PMap\u003CT\u003E\u0060 from its caller, and it calls itself at line 541 (\u0060pmap_set\u0060) with a piece of \u0060map\u0060 (and at line 543) \u2014 and nowhere in \u0060pmap_set\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 \u0060pmap_set\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9de48934575f9c471c2c70fce060546538d4073d337bf0b1ab7d2b5afe9782"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pmap_union\u0060 is exported and takes \u0060a: PMap\u003CT\u003E\u0060 from its caller, and it calls itself at line 554 (\u0060pmap_union\u0060) with a piece of \u0060a\u0060 (and at line 555) \u2014 and nowhere in \u0060pmap_union\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 \u0060pmap_union\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f63077f9fb2c444cfb7ea1cee385deca381fefd16ce79b5c415ecc56ebb8399"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pmap_to_array\u0060 is exported and takes \u0060map: PMap\u003CT\u003E\u0060 from its caller, and it calls itself at line 566 (\u0060pmap_to_array\u0060) with a piece of \u0060map\u0060 (and at line 567) \u2014 and nowhere in \u0060pmap_to_array\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 \u0060pmap_to_array\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b514c16736cedeb25be6845eec6d450827a4aa1e432e7d40d129bd9bb30e3c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pmap_any\u0060 is exported and takes \u0060map: PMap\u003CT\u003E\u0060 from its caller, and it calls itself at line 579 (\u0060pmap_any\u0060) with a piece of \u0060map\u0060 \u2014 and nowhere in \u0060pmap_any\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 \u0060pmap_any\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"402188187c0fef7e9ea1f1466883df252cb0ba8144b6ed5601adeeb67805f997"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060term_higher\u0060 is exported and takes \u0060tm: LTerm\u0060 from its caller, and it calls itself at line 737 (\u0060term_higher\u0060) with a piece of \u0060tm\u0060 (and at line 741, line 747, line 752, line 754, line 760, line 764, line 767, line 770, line 771, line 778, line 781, line 784, line 787, line 790, line 793) \u2014 and nowhere in \u0060term_higher\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 \u0060term_higher\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"942fdf0e072b86688a637d0b4697913d87f6863b97aaea1892b5c14d030bfbc2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060term_show\u0060 is exported, takes a document from its caller (line 1240) and hands it to \u0060term_show_sugar_arr\u0060, which calls itself at line 1301 (\u0060term_show_sugar_arr\u0060) with a piece of \u0060tm\u0060 (and at line 1302) \u2014 and nowhere in \u0060term_show_sugar_arr\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 \u0060term_show_sugar_arr\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"820a270d5b2e5d9d0f53e8d3e7acb1a2d02bc420dfff069b1f80021ed425a9b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parse_patt\u0060 is exported and takes \u0060t: LTerm\u0060 from its caller, and it calls itself at line 1788 (\u0060parse_patt\u0060) with a piece of \u0060t\u0060 \u2014 and nowhere in \u0060parse_patt\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 \u0060parse_patt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fbbda9279f168ece2c78594341f220794217f5f5c380a992ce8b0bfca0eabf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parse_term_ns\u0060 is exported and takes \u0060tm: LTerm\u0060 from its caller, and it calls itself at line 2207 (\u0060parse_term_ns\u0060) with a piece of \u0060tm\u0060 (and at line 2223) \u2014 and nowhere in \u0060parse_term_ns\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 \u0060parse_term_ns\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b66ae8bcea7945a867fe455052da3519ce34a4715674f4c8faedb44630ddff7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060body_sub\u0060 is exported and takes \u0060b: Body\u0060 from its caller, and it calls itself at line 2730 (\u0060body_sub\u0060) with a piece of \u0060b\u0060 \u2014 and nowhere in \u0060body_sub\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 \u0060body_sub\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"255229d5b953317d1f3478650a591c5779312f70dffc5c8230211c8742d0d8f4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060patt_term\u0060 is exported and takes \u0060q: Patt\u0060 from its caller, and it calls itself at line 2842 (\u0060patt_term\u0060) with a piece of \u0060q\u0060 \u2014 and nowhere in \u0060patt_term\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 \u0060patt_term\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf4fa06a57c87788612acef7baa9f592db95a267641e15341814aadd251d8a6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060body_flatten\u0060 is exported and takes \u0060b: Body\u0060 from its caller, and it calls itself at line 2856 (\u0060body_flatten\u0060) with a piece of \u0060b\u0060 (and at line 2864) \u2014 and nowhere in \u0060body_flatten\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 \u0060body_flatten\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/bend.ts"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b4ed5b99e4942e9471e2e95d347a5ff4428527fe0e35a3f305efdbf4dd258d"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 3/7 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: hub_wait: \u0060hub_wait\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":"gates/ping.ts"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a6254b5bcb20596492e622d044478170ba68cfd9552828d6907a8e5cbfb9ff"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: cli_publish: \u0060cli_publish\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":"bend2/main.ts"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc564ee130a2c81495d35a82d7f4cedaea677f26e33d35625c6d1f20deaa1ab2"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: hub_ask: \u0060hub_ask\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":"bend2/main.ts"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ed4819ab9986116f6d7b56289f6820f0525713a1e67e75650f1ffa9751d385"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: cli_login: \u0060cli_login\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":"bend2/main.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c4822ca68a18b2a2f92ad3b62b15a47aaed6026dbacb3398810e6b09912b83"}},{"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":"tools/bend-cache/src/cache.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd4cd03fd1ab6141491c87303b7a7ff37deb45dcc2586b009cd056a02dff740"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/_lib.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"321caf9fbc6c60fec762aab67360354503721f768516986a4cb5cc5890ce5d56"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gates/_lib.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"63577302308e4ccb128d3c2d36945ed9882d33c62d28fd4d62f1f9aecc54072a"}},{"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":"bend2/main.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae738f79a1e343d9391907f45d0327e44e4ffcfbdd14d5fcd06968830a8e40b4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef98b10ab12e0fe2449261fd65155099f5db607b4c0ad28918ced1fdaa6afae8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c449dce12c2386593972afc13ef4d3e445021700d5217d3652d66a5bdb59c6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f876a1ef908d72a697de9da775f777ecc80b29f1376194b1eb083eebfa8c02e7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/main.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d359f6f4eab7b42e448055a53bdbe16d698ba81d163e7b981161eaa9efe4407"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_close.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f118e933bfc6eba946e3842f7d5e999716deaa6cf221c12b10e3adff934d8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bend2/effs/file_read.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6b9613804ff9144524268787b2cda842a176b65a06724d5e3f41b0cbdce8fe"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~5.5 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 124 assertion(s) across the 22457 source line(s) of the 21 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: bend2/comp.ts (80), bend2/docs/film/film.ts (14), bend2/safe.ts (8). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060rows\u0060 (in \u0060pin_read\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":"gates/perf.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f43c7d89f2bb230abcc009334684c01e7fa5c873535cd99c1222a73fadcdcd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060logs\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":"gates/ping.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af3fd2b16df2326e1521aa02b994c6612105ca18ebaec669b4f3f55e4e8e180"}}],"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-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-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-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":10,"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."]}]}