- chuck-users - lists.cs.princeton.edu

Remove duplicates from array
by David Powers 21 Apr '06

21 Apr '06

Hello everyone, I tried to send this earlier today, and it didn't seem to come through, but in the meantime I did more work on the problem. I am writing some functions that will be made into a class, for doing basic serial operations on cells (i.e. arrays of floats). The operations I have so far are: transpose, reverse, invert, permute, shuffle. The next function to finish is multiply, which does Boulez-style cell multiplication. For the function to work correctly, it should remove any duplicates from the array. Unfortunately, my brain's a little rusty right now. I'm sure I did this in the only computer class I ever took (C++). But I'm too sleepy to figure out the correct solution offhand, I think the ways I'm coming up with are inefficient. Can anyone help? My attempt at this is in the function remDup below, but I made some mistake, I'm sure relating to using a while loop--I'm not sure what the problem is though, or a better way to do it. I've gotten really spoiled, by usually coding these sorts of things in Python, where its amazingly quick to do list manipulations of any kind. //cellFun.ck public class Argh { fun static void print(float cell[]) { for (0 => int i; i<cell.cap(); i++) { <<< cell[i] >>> ; } } fun static void remove (float a[], int index) { a.cap()-1 => int newLength; float temp[newLength]; for (0 => int i; i < newLength; i++) { if (i<index) { a[i] => temp[i]; } else { a[i+1] => temp[i]; } } float a[newLength]; for (0 => int i; i < newLength; i++ ) { temp[i] => a[i]; } } //match fun static int match(float cell[], float element) { cell.cap() => int length; -1 => int position; for (0 => int i; i<length; i++) { if (cell[i] == element) { i => position; break; } } return position; } fun static float[] copy(float cell[]) { cell.cap() => int length; float newCell[length]; for (0 => int i; i<length; i++) { cell[i] => newCell[i]; } return (newCell); } //sort fun static float[] sort(float cell[]) { cell.cap() => int length; float temp; for (0 => int x ; x < length-1; x++) { for (0 => int y; y < length-x-1; y++) { if (cell[y] > cell[y+1]) { cell[y] => temp; cell[y+1] => cell[y]; temp => cell[y+1]; } } } return cell; } fun static float[] remDup(float cell[]) { 1 => int i; cell.cap() => int length; while (i < length-1) { if (cell[i]==cell[i+1]) { remove(cell,i+1); } else { i++; } } return cell; } }

1 0

Function to remove duplicates from an array
by David Powers 21 Apr '06

21 Apr '06

