bit.cmp (arity 5)¶
jump to:
a < b: lt
a = b: eq
a > b: gt
a,b are bits, lt,eq,gt are addresses.
Signature¶
def cmp a, b, lt, eq, gt @ a_is1_label { ... }
Defined in bit/cond_jumps.fj — lines 66–71 (view on GitHub).
Complexity¶
Time:
2@+4Space:
3@+6
See the complexity glossary for what @, w, dw, dbit, n mean.