SuperCollider CLASSES

Dictionary

associative collection mapping keys to values
Inherits from: Set : Collection : Object
Subclasses: IdentityDictionary

Description

A Dictionary is an associative collection mapping keys to values. Two keys match if they are equal. (i.e. == returns true.)

The contents of a Dictionary are unordered. You must not depend on the order of items in a Dictionary. You must only rely on equality for the keys (e.g. symbols are ok, strings not). For identity matching see: IdentityDictionary.

Class Methods

*new (n: 8)

Creates a Dictionary with an initial capacity for n key value mappings.

*newFrom (aCollection)

Creates a new Dictionary from another collection.

d= Dictionary.newFrom(List[\a, 1, \b, 2, \c, 4]);

Arguments:

aCollection

any Object that responds to keysValuesDo (usually a List or an Array).

Discussion:

A new Dictionary can also be created from an array of Associations:

Dictionary.with(*[\a->1,\b->2,\c->3])

Inherited class methods

Instance Methods

Adding and Removing

-add (anAssociation)

Add anAssociation to the Dictionary. If the key value pair already exists in the Dictionary, the key's value will be replaced.

(
d = Dictionary.new;
d.add(\monkey -> 0).postln;
d.add(\robot -> 1).postln;    // Add robot as a key with a value of 1
d.add(\monkey -> 2).postln;    // Replaces the value for the key monkey with 2
)

-put (key, value)

Associate two objects and add them to the Dictionary.

d = Dictionary.new;
d.put("abc", 10);

// using an event:
d = ();
d.put("abc", 10);

Arguments:

key

key to associate with object. This can be any objects, but is often a Symbol.

value

an object

-removeAt (key)

Remove the key and the value associated with it from the Dictionary.

d = (monkey: 99);
d.removeAt(\monkey);

-putAll ( ... dictionaries)

Add all items of each argument to the dictionary.

d = ();
d.putAll(Dictionary[\hello -> 9, \whello -> "world"], Dictionary["abd" -> 6]);

Arguments:

... dictionaries

any Object that responds to keysValuesDo (usually a Dictionary).

-putPairs (args)

Add all items to the dictionary, using them as key and value pairwise.

d = ();
d.putPairs([\hello, 10, \whello, "lord", "abc", 7]);

Accessing

-at (key)

Access the value associated with the key.

d = (robot: 99);
d.at(\robot);    // Get the value associated with key
d[\robot];    // different syntax, same behaviour
d.at(\monkey);    // Key doesn't exist: return Nil

-atFail (key, function)

Access the value associated with the key. If the key does not exist, return the result of function.

-keys (species)

Return a Set of all keys.

d = (hello: 9, whello: "world");
d.keys;

-values

Return a List of all values.

d = (hello: 9, whello: "world");
d.values;

-atAll (keys)

From superclass: Collection

Return an Array of all values for the given keys.

d = (hello: 9, whello: "world", z: 99, c: 0.33);
d.atAll([\hello, \z, \hello, \c, \whello]);

-getPairs (args)

Return an Array with all keys and values pairwise.

d = (hello: 9, whello: 77, z: 99);
d.getPairs;

-associationAt (key)

Access the Association that has the given key.

d = (robot: 99);
d.associationAt(\robot);    // Get the value associated with key

-findKeyForValue (argValue)

Try to find a given value and return its key.

d = (hello: 1, whello: 1976);
d.findKeyForValue(1);

-matchAt (key)

The dictionary's keys are used as conditions against which the arbitrary item is matched. See: matchItem

NOTE: if an item matches multiple criteria, the value returned is arbitrary. This is because a dictionary is an unordered collection. It's the user's responsibility to make sure that criteria are mutually exclusive.

(
d = (
    0: \zero,
    \abc: \alpha,
    [1, 2, 3, 5, 8, 13, 21]: \fibonacci,
    { |x| try { x.even } }: \even // try is needed because argument might not be a number
    );
);

