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.

SourceΒΆ

Depends onΒΆ

Used byΒΆ

Example usesΒΆ


← Previous: bit.if0/2 Next: bit.cmp/5 β†’