bit.not (arity 2)ΒΆ
dst[:n] ^= (1<<n)-1
dst is bit[:n]
SignatureΒΆ
def not n, dst { ... }
Defined in bit/logics.fj β lines 118β120 (view on GitHub).
ComplexityΒΆ
Time:
nSpace:
n
See the complexity glossary for what @, w, dw, dbit, n mean.
SourceΒΆ
Click to view the macro body
def not n, dst {
rep(n, i) .not dst+dw*i
}
Used byΒΆ
Example usesΒΆ
β Previous: bit.not/1
Next: bit.exact_not β