From 095b7e513f736567848173f2572d8b329ad75af9 Mon Sep 17 00:00:00 2001 From: Travis CI Date: Thu, 19 Mar 2015 19:32:08 +0000 Subject: Gem 206d71791bc3642e8c5391a4c59c30ba7411fab8 osx/x86_64 built 'coverity_scan:206d71791bc3642e8c5391a4c59c30ba7411fab8' for osx/x86_64 --- Gem/examples/13.recursion/04.binary_tree.pd | 98 ----------------------------- 1 file changed, 98 deletions(-) delete mode 100644 Gem/examples/13.recursion/04.binary_tree.pd (limited to 'Gem/examples/13.recursion/04.binary_tree.pd') diff --git a/Gem/examples/13.recursion/04.binary_tree.pd b/Gem/examples/13.recursion/04.binary_tree.pd deleted file mode 100644 index ef8f69f..0000000 --- a/Gem/examples/13.recursion/04.binary_tree.pd +++ /dev/null @@ -1,98 +0,0 @@ -#N canvas 3 2 602 516 10; -#X obj 14 66 gemwin; -#X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 -; -#X msg 48 10 create; -#X msg 55 33 destroy; -#X obj 14 93 gemhead; -#X text 170 17 A tutorial on recursion in Gem; -#X text 170 37 (GPL) 2007 Claude Heiland-Allen -; -#X obj 24 163 r \$0-recurse; -#X obj 68 133 v \$0-depth; -#X obj 14 113 t a b; -#X floatatom 91 96 5 0 0 2 max-depth - -; -#X obj 14 253 t a a; -#X obj 59 253 circle; -#X obj 14 223 separator; -#X obj 36 473 s \$0-recurse; -#X obj 14 353 t b a b; -#X obj 99 383 v \$0-depth; -#X obj 99 403 - 1; -#X obj 99 423 max 0; -#X obj 99 443 v \$0-depth; -#X obj 36 453 spigot; -#X obj 14 383 v \$0-depth; -#X obj 14 423 v \$0-depth; -#X obj 14 403 + 1; -#X obj 184 253 t a a; -#X obj 229 253 circle; -#X obj 206 473 s \$0-recurse; -#X obj 184 353 t b a b; -#X obj 269 383 v \$0-depth; -#X obj 269 403 - 1; -#X obj 269 423 max 0; -#X obj 269 443 v \$0-depth; -#X obj 206 453 spigot; -#X obj 184 383 v \$0-depth; -#X obj 184 423 v \$0-depth; -#X obj 184 403 + 1; -#X obj 184 223 separator; -#X obj 14 183 t a a; -#X obj 184 303 translate 1.5 0 1 0; -#X obj 184 323 scale 0.5; -#X obj 14 323 scale 0.5; -#X obj 14 303 translate 1.5 0 1 0; -#X obj 14 283 rotate -30 0 0 1; -#X obj 184 283 rotate 30 0 0 1; -#X obj 68 113 f 4; -#X text 170 77 The simplest recursive branching structure is one that -splits into two at each branch. Essentially what we are creating is -a circle \, plus two transformed copies of the whole structure \, limited -to a maximums depth of recursion.; -#X text 170 137 Be careful not to increase the max-depth too much: -the splitting at each recursion leads to an exponential increase in -the number of circles to be drawn.; -#X connect 1 0 0 0; -#X connect 2 0 0 0; -#X connect 3 0 0 0; -#X connect 4 0 9 0; -#X connect 7 0 37 0; -#X connect 9 0 37 0; -#X connect 9 1 44 0; -#X connect 10 0 44 1; -#X connect 11 0 42 0; -#X connect 11 1 12 0; -#X connect 13 0 11 0; -#X connect 15 0 21 0; -#X connect 15 1 20 0; -#X connect 15 2 16 0; -#X connect 16 0 17 0; -#X connect 17 0 18 0; -#X connect 18 0 19 0; -#X connect 18 0 20 1; -#X connect 20 0 14 0; -#X connect 21 0 23 0; -#X connect 23 0 22 0; -#X connect 24 0 43 0; -#X connect 24 1 25 0; -#X connect 27 0 33 0; -#X connect 27 1 32 0; -#X connect 27 2 28 0; -#X connect 28 0 29 0; -#X connect 29 0 30 0; -#X connect 30 0 31 0; -#X connect 30 0 32 1; -#X connect 32 0 26 0; -#X connect 33 0 35 0; -#X connect 35 0 34 0; -#X connect 36 0 24 0; -#X connect 37 0 13 0; -#X connect 37 1 36 0; -#X connect 38 0 39 0; -#X connect 39 0 27 0; -#X connect 40 0 15 0; -#X connect 41 0 40 0; -#X connect 42 0 41 0; -#X connect 43 0 38 0; -#X connect 44 0 8 0; -- cgit v1.2.1