SequenceableCollection : Collection : Object

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:

Fill a SequenceableCollection with an arithmetic series.Array.series(5, 10, 2);

Fill a SequenceableCollection with a geometric series.Array.geom(5, 1, 3);

Fill a SequenceableCollection with a fibonacci series.Array.fib(5); Array.fib(5, 2, 32); // start from 32 with step 2.

Arguments:

Fill a SequenceableCollection with random values in the range minVal to maxVal.Array.rand(8, 1, 100);

Fill a SequenceableCollection with random values in the range -val to +val.Array.rand2(8, 100);

Fill a SequenceableCollection with random values in the range minVal to maxVal with a linear distribution.Array.linrand(8, 1, 100);

Fill a SequenceableCollection with random values in the range minVal to maxVal with exponential distribution.Array.exprand(8, 1, 100);

Fill a SequenceableCollection with the interpolated values between the start and end values.Array.interpolation(5, 3.2, 20.5);

synonym for ArrayedCollection: -clipAt.[3, 4, 5]|@|6;

synonym for ArrayedCollection: -wrapAt.[3, 4, 5]@@6; [3, 4, 5]@@ -1; [3, 4, 5]@@[6, 8]

synonym for ArrayedCollection: -foldAt.[3, 4, 5]@|@[6, 8];

Return the first element of the collection.[3, 4, 5].first;

Return the last element of the collection.[3, 4, 5].last;

Place item at the first / last index in the collection. Note that if the collection is empty (and therefore has no indexed slots) the item will not be added.[3, 4, 5].putFirst(100); [3, 4, 5].putLast(100);

Return the index of an item in the collection, or nil if not found. Elements are checked for identity (not for equality).[3, 4, 100, 5].indexOf(100); [3, 4, \foo, \bar].indexOf(\foo);

Return the index of something in the collection that equals the item, or nil if not found.[3, 4, "foo", "bar"].indexOfEqual("foo");

Return an array of indices of things in the collection that equal the item, or nil if not found.y = [7, 8, 7, 6, 5, 6, 7, 6, 7, 8, 9]; y.indicesOfEqual(7); y.indicesOfEqual(5);

Return the first index containing an item which is greater than item.y = List[ 10, 5, 77, 55, 12, 123]; y.indexOfGreaterThan(70);

Return a new collection of same type as receiver which consists of all indices of those elements of the receiver for which function answers true. The function is passed two arguments, the item and an integer index.#[a, b, c, g, h, h, j, h].selectIndices({|item, i| item === \h})

If you want to control what type of collection is returned, use -selectIndicesAs

Return a new collection of type class which consists of all indices of those elements of the receiver for which function answers true. The function is passed two arguments, the item and an integer index.#[a, b, c, g, h, h, j, h].selectIndicesAs({|item, i| item === \h}, Set)

Return a new collection of same type as receiver which consists of all indices of those elements of the receiver for which function answers false. The function is passed two arguments, the item and an integer index.#[a, b, c, g, h, h, j, h].rejectIndices({|item, i| item === \h})

If you want to control what type of collection is returned, use -rejectIndicesAs

Return a new collection of type class which consists of all indices of those elements of the receiver for which function answers false. The function is passed two arguments, the item and an integer index.#[a, b, c, g, h, h, j, h].rejectIndicesAs({|item, i| item === \h}, Set)

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;

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;

If the sublist exists in the receiver (in the specified order), at an offset greater than or equal to the initial offset, then return the starting index. The sublist must be of the same kind (class) as the list to search in. Elements are checked for equality (not for identity).y = [7, 8, 7, 6, 5, 6, 7, 6, 7, 8, 9]; y.find([7, 6, 5]);

Similar to -find but returns an array of all the indices at which the sequence is found.y = [7, 8, 7, 6, 5, 6, 7, 6, 7, 8, 9]; y.findAll([7, 6]);

Returns the closest index of the value in the collection (collection must be sorted).[2, 3, 5, 6].indexIn(5.2);

Returns a linearly interpolated float index for the value (collection must be sorted). Inverse operation is -blendAt.x = [2, 3, 5, 6].indexInBetween(5.2); [2, 3, 5, 6].blendAt(x);

Returns a linearly interpolated value between the two closest indices. Inverse operation is -indexInBetween.x = [2, 5, 6].blendAt(0.4);