d.matchAt(0)
d.matchAt(1)
d.matchAt(2)    // matches both 'fibonacci' and 'even', either may be returned
d.matchAt(4)
d.matchAt(\abc)

-trueAt (key)

Returns True if the item at the key is true, otherwise false. This method is also valid in Object.

-falseAt (key)

From superclass: Object

Returns False if the item at the key is not true, otherwise true. This method is inherited from Object.

Iteration/Enumeration

Most methods for iteration work analogously to Dictionary's superclasses, see e.g. Collection.

-do (function)

-collect (function)

-reject (function)

-select (function)

// do, collect, reject, select
d = Dictionary[\a -> "hello", \b -> "robot", \c -> [1, 2, 3]];
d = (a: "hello", b: "robot", c: [1, 2, 3]); // equivalent
d.do { |item, i| [item, i].postln };
d.collect { |item| item + 100 };
d.reject { |item| item.size > 4 };
d.select { |item| item.size > 4 };

-keysValuesDo (function)

Iterate over the associations, and evaluate the function for each, passing key and value as argument.

d = (a: "hello", b: "robot", c: [1, 2, 3]);
d.keysValuesDo { |key, value| postln("the key: " ++ key ++ " the value: " ++ value) };

-keysValuesChange (function)

Iterate over the associations, and evaluate the function for each, passing key and value as argument. Replace the value with the return value from the function (similar to -collect, but modifies the dictionary in place).

d = (a: "hello", b: "robot", c: [1, 2, 3]);
d.keysValuesChange { |key, value| "the key: " ++ key ++ " the value: " ++ value };
d;

-keysDo (function)

Iterate over the associations, and evaluate the function for each, passing key as argument.

d = (a: "hello", b: "robot", c: [1, 2, 3]);
d.keysDo { |key| postln("the key: " ++ key) };

-associationsDo (function)

Iterate over the associations, and evaluate the function for each.

d = (a: "hello", b: "robot", c: [1, 2, 3]);
d.associationsDo { |assoc| postln("the association: " ++ assoc) };

-pairsDo (function)

Iterate over the associations, and evaluate the function for each, passing key and value as argument. Identical to -keysValuesDo

-invert

Return a new dictionary with all the values as keys and vice versa.

d = (a: "hello", b: "robot", c: [1, 2, 3]);
d.invert;

Other instance methods

-order (func)

Return an array of keys which corresponds to the order of the values of the dictionary.

d = (a: 5, b: 7, c: 1, d: 0);
d.order;
d.atAll(d.order);    // returns items in order

-powerset

Return the set of all subsets: here an array of all sub-dictionaries.

d = (a: 5, b: 7, c: 1, d: 0);
d.powerset;

-merge (that, func, fill: true)

Combine two dictionaries into a new one by applying a function to each value. If fill is true (default: true), values missing from one of them are kept as they are.

d = (a: 5, b: 7, d: 0);
e = (a: 3, b: -3, c: 1);
merge(d, e, { |a, b| a + b });
merge(d, e, { |a, b| a + b }, false);

Arguments:

that

another dictionary.

func

a Function.

fill

a Boolean.

-blend (that, blend: 0.5, fill: true, specs)

Blend two dictionaries into a new one by interpolating each value. If fill is true (default: true), values missing from one of them are kept as they are.

d = (a: 5, b: 7, d: 0);
e = (a: 3, b: -3, c: 1);
blend(d, e, 0.3);
blend(d, e, 0.3, false);

d = (a: 500, b: 0.001);
e = (a: 300, b: 0.1);
blend(d, e, 0.3, specs: (a: \freq, b: \rq));

Arguments:

that

another dictionary.

blend

the blend ratio as a Float between 0.0 and 1.0.

fill

a Boolean.

specs

a dictionary of Specs that are applied to each before blending.

-asSortedArray

Return the values in a sorted array of key value pairs.

d = (a: 5, b: 7, c: 1, d: 0);
d.asSortedArray;

