bit.if (arity 4)¶
if x[:n] == 0 jump to l0, else jump to l1
x is bit[:n], l0,l1 are addresses.
Signature¶
def if n, x, l0, l1 { ... }
Defined in bit/cond_jumps.fj — lines 21–24 (view on GitHub).
Complexity¶
Time:
n(@+2)Space:
n(@+2)
See the complexity glossary for what @, w, dw, dbit, n mean.
Source¶
Click to view the macro body
def if n, x, l0, l1 {
rep(n-1, i) .if1 x+i*dw, l1
.if x+(n-1)*dw, l0, l1
}