Return a new SequenceableCollection which is a copy of the indexed slots of the receiver from start to end. If end < start, an empty collection is returned.( var y, z; z = [1, 2, 3, 4, 5]; y = z.copyRange(1, 3); z.postln; y.postln; )

Return a new SequenceableCollection which is a copy of the indexed slots of the receiver from start to the end of the collection. x.copyToEnd(a) can also be written as x[a..]

Return a new SequenceableCollection which is a copy of the indexed slots of the receiver from the start of the collection to end. x.copyFromStart(a) can also be written as x[..a]

Remove item from collection. Elements are checked for identity (not for equality).

Remove and return item from collection. The last item in the collection will move to occupy the vacated slot (and the collection size decreases by one). See also takeAt, defined for ArrayedCollection: -takeAt. Elements are checked for identity (not for equality).

a = [11, 12, 13, 14, 15]; a.take(12); a;

Retrieve an element from a given index (like SequenceableCollection: -at). This method is also implemented in Object, so that you can use it in situations where you don't want to know if the receiver is a collection or not. See also: SequenceableCollection: -instill

Arguments:

Put an element at a given index (like SequenceableCollection: -put). This method is also implemented in Object, so that you can use it in situations where you don't want to know if the receiver is a collection or not. It will always return a new collection. See also: SequenceableCollection: -obtain

Arguments:

Keep the first n items of the array. If n is negative, keep the last -n items.a = [1, 2, 3, 4, 5]; a.keep(3); a.keep(-3);

Drop the first n items of the array. If n is negative, drop the last -n items.a = [1, 2, 3, 4, 5]; a.drop(3); a.drop(-3);

Returns a String formed by connecting all the elements of the receiver, with joiner inbetween. See also String: -split as the complementary operation.["m", "ss", "ss", "pp", ""].join("i").postcs; "mississippi".split("i").postcs;

Returns a collection from which all nesting has been flattened.[[1, 2, 3], [[4, 5], [[6]]]].flat; // [ 1, 2, 3, 4, 5, 6 ] [1, 2, [3, 4, [5, 6, [7, 8, [9, 0]]]]].flat; // [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 0 ]

Returns a collection from which numLevels of nesting has been flattened.

Arguments:

A symmetric version of -flatten. For a negative numLevels, it flattens starting from the innermost arrays.

Arguments:

Flatten all subarrays deeper than level.

Arguments:

Invert rows and columns in a two dimensional Collection (turn inside out). See also: Function.[[1, 2, 3], [4, 5, 6]].flop; [[1, 2, 3], [4, 5, 6], [7, 8]].flop; // shorter array wraps [].flop; // result is always 2-d.

Note that the innermost arrays are not copied:a = [1, 2]; x = [[[a, 5], [a, 10]], [[a, 50, 60]]].flop; a[0] = pi; x // pi is everywhere

Flop with a user defined function. Can be used to collect over several collections in parallel.[[1, 2, 3], [4, 5, 6]].flopWith(_+_); [[1, 2, 3], 1, [7, 8]].flopWith{ |a,b,c| a+b+c }; // shorter array wraps // typical use case (pseudocode) [synths, buffers].flopWith{ |a,b| a.set(\buf, b) }

Arguments:

Invert rows and columns in a an array of dimensional Collections (turn inside out), so that they all match up in size, but remain separated.( a = flopTogether( [[1, 2, 3], [4, 5, 6, 7, 8]] * 100, [[1, 2, 3], [4, 5, 6], [7, 8]], [1000] ) ); a.collect(_.size); // sizes are the same a.collect(_.shape) // shapes can be different

Fold dimensions in a multi-dimensional Collection (turn inside out).

Arguments:

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

Arguments:

Returns the maximum depth of all subarrays.

Arguments:

Returns true if the collection is an arithmetic series.

Arguments:

Returns a new Collection of the desired length, with values resampled evenly-spaced from the receiver without interpolation.[1, 2, 3, 4].resamp0(12); [1, 2, 3, 4].resamp0(2);

Returns a new Collection of the desired length, with values resampled evenly-spaced from the receiver with linear interpolation.[1, 2, 3, 4].resamp1(12); [1, 2, 3, 4].resamp1(3);

Choose an element from the collection at random.[1, 2, 3, 4].choose;

Choose an element from the collection at random using a list of probabilities or weights. The weights must sum to 1.0.[1, 2, 3, 4].wchoose([0.1, 0.2, 0.3, 0.4]);

