def random_insert_rb(n): vs = range(n) random.shuffle(vs) RB = RedBlack() D = RB.E for v in vs: D = RB.insert(v, D)
def loadRedBlack(lista): if not lista is None: MyRB = RedBlack() for item in lista: MyRB.insert(item) return MyRB return None
def demo_normal(): RB = RedBlack() D = RB.E print D for i in range(10): D = RB.insert(i, D) print D for i in range(10): D = RB.delete(i, D) print D
def main3(): global MerkleTree RB = RedBlack() start = -1; MerkleTree = RB.E txs = transactions_in_order() for i,(nHeight,tx_id,txn) in enumerate(txs): if i <= start: continue MerkleTree = reduce(partial(apply_update, RB), updates_in_transaction(nHeight,tx_id,txn), MerkleTree) print nHeight, i if nHeight >= stop: break print hash(tuple(RB.preorder_traversal(MerkleTree)))
def main3(): global MerkleTree RB = RedBlack() start = -1 MerkleTree = RB.E txs = transactions_in_order() for i, (nHeight, tx_id, txn) in enumerate(txs): if i <= start: continue MerkleTree = reduce(partial(apply_update, RB), updates_in_transaction(nHeight, tx_id, txn), MerkleTree) print nHeight, i if nHeight >= stop: break print hash(tuple(RB.preorder_traversal(MerkleTree)))
from redblack import RedBlack from playerprovider import PlayerProvider playerprovider = PlayerProvider() game = RedBlack(playerprovider) game.run()
def setUp(self): self.RB = RedBlack()