bit.mul10

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).

Complexity

• Time: n(14@+10)

• Space: n(14@+10)

See the complexity glossary for what @, w, dw, dbit, n mean.

Source

Click to view the macro body

def mul10 n, x @ twice, end {
    .shl n, x
    .mov n, twice, x
    .shl n, 2, x
    .add n, x, twice
    ;end

  twice:
    .vec n
  end:
}

Depends on

• bit.add

• bit.mov/3

• bit.shl/2

• bit.shl/3

• bit.vec/1

---

Next: bit.mul_loop →