Sort the contents of the collection using the comparison function argument. The function should take two elements as arguments and return true if the first argument should be sorted before the second argument. If the function is nil, the following default function is used. { arg a, b; a < b }[6, 2, 1, 7, 5].sort; [6, 2, 1, 7, 5].sort({ arg a, b; a > b }); // reverse sort

Sort the contents of the collection using the key key, which is assumed to be found inside each element of the receiver.( a = [ Dictionary[\a->5, \b->1, \c->62], Dictionary[\a->2, \b->9, \c->65], Dictionary[\a->8, \b->5, \c->68], Dictionary[\a->1, \b->3, \c->61], Dictionary[\a->6, \b->7, \c->63] ] ) a.sortBy(\b); a.sortBy(\c);

Return an array of indices that would sort the collection into order. function is treated the same way as for the -sort method.[6, 2, 1, 7, 5].order;

Swap two elements in the collection at indices i and j.

Calls function for each subsequent pair of elements in the SequentialCollection. The function is passed the two elements and an index.[1, 2, 3, 4, 5].pairsDo({ arg a, b; [a, b].postln; });

Calls function for every adjacent pair of elements in the SequenceableCollection. The function is passed the two adjacent elements and an index.[1, 2, 3, 4, 5].doAdjacentPairs({ arg a, b; [a, b].postln; });

Separates the collection into sub-collections by calling the function for each adjacent pair of elements. If the function returns true, then a separation is made between the elements.[1, 2, 3, 5, 6, 8, 10].separate({ arg a, b; (b - a) > 1 }).postcs;

Separates the collection into sub-collections by separating every groupSize elements.[1, 2, 3, 4, 5, 6, 7, 8].clump(3).postcs;

Separates the collection into sub-collections by separating elements into groupings whose size is given by integers in the groupSizeList.[1, 2, 3, 4, 5, 6, 7, 8].clumps([1, 2]).postcs;

Separates the collection into sub-collections by randomly separating elements according to the given probability.[1, 2, 3, 4, 5, 6, 7, 8].curdle(0.3).postcs;

Returns a collection with the incremental sums of all elements.[3, 4, 1, 1].integrate;

Returns a collection with the pairwise difference between all elements.[3, 4, 1, 1].differentiate;

Applies the method named by operator to the first and second elements of the collection, and then applies the method to the result and to the third element of the collection, then applies the method to the result and to the fourth element of the collection, and so on, until the end of the array.

If the collection contains only one element, it is returned as the result. If the collection is empty, returns nil.

Arguments:

Returns an integer resulting from interpreting the elements as digits to a given base (default 10). See also asDigits in Integer: asDigits for the complementary method.[1, 0, 0, 0].convertDigits; [1, 0, 0, 0].convertDigits(2); [1, 0, 0, 0].convertDigits(3);

Returns the count of array elements that are not equal in identical positions. http://en.wikipedia.org/wiki/Hamming_distance

The collections are not wrapped - if one array is shorter than the other, the difference in size should be included in the count.[0, 0, 0, 1, 1, 1, 0, 1, 0, 0].hammingDistance([0, 0, 1, 1, 0, 0, 0, 0, 1, 1]); "SuperMan".hammingDistance("SuperCollider");

Returns the mininum number of changes to modify this SequenceableCollection into the other SequenceableCollection. A change can be: an addition, a deletion, or a substitution. This is known as the Levenshtein Distance and is implemented in SuperCollider using the Wagner–Fischer algorithm.

The default comparison uses identity - see Object: -== and Object: -===

Where both arrays are raw arrays (String, Int16Array, Int32Array, FloatArray etc., or any derived classes), like comparing two strings, a faster primitive will be used to calculate the distance."hello".editDistance("hallo"); // 1 (substitution) "hello".editDistance("hell"); // 1 (deletion) "hello".editDistance("helloo"); // 1 (addition) "hello".editDistance("hllo"); // 1 (removal) "hello".editDistance("haldo"); // 2 (substitutions)

In cases where the arrays are of different types, it will fall back to a slower, non-primitive implementation.// String vs Array "hello".editDistance([$h, $e, $l, $l, $o]);

For cases that require comparisons other than identity, the optional compareFunc can be given to compare elements. This function will be passed two arguments, representing a single element from each array to compare, and this function must return a boolean as to whether or not the elements are equal.// Using compareFunc for case insensitive comparisons "HeLLO".editDistance("HELLO", { |a, b| a.toLower == b.toLower; });