-asKeyValuePairs

Return the values in an array of alternating key value pairs.

d = (a: 5, b: 7, c: 1, d: 0);
d.asKeyValuePairs;

-embedInStream (event)

Arguments:

event

The inval, usually in an event stream. See also Event.

If the event is not nil, yields a copy, adding all the elements of the receiver event (this leaves the receiver unchanged). If it is nil, return the receiver.

a = (note: 2);
b = (note: [3, 5]);
Pseq([a, b]).play;

If a key "embedInStream" is given, use this function instead. The behaviour of the event can be configured easily this way.

The arguments event (the receiver) and inevent (the inevent) are passed to the function.

NOTE: In infinite patterns, you must call yield or embedInStream in the function, otherwise it will loop forever.
(
a = (
    pattern: Pbind(\note, Pgeom(1, 1.1, { 20.rand }), \dur, 0.05),
    embedInStream: { |event, inevent| event[\pattern].embedInStream(inevent) }
);
b = (note: [3, 5]);
c = (freq: 402, dur: 0.3);
Prand([a, b, c], inf).trace.play;
)

// change the events while playing
c[\freq] = [900, 1002, 1102];
c[\freq] = [200, 101, 1102];

A generator for dictionaries:

(
d = (
    a: 5, b: 7, c: 1,
    rout: Routine { |inval|
        inf.do { |i|
            var event = d.copy.put(\count, i);
            inval = event.embedInStream(inval);
        }
    }
);
)

// draw new values
d.rout.((z:999));
d.rout.((z:1, a:0));
d.rout.(());

Inherited instance methods

Undocumented instance methods

-++ (dict)

-asDict

-asPairs

-associationAtFail (argKey, function)

-choose

-fixCollisionsFrom (index)

-grow

-gui ( ... args)

From extension in /usr/local/share/SuperCollider/SCClassLibrary/JITLib/GUI/extJITgui.sc

-includes (item1)

-includesKey (key)

-isAssociationArray

-keysValuesArrayDo (argArray, function)

-mergeItem (key, val, func)

-printItemsOn (stream, itemsPerLine: 5)

-remove

-removeAtFail (key, function)

-removeFail

-scanFor (argKey)

-softPut (param, val, within: 0.025, mapped: true, lastVal, spec)

From extension in /usr/local/share/SuperCollider/SCClassLibrary/JITLib/GUI/extSoftSet.sc

-softSet (param, val, within: 0.025, mapped: true, lastVal, spec)

From extension in /usr/local/share/SuperCollider/SCClassLibrary/JITLib/GUI/extSoftSet.sc

-sortedKeysValuesDo (function, sortFunc)

-storeItemsOn (stream, itemsPerLine: 5)

-transformEvent (event)

Overview

The Difference between Dictionary, IdentityDictionary, Environment, and Event

Often, the subclass Event is used as an IdentityDictionary, because there is a syntactical shortcut:

a = (foo: 7);    // return a new Event.
a.put(\foo, 2.718);
a.at(\foo);
a[\foo] = 3.5;    // different syntax for put

Event, Environment and IdentityDictionary differ mainly insofar from Dictionary as the keys are taken to be identical (===) objects (see IdentityDictionary), instead of equal (==) objects. By consequence, the subclasses are also faster for indexing. Apart from this, the subclasses add specific functionality only. Because of its very common usage, the examples often use the shortcut for the subclass Event.

// preliminary identity and equality of strings and symbols
"hello" == "hello";    // true, but
"hello" === "hello";    // false. However:
\hello === \hello;    // true

// compare
Dictionary["hello" -> 0, "hello" -> 1]; // Dictionary[ (hello -> 1) ]
("hello": 0, "hello": 1); // ( "hello": 1, "hello": 0 )

// for symbols as keys, the behaviour is identical:
Dictionary[\hello -> 1, \hello -> 0];
( \hello: 1, \hello: 0 );