()
| 82 | |
| 83 | # Hier 3 Baumgeneratoren: |
| 84 | def main(): |
| 85 | p = Turtle() |
| 86 | p.ht() |
| 87 | tracer(75,0) |
| 88 | u = doit1(6, Turtle(undobuffersize=1)) |
| 89 | s = doit2(7, Turtle(undobuffersize=1)) |
| 90 | t = doit3(5, Turtle(undobuffersize=1)) |
| 91 | a = clock() |
| 92 | while True: |
| 93 | done = 0 |
| 94 | for b in u,s,t: |
| 95 | try: |
| 96 | b.__next__() |
| 97 | except: |
| 98 | done += 1 |
| 99 | if done == 3: |
| 100 | break |
| 101 | |
| 102 | tracer(1,10) |
| 103 | b = clock() |
| 104 | return "runtime: %.2f sec." % (b-a) |
| 105 | |
| 106 | if __name__ == '__main__': |
| 107 | main() |