SuperCollider CLASSES

# Collection

Abstract superclass of all collections
Inherits from: Object

## Description

Collection is an abstract class. You do not create direct instances of Collection. There are many types of Collections including List, Array, Dictionary, Bag, Set, SortedList, etc. See Collections for a complete class tree.

## Class Methods

### *newFrom (aCollection)

Creates a new Collection from another collection. This supports the interface for the method "as".

Array.newFrom(Set[4, 2, 1]);
Set.newFrom(Array[4, 2, 1]);
[1, 2, 3, 4, 3, 2].as(Set); // as(someClass) calls someClass.newFrom(this)

### *with ( ... args)

Creates a new Collection from the args.

Array.with(4, 2, 1);

### *fill (size, function)

Creates a Collection of the given size, the elements of which are determined by evaluation the given function. The function is passed the index as an argument.

Array.fill(4, { arg i; i * 2 });
Bag.fill(14, { arg i; i.rand });

#### Arguments:

 size The size of the collection which is returned. If nil, it returns an empty collection. If an array of sizes is given, the resulting collection has the appropriate dimensions (see: *fillND).Array.fill([2, 2, 3], { arg i, j, k; i * 100 + (j * 10) + k }); function The function which is called for each new element - the index is passed in as a first argument. The function be anything that responds to the message "value".Array.fill(10, { arg i; 2 ** i }); Array.fill(10, Pxrand([0, 1, 2], inf).iter); Array.fill(10, 7); // an object that doesn't respond with a new value is just repeatedly added.

### *fill2D (rows, cols, function)

Creates a 2 dimensional Collection of the given sizes. The items are determined by evaluation of the supplied function. The function is passed row and column indexes as arguments. See J concepts in SC

Array.fill2D(2, 4, 0);
Array.fill2D(3, 4, { arg r, c; r*c+c; });

### *fill3D (planes, rows, cols, function)

Creates a 3 dimensional Collection of the given sizes. The items are determined by evaluation of the supplied function. The function is passed plane, row and column indexes as arguments. See J concepts in SC

Array.fill3D(2, 3, 4, { arg p, r, c; p; });

### *fillND (dimensions, function, args: [ ])

Creates a N dimensional Collection where N is the size of the array dimensions. The items are determined by evaluation of the supplied function. The function is passed N number of indexes as arguments. See J concepts in SC

Array.fillND([4, 4], { arg a, b; a+b; });                // 2D
Array.fillND([4, 4, 4], { arg a, b, c; a+b*c; });        // 3D
Array.fillND([1, 2, 3, 4], { arg a, b, c, d; b+d; });    // 4D

## Instance Methods

### -size

Answers the number of objects contained in the Collection.

List[1, 2, 3, 4].size;

### -isEmpty

List[].isEmpty;

List[1, 2].add(3);

List[1, 2].addAll(List[3, 4]);

### -remove

(
var a;
a = List[1, 2, 3, 4];
a.remove(3);
a;
)

### -removeAll (list)

Remove all items in aCollection from the receiver.

List[1, 2, 3, 4].removeAll(List[2, 3]);

NOTE: that multiple items in the receiver will not necessarily be removed
~closet = [\hat, \hat, \hat, \coat, \coat, \shoe, \shoe];
~closet.removeAll([\hat, \coat, \shoe, \shoe]); // Doesn't empty the closet, just removes what we wanted to

See -removeEvery for a related method that removes all occurrences.

### -removeEvery (list)

Remove all occurrences of the items in aCollection from the receiver.

List[1, 2, 3, 2, 3, 2, 3, 4].removeEvery(List[2, 3]);

### -removeAllSuchThat (function)

Remove all items in the receiver for which function answers True. The function is passed two arguments, the item and an integer index. Answers the objects which have been removed.

(
var a;
a = List[1, 2, 3, 4];
a.removeAllSuchThat({ arg item, i; item < 3 });
a;
)

### -putEach (keys, values)

Put the values in the corresponding indices given by keys. If one of the two argument arrays is longer then it will wrap.

y = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
y.putEach([2, 3, 5, 6], \wotsits);

### -atAll (keys)

Return a collection of all the items for the keys.

y = [\a, \b, \c];
y.atAll([0, 2]);

### -includes (item1)

List[1, 2, 3, 4].includes(3);

### -includesAny (aCollection)

List[1, 2, 3, 4].includesAny(List[4, 5]);

### -includesAll (aCollection)

List[1, 2, 3, 4].includesAll(List[4, 5]);

### -matchItem (item)

Returns True if this includes the item.

### -do

Evaluates function for each item in the collection. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].do({ arg item, i; item.postln });

### -collect (function)

Answer a new collection which consists of the results of function evaluated for each item in the collection. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].collect({ arg item, i; item + 10 });

