FM / turtledemo

/usr/lib64/python3.12/turtledemo

Name	Size	Mode	Actions
__pycache__/	-	0755	rm
bytedesign.py	4248	0755	edit dl rm
chaos.py	951	0644	edit dl rm
clock.py	3304	0755	edit dl rm
colormixer.py	1339	0644	edit dl rm
forest.py	2966	0755	edit dl rm
fractalcurves.py	3473	0755	edit dl rm
lindenmayer.py	2434	0755	edit dl rm
minimal_hanoi.py	2051	0755	edit dl rm
nim.py	6513	0644	edit dl rm
paint.py	1291	0755	edit dl rm
peace.py	1066	0755	edit dl rm
penrose.py	3380	0755	edit dl rm
planet_and_moon.py	2825	0755	edit dl rm
rosette.py	1361	0644	edit dl rm
round_dance.py	1804	0644	edit dl rm
sorting_animate.py	5053	0755	edit dl rm
tree.py	1401	0755	edit dl rm
turtle.cfg	160	0644	edit dl rm
two_canvases.py	1119	0644	edit dl rm
yinyang.py	821	0755	edit dl rm
__init__.py	314	0644	edit dl rm
__main__.py	15384	0755	edit dl rm

Edit: /usr/lib64/python3.12/turtledemo/tree.py (1401B)

#! /usr/bin/python3.12
"""      turtle-example-suite:

tdemo_tree.py

Displays a 'breadth-first-tree' - in contrast
to the classical Logo tree drawing programs,
which use a depth-first-algorithm.

Uses:
(1) a tree-generator, where the drawing is
quasi the side-effect, whereas the generator
always yields None.
(2) Turtle-cloning: At each branching point
the current pen is cloned. So in the end
there are 1024 turtles.
"""
from turtle import Turtle, mainloop
from time import perf_counter as clock

def tree(plist, l, a, f):
    """ plist is list of pens
    l is length of branch
    a is half of the angle between 2 branches
    f is factor by which branch is shortened
    from level to level."""
    if l > 3:
        lst = []
        for p in plist:
            p.forward(l)
            q = p.clone()
            p.left(a)
            q.right(a)
            lst.append(p)
            lst.append(q)
        for x in tree(lst, l*f, a, f):
            yield None

def maketree():
    p = Turtle()
    p.setundobuffer(None)
    p.hideturtle()
    p.speed(0)
    p.getscreen().tracer(30,0)
    p.left(90)
    p.penup()
    p.forward(-210)
    p.pendown()
    t = tree([p], 200, 65, 0.6375)
    for x in t:
        pass

def main():
    a=clock()
    maketree()
    b=clock()
    return "done: %.2f sec." % (b-a)

if __name__ == "__main__":
    msg = main()
    print(msg)
    mainloop()

#! /usr/bin/python3.12 """ turtle-example-suite: tdemo_tree.py Displays a 'breadth-first-tree' - in contrast to the classical Logo tree drawing programs, which use a depth-first-algorithm. Uses: (1) a tree-generator, where the drawing is quasi the side-effect, whereas the generator always yields None. (2) Turtle-cloning: At each branching point the current pen is cloned. So in the end there are 1024 turtles. """ from turtle import Turtle, mainloop from time import perf_counter as clock def tree(plist, l, a, f): """ plist is list of pens l is length of branch a is half of the angle between 2 branches f is factor by which branch is shortened from level to level.""" if l > 3: lst = [] for p in plist: p.forward(l) q = p.clone() p.left(a) q.right(a) lst.append(p) lst.append(q) for x in tree(lst, l*f, a, f): yield None def maketree(): p = Turtle() p.setundobuffer(None) p.hideturtle() p.speed(0) p.getscreen().tracer(30,0) p.left(90) p.penup() p.forward(-210) p.pendown() t = tree([p], 200, 65, 0.6375) for x in t: pass def main(): a=clock() maketree() b=clock() return "done: %.2f sec." % (b-a) if __name__ == "__main__": msg = main() print(msg) mainloop()