algorithm/test.py at master · pihou/algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#from graphviz import Digraph
from rbtree import RBTree

import random
import time
import gc
import sys

def print_tree(dot, debug, i=0):
    i = str(i)
    for info in debug:
        if not info["black"]:
            _attributes = [("fillcolor", "red"), ("style", "filled")]
        else:
            _attributes = None
        dot.node(i+str(info["id"]), str(info["key"]), _attributes=_attributes)
        if info["left"]:
            dot.edge(i+str(info["id"]), i+str(info["left"]))
        if info["right"]:
            dot.edge(i+str(info["id"]), i+str(info["right"]))

def main():
    #dots = Digraph(name="dots")
    t = RBTree()
    data = []
    start = time.time()
    time.sleep(5)
    for i in xrange(100*10000):
        num = random.randint(10000, 10000*100)
        t[num] = str(num)
        #data.append(num)
    #dot = Digraph()
    #print_tree(dot, t.debug())
    #dots.subgraph(dot)
    ##t.debug()
    #for i, d in enumerate(data):
    #    del t[d]
    #    #dot = Digraph()
    #    #print_tree(dot, t.debug(), i)
    #    #dots.subgraph(dot)
    #end = time.time()
    #print "total time:%s" % (end-start)
    #dots.render(view=True)
    del t
    gc.collect()
    time.sleep(1000)

if __name__ == "__main__":
    main()