bit.shr (arity 3)ΒΆ

x[:n] >>= times
times is a constant.
@Assumes: times <= n

@Assumes: times <= n

SignatureΒΆ

def shr n, times, x { ... }

Defined in bit/shifts.fj β€” lines 15–18 (view on GitHub).

ComplexityΒΆ

  • Time: n(2@-1)

  • Space: n(2@-1)

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

SourceΒΆ

Depends onΒΆ

Used byΒΆ

Example usesΒΆ


← Previous: bit.shr/2 Next: bit.shra β†’