Compute v1 = v2 & v3.
Compute v1 &= v2.
Allocate a vector given # of bits in it. Clear the vector.
Clear vector.
Clear bit b in vector v.
Clear any extra bits in vector.
Allocate copy of existing vector.
Copy vector.
Return 1 if (v1 & v2) == 0
Return 1 if vectors are equal.
Free a vector.
Find first set bit starting from b in vector v. If no bit is found, return vec_numbits(v).
Initialize package.
Count number of set bits in vector v
Compute v1 = v2 | v3.
Compute v1 |= v2.
Write out vector.
Realloc a vector to have numbits bits in it. Extra bits are set to 0.
Recycle a vector v to a new size numbits, clear all bits. Re-uses original if possible.
Set vector.
Set bit b in vector v.
Compute v1 = v2 - v3.
Compute v1 -= v2.
Terminate package.
Test bit b in vector v.
Compute v1 = v2 ^ v3.
Compute v1 ^= v2.
Turn a vec_t into an InputRange so we can foreach over each bit in the bit vector. Replaces for (size_t i = 0; (i = vec_index(i, v)) < vec_numbits(v); ++i) { ... } With foreach (i; VecRange(v)) { ... }
Compiler implementation of the D programming language.
Simple bit vector implementation.