1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
class:: Prewrite
summary:: L-system pattern for selfsimilar structures
related:: Classes/Pfsm
categories:: Streams-Patterns-Events>Patterns>List>Indexing
description::
Lindenmayer system pattern for selfsimilar structures. Its strong::dictionary (or event):: maps one element to an array of child elements. The algorithm replaces iteratively (strong::levels:: deep) elements by arrays of elements starting with the values in the strong::pattern::.
ClassMethods::
method::new
argument::pattern
starting value
argument::dict
a dictionary or an event.
argument::levels
number of levels
code::
IdentityDictionary[
elem1 -> [ otherElements ],
elem2 -> [ otherElements ],
elem2 -> [ otherElements ]
]
::
Examples::
The examples use the code::():: shortcut for link::Classes/Event::.
code::
// A generative song
(
// Scale degrees going up
Pdef(\a, Pbind(\dur, 0.25, \degree, Pseq((0..3))));
// Scale degrees going down
Pdef(\b, Pbind(\dur, 0.25, \degree, Pseq((3..0))));
// Random scale degrees
Pdef(\c, Pbind(\dur, 0.125, \degree, Pwhite(0,10, 8)));
// Use the L-system to put together a sequence of keys
// Psym will then retrieve the patterns from the global Pdef dictionary
// See the post window for info about which of these are playing
Psym(
Prewrite(\a, // start with pattern \a
(
\a: #[\a, \b],
\b: #[\c, \a],
\c: #[\a, \b]
), 4).trace
).play
)
// Inspect the L-system to see what data it produces
(
a = Prewrite(0, // start with 0
(
0: #[2,0],
1: #[0,0,1],
2: #[1,0,1]
), 4);
x = a.asStream;
30.do({ x.next.postln });
)
::
|
