diff options
author | Travis CI <zmoelnig@travis-ci.umlaeute.mur.at> | 2019-02-07 23:02:34 +0000 |
---|---|---|
committer | Travis CI <zmoelnig@travis-ci.umlaeute.mur.at> | 2019-02-07 23:02:34 +0000 |
commit | 4f2a18125b4558c4c63daf5dacd9173c08b34fcf (patch) | |
tree | ebad5c03b60295396fe699b3038239e485032183 /Gem/examples/13.recursion | |
parent | 2d50e14a3be3d93d9dcf72998691f0f6f0e7c771 (diff) |
Gem 6ea7a457bfdbafb64c4123cb12882643bcf4109f linux/amd64
built 'master:6ea7a457bfdbafb64c4123cb12882643bcf4109f' for linux/amd64
Diffstat (limited to 'Gem/examples/13.recursion')
6 files changed, 18 insertions, 6 deletions
diff --git a/Gem/examples/13.recursion/01.repetition_is_futile.pd b/Gem/examples/13.recursion/01.repetition_is_futile.pd index 2fe7232..250142a 100644 --- a/Gem/examples/13.recursion/01.repetition_is_futile.pd +++ b/Gem/examples/13.recursion/01.repetition_is_futile.pd @@ -1,4 +1,5 @@ -#N canvas 0 0 602 516 10; +#N canvas 6 61 542 516 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -36,6 +37,7 @@ with just 4 circles the repetition is painfully obvious \, and if we wanted more the duplication would be painfully tedious.; #X text 170 177 There is a powerful way to avoid this pain \, however \, using recursion.; +#X obj 430 9 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 0 0; diff --git a/Gem/examples/13.recursion/02.iteration_is_insufficient.pd b/Gem/examples/13.recursion/02.iteration_is_insufficient.pd index fad24c1..e161cac 100644 --- a/Gem/examples/13.recursion/02.iteration_is_insufficient.pd +++ b/Gem/examples/13.recursion/02.iteration_is_insufficient.pd @@ -1,4 +1,5 @@ -#N canvas 0 0 602 259 10; +#N canvas 6 61 602 259 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -22,6 +23,7 @@ structure \, without branches. Iteration has solved one problem \, only to present us with another: what if we want a branching structure? ; #X text 170 187 Recursion is an elegant solution to this problem.; +#X obj 470 9 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 0 0; diff --git a/Gem/examples/13.recursion/03.recursive_spiral.pd b/Gem/examples/13.recursion/03.recursive_spiral.pd index 2783fc8..7c64e36 100644 --- a/Gem/examples/13.recursion/03.recursive_spiral.pd +++ b/Gem/examples/13.recursion/03.recursive_spiral.pd @@ -1,4 +1,5 @@ -#N canvas 3 2 602 516 10; +#N canvas 6 61 602 516 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -44,6 +45,7 @@ depth \, and recurse (after decrementing the maximum depth).; less elegant than the iterative solution with [repeat] \, and it is -- for non-branching structures. The power of recursion comes from the ease with which branching structures can be created.; +#X obj 497 15 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 0 0; diff --git a/Gem/examples/13.recursion/04.binary_tree.pd b/Gem/examples/13.recursion/04.binary_tree.pd index ef8f69f..01dcd99 100644 --- a/Gem/examples/13.recursion/04.binary_tree.pd +++ b/Gem/examples/13.recursion/04.binary_tree.pd @@ -1,4 +1,5 @@ -#N canvas 3 2 602 516 10; +#N canvas 6 61 602 516 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -53,6 +54,7 @@ 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 obj 497 15 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 0 0; diff --git a/Gem/examples/13.recursion/05.n-ary_tree.pd b/Gem/examples/13.recursion/05.n-ary_tree.pd index 91d0565..308f5e5 100644 --- a/Gem/examples/13.recursion/05.n-ary_tree.pd +++ b/Gem/examples/13.recursion/05.n-ary_tree.pd @@ -1,4 +1,5 @@ -#N canvas 3 2 600 605 10; +#N canvas 6 61 600 605 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -43,6 +44,7 @@ Trying to use it with an external counter leads to re-entrancy bugs \, because the [repeat] is retriggered before the counter has finished \, which messes up the counter's internal state. [nrepeat] is a "repeat with a built in counter" \, which is re-entrancy safe.; +#X obj 440 9 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 0 0; diff --git a/Gem/examples/13.recursion/06.breaking_symmetry.pd b/Gem/examples/13.recursion/06.breaking_symmetry.pd index c409aaf..e5aeefc 100644 --- a/Gem/examples/13.recursion/06.breaking_symmetry.pd +++ b/Gem/examples/13.recursion/06.breaking_symmetry.pd @@ -1,4 +1,5 @@ -#N canvas 4 2 673 560 10; +#N canvas 6 61 673 560 10; +#X declare -lib Gem; #X obj 14 66 gemwin; #X obj 14 9 tgl 15 0 empty empty empty 17 7 0 10 -262144 -1 -1 0 1 ; @@ -354,6 +355,7 @@ the geos according to the transformations. Allowing different parameters for each transformation means we can create non-symmetric structures with some sort of self-similarity.; #X msg 48 13 create; +#X obj 560 9 declare -lib Gem; #X connect 1 0 0 0; #X connect 2 0 0 0; #X connect 3 0 25 0; |