�
A fc @ so d Z d d l m Z m Z d d l m Z d � Z d � Z d � Z e d k rk e � Z
e
GHe � n d S( s� 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.
i����( t Turtlet mainloop( t clockc c s� | d k r� g } x[ | D]S } | j | � | j � } | j | � | j | � | j | � | j | � q Wx) t | | | | | � D] } d Vq� Wn d S( s� 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.i N( t forwardt clonet leftt rightt appendt treet None( t plistt lt at ft lstt pt qt x( ( s. /usr/lib64/python2.7/Demo/turtle/tdemo_tree.pyR s
c C s� t � } | j d � | j � | j d � | j d d � | j d � | j � | j d � | j � t
| g d d d � } x | D] } q� Wt | j � j
� � GHd S( Ni i iZ i.���i� iA gffffff�?( R t
setundobufferR t
hideturtlet speedt tracerR t penupR t pendownR t lent getscreent turtles( R t tR ( ( s. /usr/lib64/python2.7/Demo/turtle/tdemo_tree.pyt maketree' s
c C s% t � } t � t � } d | | S( Ns done: %.2f sec.( R R ( R t b( ( s. /usr/lib64/python2.7/Demo/turtle/tdemo_tree.pyt main6 s t __main__N( t __doc__t turtleR R t timeR R R R t __name__t msg( ( ( s. /usr/lib64/python2.7/Demo/turtle/tdemo_tree.pyt s