Arguments:

Returns a value between 0 and 1 representing the percentage similarity between this SequenceableCollection and the other SequenceableCollection.

A value of 1 means they are exactly the same, a value of 0 means they are completely different. This is calculated based on the -editDistance"hello".similarity("hello"); // 1 "hello".similarity("asdf"); // 0 "word".similarity("wodr"); // 0.5

Arguments:

Creates a new collection of the results of applying the selector to all elements in the receiver.[1, 2, 3, 4].neg; [1, 2, 3, 4].reciprocal;

Creates a new collection of the results of applying the selector with the operand to all elements in the receiver. If the operand is a collection then elements of that collection are paired with elements of the receiver.([1, 2, 3, 4] * 10); ([1, 2, 3, 4] * [4, 5, 6, 7]);

Returns the (2*n)th Bernoulli number.

Because all odd numbered Bernoulli numbers are zero (apart from B(1) which is -1/2) the interface will only return the even numbered Bernoulli numbers.

Returns a single tangent number at i. Also called a zag function.

Returns the "true gamma" of value z.

Returns gamma(dz + 1) - 1.

Returns the natural logarithm of the gamma function.

Returns the digamma or psi function of z.

Digamma is defined as the logarithmic derivative of the gamma function.

Returns the trigamma function of z.

Trigamma is defined as the derivative of the digamma function.

Returns the polygamma function of z.

Polygamma is defined as the n'th derivative of the digamma function.

Returns the ratio of gamma functions tgamma(a) / tgamma(b).

Returns the ratio of gamma functions tgamma(a) / tgamma(a+delta).

Returns the normalised lower incomplete gamma function.

Requires a > 0 and z >= 0.

Returns the normalised upper incomplete gamma function.

Requires a > 0 and z >= 0.

Returns the full (non-normalised) lower incomplete gamma function.

Requires a > 0 and z >= 0.

Returns the full (non-normalised) upper incomplete gamma function.

Requires a > 0 and z >= 0.

Returns a value such that p = gamma_p(a, x).

Requires a > 0 and 1 >= p,q >= 0.

Returns a value x such that q = gamma_q(a, x).

Requires a > 0 and 1 >= p,q >= 0.

Returns a value such that p = gamma_p(a, x).

Requires x > 0 and 1 >= p,q >= 0.

Returns a value x such that q = gamma_q(a, x).

Requires x > 0 and 1 >= p,q >= 0.

Implements the partial derivative with respect to x of the incomplete gamma function (lower).

Implements the partial derivative with respect to x of the incomplete gamma function (upper).

Returns i!.

Returns i!!.

For even i, i !! = i(i-2)(i-4)(i-6) ... (4)(2).

For odd i, i !! = i(i-2)(i-4)(i-6) ... (3)(1).

Returns the rising factorial of x and i:

x(x+1)(x+2)(x+3)...(x+i-1)

Both x and i can be negative as well as positive.

Returns the falling factorial of x and i:

x(x-1)(x-2)(x-3)...(x-i+1)

This function is only defined for positive i. Argument x can be either positive or negative.

Requires k <= n.

The beta function is defined by: tgamma(a)*tgamma(b) / tgamma(a+b).

Returns the normalised incomplete beta function of a, b and x.

Require 0 <= x <= 1, a,b >= 0, and in addition that not both a and b are zero.

Returns the normalised complement of the incomplete beta function of a, b and x.

Require 0 <= x <= 1, a,b >= 0, and in addition that not both a and b are zero.

Returns the full (non-normalised) incomplete beta function of a, b and x.

Require 0 <= x <= 1, and a,b > 0.

Returns the full (non-normalised) complement of the incomplete beta function of a, b and x.

Require 0 <= x <= 1, and a,b > 0.

Returns a value x such that: p = ibeta(a, b, x).

Requires a,b > 0 and 0 <= p <= 1.

Returns a value x such that: q = ibetaC(a, b, x).

Requires a,b > 0 and 0 <= q <= 1.

Returns a value a such that: p = ibeta(a, b, x).

Requires b > 0, 0 < x < 1, and 0 <= p <= 1.

Returns a value a such that: q = ibetaC(a, b, x).

Requires b > 0, 0 < x < 1, and 0 <= q <= 1.

Returns a value b such that: p = ibeta(a, b, x).