Hello everyone, I am writing some functions that will be made into a class, for doing basic serial operations on cells (i.e. arrays of floats). The operations I have so far are: transpose, reverse, invert, permute, shuffle. The next function to finish is multiply, which does Boulez-style cell multiplication. For the function to work correctly, it should remove any duplicates from the array. Unfortunately, my brain's a little rusty right now. I'm sure I did this in the only computer class I ever took (C++). But I'm too sleepy to figure out the correct solution offhand, I think the ways I'm coming up with are inefficient. Can anyone help? I've gotten really spoiled, by usually coding these sorts of things in Python, where its amazingly quick to do list manipulations of any kind. Here's my code so far, which works except multiply is a dummy function: //cellFun.ck public class Argh { fun static void print(float cell[]) { for (0 => int i; i<cell.cap(); i++) { <<< cell[i] >>> ; } } fun static void remove (float a[], int index) { a.cap()-1 => int newLength; float temp[newLength]; for (0 => int i; i < newLength; i++) { if (i<index) { a[i] => temp[i]; } else { a[i+1] => temp[i]; } } float a[newLength]; for (0 => int i; i < newLength; i++ ) { temp[i] => a[i]; } } //match fun static int match(float cell[], float element) { cell.cap() => int length; -1 => int position; for (0 => int i; i<length; i++) { if (cell[i] == element) { i => position; break; } } return position; } } fun float[] copyCell(float cell[]) { cell.cap() => int length; float newCell[length]; for (0 => int i; i<length; i++) { cell[i] => newCell[i]; } return (newCell); } //transpose fun float[] tranCell(float cell[], float amount) { cell.cap() => int length; float newCell[length]; for (0 => int i; i<length; i++) { cell[i] + amount => newCell[i]; } return(newCell); } //reverse fun float[] revCell(float cell[]) { cell.cap() => int length; float newCell[length]; length - 1 => int counter; for (0 => int i; i<length; i++) { cell[i]=> newCell[counter]; counter--; } return(newCell); } //invert() fun float[] invCell(float cell[]) { cell.cap() => int length; float newCell[length]; cell[0] => newCell[0]; for (1 => int i; i<length; i++) { (2 * cell[0]) - (cell[i]) => newCell[i]; } return(newCell); } //shufCell(): fun float[] shufCell(float cell[]) { cell.cap() => int length; copyCell(cell) @=> float newCell[]; //--- Shuffle elements by randomly exchanging each with one other. for (0 => int i; i<length; i++) { std.rand2(0,length-1) => int r; // generate a random position newCell[i] => float temp; newCell[r] => newCell[i]; temp => newCell[r]; } return(newCell); } //permCell(float cell[], int amount): fun float[] permCell (float cell[], int amount) { cell.cap() => int length; float newCell[length]; for (0=>int i; i<length; i++) { cell[(amount+i)%length] => newCell[i]; } return(newCell); } //multiply(float cell[], float multCell[]) //unfinished //look for a match //store the position in a new array fun float[] multCell (float cell[], float mult[]) { <<<"unfinished">>>; return [0.0]; } //tests!!! fun void testShiz() { [0.0,2.0,4.0,6.0,8.0,2.0,10.0] @=> float testCell[]; copyCell(testCell) @=> float theCopy[]; [0.0,1.0,2.0] @=> float multi[]; <<<"print cell">>>; Argh.print(testCell); <<<"match (return position of first occurrance of 2.0 in cell)">>>; <<<Argh.match(testCell,2.0)>>>; <<<"transpose cell by 2.0 (returns a copy)">>>; Argh.print(tranCell(testCell, 2.0)); <<<"reverse cell (returns a copy)">>>; Argh.print(revCell(testCell)); <<<"invert cell (returns a copy)">>>; Argh.print(invCell(testCell)); <<<"shuffle cell (returns a copy)">>>; Argh.print(shufCell(testCell)); <<<"permCell(permute by 2, returns a copy)">>>; Argh.print(permCell(testCell, 2)); <<<"multCell (multiply by [0.0,1.0,2.0], returns a copy">>>; Argh.print(multCell(testCell,multi)); <<<"print the original">>>; Argh.print(testCell); <<<"permute the original by 2 and print">>>; permCell(testCell, 2) @=> testCell; Argh.print(testCell); <<<"print the copy">>>; Argh.print(theCopy); } testShiz();

1 0

Windows XP - setting chuck.exe to "realtime" priority
by David Powers 21 Apr '06

21 Apr '06

Hello, I'm new to ChucK, but I'm really excited about the possibilities. However, to get it to run well on my new Dell laptop running WinCrap XP, I had to go CTL-ALT-DEL, open up processes, and set the priority of chuck.exeto "realtime". Otherwise, when I create and delete shreds, I was getting unwanted glitching. Is there some way to automate this process, so that chuck always has realtime priority? A command line flag would be really helpful I guess. Also, is it normal for me to need to do this? Strangely, despite maxing out the CPU, on an old PIII desktop with only 256 MB RAM (as opposed to 1 gig on the laptop) I had no problems like this and creating and deleting shreds occurred very smoothly. That was with a clean install of WinCrap, however. So it may be the case that on the new Dell, the out-of-the-box install has processes running that are interfering with the audio. I know this might veer into off topic territory due to OS issues, so if anyone has insights specific to XP or Dells, feel free to email me privately. Thanks, David

8 15

durations and control structures
by Timothy Sutton 19 Apr '06

19 Apr '06

Hi there list, I'm new to this chuck business and am trying to get a handle on a number of things - timing and durations are one of them. If I have a chunk of code that I'd like to run for a specific duration of time, how could I go about defining this in the control structure? something like while (duration condition here) { do this } I understand that I could use some kind of counter that (de/) increments each iteration and use this to control the loop with a < or > operation, but one thing I might like to do in performance is vary the (poll rate) => now, and it would be nice for my control structure timing to remain intact with such operations. I'm sure there's a simple answer, but it avoids me. Thanks, --Tim