If you want to control what type of collection is returned, use -collectAs(function, class).

### -select (function)

Answer a new collection which consists of all items in the receiver for which function answers True. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].select({ arg item, i; item.even });

If you want to control what type of collection is returned, use -selectAs(function, class).

### -reject (function)

Answer a new collection which consists of all items in the receiver for which function answers False. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].reject({ arg item, i; item.even });

If you want to control what type of collection is returned, use -rejectAs(function, class).

### -detect (function)

Answer the first item in the receiver for which function answers True. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].detect({ arg item, i; item.even });

### -detectIndex (function)

Similar to -detect but returns the index instead of the item itself.

List[1, 2, 3, 4].detectIndex({ arg item, i; item.even });

### -inject (thisValue, function)

In functional programming, the operation known as a left fold. inject takes an initial value and a function and combines the elements of the collection by applying the function to the accumulated value and an element from the collection starting from the first element in the collection. The function takes two arguments and returns the new value. The accumulated value is initialized to initialValue.

[1,2,3,4,5].inject(0, _+_); // 15

[1,2,3,4,5].inject(1, _*_); // 120

// same as .collect(_.squared)
[1,2,3,4,5].inject([], {|a,b| a ++ b.squared }); // [ 1, 4, 9, 16, 25 ]
[1,2,3,4,5].inject([], {|a,b| [b] ++ a ++ [b]}); // [ 5, 4, 3, 2, 1, 1, 2, 3, 4, 5 ]
[1,2,3,4,5].inject([], {|a,b| a ++ b ++ a});
[1,2,3,4,5].inject([], {|a,b| a ++ a ++ b});

### -injectr (thisValue, function)

In functional programming, the operation known as a right fold. inject takes an initial value and a function and combines the elements of the collection by applying the function to the accumulated value and an element from the collection starting from the last element in the collection. The function takes two arguments and returns the new value. The accumulated value is initialized to initialValue.

[1,2,3,4,5].injectr([], _++_); // [ 5, 4, 3, 2, 1 ]

[1,2,3,4,5].inject([], _++_); // [ 1, 2, 3, 4, 5 ]

### -collectInPlace (function)

Iterate over the collection and replace each item with a new one, returned by the function. This can be useful when one wants to aviod creating a new array in memory. In most cases, it is better to use -collect.

a = [1, 5, 3, 4];
a.collectInPlace { |x| 2 ** x };
a; // changed

// compare:
a = [1, 5, 3, 4];
a.collect { |x| 2 ** x };
a; // remains unchanged

### -collectCopy (func)

Like -collect, but the collection is copied before iteration. This is recommended wherever the function may change the collection itself.

a = [1, 5, 2, 3, 4];
b = a.collectCopy { |x| if(x.even) { a.remove(x); "removed" } { x }  };
a;
b;

### -any (function)

Answer whether function answers True for any item in the receiver. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].any({ arg item, i; item.even });

### -every (function)

Answer whether function answers True for every item in the receiver. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].every({ arg item, i; item.even });

### -count (function)

Answer the number of items for which function answers True. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].count({ arg item, i; item.even });

### -occurrencesOf (obj)

Answer the number of items in the receiver which are equal to anObject.

List[1, 2, 3, 3, 4, 3, 4, 3].occurrencesOf(3);

### -sum (function)

Answer the sum of the results of function evaluated for each item in the receiver. The function is passed two arguments, the item and an integer index.

List[1, 2, 3, 4].sum;
(0..8).sum { |i| 1 / (2 ** i) };

### -maxItem (function)

Answer the maximum of the results of function evaluated for each item in the receiver. The function is passed two arguments, the item and an integer index. If function is nil, then answer the maximum of all items in the receiver.

List[1, 2, 3, 4].maxItem({ arg item, i; item + 10 });

### -minItem (function)

Answer the minimum of the results of function evaluated for each item in the receiver. The function is passed two arguments, the item and an integer index. If function is nil, then answer the minimum of all items in the receiver.

List[1, 2, 3, 4].minItem({ arg item, i; item + 10 });

### -maxIndex (function)

Answer the index of the maximum of the results of function evaluated for each item in the receiver. The function is passed two arguments, the item and an integer index. If function is nil, then answer the maximum of all items in the receiver.

List[1, 2, 3, 4].maxIndex({ arg item, i; item + 10 });
[3.2, 12.2, 13, 0.4].maxIndex;

### -minIndex (function)

Answer the index of the minimum of the results of function evaluated for each item in the receiver. The function is passed two arguments, the item and an integer index. If function is nil, then answer the minimum of all items in the receiver.

List[1, 2, 3, 4].minIndex({ arg item, i; item + 10 });
List[3.2, 12.2, 13, 0.4].minIndex;

### -maxSizeAtDepth (rank)