Requires a > 0, 0 < x < 1, and 0 <= p <= 1.

Returns a value b such that: q = ibetaC(a, b, x).

Requires a > 0, 0 < x < 1, and 0 <= q <= 1.

Returns the partial derivative with respect to x of the incomplete beta function ibeta(a,b,x).

Returns the error function of z.

Returns the complement of the error function of z.

Returns the inverse error function of z, that is a value x such that:

p = erf(x).

Returns the inverse of the complement of the error function of z, that is a value x such that:

p = erfC(x)

Returns the Legendre Polynomial of the first kind.

Requires -1 <= x <= 1.

Returns the derivatives of the Legendre polynomials.

Since the Legendre polynomials are alternatively even and odd, only the non-negative zeros are returned. For the odd Legendre polynomials, the first zero is always zero. The rest of the zeros are returned in increasing order.

Returns the associated Legendre polynomial of the first kind.

Requires -1 <= x <= 1.

Returns the value of the Legendre polynomial that is the second solution to the Legendre differential equation.

Requires -1 <= x <= 1.

Returns the value of the Laguerre Polynomial of order n at point x.

Returns the Associated Laguerre polynomial of degree of dgree n and order m at point x.

Returns the value of the Hermite Polynomial of order n at point x.

Returns the Chebyshev polynomials of the first kind.

Returns the Chebyshev polynomials of the second kind.

Returns the derivatives of the Chebyshev polynomials of the first kind.

Returns the roots (zeros) of the n-th Chebyshev polynomial of the first kind.

Returns the (Complex) value of the Spherical Harmonic.

theta is taken as the polar (colatitudinal) coordinate within [0, pi], and phi as the azimuthal (longitudinal) coordinate within [0,2pi].

See boost documentation for further information, including a note about the Condon-Shortley phase term of (-1)^m.

Returns the real part of the Spherical Harmonic.

Returns the imaginary part of the Spherical Harmonic.

Returns the result of the Bessel functions of the first kind.

The functions return the result of domain_error whenever the result is undefined or complex. This occurs when x < 0 and v is not an integer, or when x == 0 and v != 0.

Returns the result of the Bessel functions of the second kind.

The functions return the result of domain_error whenever the result is undefined or complex. This occurs when x <= 0.

Returns a single zero or root of the Bessel function of the first kind.

index is a 1-based index of zero of the cylindrical Bessel function of order v.

Returns a single zero or root of the Neumann function (Bessel function of the second kind).

index is a 1-based index of zero of the cylindrical Neumann function of order v.

Returns the result of the modified Bessel functions of the first kind.

Returns the result of the modified Bessel functions of the second kind.

Requires x > 0.

Returns the result of the spherical Bessel functions of the first kind.

Requires x > 0.

Returns the result of the spherical Bessel functions of the first kind.

Requires x > 0.

Returns the first derivative with respect to x of the corresponding Bessel function.

Returns the first derivative with respect to x of the corresponding Neumann function.

Requires x > 0.

Returns the first derivative with respect to x of the corresponding Bessel function.

Returns the first derivative with respect to x of the corresponding Bessel function.

Requires x > 0.

Returns the first derivative with respect to x of the corresponding Bessel function.

Requires x > 0.

Returns the first derivative with respect to x of the corresponding Neumann function.

Requires x > 0.

Returns the result of the Hankel functions of the first kind.

Returns the result of the Hankel functions of the second kind.

Returns the result of the spherical Hankel functions of the first kind.

Returns the result of the spherical Hankel functions of the second kind.

Returns the result of the Airy function Ai at x.

Returns the result of the Airy function Bi at x.

Returns the derivative of the Airy function Ai at x.

Returns the derivative of the Airy function Bi at x.

Returns the mth zero or root of the Airy Ai function. The Airy Ai function has an infinite number of zeros on the negative real axis.

m is 1-based.

Returns the mth zero or root (1-based) of the Airy Bi function. The Airy Bi function has an infinite number of zeros on the negative real axis.

m is 1-based.

Returns Carlson's Elliptic Integral RF.

Requires that x,y >= 0, with at most one of them zero, and that z >= 0.

Returns Carlson's Elliptic Integral RD.

Requires that x,y >= 0, with at most one of them zero, and that z >= 0.

Returns Carlson's Elliptic Integral RJ.

Requires that x,y,z >= 0, with at most one of them zero, and that p != 0.

