bit.if0 (arity 3)¶
if x[:n] == 0 jump to l0
x is bit[:n], l0 is an address.
Signature¶
def if0 n, x, l0 @ end { ... }
Defined in bit/cond_jumps.fj — lines 53–56 (view on GitHub).
Complexity¶
Time:
n(@+2)Space:
n(@+2)
See the complexity glossary for what @, w, dw, dbit, n mean.