**Question 1:**

How would I turn a set of intervals into a set of specific pitches, where, starting with 0, the intervals are consecutively summed together as adjacent intervals?

For example:

[ 1, 2, 5, 7, 7 ] → [ 0, 1, 2, 8, 15, 22 ]

[ 7, 7, 5, 2, 1 ] → [ 0, 7, 14, 19, 21, 22 ]

**Question 2:**

Starting with a set of intervals, how would I create an array of all possible permutations and render all permutations as adjacent interval series?

For example:

Using permute in some way to create all possible permutations rendered as adjacent intervals…

```
(
x = [ 1, 2,3];
6.do({|i| x.permute(i).postln;});
--> sum intervals starting with 0
```

So *not* as:

[ 1, 2, 3 ]

[ 2, 1, 3 ]

[ 3, 2, 1 ]

[ 1, 3, 2 ]

[ 2, 3, 1 ]

[ 3, 1, 2 ]

But *rather* as:

[ 0, 1, 3, 6 ]

[ 0, 2, 3, 6 ]

[ 0, 3, 5, 6 ]

[ 0, 1, 4, 6 ]

[ 0, 2, 5, 6 ]

[ 0, 3, 4, 6 ]

**Question 3:**

Are there any good resources online that detail common ways of working with set theory processes in Supercollider?

Any help would be greatly appreciated–thank you!