(level, pen)
| 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() |
no test coverage detected
searching dependent graphs…