Arrays are used represent N-dimensional ordered sets of data (of the same type). This sections specifies how arrays are declared and used in ChucK. Some quick notes:
Arrays can be declared in the following way:
// declare 10 element array of int, called foo int foo[10]; // since array of int (primitive type), the contents // are automatically initialized to 0
Arrays can also be initialized:
// chuck intializer to array reference [ 1, 1, 2, 3, 5, 8 ] @=> int foo[];
In the above code, there are several things to note.
When declaring an array of ob jects, the ob jects inside the array are automatically instantiated.
// objects in arrays are automatically instantiated Object group[10];
If you only want an array of object references:
// array of null object references Object @ group[10];
The above examples are 1-dimensional arrays (or vectors). Coming up next are multi-dimensional arrays!
Here's a declaration of a multi-dimensional array:
// declare 4 by 6 by 8 array of float float foo3D[4][6][8];
Initializing a multi-dimensional array works in a similar way:
// declare 2 by 2 array of int [ [1,3], [2,4] ] @=> int bar[][];
In the above code, note the two [ ][ ] since we make a matrix.
Elements in an array can be accessed using [ ] (in the appropriate quantities).
// declare an array of floats [ 3.2, 5.0, 7 ] @=> float foo[]; // access the 0th element (debug print) <<< foo[0] >>>; // hopefully 3.2 // set the 2nd element 8.5 => foo[2];
Looping over the elements of an array:
// array of floats again
[ 1, 2, 3, 4, 5, 6 ] @=> float foo[];
// loop over the entire array
for( 0 => int i; i < foo.cap(); i++ ) {
// do something (debug print)
<<< foo[i] >>>;
}
Accessing multi-dimensional array:
// 2D array int foo[4][4]; // set an element 10 => foo[2][2];
If the index exceeds the bounds of the array in any dimension, an exception is issued and the current shred is halted.
// array capacity is 5 int foo[5]; // this should cause ArrayOutOfBoundsException // access element 6 (index 5) <<< foo[5] >>>;
A longer program: otf_06.ck from the examples folder:
// the period
.5::second => dur T;
// synchronize to period (for on-the-fly synchronization)
T - (now % T) => now;
// our patch
SinOsc s => JCRev r => dac;
// initialize
.05 => s.gain;
.25 => r.mix;
// scale (pentatonic; in semitones)
[ 0, 2, 4, 7, 9 ] @=> int scale[];
// infinite time loop
while( true ) {
// pick something from the scale
scale[ Math.rand2(0,4) ] => float freq;
// get the final freq
Std.mtof( 69 + (Std.rand2(0,3)*12 + freq) ) => s.freq;
// reset phase for extra bandwidth
0 => s.phase;
// advance time
if( Std.randf() > -.5 ) .25::T => now;
else .5::T => now;
}
Any array can be used also as an associative array, indexed on strings. Once the regular array is instantiated, no further work has to be done to make it associative as well - just start using it as such.
// declare regular array (capacity doesn’t matter so much) float foo[4]; // use as integer-indexed array 2.5 => foo[0]; // use as associative array 4.0 => foo["yoyo"]; // access as associative (print) <<< foo["yoyo"] >>>; // access empty element <<< foo["gaga"] >>>; // -> should print 0.0
It is important to note (again), that the address space of the integer portion and the associative portion of the array are completely separate. For example:
// declare array int foo[2]; // put something in element 0 10 => foo[0]; // put something in element "0" 20 => foo["0"]; // this should print out 10 20 <<< foo[0], foo["0"] >>>;
The capacity of an array relates only to the integer portion of it. An array with an integer portion of capacity 0, for example, can still have any number of associative indexes.
// declare array of 0 capacity int foo[0]; // put something in element "here" 20 => foo["here"]; // this should print out 20 <<< foo["here"] >>> // this should cause an exception <<< foo[0] >>>
Note: The associative capacity of an array is not defined, so objects used in the associative names- pace must be explicitly instantiated, in contrast to those in the integer namespace.
Accessing an uninstantiated element of the associate array will return a null reference. Please check the class documentation page for an explanation of ChucK objects and references.
class Item {
float weight;
}
Item box[10];
// integer indices ( up to capacity ) are pre-instantiated.
1.2 => box[1].weight;
// instantiate element "lamp";
new Item @=> box["lamp"];
// access allowed to "lamp"
2.0 => box["lamp"].weight;
// access causes a NullPointerException
2.0 => box["sweater"].weight;
Arrays are ob jects. So when we declare an array, we are actually (1) declaring a reference to array (reference variable) and (2) instantiating a new array and reference assigned to the variable. A (null) reference is a reference variable that points to no object or null. A null reference to an array can be created in this fasion:
// declare array reference (by not specifying a capacity) int foo[]; // we can now assign any int[] to foo [ 1, 2, 3 ] @=> foo; // print out 0th element <<< foo[0] >>>;
This is also useful in declaring functions that have arrays as arguments or return type.
// our function
fun void print( int bar[] ) {
// print it
for( 0 => int i; i < bar.cap(); i++ )
<<< bar[0] >>>;
}
// we can call the function with a literal
print( [ 1, 2, 3, 4, 5 ] );
// or can we can pass a reference variable
int foo[10];
print( foo );
Like other objects, it is possible make multiple references to a single array. Like other ob jects, all assignments are reference assignments, meaning the contents are NOT copied, only a reference to array is duplicated.
// our single array int the_array[10]; // assign reference to foo and bar the_array => int foo[] => int bar[]; // (the_array, foo, and bar now all reference the same array) // we change the_array and print foo... // they reference the same array, changing one is like changing the other 5 => the_array[0]; <<< foo[0] >>>; // should be 5
It is possible to reference sub-sections of multi-dimensional arrays.
// a 3D array int foo3D[4][4][4]; // we can make a reference to a sub-section foo3D[2] => int bar[][]; // (note that the dimensions must add up!)
There has been error in communication with Booktype server. Not sure right now where is the problem.
You should refresh this page.