Map a GateKeyState to the native GATE KEY push (keyed gates §3, rulings 1 and 3).
The two filter edges are designed HERE, at the LIVE graph rate, from the same single RBJ
transcription the channel EQ's pass filters run (rbjCoeffs with butterworthSlopeQs's
12 dB/oct Q) — the C only runs the biquad, exactly as it does for the EQ. An edge at 0 Hz is
OFF and pushes null, which is the native side's own spelling for a section that does not
run; nothing is designed for it, so a key with no filter costs no coefficients at all.
source is resolved to a LANE INDEX by the caller (the same resolver every other push takes),
because a key names a CHANNEL and the node knows only lanes. -1 is SELF — the absence value,
per §3.1.
Map a GateKeyState to the native GATE KEY push (keyed gates §3, rulings 1 and 3).
The two filter edges are designed HERE, at the LIVE graph rate, from the same single RBJ transcription the channel EQ's pass filters run (rbjCoeffs with
butterworthSlopeQs's 12 dB/oct Q) — the C only runs the biquad, exactly as it does for the EQ. An edge at 0 Hz is OFF and pushesnull, which is the native side's own spelling for a section that does not run; nothing is designed for it, so a key with no filter costs no coefficients at all.sourceis resolved to a LANE INDEX by the caller (the same resolver every other push takes), because a key names a CHANNEL and the node knows only lanes.-1is SELF — the absence value, per §3.1.