如何最好地实现位矩阵？

Question

I need a matrix that holds only 1 or 0 for each element. What is the least costly way to do this regarding memory and processor usage?

My current direction is an array of arrays with each element as an int(weakly typed). Because each int, is either 32 or 64 bits depending upon the platform, I have 32/64 sub elements per element. Is there a solution that already exists so that I don't have to reinvent the wheel?

Answer 1

nxm Bitmask describes as array of int

// setting bit in $ix$j 
$array[$i] = $array[$i] |  pow(2,$j);
// unsetting bit in $ix$j 
$array[$i] = $array[$i] & ~ pow(2,$j);
// test, if bit in $ix$j is set
$array[$i] & pow(2,$j);

Its untested ;)

its something like that you are looking for?

As a bonus its very easy to initialize it

$array = array_fill(0, $n, 0);