bit.shl (arity 3)¶
x[:n] <<= times
times is a constant.
@Assumes: times <= n
@Assumes: times <= n
Signature¶
def shl n, times, x { ... }
Defined in bit/shifts.fj — lines 40–43 (view on GitHub).
Complexity¶
Time:
n(2@-1)Space:
n(2@-1)
See the complexity glossary for what @, w, dw, dbit, n mean.
Source¶
Click to view the macro body
def shl n, times, x {
rep(n-times, i) .mov x+(n-1-i)*dw, x+(n-1-i-times)*dw
.zero times, x
}