Returns the maximum size of all subcollections at a certain depth (dimension)

#### Arguments:

 rank The depth at which the size of the collection is measuredSet[Set[1, 2, 3], [Set[41, 52], 5, 6], 1, 2, 3].maxSizeAtDepth(2); Set[Set[1, 2, 3], [Set[41, 52], 5, 6], 1, 2, 3].maxSizeAtDepth(1); Set[Set[1, 2, 3], [Set[41, 52], 5, 6], 1, 2, 3].maxSizeAtDepth(0); Set[].maxSizeAtDepth(0); Set[[]].maxSizeAtDepth(0); Set[[]].maxSizeAtDepth(1);

### -maxDepth (max: 1)

Returns the maximum depth of all subcollections.

#### Arguments:

 max Internally used only.Set[Set[1, 2, 3], Set[Set[41, 52], 5, 6], 1, 2, 3].maxDepth

### -iter

Returns a Routine that returns the elements one by one.

r = Set[10, 2, -3, -4].iter;
r.next;
r.next;
r.next;
r.next; // nil.

### -asBag

List[1, 2, 3, 4].asBag;

### -asList

Set[1, 2, 3, 4].asList;

### -asSet

List[1, 2, 3, 4].asSet;

### -asSortedList (function)

List[2, 1, 4, 3].asSortedList;

### -powerset

Returns all possible combinations of the collection's elements.

Set[1, 2, 3].powerset;

// generate the von neumann ordinals. (warning: only count to four at maximum!)
a = Set[];
a = a.powerset;
a = a.powerset;
a = a.powerset;

u = { |set| set.unify }; // union (count down)
n = { |set| set.powerset }; // powerset (count up)
a = Set[]; // empty set (zero)
n.(n.(a)); // two
u.(n.(n.(a))) == n.(a); // two - one == one
u.(u.(n.(n.(a)))) == u.(n.(a)); // two - two == one - one

### -flopDict (unbubble: true)

Takes a collection of dictionaries and returns a single dictionary with arrays of all dictionaries' elements. If unbubble is True (default), and if one element is singular, the array is replaced by this element.

[(degree: 7, x: 4), (degree: 8, x: 5), (degree: -2, dur: 2.5)].flopDict;
[(degree: 7, x: 4), (degree: 8, x: 5), (degree: -2, dur: 2.5)].flopDict(false);

### -histo (steps: 100, min, max)

Returns a histogram of the collection by counting the number of values that fall into each slot of size (default: 100) subdivisions between min and max. If there are any values outside this range, it posts a note. If min or max is not given, the smallest (or largest value respectively) is used.

{ 1.0.linrand }.dup(10000).histo(1000).plot;
{ 8.rand }.dup(10000).histo(8).plot(discrete: true);

### -invert (axis)

Subtractively invert a collection about a value (default: sum of minimal and maximum value). It can be used to invert a pitch list about a given axis.

[0, 1, 4, 7].invert(0);
[0, 1, 2, 3].invert(1);
[3, 2, 9, 7].invert(11); // becomes [ 19, 20, 13, 15 ]
// if axis is nil, invert uses the registral center
[3, 2, 9, 7].invert; // becomes [ 8, 9, 2, 4 ]
// invert chords
[[0, 5, 7], [5, 7, 11], [6, 7, 9]].invert(5);

### -printOn (stream)

Print a representation of the collection to a stream.

### -storeOn (stream)

Write a compilable representation of the collection to a stream.

### -printItemsOn (stream)

Print a comma separated compilable representation of the items in the collection to a stream.

### -storeItemsOn (stream)

Write a comma separated compilable representation of the items in the collection to a stream.

### -sect (that)

Return the set theoretical intersection of this and that.

a = [1, 2, 3]; b = [2, 3, 4, 5];
sect(a, b);

### -union (that)

Return the set theoretical union of this and that.

a = [1, 2, 3]; b = [2, 3, 4, 5];
union(a, b);

### -difference (that)

Return the set of all items which are elements of this, but not of that.

a = [1, 2, 3]; b = [2, 3, 4, 5];
difference(a, b);

### -symmetricDifference (that)

Return the set of all items which are not elements of both this and that. this -- that

a = [1, 2, 3]; b = [2, 3, 4, 5];
symmetricDifference(a, b);

### -isSubsetOf (that)

Returns True if all elements of this are also elements of that

a = Set[1, 2, 3, 4];
Set[1, 2].isSubsetOf(a); // true
Set[1, 5].isSubsetOf(a); // false

### -debug (caller)

From extension in /usr/local/share/SuperCollider/SCClassLibrary/Common/Core/debug.sc

### -processRest (inval)

From extension in /usr/local/share/SuperCollider/SCClassLibrary/Common/Streams/Rest.sc