Python space+time efficient Data Structure to store 2D Bit Arrays

Question

I want to create a 2D Binary (Bit) Array in Python in a space and time efficient way as my 2D bitarray would be around 1 Million(rows) * 50000(columns of 0's or 1's) and also I would be performing bitwise operations over these huge elements. My array would look something like: ``` 0 1 0 1 1 1 1 0 1 0 0 0 ... ``` In C++ most efficient way (space) for me would be to create a kind of array of integers where each element represents 32 bits and then I can use the shift operators coupled with bit-wise operators to carry operations. Now I know that there is a bitarray module in python. But I am unable to create a 2D structure using list of bit-arrays. How can I do this? Another way I know in C++ would be to create a map something like `map >` where then I can manipulate the vector as I have mentioned above. Should I use the dictionary equivalent in python? Even if you suggest me some way out to use bit array for this task it will be great If I can get to know whether I can ha…

Accepted Answer

As per my comment, you may be able to use sets

```
0 1 0 1
1 1 1 0
1 0 0 0 
```

can be represented as

```
set([(1,0), (3,0), (0,1), (1,1), (2, 1), (0,2)])
```

or

```
{(1,0), (3,0), (0,1), (1,1), (2, 1), (0,2)}
```

an AND is equivalent to an intersection of 2 sets OR is the union of the 2 sets

Python space+time efficient Data Structure to store 2D Bit Arrays

Solution

Problem