Set : Collection : Object

Add an Object to the Set. An object which is equal to an object already in the Set will not be added.Set[1, 2, 3].add(4).postln; Set[1, 2, 3].add(3).postln; Set["abc", "def", "ghi"].add("jkl").postln; Set["abc", "def", "ghi"].add("def").postln;

Set[1, 2, 3].add(4).postln;

Set[1, 2, 3].add(3).postln;

Set["abc", "def", "ghi"].add("jkl").postln;

Set["abc", "def", "ghi"].add("def").postln;

Remove an Object from the Set. Element is checked for equality (not for identity).Set[1, 2, 3].remove(3).postln;

xxxxxxxxxx

Set[1, 2, 3].remove(3).postln;

Returns true if the specified item is present in the Set. Elements are checked for equality (not for identity).Set[1, 2, 3].includes(2).postln;

xxxxxxxxxx

Set[1, 2, 3].includes(2).postln;

Returns the item, if it is present in the set. Otherwise returns nil. Element is checked for equality (not for identity).Set[1, 2, 3].findMatch(3).postln;

xxxxxxxxxx

Set[1, 2, 3].findMatch(3).postln;

Evaluates function for each item in the Set. The function is passed two arguments, the item and an integer index.Set[1, 2, 3, 300].do({ arg item, i; item.postln });

xxxxxxxxxx

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

Returns the object at the internal index. This index is not deterministic.

Return the set theoretical intersection of this and that. The function will search for objects occurring in both sets and return a new set containing those. Elements are checked for equality (not for identity).a = Set[1, 2, 3]; b = Set[2, 3, 4, 5]; sect(a, b); a & b // shorter syntax

xxxxxxxxxx

a = Set[1, 2, 3]; b = Set[2, 3, 4, 5];

sect(a, b);

a & b // shorter syntax

Return the set theoretical union of this and that. The function combines the two sets into one without duplicates. Elements are checked for equality (not for identity).a = Set[1, 2, 3]; b = Set[2, 3, 4, 5]; union(a, b); a | b // shorter syntax

xxxxxxxxxx

a = Set[1, 2, 3]; b = Set[2, 3, 4, 5];

union(a, b);

a | b // shorter syntax

Return the set of all items which are elements of this, but not of that. Elements are checked for equality (not for identity).a = Set[1, 2, 3]; b = Set[2, 3, 4, 5]; difference(a, b); a - b // shorter syntax

xxxxxxxxxx

a = Set[1, 2, 3]; b = Set[2, 3, 4, 5];

difference(a, b);

a - b // shorter syntax

Return the set of all items which are not elements of both this and that. Elements are checked for equality (not for identity).a = Set[1, 2, 3]; b = Set[2, 3, 4, 5]; symmetricDifference(a, b); a -- b // shorter syntax

xxxxxxxxxx

a = Set[1, 2, 3]; b = Set[2, 3, 4, 5];

symmetricDifference(a, b);

a -- b // shorter syntax

Returns true if all elements of this are also elements of that. Elements are checked for equality (not for identity). Since Set is an unordered collection, order doesn't matter in this comparison.a = Set[1, 2, 3, 4]; Set[1, 2].isSubsetOf(a); // true Set[1, 5].isSubsetOf(a); // false

xxxxxxxxxx

a = Set[1, 2, 3, 4];

Set[1, 2].isSubsetOf(a); // true

Set[1, 5].isSubsetOf(a); // false