Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 3.142.201.222
Domains :
Cant Read [ /etc/named.conf ]
User : cleahvkv
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
lib64 /
python3.8 /
turtledemo /
Delete
Unzip
Name
Size
Permission
Date
Action
__pycache__
[ DIR ]
drwxr-xr-x
2024-03-05 23:45
__init__.py
314
B
-rw-r--r--
2023-06-06 13:32
__main__.py
13.91
KB
-rw-r--r--
2023-10-17 18:12
bytedesign.py
4.15
KB
-rwxr-xr-x
2023-06-06 13:32
chaos.py
951
B
-rw-r--r--
2023-06-06 13:32
clock.py
3.13
KB
-rwxr-xr-x
2023-06-06 13:32
colormixer.py
1.31
KB
-rw-r--r--
2023-06-06 13:32
forest.py
2.9
KB
-rwxr-xr-x
2023-06-06 13:32
fractalcurves.py
3.39
KB
-rwxr-xr-x
2023-06-06 13:32
lindenmayer.py
2.38
KB
-rwxr-xr-x
2023-06-06 13:32
minimal_hanoi.py
2
KB
-rwxr-xr-x
2023-06-06 13:32
nim.py
6.36
KB
-rw-r--r--
2023-06-06 13:32
paint.py
1.26
KB
-rwxr-xr-x
2023-06-06 13:32
peace.py
1.04
KB
-rwxr-xr-x
2023-06-06 13:32
penrose.py
3.3
KB
-rwxr-xr-x
2023-06-06 13:32
planet_and_moon.py
2.76
KB
-rwxr-xr-x
2023-06-06 13:32
rosette.py
1.33
KB
-rw-r--r--
2023-06-06 13:32
round_dance.py
1.76
KB
-rw-r--r--
2023-06-06 13:32
sorting_animate.py
4.91
KB
-rw-r--r--
2023-10-17 18:12
tree.py
1.37
KB
-rwxr-xr-x
2023-06-06 13:32
turtle.cfg
160
B
-rw-r--r--
2023-06-06 13:32
two_canvases.py
1.09
KB
-rw-r--r--
2023-06-06 13:32
yinyang.py
820
B
-rwxr-xr-x
2023-06-06 13:32
Save
Rename
#! /usr/bin/python3.8 """ 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()