bit.mul10

Complexity n(14@+10)
x[:n] *= 10
@NOTE: this implementation works with both signed and unsigned numbers.

Signature

def mul10 n, x @ twice, end { ... }

Defined in bit/mul.fj — lines 5–15 (view on GitHub).

Depends on

• bit.add

• bit.mov/3

• bit.shl/2

• bit.shl/3

• bit.vec/1