mirror of
https://github.com/codex-storage/das-research.git
synced 2025-02-24 00:38:26 +00:00
a07be50727
It is faster to store and process data availability as bitmaps. It is also enough, as we will not do anything with the data itself. Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
36 lines
860 B
Python
36 lines
860 B
Python
#!/bin/python3
|
|
|
|
import random
|
|
from bitarray import bitarray
|
|
from bitarray.util import zeros
|
|
|
|
class Block:
|
|
|
|
blockSize = 0
|
|
data = bitarray()
|
|
|
|
def __init__(self, size):
|
|
self.blockSize = size
|
|
self.data = zeros(self.blockSize*self.blockSize)
|
|
|
|
def fill(self):
|
|
for i in range(self.blockSize*self.blockSize):
|
|
self.data[i] = 1
|
|
|
|
def getColumn(self, columnID):
|
|
return self.data[columnID::self.blockSize]
|
|
|
|
def getRow(self, rowID):
|
|
return self.data[rowID*self.blockSize:(rowID+1)*self.blockSize]
|
|
|
|
def print(self):
|
|
dash = "-" * (self.blockSize+2)
|
|
print(dash)
|
|
for i in range(self.blockSize):
|
|
line = "|"
|
|
for j in range(self.blockSize):
|
|
line += "%i" % self.data[(i*self.blockSize)+j]
|
|
print(line+"|")
|
|
print(dash)
|
|
|