| 1 |
"""turtledemo/forest.py |
| 2 |
|
| 3 |
Displays a 'forest' of 3 breadth-first trees, |
| 4 |
similar to the one in tree.py. |
| 5 |
For further details, see tree.py. |
| 6 |
|
| 7 |
This example is a breadth-first rewrite of |
| 8 |
a Logo program by Erich Neuwirth. |
| 9 |
""" |
| 10 |
from turtle import Turtle, colormode, tracer, mainloop |
| 11 |
from random import randrange |
| 12 |
from time import perf_counter as clock |
| 13 |
|
| 14 |
def symRandom(n): |
| 15 |
return randrange(-n,n+1) |
| 16 |
|
| 17 |
def randomize( branchlist, angledist, sizedist ): |
| 18 |
return [ (angle+symRandom(angledist), |
| 19 |
sizefactor*1.01**symRandom(sizedist)) |
| 20 |
for angle, sizefactor in branchlist ] |
| 21 |
|
| 22 |
def randomfd( t, distance, parts, angledist ): |
| 23 |
for i in range(parts): |
| 24 |
t.left(symRandom(angledist)) |
| 25 |
t.forward( (1.0 * distance)/parts ) |
| 26 |
|
| 27 |
def tree(tlist, size, level, widthfactor, branchlists, angledist=10, sizedist=5): |
| 28 |
# benutzt Liste von turtles und Liste von Zweiglisten, |
| 29 |
# fuer jede turtle eine! |
| 30 |
if level > 0: |
| 31 |
lst = [] |
| 32 |
brs = [] |
| 33 |
for t, branchlist in list(zip(tlist,branchlists)): |
| 34 |
t.pensize( size * widthfactor ) |
| 35 |
t.pencolor( 255 - (180 - 11 * level + symRandom(15)), |
| 36 |
180 - 11 * level + symRandom(15), |
| 37 |
0 ) |
| 38 |
t.pendown() |
| 39 |
randomfd(t, size, level, angledist ) |
| 40 |
yield 1 |
| 41 |
for angle, sizefactor in branchlist: |
| 42 |
t.left(angle) |
| 43 |
lst.append(t.clone()) |
| 44 |
brs.append(randomize(branchlist, angledist, sizedist)) |
| 45 |
t.right(angle) |
| 46 |
for x in tree(lst, size*sizefactor, level-1, widthfactor, brs, |
| 47 |
angledist, sizedist): |
| 48 |
yield None |
| 49 |
|
| 50 |
|
| 51 |
def start(t,x,y): |
| 52 |
colormode(255) |
| 53 |
t.reset() |
| 54 |
t.speed(0) |
| 55 |
t.hideturtle() |
| 56 |
t.left(90) |
| 57 |
t.penup() |
| 58 |
t.setpos(x,y) |
| 59 |
t.pendown() |
| 60 |
|
| 61 |
def doit1(level, pen): |
| 62 |
pen.hideturtle() |
| 63 |
start(pen, 20, -208) |
| 64 |
t = tree( [pen], 80, level, 0.1, [[ (45,0.69), (0,0.65), (-45,0.71) ]] ) |
| 65 |
return t |
| 66 |
|
| 67 |
def doit2(level, pen): |
| 68 |
pen.hideturtle() |
| 69 |
start(pen, -135, -130) |
| 70 |
t = tree( [pen], 120, level, 0.1, [[ (45,0.69), (-45,0.71) ]] ) |
| 71 |
return t |
| 72 |
|
| 73 |
def doit3(level, pen): |
| 74 |
pen.hideturtle() |
| 75 |
start(pen, 190, -90) |
| 76 |
t = tree( [pen], 100, level, 0.1, [[ (45,0.7), (0,0.72), (-45,0.65) ]] ) |
| 77 |
return t |
| 78 |
|
| 79 |
# Hier 3 Baumgeneratoren: |
| 80 |
def main(): |
| 81 |
p = Turtle() |
| 82 |
p.ht() |
| 83 |
tracer(75,0) |
| 84 |
u = doit1(6, Turtle(undobuffersize=1)) |
| 85 |
s = doit2(7, Turtle(undobuffersize=1)) |
| 86 |
t = doit3(5, Turtle(undobuffersize=1)) |
| 87 |
a = clock() |
| 88 |
while True: |
| 89 |
done = 0 |
| 90 |
for b in u,s,t: |
| 91 |
try: |
| 92 |
b.__next__() |
| 93 |
except: |
| 94 |
done += 1 |
| 95 |
if done == 3: |
| 96 |
break |
| 97 |
|
| 98 |
tracer(1,10) |
| 99 |
b = clock() |
| 100 |
return "runtime: %.2f sec." % (b-a) |
| 101 |
|
| 102 |
if __name__ == '__main__': |
| 103 |
main() |
| 104 |
mainloop() |