Returns Carlson's Elliptic Integral RC.

Requires that x >= 0, with at most one of them zero, and that y != 0.

Returns Carlson's Elliptic Integral RG.

Requires that x,y >= 0.

Returns the incomplete elliptic integral of the first kind, Legendre form.

Requires -1 <= k <= 1.

Returns the complete elliptic integral of the first kind, Legendre form.

Requires -1 <= k <= 1.

Returns the incomplete elliptic integral of the second kind, Legendre form.

Requires -1 <= k <= 1.

Returns the complete elliptic integral of the second kind, Legendre form.

Requires -1 <= k <= 1.

Returns the incomplete elliptic integral of the third kind, Legendre form.

Requires -1 <= k <= 1 and n < 1/sin^2(phi).

Returns the complete elliptic integral of the third kind, Legendre form.

Requires -1 <= k <= 1 and n < 1.

Returns the incomplete elliptic integral D(phi, k), Legendre form.

Requires -1 <= k <= 1.

Returns the complete elliptic integral D(phi, k), Legendre form.

Requires -1 <= k <= 1.

Returns the result of the Jacobi Zeta Function.

Requires -1 <= k <= 1.

Returns the result of the Heuman Lambda Function.

Requires -1 <= k <= 1.

Returns the zeta function of z.

Requires z != 1.

Returns the exponential integral En of z.

Requires that when n == 1, z !=0.

Returns the exponential integral of z.

Requires z != 0.

Returns sin(x * π).

Returns cos(x * π).

Returns the natural logarithm of x+1.

Returns e^x - 1.

Returns the cube root of x.

Returns sqrt(1+x) - 1.

Returns x^y - 1.

Returns the Sinus Cardinal of x. Also known as the "sinc" function.

sincPi(x) = sin(x) / x

Returns the Hyperbolic Sinus Cardinal of x.

sinhcPi(x) = sinh(x) / x

Returns the reciprocal of the hyperbolic sine function at x.

Returns the reciprocal of the hyperbolic cosine function at x.

Requires x >= 1.

Returns the reciprocal of the hyperbolic sine function at x.

Requires -1 < x < 1.

Returns the Owens T function of h and a.

Calls this.multiChannelPerform(selector, *args) where selector is the name of the message.

This method is called internally on inputs to UGens that take multidimensional arrays, like Klank and it allows proper multichannel expansion even in those cases. For SequenceableCollection, this returns the collection itself, assuming that it contains already a number of Refs. See Ref for the corresponding method implementation.

Arguments:

Convert a rhythm-list to durations.

Discussion:

supports a variation of Mikael Laurson's rhythm list RTM-notation.¹

The method converts a collection of the form [beat-count, [rtm-list], repeats] to a List of Floats. A negative integer within the rtm-list equates to a value tied over to the duration following. The method is recursive in that any subdivision within the rtm-list can itself be a nested convertRhythm collection (see example below). The repeats integer has a default value of 1.

If the divisions in the rtm-list are events, the event durations are interpreted as relative durations, and a list of events is returned.// using numbers as score [3, [1, 2, 1], 1].convertRhythm; // List[ 0.75, 1.5, 0.75 ] [2, [1, 3, [1, [2, 1, 1, 1]], 1, 3], 1].convertRhythm; [2, [1, [1, [2, 1, 1, 1]]], 1].convertRhythm; [2, [1, [1, [2, 1, 1, 1]]], 2].convertRhythm; // repeat [2, [1, [1, [2, 1, 1, -1]]], 2].convertRhythm; // negative value is tied over. // sound example Pbind(\degree, Pseries(0, 1, inf), \dur, Pseq([2, [1, [1, [2, 1, 1, -1]]], 2].convertRhythm)).play;

Execute a UNIX command asynchronously. This object should be an array of strings where the first string is the path to the executable to be run and all other strings are passed as arguments to the executable. This method starts the process directly without using a shell.

Arguments:

Returns:

Discussion:

Example:["ls","/"].unixCmd;

Similar to -unixCmd except that the stdout of the process is returned (synchronously) rather than sent to the post window. This object should be an array of strings where the first string is the path to the executable to be run and all other strings are passed as arguments to the executable. This method starts the process directly without using a shell.~listing = ["ls","/"].unixCmdGetStdOut; // Grab ~listing.reverse.as(Array).dupEach.join.postln; // Mangle