2 3

string manipulation ... yes
by Scot Gresham-Lancaster 18 Apr '06

18 Apr '06

On Apr 18, 2006, at 9:00 AM, chuck-users- request(a)lists.cs.princeton.edu wrote: > Some regex-based features are being prototyped... we may see some > surface with or after string manipulations (coming up next). Fantastic, that will make for more sophisticated formatting of OSC messages possible. Looking forward to it. ¸,ø¤º°`°º¤ø¸,ø¤º°`°º¤ø Scot Gresham-Lancaster department of the redundancy department http://o-art.org/Scot podcast: http://feeds.feedburner.com/blogspot/scotgl blog: http://scotgl.blogspot.com/ myspace: http://myspace.com/scotgl A foolish consistency is the hobgoblin of little minds. ... Emerson

1 0

Opening Files, Reading Command Output, and Regular Expressions...
by DANIEL MAGNUSZEWSKI 17 Apr '06

17 Apr '06

(Inspired by my previous post) Is there currently, or any plans to implement, a way to open files (regular text/ascii files), running a command _and_ capture it's output (it seems that currently, the "system" function only returns an int - which I'm assuming is a return status), or use regular expressions within ChucK. Thanks! -Dan P.S - ChucK is awesome!

2 1

(OT) Toplap.org?
by Kassen 14 Apr '06

14 Apr '06

Dear list, Sorry to be a bit off topic but out of curiosity I tried subscribing to the Toplap "live-coding" list a while ago and this seems to be failing. Another thing that seems to be failing is "webmaster(a)toplap.org" to whom I tried to report this issue. My bet is that at least some people involved there will also be here so; Could somebody kindly give me a gentle push in the right direction? Sorry to bother you with this. Kas.

2 1

happy ChucK easter!
by Graham Coleman 14 Apr '06

14 Apr '06

http://flickr.com/photos/73155597@N00/120589645/ best, Graham

1 0

dorkbot-chicago tomorrow
by Ge Wang 12 Apr '06

12 Apr '06

Hi all! ChucK/Audicle @ dorkbot-chicago --- when: April 11, 8pm where: deadtech artspace why: [fill in blank] http://dorkbot.deadtech.net/ --- Best, Ge!

3 9

Re: [chuck-users] chuck - python
by DANIEL MAGNUSZEWSKI 12 Apr '06

12 Apr '06

I believe the command that you are looking for is: %> chuck ^ This prints the internal shred start at the listener VM, something like: [chuck](VM): status (now == 0h:2m:34s) ... [shred id]: 1 [source]: foo.ck [sporked]: 21.43s ago [shred id]: 2 [source]: bar.ck [sporked]: 28.37s ago (From: http://chuck.cs.princeton.edu/doc/program/otfp.html) I am doing something similar in Perl, so perhaps I can help you out. You can have your python script run this command on the shell (what OS are you running?) and grab the results (shred id, filename, etc) within that script. In Perl, it is done with the following code: @cmd_output = `chuck ^`; Then you can parse out the id number and run the following commands from the script to: Remove a shred ID: %> chuck - $shred_id _or_ Add: %> chuck + $shred_id _or_ Replace: %> chuck = $shred_id In Perl, assuming the above status output, the whole thing would look something like: # Get output from the chuck status command @cmd_output = `chuck ^`; # Parse IDs into shred_ids array @shred_ids = grep { /shred id\]:\s(\d+)\s/; $_ = $1 } @cmd_output; # Remove shred ID 1 (which is in the first array element) from the VM `chuck - $shred_ids[0]`; I hope this helps! -Dan >>> x(a)branwelt.de 04/07/06 6:24 AM >>> Hello I want to write a python program, that adds and removes (sporks) chuck-shreds to/from the chuck VM How to retrieve the shred-id ? What would be the best way to do so? Thanks, Emanuel _______________________________________________ chuck-users mailing list chuck-users(a)lists.cs.princeton.edu https://lists.cs.princeton.edu/mailman/listinfo/chuck-users

1 0