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
|
class:: PstepNfunc
summary:: combinatoric pattern
related:: Classes/PstepNadd
categories:: Streams-Patterns-Events>Patterns>Time
description::
Combines an arbitrary number of patterns by evaluating a function (depth first traversal). When a stream ends it is recreated from its pattern until the top stream ends.
Examples::
code::
(
f = { arg vals;
vals.postln;
};
x = PstepNfunc(f, [
Pseq([1, 2, 3]), Pseq([4, 5, 6]), Pseq([7, 8, 9])
]).asStream;
50.do({ x.next });
)
(
f = { arg vals;
var r;
r = vals.copy.removeAt(0);
vals.do({ arg item; r = item / r.squared * 10 });
r
};
x = PstepNfunc(f,
[
Pseq([1, 2, 3], inf),
Pseq([2, pi, 1]),
Pseq([0.1, 3, 0.2, 3])
]
).asStream;
50.do({ x.next.postln });
)
// note that if the last pattern loops it will stick to that one:
(
f = { arg vals;
vals.postln;
};
x = PstepNfunc(f, [Pseq([1, 2, 3]), Pseq([10, 20, 30, 40]), Pseq([100, 200, 300], inf)]).asStream;
50.do({ x.next });
)
(
f = { arg vals;
vals.inject(1, { arg x, y; x * y })
};
x = PstepNfunc(f,
[
Pseq([1, 2, 3], inf),
Pseq([2, pi, 1]),
Pseq([0.1, 3, 0.2, 3])
]
).asStream;
50.do({ x.next.postln });
)
::
|
