Example #1
0
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)
Example #2
0
def loadRedBlack(lista):
    if not lista is None:
        MyRB = RedBlack()
        for item in lista:
            MyRB.insert(item)

        return MyRB
    return None
Example #3
0
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
Example #4
0
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
Example #5
0
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)))
Example #6
0
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)))
Example #7
0
from redblack import RedBlack
from playerprovider import PlayerProvider
playerprovider = PlayerProvider()
game = RedBlack(playerprovider)

game.run()
Example #8
0
 def setUp(self):
     self.RB = RedBlack()
Example #9
0
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)