{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"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":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"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":"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":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"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":"abi-regassign.V.register(\u0022abi-regassign\u0022) (cyclomatic 93): abi-regassign.V.register(\u0022abi-regassign\u0022) has cyclomatic complexity 93 (threshold 15). Most of this is not in the body itself: 1 of the 93 points is its own statement and the rest belongs to 17 function items inside it that branch (a function literal at line 214, a function literal at line 255, narrate, \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":"website/themes/book/static/viz/widgets/abi-regassign.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2693696eb1abb704dae4ddf0190051236abc2f8052e27c9a6694ad99720b16"}},{"ruleId":"D1","level":"warning","message":{"text":"link-deadcode.V.register(\u0022link-deadcode\u0022) (cyclomatic 81): link-deadcode.V.register(\u0022link-deadcode\u0022) has cyclomatic complexity 81 (threshold 15). Most of this is not in the body itself: 1 of the 81 points is its own statement and the rest belongs to 20 function items inside it that branch (a function literal at line 184, step, a function literal at line 171, \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":"website/themes/book/static/viz/widgets/link-deadcode.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"07581a83da28cdf197d907588a7ec66bb16d5ed8c3bb7ada3f0540f9694d3a85"}},{"ruleId":"D1","level":"warning","message":{"text":"panic-unwind.V.register(\u0022panic-unwind\u0022) (cyclomatic 76): panic-unwind.V.register(\u0022panic-unwind\u0022) has cyclomatic complexity 76 (threshold 15). Most of this is not in the body itself: 1 of the 76 points is its own statement and the rest belongs to 13 function items inside it that branch (a function literal at line 331, a function literal at line 265, drawStack, \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":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a16c9eea3adc67bb219ad745bf3b27511cf9ac29baf90d75e2ada9c50454d84"}},{"ruleId":"D1","level":"warning","message":{"text":"csp-rendezvous.V.register(\u0022csp-rendezvous\u0022) (cyclomatic 74): csp-rendezvous.V.register(\u0022csp-rendezvous\u0022) has cyclomatic complexity 74 (threshold 15). Most of this is not in the body itself: 1 of the 74 points is its own statement and the rest belongs to 15 function items inside it that branch (draw, a function literal at line 219, a function literal at line 155, \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":"website/themes/book/static/viz/widgets/csp-rendezvous.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3be1faa4e5b12b4c3329fcabd7f0033ebb266fedc3be681ea45dba19349455"}},{"ruleId":"D1","level":"warning","message":{"text":"select-order.V.register(\u0022select-order\u0022) (cyclomatic 70): select-order.V.register(\u0022select-order\u0022) has cyclomatic complexity 70 (threshold 15). Most of this is not in the body itself: 1 of the 70 points is its own statement and the rest belongs to 25 function items inside it that branch (draw, a function literal at line 222, a function literal at line 259, \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":"website/themes/book/static/viz/widgets/select-order.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6ec7e7aed9abdb6d9a2961207482d24a3e080e1f7ee94fe3bfa6c0d1ec429"}},{"ruleId":"D1","level":"warning","message":{"text":"mutex-starvation.simulate (cyclomatic 61): mutex-starvation.simulate has cyclomatic complexity 61 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 43 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cc817e818b5dd8209265c13d07db9ca246a03ed345b93ea98fb425d485753c"}},{"ruleId":"D1","level":"warning","message":{"text":"viz.gmpScheduler (cyclomatic 57): viz.gmpScheduler has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 4 of the 57 points are its own statements and the rest belongs to 13 function items inside it that branch (step, schedule, draw, \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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f254c833fcddff1c7999536a92d157104be66bcf537cae925f11b649b4fdab"}},{"ruleId":"D1","level":"warning","message":{"text":"raster-depth.V.register(\u0022raster-depth\u0022) (cyclomatic 57): raster-depth.V.register(\u0022raster-depth\u0022) has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 3 of the 57 points are its own statements and the rest belongs to 20 function items inside it that branch (draw, stepPixel, describe, \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":"website/themes/book/static/viz/widgets/raster-depth.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"427332d18235dfe0da18222c3f174bfd45e4cfd950bb99dc2fbf7fe4efc32f80"}},{"ruleId":"D1","level":"warning","message":{"text":"mutex-starvation.V.register(\u0022mutex-starvation\u0022) (cyclomatic 54): mutex-starvation.V.register(\u0022mutex-starvation\u0022) has cyclomatic complexity 54 (threshold 15). Most of this is not in the body itself: 1 of the 54 points is its own statement and the rest belongs to 18 function items inside it that branch (draw, a function literal at line 286, a function literal at line 299, \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":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f349ba0c850ee20881e8d62ab013476421137b3bf8c4b5f9a5e6b394cc77512b"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-barrier.V.register(\u0022gc-barrier\u0022) (cyclomatic 50): gc-barrier.V.register(\u0022gc-barrier\u0022) has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 12 function items inside it that branch (drawGraph, a function literal at line 195, stepKind, \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":"website/themes/book/static/viz/widgets/gc-barrier.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"12153b7ca909aa2a79b83f5f61f73a64c7ae5df2e3a653bcd496e5ac3392e582"}},{"ruleId":"D1","level":"warning","message":{"text":"slice-growth.V.register(\u0022slice-growth\u0022) (cyclomatic 50): slice-growth.V.register(\u0022slice-growth\u0022) has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 11 function items inside it that branch (a function literal at line 169, a function literal at line 114, boxes, \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":"website/themes/book/static/viz/widgets/slice-growth.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"827426b99549f1f3e5e0c152bf7a9f15855d3d3c0febc9c81d22f422ca3f0e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"continuous-batching.simulate (cyclomatic 46): continuous-batching.simulate has cyclomatic complexity 46 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 12 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd26e24464eeeb6439171aa1c4168540b758691625019362d22223172c8a7ec"}},{"ruleId":"D1","level":"warning","message":{"text":"swiss-probe.V.register(\u0022swiss-probe\u0022)::drawTable (cyclomatic 45): swiss-probe.V.register(\u0022swiss-probe\u0022)::drawTable 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c947d4bd4e9dfbc59680259e2c7c8dca1079efd900a60be9190e8b0648665f"}},{"ruleId":"D1","level":"warning","message":{"text":"iface-data.V.register(\u0022iface-data\u0022)::draw (cyclomatic 41): iface-data.V.register(\u0022iface-data\u0022)::draw has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (iface-data.V.register(\u0022iface-data\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45176249d1eeab2871ebee528833c579a2188cc1775aad8455885bd1be79ac8"}},{"ruleId":"D1","level":"warning","message":{"text":"bench-ramp.V.register(\u0022bench-ramp\u0022) (cyclomatic 38): bench-ramp.V.register(\u0022bench-ramp\u0022) 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 8 function items inside it that branch (narrate, a function literal at line 124, draw, \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":"website/themes/book/static/viz/widgets/bench-ramp.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"43500529db7ce616920a9c6f1835e5c95987e9bd24dacbfa9f88fc44816fd6e3"}},{"ruleId":"D1","level":"warning","message":{"text":"escape-flow.V.register(\u0022escape-flow\u0022)::narrate (cyclomatic 35): escape-flow.V.register(\u0022escape-flow\u0022)::narrate has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/escape-flow.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de1c5241c3b7709a43d7dcaf56452495957cdbd552c86a3fe98324249d29621"}},{"ruleId":"D1","level":"warning","message":{"text":"sysmon-backoff.V.register(\u0022sysmon-backoff\u0022) (cyclomatic 33): sysmon-backoff.V.register(\u0022sysmon-backoff\u0022) has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 7 function items inside it that branch (draw, explain, a function literal at line 122, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/sysmon-backoff.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb904de81d8284507ce05692b0c6dc3dacf073854f07d04fce8fbcb8efbc5ff"}},{"ruleId":"D1","level":"warning","message":{"text":"gpu-launch-overlap.V.register(\u0022gpu-launch-overlap\u0022) (cyclomatic 32): gpu-launch-overlap.V.register(\u0022gpu-launch-overlap\u0022) has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 12 function items inside it that branch (a function literal at line 73, draw, frame, \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":"website/themes/book/static/viz/widgets/gpu-launch-overlap.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e77235ed227a00c218cec3c193dcf2d407e24a6e0266d837d0bccd7d6af102"}},{"ruleId":"D1","level":"warning","message":{"text":"race-vclock.V.register(\u0022race-vclock\u0022)::narrate (cyclomatic 31): race-vclock.V.register(\u0022race-vclock\u0022)::narrate has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/race-vclock.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0444d5d24f10e049a51bd81fc5031ec284a3cf93eda01c5f3fda5d7e511ff49d"}},{"ruleId":"D1","level":"warning","message":{"text":"escape-flow.solve (cyclomatic 28): escape-flow.solve has cyclomatic complexity 28 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/escape-flow.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"129b7cbaf5b60e4c8b31d5fd103375edb427ca2b4bb0838f6490ef5c9c9df145"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-barrier.run (cyclomatic 28): gc-barrier.run has cyclomatic complexity 28 (threshold 15). Of this number, 25 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":"website/themes/book/static/viz/widgets/gc-barrier.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5e518b762c1afad0ee152279c20ce4f3f371fbe2a91ed9b4f69bb918a43f3"}},{"ruleId":"D1","level":"warning","message":{"text":"csp-rendezvous.simulate (cyclomatic 27): csp-rendezvous.simulate has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (tryRecv, trySend, a function literal at line 86, \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":"website/themes/book/static/viz/widgets/csp-rendezvous.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420cd2b00aa8160ef8e24404f2e66de066bd99d89bf22f0b80e811c03d2f39c"}},{"ruleId":"D1","level":"warning","message":{"text":"mvs-select.V.register(\u0022mvs-select\u0022)::narrate (cyclomatic 26): mvs-select.V.register(\u0022mvs-select\u0022)::narrate 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":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1bc47e262e6d8e4d50b4b8bc2d0714bd8e369af0aa916dda46fcdc9083648c"}},{"ruleId":"D1","level":"warning","message":{"text":"race-vclock.simulate (cyclomatic 26): race-vclock.simulate has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 118, 154, 163, \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":"website/themes/book/static/viz/widgets/race-vclock.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1008c21bc3770dffac59d7ad4faf518ce461a12ce00652a013efa90fe794c2c"}},{"ruleId":"D1","level":"warning","message":{"text":"main.joinCJKLines (cyclomatic 26): main.joinCJKLines has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 393). 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":"website/make-cn.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112b93e43f1e15538550e3a2cf8dc8b645b19698198ad26aee43cf2074ebcc7"}},{"ruleId":"D1","level":"warning","message":{"text":"continuous-batching.V.register(\u0022continuous-batching\u0022)::draw (cyclomatic 24): continuous-batching.V.register(\u0022continuous-batching\u0022)::draw has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c559e7f674ea555e256f5a8117656e5aa7955efe6e430b6b7331d55213bda6b8"}},{"ruleId":"D1","level":"warning","message":{"text":"continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate (cyclomatic 24): continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (continuous-batching.V.register(\u0022continuous-batching\u0022)::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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fac1b9c15aaead4b8d0628bf51a54e192c13c5b41df3ae0c0fe6d45c4c1fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"viz.channel (cyclomatic 23): viz.channel has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 10 function items inside it that branch (step, draw::actor, doRecv, \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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e285df13b6f6af46b70553127768af408321fb310b06a8b484b008eb76dcc9"}},{"ruleId":"D1","level":"warning","message":{"text":"error-tree-walk.V.register(\u0022error-tree-walk\u0022)::narrate (cyclomatic 22): error-tree-walk.V.register(\u0022error-tree-walk\u0022)::narrate 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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"153a731c6da58cb548494b2e8a4da3d9fa48def374127cc9234be813ab3c891c"}},{"ruleId":"D1","level":"warning","message":{"text":"init-order.V.register(\u0022init-order\u0022)::step (cyclomatic 22): init-order.V.register(\u0022init-order\u0022)::step 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":"website/themes/book/static/viz/widgets/init-order.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1bfc899e670b0057e28d6981db0544a39bff23c17aefd8fa62de0a72ea36c0"}},{"ruleId":"D1","level":"warning","message":{"text":"viz.gcTricolor (cyclomatic 21): viz.gcTricolor has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 11 function items inside it that branch (sweepStep, step, a function literal at line 413, \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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5807bf757ca2c885023ba70d41414148c8faee10552757d6bcd806346ee94c"}},{"ruleId":"D1","level":"warning","message":{"text":"abi-regassign.reg (cyclomatic 21): abi-regassign.reg has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/abi-regassign.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17884cbbb71ec9d295763e262ec7f2fd3c8eb7983dfa709f4a74b4e0b7ce9af"}},{"ruleId":"D1","level":"warning","message":{"text":"swiss-probe.trace::run (cyclomatic 21): swiss-probe.trace::run 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":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7ff7684512152a8c7c81d5053f6631f40cb13968d6e97be1a0960fbdb59ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSpan (cyclomatic 20): alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSpan has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSlot) 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":"website/themes/book/static/viz/widgets/alloc-sizeclass.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"342b2844b9d1ab09a9985b5274c299d17b7ccfa01a9467794aa22f5719dfcd39"}},{"ruleId":"D1","level":"warning","message":{"text":"boot-sequence.V.register(\u0022boot-sequence\u0022)::draw (cyclomatic 20): boot-sequence.V.register(\u0022boot-sequence\u0022)::draw has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/boot-sequence.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75c3542b90b02f8ff219f92644dafc80243e730875a45e0f6914e01c384e8e2"}},{"ruleId":"D1","level":"warning","message":{"text":"csp-sieve.V.register(\u0022csp-sieve\u0022)::draw (cyclomatic 20): csp-sieve.V.register(\u0022csp-sieve\u0022)::draw 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":"website/themes/book/static/viz/widgets/csp-sieve.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b946506f813b1af4f2217431a9f148a762ff839c21d86a6b594e208efd95b"}},{"ruleId":"D1","level":"warning","message":{"text":"iface-data.decide (cyclomatic 20): iface-data.decide has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fca3f06ab8a063fd04e8632e4ceea8c4e29bb62721d6917de1cbeb41e44c37e"}},{"ruleId":"D1","level":"warning","message":{"text":"mvs-select.downgrade (cyclomatic 20): mvs-select.downgrade has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 5 function items inside it that branch (add, a function literal at line 171, exclude, \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":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b157e99161c4f919982fbd3103c3d46e28b8cdad78ad08bd2d12ff1ab2a75f99"}},{"ruleId":"D1","level":"warning","message":{"text":"panic-unwind.simulate (cyclomatic 20): panic-unwind.simulate has cyclomatic complexity 20 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a97f72522b2223c3750e0c518da8a8a9f7f5e0d310b018680b7b6125c3b3a99"}},{"ruleId":"D1","level":"warning","message":{"text":"sysmon-backoff.simulate (cyclomatic 20): sysmon-backoff.simulate 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":"website/themes/book/static/viz/widgets/sysmon-backoff.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cb9d1de1ce71734e47529adafbae49413e7384a9f09266f7ffe5b52f228ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"lang-interactions.V.register(\u0022lang-interactions\u0022)::draw (cyclomatic 19): lang-interactions.V.register(\u0022lang-interactions\u0022)::draw 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":"website/themes/book/static/viz/widgets/lang-interactions.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"528a5f3239eff0fb32f3c231cfc608c7000e62c9dbacb9fef553f4da5b046c1a"}},{"ruleId":"D1","level":"warning","message":{"text":"mvs-select.buildList (cyclomatic 19): mvs-select.buildList has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (cmp, required, a function literal at line 85, \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":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0689c8818b9c8dfbb5ec2b3508b962092c1c1a40abbc126a8c453774246dd70"}},{"ruleId":"D1","level":"warning","message":{"text":"swiss-probe.prune (cyclomatic 19): swiss-probe.prune 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":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a7c35fe9a6b0134dcd961e2f14ec79b315d11954e7250e2b962da6f360ad06"}},{"ruleId":"D1","level":"warning","message":{"text":"agent-cancel.V.register(\u0022agent-cancel\u0022)::draw (cyclomatic 18): agent-cancel.V.register(\u0022agent-cancel\u0022)::draw has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/agent-cancel.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc06f4f058a342703712f9e0379c62dcf7b0de62e039d0547330efc29357bcc0"}},{"ruleId":"D1","level":"warning","message":{"text":"alloc-tiny.V.register(\u0022alloc-tiny\u0022)::drawBlocks (cyclomatic 18): alloc-tiny.V.register(\u0022alloc-tiny\u0022)::drawBlocks 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":"website/themes/book/static/viz/widgets/alloc-tiny.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3f4a439de3bab1884d7bdb574f72501379259979350592000b2e0ec70916eb"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-shape.V.register(\u0022gc-shape\u0022)::narrate (cyclomatic 18): gc-shape.V.register(\u0022gc-shape\u0022)::narrate 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":"website/themes/book/static/viz/widgets/gc-shape.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4327bd371f02928aabcc7d537b04d6e35136e77a4ffcaf54f71a61fe23948"}},{"ruleId":"D1","level":"warning","message":{"text":"error-tree-walk.trace (cyclomatic 17): error-tree-walk.trace has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (walk, visit, a function literal at line 95). 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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"226c66e60e56e72e09f3e5032e3b9f46f24b316f1dc720bfa1f8a54af2d76292"}},{"ruleId":"D1","level":"warning","message":{"text":"iface-data.V.register(\u0022iface-data\u0022)::narrate (cyclomatic 17): iface-data.V.register(\u0022iface-data\u0022)::narrate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (iface-data.V.register(\u0022iface-data\u0022)::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":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0a380c74b033e75b95ed96a658f15a7b839c74722afa2e16220e4a0db49f83"}},{"ruleId":"D1","level":"warning","message":{"text":"timer-heap.V.register(\u0022timer-heap\u0022)::draw (cyclomatic 17): timer-heap.V.register(\u0022timer-heap\u0022)::draw has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/timer-heap.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bdfb4648fce59e644e468799877a2dbb18538961545c65aff43adc823ca40e"}},{"ruleId":"D1","level":"warning","message":{"text":"alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSlot (cyclomatic 16): alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSlot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSpan) 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":"website/themes/book/static/viz/widgets/alloc-sizeclass.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09b0ac150214fdc0a9555eb686807088d6cd3eeaea5bc21d39444e65761b5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cache.V.register(\u0022build-cache\u0022)::narrate (cyclomatic 16): build-cache.V.register(\u0022build-cache\u0022)::narrate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (build-cache.V.register(\u0022build-cache\u0022)::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":"website/themes/book/static/viz/widgets/build-cache.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e4e97d61566a74c4d17c3dbc50f4406207d8e329abc1d30e545f29433de0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"build-cache.V.register(\u0022build-cache\u0022)::draw (cyclomatic 16): build-cache.V.register(\u0022build-cache\u0022)::draw has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (build-cache.V.register(\u0022build-cache\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/build-cache.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"19756611c138bc88ab8efc3cf0f72fc4f40a5c869d88674e70e61f4a2adfe745"}},{"ruleId":"D1","level":"warning","message":{"text":"gc-pacer.V.register(\u0022gc-pacer\u0022)::drawTable (cyclomatic 16): gc-pacer.V.register(\u0022gc-pacer\u0022)::drawTable 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":"website/themes/book/static/viz/widgets/gc-pacer.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f44b7518a14c7ed329c495add00d5ea1cc7874e236d15c6feabbb3477b90ea6"}},{"ruleId":"D1","level":"warning","message":{"text":"stack-resize.V.register(\u0022stack-resize\u0022)::narrate (cyclomatic 16): stack-resize.V.register(\u0022stack-resize\u0022)::narrate 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":"website/themes/book/static/viz/widgets/stack-resize.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9889f1b2524c76ecff03de8a01b6c3559b52b138a433c558235f19e68540fe"}},{"ruleId":"D2","level":"warning","message":{"text":"abi-regassign.V.register(\u0022abi-regassign\u0022) (cognitive 102): abi-regassign.V.register(\u0022abi-regassign\u0022) has cognitive complexity 102 (threshold 15). Drivers by points: ternaries 26 (53 pts), if/else 23 (27 pts), boolean chains 19, loops 3 (nesting depth added 31). None of this is in the body itself: all 102 points belong to 17 function items inside it that branch (a function literal at line 214, a function literal at line 255, narrate, \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":"website/themes/book/static/viz/widgets/abi-regassign.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8297bc86e4ab4a53fc4dc97a25b96396ec38849694dd7ad6fffc4b5b1adbb369"}},{"ruleId":"D2","level":"warning","message":{"text":"continuous-batching.simulate (cognitive 91): continuous-batching.simulate has cognitive complexity 91 (threshold 15). Drivers by points: if/else 25 (65 pts), loops 8 (14 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 48). Of this number, 61 points are the body\u0027s own statements and 30 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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e681977ac55b9d35d7b3739638d980984c743bc90ff4f6efeeead5fcb980a730"}},{"ruleId":"D2","level":"warning","message":{"text":"mutex-starvation.simulate (cognitive 74): mutex-starvation.simulate has cognitive complexity 74 (threshold 15). Drivers by points: if/else 36 (56 pts), boolean chains 16, loops 1, ternaries 1 (nesting depth added 20). Of this number, 35 points are the body\u0027s own statements and 39 belong to 10 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a132b35dea2d2490eaf6badac974dda98ece96a54584441b0dce802a25222c7"}},{"ruleId":"D2","level":"warning","message":{"text":"link-deadcode.V.register(\u0022link-deadcode\u0022) (cognitive 72): link-deadcode.V.register(\u0022link-deadcode\u0022) has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (28 pts), ternaries 15 (25 pts), boolean chains 18, loops 1 (nesting depth added 17). None of this is in the body itself: all 72 points belong to 20 function items inside it that branch (a function literal at line 184, step, a function literal at line 171, \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":"website/themes/book/static/viz/widgets/link-deadcode.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"11aa56b81b001a4e80e674ab86707e1c48b3c5c3f96062f0272763105d1dac71"}},{"ruleId":"D2","level":"warning","message":{"text":"select-order.V.register(\u0022select-order\u0022) (cognitive 71): select-order.V.register(\u0022select-order\u0022) has cognitive complexity 71 (threshold 15). Drivers by points: if/else 30 (35 pts), ternaries 16 (23 pts), boolean chains 11, loops 2 (nesting depth added 12). None of this is in the body itself: all 71 points belong to 25 function items inside it that branch (draw, a function literal at line 222, a function literal at line 178, \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":"website/themes/book/static/viz/widgets/select-order.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ac0ad434fdc07e9ba3d185992f9e8d038f9e11002efb72e51d3ebecdbc2977"}},{"ruleId":"D2","level":"warning","message":{"text":"iface-data.V.register(\u0022iface-data\u0022)::draw (cognitive 65): iface-data.V.register(\u0022iface-data\u0022)::draw has cognitive complexity 65 (threshold 15). Drivers by points: ternaries 23 (55 pts), if/else 4 (6 pts), boolean chains 2, loops 2 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (iface-data.V.register(\u0022iface-data\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ead9b70f18d83c44be40b0129779f7bee3cfe8f3e1a9315db8fcfb32218043"}},{"ruleId":"D2","level":"warning","message":{"text":"escape-flow.solve (cognitive 63): escape-flow.solve has cognitive complexity 63 (threshold 15). Drivers by points: if/else 19 (49 pts), loops 3 (8 pts), boolean chains 6 (nesting depth added 35). Of this number, 35 points are the body\u0027s own statements and 28 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/escape-flow.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eccb66afedfbc11a7c330bb73a1176c9628ebccdac46ccd1ff8c316d4db8d0d"}},{"ruleId":"D2","level":"warning","message":{"text":"panic-unwind.V.register(\u0022panic-unwind\u0022) (cognitive 62): panic-unwind.V.register(\u0022panic-unwind\u0022) has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 15 (31 pts), boolean chains 16, if/else 12, loops 2 (3 pts) (nesting depth added 17). None of this is in the body itself: all 62 points belong to 13 function items inside it that branch (a function literal at line 331, drawCode, a function literal at line 265, \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":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd75a5d9accd67a9dd166810a5da389a9d79cda90455040e5dae5b5b56088a7"}},{"ruleId":"D2","level":"warning","message":{"text":"raster-depth.V.register(\u0022raster-depth\u0022) (cognitive 56): raster-depth.V.register(\u0022raster-depth\u0022) has cognitive complexity 56 (threshold 15). Drivers by points: if/else 21 (26 pts), ternaries 9 (13 pts), loops 10 (12 pts), boolean chains 5 (nesting depth added 11). Most of this is not in the body itself: 3 of the 56 points are its own statements and the rest belongs to 20 function items inside it that branch (stepPixel, describe, draw, \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":"website/themes/book/static/viz/widgets/raster-depth.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c07e26dfbd0165d45be9ea81d823dcd81ac7fdcc74786259aef755df2f74d83"}},{"ruleId":"D2","level":"warning","message":{"text":"mutex-starvation.V.register(\u0022mutex-starvation\u0022) (cognitive 53): mutex-starvation.V.register(\u0022mutex-starvation\u0022) has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21, ternaries 10 (16 pts), boolean chains 12, loops 4 (nesting depth added 6). None of this is in the body itself: all 53 points belong to 18 function items inside it that branch (draw, a function literal at line 286, a function literal at line 299, \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":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3430edf1e3dc114e1aa05340de79943a424f988fd5deb104eb51e0187be93721"}},{"ruleId":"D2","level":"warning","message":{"text":"swiss-probe.V.register(\u0022swiss-probe\u0022)::drawTable (cognitive 53): swiss-probe.V.register(\u0022swiss-probe\u0022)::drawTable has cognitive complexity 53 (threshold 15). Drivers by points: ternaries 10 (24 pts), if/else 9 (22 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf708535af365b1a0371640654cc62e6784c213332bba993eeef1c84a7244eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mvs-select.V.register(\u0022mvs-select\u0022)::narrate (cognitive 48): mvs-select.V.register(\u0022mvs-select\u0022)::narrate has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (32 pts), ternaries 5 (13 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f691787f00446cf334ddcf0e11968663e038c7c8656444f01e97e3be554dd"}},{"ruleId":"D2","level":"warning","message":{"text":"swiss-probe.prune (cognitive 41): swiss-probe.prune has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 8 (16 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5708e7adf6177d203f5fb0c64c1703fdd3b36c20b4d1d127e5d0ebf0cca9b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-barrier.V.register(\u0022gc-barrier\u0022) (cognitive 40): gc-barrier.V.register(\u0022gc-barrier\u0022) has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16, ternaries 8 (14 pts), boolean chains 9, loops 1 (nesting depth added 6). None of this is in the body itself: all 40 points belong to 12 function items inside it that branch (stepKind, drawGraph, a function literal at line 195, \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":"website/themes/book/static/viz/widgets/gc-barrier.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff021073060868adf303cffca82820292ace647353edd5c8691f430b8e0b4e45"}},{"ruleId":"D2","level":"warning","message":{"text":"slice-growth.V.register(\u0022slice-growth\u0022) (cognitive 39): slice-growth.V.register(\u0022slice-growth\u0022) has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 12 (16 pts), if/else 11 (13 pts), boolean chains 8, loops 2 (nesting depth added 6). None of this is in the body itself: all 39 points belong to 11 function items inside it that branch (narrate, boxes, a function literal at line 169, \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":"website/themes/book/static/viz/widgets/slice-growth.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a01fbb833d3dceca0c6702aed953ca759e2746f4b85d9ee264a0462f3db85"}},{"ruleId":"D2","level":"warning","message":{"text":"stack-resize.V.register(\u0022stack-resize\u0022) (cognitive 39): stack-resize.V.register(\u0022stack-resize\u0022) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (26 pts), ternaries 4 (5 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 4). None of this is in the body itself: all 39 points belong to 13 function items inside it that branch (narrate, call, gc, \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":"website/themes/book/static/viz/widgets/stack-resize.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"22895767fefe3d947dcc03ff7c73c17860861041dc655bbc0765b387a2f95105"}},{"ruleId":"D2","level":"warning","message":{"text":"gpu-launch-overlap.V.register(\u0022gpu-launch-overlap\u0022) (cognitive 37): gpu-launch-overlap.V.register(\u0022gpu-launch-overlap\u0022) has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (24 pts), loops 7 (9 pts), ternaries 3, boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 37 points belong to 12 function items inside it that branch (a function literal at line 73, draw, frame, \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":"website/themes/book/static/viz/widgets/gpu-launch-overlap.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eb8cd6d64b0eece6fd7d9ed2490e29ba8246b0a7d8cc9554f28047c98b07b3"}},{"ruleId":"D2","level":"warning","message":{"text":"csp-rendezvous.simulate (cognitive 36): csp-rendezvous.simulate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 12). Most of this is not in the body itself: 10 of the 36 points are its own statements and the rest belongs to 5 function items inside it that branch (tryRecv, a function literal at line 86, trySend, \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":"website/themes/book/static/viz/widgets/csp-rendezvous.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"195323c3d93ac0c8c3a0d479371248e054c3a57db1b3079757c1b31d97d36993"}},{"ruleId":"D2","level":"warning","message":{"text":"swiss-probe.trace::run (cognitive 35): swiss-probe.trace::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (31 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca11a6be29ba840e19b328b4a2eff3e6fcbb2576794dd2bd2c784a052fbe3c59"}},{"ruleId":"D2","level":"warning","message":{"text":"agent-cancel.V.register(\u0022agent-cancel\u0022) (cognitive 34): agent-cancel.V.register(\u0022agent-cancel\u0022) has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 11 (16 pts), if/else 10, boolean chains 7, loops 1 (nesting depth added 5). None of this is in the body itself: all 34 points belong to 9 function items inside it that branch (draw, mid, a function literal at line 190, \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":"website/themes/book/static/viz/widgets/agent-cancel.js"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc999454a5cce152a9f032f38be37bd1a63b39b8bd9b29d2ca6c6e2874c19181"}},{"ruleId":"D2","level":"warning","message":{"text":"viz.gmpScheduler::step (cognitive 33): viz.gmpScheduler::step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/viz.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"696b2ccc0d92ef4ff0691df79d063e540c84c41677ee095d6a0ab168a7842f00"}},{"ruleId":"D2","level":"warning","message":{"text":"escape-flow.V.register(\u0022escape-flow\u0022)::narrate (cognitive 33): escape-flow.V.register(\u0022escape-flow\u0022)::narrate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/escape-flow.js"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9aaaf4127ff1879d98ad397818ab2d417026681d33221bfebed10bbf486cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"bench-ramp.V.register(\u0022bench-ramp\u0022) (cognitive 31): bench-ramp.V.register(\u0022bench-ramp\u0022) has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 5 (10 pts), boolean chains 4, loops 3 (nesting depth added 6). None of this is in the body itself: all 31 points belong to 8 function items inside it that branch (a function literal at line 124, draw, narrate, \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":"website/themes/book/static/viz/widgets/bench-ramp.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2181fd9741275512e7e68031f40c71e46d10f6a50eef930b9eddbd03fcb4870"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-barrier.run (cognitive 31): gc-barrier.run has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 8, boolean chains 1 (nesting depth added 10). Of this number, 28 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gc-barrier.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df01a171b1e7dc5cb408e6d29524045309d0db04030df0cae0d68ad1882c99"}},{"ruleId":"D2","level":"warning","message":{"text":"continuous-batching.V.register(\u0022continuous-batching\u0022)::draw (cognitive 30): continuous-batching.V.register(\u0022continuous-batching\u0022)::draw has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (9 pts), ternaries 3 (6 pts), boolean chains 3 (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. This shape REPEATS in the file: one other method here (continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5133ffdfb4585a2540680ad14680fc3bd758bd82d4419d4753e23c8a53c3bc36"}},{"ruleId":"D2","level":"warning","message":{"text":"alloc-tiny.V.register(\u0022alloc-tiny\u0022)::drawBlocks (cognitive 29): alloc-tiny.V.register(\u0022alloc-tiny\u0022)::drawBlocks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (10 pts), ternaries 1 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/alloc-tiny.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fcc160af7afed21194effa7d731357185c48a6d0e0561487428847c283e211"}},{"ruleId":"D2","level":"warning","message":{"text":"error-tree-walk.V.register(\u0022error-tree-walk\u0022)::narrate (cognitive 29): error-tree-walk.V.register(\u0022error-tree-walk\u0022)::narrate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (23 pts), ternaries 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (error-tree-walk.V.register(\u0022error-tree-walk\u0022)::checkRows) 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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc30a943ea958236bff297dd652e01513b2f9a0fe53b9677c36d6cf0de9fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"mvs-select.buildList (cognitive 29): mvs-select.buildList has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 pts), ternaries 2, boolean chains 1, loops 1 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 13 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"520e949129a3e774f5fd91f8503054a3983263d6a2e76bf699b4a9a42563253a"}},{"ruleId":"D2","level":"warning","message":{"text":"sysmon-backoff.simulate (cognitive 29): sysmon-backoff.simulate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 3 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/sysmon-backoff.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c22e0a3c5e16dfa9c7737b2fde68c21d5d57385a349461ec2d11aee54dd1668"}},{"ruleId":"D2","level":"warning","message":{"text":"boot-sequence.V.register(\u0022boot-sequence\u0022)::draw (cognitive 28): boot-sequence.V.register(\u0022boot-sequence\u0022)::draw has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 6 (10 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/boot-sequence.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"96489a71fcbc4521e6b7bf70f73fd9e606cb26f1c62e12d8572f315ac267f0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"error-tree-walk.V.register(\u0022error-tree-walk\u0022)::checkRows (cognitive 27): error-tree-walk.V.register(\u0022error-tree-walk\u0022)::checkRows has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 10 (19 pts), if/else 5 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (error-tree-walk.V.register(\u0022error-tree-walk\u0022)::narrate) 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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a52ebe8deeb670d3c1fc922067c8ceeadc0599de886883d9dcca9df34c71cd"}},{"ruleId":"D2","level":"warning","message":{"text":"csp-rendezvous.V.register(\u0022csp-rendezvous\u0022)::draw (cognitive 24): csp-rendezvous.V.register(\u0022csp-rendezvous\u0022)::draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (8 pts), ternaries 4 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/csp-rendezvous.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2619c12f74dc438c9f28f6bcea72351ff66fdd8168dc9e40646f1375d0d2bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"lang-interactions.V.register(\u0022lang-interactions\u0022)::draw (cognitive 24): lang-interactions.V.register(\u0022lang-interactions\u0022)::draw has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, loops 5 (6 pts), ternaries 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/lang-interactions.js"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"97385ed1ba97a37aadaa01ab1c299cc250204907cd477179d9b61493878cc450"}},{"ruleId":"D2","level":"warning","message":{"text":"select-order.runNew (cognitive 24): select-order.runNew has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 7 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/select-order.js"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a4645b853734881682d6f7d5920c9d42e12d580c6c0da9f4186a391b8b4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"viz.channel (cognitive 23): viz.channel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, loops 3 (nesting depth added 3). None of this is in the body itself: all 23 points belong to 10 function items inside it that branch (step, doRecv, doSend, \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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f255306d86b7184254057132fbada08456fca841b2cd0b87c5aee8b802e121"}},{"ruleId":"D2","level":"warning","message":{"text":"error-tree-walk.trace (cognitive 23): error-tree-walk.trace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 9). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 3 function items inside it that branch (walk, visit, a function literal at line 95). 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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836cf4e3fb7d6f243f147a483b5c8ccd124ba002c0ee7918ea0457fb74053a4"}},{"ruleId":"D2","level":"warning","message":{"text":"race-vclock.simulate (cognitive 23): race-vclock.simulate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, match/switch 1 (nesting depth added 7). None of this is in the body itself: all 23 points belong to 5 function literals inside it that branch (lines 118, 154, 163, \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":"website/themes/book/static/viz/widgets/race-vclock.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91594d6f3f3a0e5c94fdd1ad481bbf830d868a366fb58861dce6dda8897a3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"race-vclock.V.register(\u0022race-vclock\u0022)::narrate (cognitive 23): race-vclock.V.register(\u0022race-vclock\u0022)::narrate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 1 (2 pts), boolean chains 1, 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":"website/themes/book/static/viz/widgets/race-vclock.js"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"91feb9031fcab904e211c1fb987ee05182b1577186b68a79a64487dc30ac86ca"}},{"ruleId":"D2","level":"warning","message":{"text":"mvs-select.downgrade (cognitive 22): mvs-select.downgrade has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, loops 2 (nesting depth added 3). None of this is in the body itself: all 22 points belong to 5 function items inside it that branch (add, a function literal at line 171, exclude, \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":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19038d8f0b3da9a8fc19a3b25747f210fdbd23f338963de4212daeec7270138"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-pacer.V.register(\u0022gc-pacer\u0022)::drawTable (cognitive 21): gc-pacer.V.register(\u0022gc-pacer\u0022)::drawTable has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 13 (19 pts), boolean chains 1, if/else 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gc-pacer.V.register(\u0022gc-pacer\u0022)::drawChart) 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":"website/themes/book/static/viz/widgets/gc-pacer.js"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d4dca7b48e710a3abd1c8bc6834198a24533cd806ed613eff460963bbb6289"}},{"ruleId":"D2","level":"warning","message":{"text":"main.joinCJKLines (cognitive 21): main.joinCJKLines has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts), loops 3 (nesting depth added 1). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 393). 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":"website/make-cn.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0e36132bd9818dab011ef1e7b441e0d3c86d2f44b63f4f3e2209698b4e0307"}},{"ruleId":"D2","level":"warning","message":{"text":"viz.gcTricolor (cognitive 20): viz.gcTricolor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, ternaries 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 1). None of this is in the body itself: all 20 points belong to 11 function items inside it that branch (sweepStep, step, a function literal at line 413, \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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"349473fd8b6cf4f5a6d6da9185867ea0441e3d35fe1225dd5f0623fe4f3af72b"}},{"ruleId":"D2","level":"warning","message":{"text":"continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate (cognitive 20): continuous-batching.V.register(\u0022continuous-batching\u0022)::narrate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, ternaries 4 (8 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (continuous-batching.V.register(\u0022continuous-batching\u0022)::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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"931a6bee0cf449a73977afe2cf0ae17be5e70751ca176c5d9eb550f6db9616f8"}},{"ruleId":"D2","level":"warning","message":{"text":"csp-sieve.V.register(\u0022csp-sieve\u0022)::draw (cognitive 20): csp-sieve.V.register(\u0022csp-sieve\u0022)::draw has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 4 (6 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/csp-sieve.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a304b7f74c9ed522b9ac093bfdbe33325606ad394d445ed29e46a42d7ebc3"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-pacer.V.register(\u0022gc-pacer\u0022)::drawChart (cognitive 20): gc-pacer.V.register(\u0022gc-pacer\u0022)::drawChart has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gc-pacer.V.register(\u0022gc-pacer\u0022)::drawTable) 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":"website/themes/book/static/viz/widgets/gc-pacer.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"032344afe40444ddae0517331e1a0ea5995a1214a308c36adbdf2ad0d8184e30"}},{"ruleId":"D2","level":"warning","message":{"text":"panic-unwind.simulate (cognitive 20): panic-unwind.simulate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 7 (8 pts), boolean chains 1, loops 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3914b54ade7eccff64eecc239f2c741462f9bd42c3c339aa0923e6d12f5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"iface-data.V.register(\u0022iface-data\u0022)::narrate (cognitive 19): iface-data.V.register(\u0022iface-data\u0022)::narrate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (iface-data.V.register(\u0022iface-data\u0022)::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":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a675efa097803f72fb37d050b3f1450d5a982241ef249627ec3fbc6e1588e593"}},{"ruleId":"D2","level":"warning","message":{"text":"init-order.V.register(\u0022init-order\u0022)::step (cognitive 19): init-order.V.register(\u0022init-order\u0022)::step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/init-order.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b60640aefaf9a048a8c3d444035a3b302565466ba5b85576ac2a950a1a6053"}},{"ruleId":"D2","level":"warning","message":{"text":"alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSpan (cognitive 18): alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022)::drawSpan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, ternaries 4 (5 pts), loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/alloc-sizeclass.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c593d2f1d8f1c9257db7468ede6855af898809aaaee04d5f679578072a2c08"}},{"ruleId":"D2","level":"warning","message":{"text":"gc-shape.V.register(\u0022gc-shape\u0022)::narrate (cognitive 17): gc-shape.V.register(\u0022gc-shape\u0022)::narrate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gc-shape.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb89cf799fabdf446b8bf74a9c84a18c2a34afdbc3cf924b334d3ed3bc74735"}},{"ruleId":"D2","level":"warning","message":{"text":"sysmon-backoff.V.register(\u0022sysmon-backoff\u0022)::draw (cognitive 17): sysmon-backoff.V.register(\u0022sysmon-backoff\u0022)::draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/sysmon-backoff.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"704d9ba2dc8c62d5bd46b77034774e93bb0ec03b61e4ce6429bcf60bd27f6f52"}},{"ruleId":"D2","level":"warning","message":{"text":"timer-heap.V.register(\u0022timer-heap\u0022)::check (cognitive 17): timer-heap.V.register(\u0022timer-heap\u0022)::check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/timer-heap.js"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92fb7af3529e7eff08d651f53ceb96f5e3f0a81af03a932db38b90d67086f7"}},{"ruleId":"D2","level":"warning","message":{"text":"build-cache.V.register(\u0022build-cache\u0022)::narrate (cognitive 16): build-cache.V.register(\u0022build-cache\u0022)::narrate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/build-cache.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662a75ee79f19b6e324bb7cc5d9742ee1517e62c58d09f51f6e6256de7e0ff3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: timer-heap.V.register(\u0022timer-heap\u0022): FunctionTooLong \u2014 V.register(\u0022timer-heap\u0022) runs 278 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 178 over it, 2.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/timer-heap.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3a95b0c0e24c47a75d85d4cbf4d835e192ea963fa8832e4f192c8d9309025f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mvs-select.V.register(\u0022mvs-select\u0022): FunctionTooLong \u2014 V.register(\u0022mvs-select\u0022) runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mvs-select.js"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfa531911bddecea29f1699ab749ac1c45d308bb5bb29473cd3cf241579cfff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: race-vclock.V.register(\u0022race-vclock\u0022): FunctionTooLong \u2014 V.register(\u0022race-vclock\u0022) runs 231 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/race-vclock.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"784dcd92d5db48d6ac5641b5531b009ad2faca557c2c3c1833e88874e771d4cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: select-order.V.register(\u0022select-order\u0022): FunctionTooLong \u2014 V.register(\u0022select-order\u0022) runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/select-order.js"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"057ad5bdc99a5303f7665c8fb50175fcd40a758d684de8121d5fdd208a4f0f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: link-deadcode.V.register(\u0022link-deadcode\u0022): FunctionTooLong \u2014 V.register(\u0022link-deadcode\u0022) runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/link-deadcode.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7aad592f078e5afa865bc23119b2279238b4f57d5067ccc425066f875f98c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: error-tree-walk.V.register(\u0022error-tree-walk\u0022): FunctionTooLong \u2014 V.register(\u0022error-tree-walk\u0022) runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"website/themes/book/static/viz/widgets/error-tree-walk.js"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f2086643ea382188c63a14a34a74853d7b8f3539d32963e606726d5bf0fa22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: escape-flow.V.register(\u0022escape-flow\u0022): FunctionTooLong \u2014 V.register(\u0022escape-flow\u0022) runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"website/themes/book/static/viz/widgets/escape-flow.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c54828563075f3cb6d19b625fbdf4afcf4c69143a318da39d2975983f27101"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gc-pacer.V.register(\u0022gc-pacer\u0022): FunctionTooLong \u2014 V.register(\u0022gc-pacer\u0022) runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gc-pacer.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1432b3013dbc2ae98eafc59d3fb8796aa47eaa39733784e2ba8c8e9203b8d96"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: init-order.V.register(\u0022init-order\u0022): FunctionTooLong \u2014 V.register(\u0022init-order\u0022) runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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":"website/themes/book/static/viz/widgets/init-order.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5349beb9c0f438a1a739819756c52209014f9b0efc7887c65d61ab0059addbfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: build-cache.V.register(\u0022build-cache\u0022): FunctionTooLong \u2014 V.register(\u0022build-cache\u0022) runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/build-cache.js"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"effd852bc8385ca573c879aa7c40f29c6a1dcfc13ea028351cfeafa1d7e41464"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: raster-depth.V.register(\u0022raster-depth\u0022): FunctionTooLong \u2014 V.register(\u0022raster-depth\u0022) runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/raster-depth.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a8b63ff6765bf323ac6fdc7690f09df1f0039137da62666597cd8dc043f58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: continuous-batching.V.register(\u0022continuous-batching\u0022): FunctionTooLong \u2014 V.register(\u0022continuous-batching\u0022) runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"website/themes/book/static/viz/widgets/continuous-batching.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"758656bfe82abb38883e08cd605f033bb71d9f233bcac67bfff6a972fbbbb23a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: csp-rendezvous.V.register(\u0022csp-rendezvous\u0022): FunctionTooLong \u2014 V.register(\u0022csp-rendezvous\u0022) runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/csp-rendezvous.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb38c9f3dc5932a216feab9412898013eaf60b4ddc0a334967f0f1f53aeece3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: alloc-sizeclass.V.register(\u0022alloc-sizeclass\u0022): FunctionTooLong \u2014 V.register(\u0022alloc-sizeclass\u0022) runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/alloc-sizeclass.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f7f03eeca98eb86e0ab5a9e2e960019cc628221587bb9894482605d975395"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: stack-resize.V.register(\u0022stack-resize\u0022): FunctionTooLong \u2014 V.register(\u0022stack-resize\u0022) runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"website/themes/book/static/viz/widgets/stack-resize.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ec5ea0d1d592472886856cf345c9ad35c51e060a6d6b194bc5faa3c1a83f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: abi-regassign.V.register(\u0022abi-regassign\u0022): FunctionTooLong \u2014 V.register(\u0022abi-regassign\u0022) runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/abi-regassign.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ab71f0805c72e21ded65eeed337fe0278152088491976475a38f7a3539ecd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: alloc-tiny.V.register(\u0022alloc-tiny\u0022): FunctionTooLong \u2014 V.register(\u0022alloc-tiny\u0022) runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/alloc-tiny.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b39d5dfb2531d2c8f08e498d9c6d0d07be7118a9ff81bd0990f7565c670dd84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viz.gmpScheduler: FunctionTooLong \u2014 gmpScheduler runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\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":"website/themes/book/static/viz/viz.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c69163b16fb000228b718db1dd14a10bca20753429ca55c5da79d035f73384"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: panic-unwind.simulate: FunctionTooLong \u2014 simulate runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"96909f1809053153524308fbed12e0027b88743931cd4ace5111f7672862aaf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: iface-data.V.register(\u0022iface-data\u0022): FunctionTooLong \u2014 V.register(\u0022iface-data\u0022) runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/iface-data.js"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f211cae7efd62a4eeb6b92f2b05bf8b1c3dfc92b366fd55aa52449bf39b4dade"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mutex-starvation.V.register(\u0022mutex-starvation\u0022): FunctionTooLong \u2014 V.register(\u0022mutex-starvation\u0022) runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"8470102447dfd78fb8543570c631e56aac8db79f5cdabe51ec98409d6fe10577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: slice-growth.V.register(\u0022slice-growth\u0022): FunctionTooLong \u2014 V.register(\u0022slice-growth\u0022) runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/slice-growth.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ddec9198fec731a875a3dc7450828c40287862017a53d31305499691fd06b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bench-ramp.V.register(\u0022bench-ramp\u0022): FunctionTooLong \u2014 V.register(\u0022bench-ramp\u0022) runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/bench-ramp.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a718726f1385c765aa08daa793e01b307993ce799b294568e69ad70ad91dae22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: boot-sequence.V.register(\u0022boot-sequence\u0022): FunctionTooLong \u2014 V.register(\u0022boot-sequence\u0022) runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/boot-sequence.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"15872b16eb0615d38438887b178f0ae4efd4c68cde59b1107fa5baabb0b0a0d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: panic-unwind.V.register(\u0022panic-unwind\u0022): FunctionTooLong \u2014 V.register(\u0022panic-unwind\u0022) runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/panic-unwind.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"904312e87ffc7d9e1b562f79f3105c520094698cbbf8d056fe3b037a31b52c46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mutex-starvation.simulate: FunctionTooLong \u2014 simulate runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/mutex-starvation.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d227a2eaac3aa310e7c7d55cc39244ae8361599a5bdaae0058d2355c56345f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gc-barrier.V.register(\u0022gc-barrier\u0022): FunctionTooLong \u2014 V.register(\u0022gc-barrier\u0022) runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gc-barrier.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9dd8b6808f6015aa038678b81a06d2141936d85354bbf3ac8b06d836d09c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sysmon-backoff.V.register(\u0022sysmon-backoff\u0022): FunctionTooLong \u2014 V.register(\u0022sysmon-backoff\u0022) runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/sysmon-backoff.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2afe753636c60592d2567f4f3fc8149314ba869712e4c5284d5d5a9892c623"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: swiss-probe.V.register(\u0022swiss-probe\u0022): FunctionTooLong \u2014 V.register(\u0022swiss-probe\u0022) runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/swiss-probe.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2017ce3733d9baecab5d25422dcd9496229079fb7021b993b166b44ff3348043"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gpu-launch-overlap.V.register(\u0022gpu-launch-overlap\u0022): FunctionTooLong \u2014 V.register(\u0022gpu-launch-overlap\u0022) runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gpu-launch-overlap.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8f77fec35f75b06aaabb708d1233b7db6cc0d602a4caf08b374f00ef9daef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: csp-sieve.V.register(\u0022csp-sieve\u0022): FunctionTooLong \u2014 V.register(\u0022csp-sieve\u0022) runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/csp-sieve.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"521cd89ac3e8b930b5e140cf9be3572b3c832c108fb015ee1fc5fc39a7901e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gc-shape.V.register(\u0022gc-shape\u0022): FunctionTooLong \u2014 V.register(\u0022gc-shape\u0022) runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/themes/book/static/viz/widgets/gc-shape.js"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"491970070cfb76f92b4c946222bec267a290a02225479254ce6a95f623c8af89"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // !!!HACK: \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/make-cn.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb2d7b74c5231212e406362c63a48d2a512e1a633c57ea62ff2113185379e83"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: the repository holds project manifests and neither \u0060README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a5992d4bd6ac1ea4b853ae69753fcd7e0410099c58731c86be53325ba8c96"}},{"ruleId":"D28","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":"f2117f227095de483b57bba3e9ece4702e66dfef45c4c8ed99855996bbf9422d"},"properties":{"commitSha":"6b740b7ee617f8cc29a1ad6242314f0c019714db"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"85b6ba4ce64b01704ea3e896059d41c7c767da6065d5a3b4e0cc8727ac3b03db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a07a56ea5e959a8887153e2b336e169c3d970a18e77f8f9df58d0011ec190201"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70c287ecb9f265cf17a0d6c882cf281eb38a2c9c336818d915242f9790c5d618"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88a62e403e88594dfb074296a4402eb2ab01e6f1cc1b3c49d940ca40e48360cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"669ed9a77e6e98700061ed065dd557f2c539c377470c5c7c1e68e8a5791a6204"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15abcdd2b021f28937605b96908c59864cc294c13e0c14872511ceecf8d3da4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6f7f9c7c66487bff3c29d3a006cbac6d0bba1975272d4d518a58edd59d7a41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4fa3a3025b7a9052cbd7b0d8a17b7d24287898600c95850a4b97997b4072afa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40b13e661977ec383b3447ceb5c9f2b5ad4da373f334fdb358e33166ce854f36"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87ba35728564bceb0d4a268d35614a2505f142f930d0f44f485b7415d60d1cb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eed20023709e4e702ce7b232da01db1cabe33fdd34a2f25f1874255b2a11976a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"904dc218db6a2d6410e1fa8ef6dc98cf6ea706317cab641b090dbe1b5e78095d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2367894afbc4848a78efa4351912f52f74ad5a6d56244556303dd5f52520de32"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6790f47092b3d0481018c6e93a66886cb82ef8c327b22114f7747d22cd53881"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df47e2b4cd94b7ccba96cb961a9499813ea0ed440280a8f92ecb2b7fe2084759"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6a653ed04122b268014d34f0080224c4b38584a127fbb364a20e55bd4ca18fa"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50565ed678103d4c023d1390b8969d1ce5e2f9c889db4ad844ee773d6aabb7ed"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc804777655c065c99fb632ec486efea122f1be98ba46d3674087e6c155b171a"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"641a36af96d089cf38894c712fd5fa22091820f9e446df7ceb6e3783d8e028e8"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ccc08f265bd0b4e00abcf8a1211154f006765423088c5df2a3e7ac3bef4c058"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89b413708ab24bb953f16a12bc59c1d2d85a816e99c204ed94f018fd5b0e864e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9cec6b8165cda15e0da26402c8d40f9d546c86f50822c9abb45c5aacf1547cd"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"512dc2602bf7c71f20ceedb940a5f64a9f8dfc77fff2faca7aa123f3b237b8bc"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c18f6e821fe57754f860cf92b317a8ff5e44304e1aee6bfdf3ad8c343de6450"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cffa5b6e0869e38f92c6c15df742118fda691413490415c856a394b88f5f63c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57a2441fd929434504e2104cc419452554073a7e535ca0c19709344725d35557"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62b1fb60b47a3ea07050d09354d7035b25572385c8dcaa95b57fc09444f2f14c"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bae09a134f2ff0e2cbfe4a231c00906f977fa1ba3bf6706a58f76ddd4af7165"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"02fe620e97c0d9a44b0b2f6967a8e61d98754310b6e767fd0cf5f1ad878f31f1"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"970fac58f5055145197f76cf8dcd8dda1b9823d16aa9287c3aa7e4a427fe4948"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3800dd09218b175d36edc753aed7300a1a76977f4e5a5f936946515773bd9ba"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9d1be34fa74b6fb6e62102ac255f4e7b76aab88e5ded26c6b39d8eea123eac9"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb469b38be33c643bcccd607f8a06d529759b1ae5b18dd21f23b0b7e79fe63ae"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"M3","level":"note","message":{"text":"No src/ separation: Nothing in the layout marks which files are the product and which are its tooling: no production source was found set apart in a directory of its own."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: tools/book/README.md links to \u0060../ch09sched/preemption.md\u0060, but \u0060tools/ch09sched/preemption.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/book/README.md"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36799b608efdc9a2b0886d9de2b55182db6b0f32d36e6d2ee13ccebc97d5e29"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: book/en-us/part2lang/ch05data/readme.md names Go 1.24, but website/go.mod:3 requires \u0060go 1.26\u0060: the code does not build on Go 1.24. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"book/en-us/part2lang/ch05data/readme.md"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e476b89b07ce4c0374bf7ab5ecb50c6531cfffe9c50a7d2dbd096ee3fe21328"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"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 gosec / govulncheck (or golangci-lint) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 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/links.yml"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060website/go.mod\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":"website/go.mod"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8400cb4b3d0fb3da7ea8e7505444d432b8e46d0edc6e5dff71d88a511d344cbe"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-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":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":43,"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."]}]}