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

Re: [chuck-users] KBHit and arrow keys
by Jim Hinds 30 Apr '06

30 Apr '06

The behavior of KBHit is kind of standard for ketting data from some asynchronous source. Since the chuck program (or any user prog) runs at some unknown speed it is possible for several keys to be pressed before you get control. In that case the boolean (KBHit) returns true. Your input routine would then process all the characters in the input buffer. That's why kb.getchar returns (and removes) the first char in the input buffer. When kb.getchar returns zero, you know that you have processed all of the input. This allows KBHit to get re-enabled so that it will indicate when new stuff is available. This isn't unique to the keyboard, but is pretty much the way all interrupt driven I/O works. So, be happy: what you thought were warts in your program were really elegant solutions to a universal problem. Or something like that. Jim Hinds jahbini(a)jahbini.org http://www.celarien.com/ http://www.jahbini.info/ On Apr 27, 2006, at 6:00 AM, chuck-users- request(a)lists.cs.princeton.edu wrote: > Send chuck-users mailing list submissions to > chuck-users(a)lists.cs.princeton.edu > > To subscribe or unsubscribe via the World Wide Web, visit > https://lists.cs.princeton.edu/mailman/listinfo/chuck-users > or, via email, send a message with subject or body 'help' to > chuck-users-request(a)lists.cs.princeton.edu > > You can reach the person managing the list at > chuck-users-owner(a)lists.cs.princeton.edu > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of chuck-users digest..." > Today's Topics: > > 1. KBHit and arrow keys. (Kassen) > > From: Kassen <signal.automatique(a)gmail.com> > Date: April 26, 2006 10:22:12 AM HST > To: "ChucK Users Mailing List" <chuck-users(a)lists.cs.princeton.edu> > Subject: [chuck-users] KBHit and arrow keys. > Reply-To: ChucK Users Mailing List <chuck- > users(a)lists.cs.princeton.edu> > > > Hello all, > > The new keyboard input is great but getting the arrow and F1-F10 and > so on keys to work is kinda tricky, I found. I cooked up a sorta kinda > maybe solution to this that I thought might be useful to others as > well. See below. > > use the up and down keys to increase or decrease "bla", then print > bla's current value. This won't win any beauty contests but it does > work. I'm not at all sure why it needs two temporary variables but I > can't get it to work without them. If I don't use temporary variables > it seems that I can only use one test on kb.getchar() before it > disappears(??) and one test isn't enough for anything beyond the most > simple of triggers. The same method could be used to get function keys > to work. > > I hope this is of use to some. This works on my IBM- compatible laptop > running XP, no refunds if it turns out Mac's use some entirely > different way of reading the keyboard; I have no idea how those work. > If it's found useful I could add it to the Wiki? > > Yours, > Kas. > > > ---------------------------------------------------------------------- > -------- > // the keyboard input > KBHit kb; > > //some setting that's of great importance somewhere > int bla; > > > // time-loop > while( true ) > { > // wait on kbhit event > kb => now; > > // potentially more than 1 key at a time > while( kb.more() ) > { > //store number to avoid it getting lost after one check > kb.getchar() => int K; > > //arrow keys are encoded in two numbers with the first being 224 > if (K == 224 ) > > { > //wait for the second number > kb => now; > > //the same "anti number disapear" trick > kb.getchar() => int L; > > //do intuitively sensible stuff to "up"... > if(L == 72) 1 +=> bla; > > //........and "down"...... > if(L == 80) 1 -=> bla; > > //...and make the result go somewhere. > <<<"bla is", bla>>>; > } > else > { > //do something else to normal keys > <<<K>>>; > } > } > } > ------------------------------------------------- > > > > _______________________________________________ > chuck-users mailing list > chuck-users(a)lists.cs.princeton.edu > https://lists.cs.princeton.edu/mailman/listinfo/chuck-users

3 4

multiple class declaration
by eun.sung＠no-log.org 29 Apr '06

29 Apr '06

Hi list. I declare in a same .ck file two different classes, a standard and a public one. I try to instance an object of the standard class in the public one. This seems to be "unauthorized". Is it a normal behaviour? Is there another way to do that? Greetings.

1 0

KBHit and arrow keys.
by Kassen 26 Apr '06

26 Apr '06

Hello all, The new keyboard input is great but getting the arrow and F1-F10 and so on keys to work is kinda tricky, I found. I cooked up a sorta kinda maybe solution to this that I thought might be useful to others as well. See below. use the up and down keys to increase or decrease "bla", then print bla's current value. This won't win any beauty contests but it does work. I'm not at all sure why it needs two temporary variables but I can't get it to work without them. If I don't use temporary variables it seems that I can only use one test on kb.getchar() before it disappears(??) and one test isn't enough for anything beyond the most simple of triggers. The same method could be used to get function keys to work. I hope this is of use to some. This works on my IBM- compatible laptop running XP, no refunds if it turns out Mac's use some entirely different way of reading the keyboard; I have no idea how those work. If it's found useful I could add it to the Wiki? Yours, Kas. ------------------------------------------------------------------------------ // the keyboard input KBHit kb; //some setting that's of great importance somewhere int bla; // time-loop while( true ) { // wait on kbhit event kb => now; // potentially more than 1 key at a time while( kb.more() ) { //store number to avoid it getting lost after one check kb.getchar() => int K; //arrow keys are encoded in two numbers with the first being 224 if (K == 224 ) { //wait for the second number kb => now; //the same "anti number disapear" trick kb.getchar() => int L; //do intuitively sensible stuff to "up"... if(L == 72) 1 +=> bla; //........and "down"...... if(L == 80) 1 -=> bla; //...and make the result go somewhere. <<<"bla is", bla>>>; } else { //do something else to normal keys <<<K>>>; } } } -------------------------------------------------

1 0

Building ChucK for Ubuntu 5.10
by Sean M Gomez 25 Apr '06

25 Apr '06

I'm sure this is a real n00b question, but are there any known problems building ChucK for Ubuntu Linux? I've hit a compile error with rtaudio that I'm not seeing a way around. Any help is appreciated. sean -- Sean M. Gomez ITS - Desktop Support Specialist Wesleyan University

3 4

My solution: HyperArray class
by David Powers 22 Apr '06

22 Apr '06

Hello, my solution to the array problem was to create a new class, "HyperArray", which has functions for insert, remove, remove duplicates. It holds an array, currently of size 1024, but the methods make it appear as if it's an array of variable length. So, I'm going to have the Cell class inherit from HyperArray, and simply add methods that are specific to manipulating arrays of notes (or whatever) in serial fashion. If anyone wants to test this class out more, I'd appreciate it. There may be some things wrong, because when I used the get() method internally, in the shuffle function, it crashed check for reasons I don't really understand. Here's the code: //HyperArray public class HyperArray { //initialize 1024 => int max; 0 => int hyperLen; float hyperA[max]; //set fun void set(float a[]) { a.cap() => hyperLen; for (0 => int i; i<hyperLen; i++) { a[i] => hyperA[i]; } } //get fun float[] get() { float temp[hyperLen]; for (0 => int i; i<hyperLen; i++) { hyperA[i] => temp[i] ; } return temp; } //print fun void print() { for (0 => int i; i<hyperLen; i++) { <<< hyperA[i] >>> ; } } //remove fun void remove (int index) { hyperLen--; for (0 => int i; i < hyperLen; i++) { if (i==index || i>index) { hyperA[i+1] => hyperA[i]; } } } //insert fun void insert (int index, float item) { hyperLen++; get() @=> float temp[]; for (0 => int i; i < hyperLen; i++) { if (i==index) { item => hyperA[i]; } if (i>index) { temp[i-1] => hyperA[i]; } } } //sort fun float[] sort() { float temp; for (0 => int x ; x < hyperLen-1; x++) { for (0 => int y; y < hyperLen-x-1; y++) { if (hyperA[y] > hyperA[y+1]) { hyperA[y] => temp; hyperA[y+1] => hyperA[y]; temp => hyperA[y+1]; } } } return hyperA; } //remove duplicates fun float[] removeDup() { int purge[hyperLen]; 0 => int purgeIndex; for (0 => int i; i<hyperLen-1; i++) { for (i+1 => int j; j<hyperLen;j++) { if (hyperA[i]==hyperA[j]) { j => purge[purgeIndex]; purgeIndex++; } } } for (purgeIndex => int k; k>0; k--) { remove(purge[k-1]); } return hyperA; } //reverse fun float[] reverse() { float newA[hyperLen]; hyperLen - 1 => int counter; for (0 => int i; i<hyperLen; i++) { hyperA[i] => newA[counter]; counter--; } set(newA); return(hyperA); } //shuffle fun float[] shuffle(int times) { float newA[hyperLen]; for (0 => int i; i<hyperLen; i++) { hyperA[i] => newA[i] ; } //--- Shuffle elements by randomly exchanging each with one other. for (0 => int i; i<times; i++) { for (0 => int j; j<hyperLen; j++) { std.rand2(0,hyperLen-1) => int r; // generate a random position newA[j] => float temp; newA[r] => newA[j]; temp => newA[r]; } } set(newA); return(hyperA); } } fun void testShiz() { HyperArray booyah; <<<"Set and print array">>>; booyah.set([5.0,2.0,3.0,4.0,5.0,1.0,2.0,3.0]); booyah.print(); <<<"Remove item at index 3 and print HyperArray">>>; booyah.remove(3); booyah.print(); <<<"insert value 4.0 at index 3 and print HyperArray">>>; booyah.insert(3,4.0); booyah.print(); <<<"Remove duplicates and print HyperArray">>>; booyah.removeDup(); booyah.print(); <<<"Sort and print HyperArray">>>; booyah.sort(); booyah.print(); <<<"Reverse and print HyperArray">>>; booyah.reverse(); booyah.print(); <<<"Shuffle and print HyperArray">>>; booyah.shuffle(3); booyah.print(); <<<"Create new array using HyperArray get method, print new array">>>; booyah.get() @=> float theNewArray[]; for (0 => int i; i<theNewArray.cap();i++) { <<<theNewArray[i]>>>; } } testShiz();

1 0

midi clock
by Kassen 21 Apr '06

21 Apr '06

Hi, list. At the moment I'm merrily ChucKing allong building a little "groovebox". My idea here is that it's easier to put knobs on a laptop then it is to put a comand line on a groovebox. The plan is to have one shred backed by a few sporked functions that will allow me to manipulate data in arrays using a midi controler (toggeling steps for beats, so far). Eventually this will use events to trigger the sounds in other shreds so those sounds could be re-compiled without ruining the data in the arrays. This is working nicely and seems like a good idea, even if at the moment it's not quite up to the level of a rs7000 or Live (yet!). For true groovebox functionality it would be nice to have some way of listening to a MIDI clock and this seems to be missing at the moment. Of cource MIDI sync normally works quite differently from the typical structure of ChucK code but at least some way of relating to it would be nice. I'd like to sugest some new function for this. What if we had something that would for example be able to output those midi clock "sync" pulses (I think they are properly defined as repeat "play" messages or something along those lines?) as events as well as the duration (in time) between the last two clock ticks of a incoming clock. Practically speaking it might be more sensible to average the time of -say- the last four of those, considdering how inacurate MIDI is and how quickly multiplied jitter might add up if looped. This would enable us to have chuck loops that would go something like; //wait for next sync event sync => now; //main loop while(true) { something_involving_realy_cool_beats; //advance my sequencer 1 +=> steps; (steps % 16) => steps; //advance time by a quarter note 24::click => now; } Now; this example would probably start drifting unless the duration of "click" was updated frequently by some external loop (thus averaging out the jitter) and even then some more advanced form of syncing the whole loop up every once in while would be preferable, especially if the external master clock will be modulated in mid piece.... Still; I hope this demonstrates that Chuck programs could relate to a MIDI clock in a way that's at least somewhat similar to the way they normally relate to the internal ChucK "now". Bad; Keeps MIDI alive while it realy should have died long ago. Good; Allows one to jam with friends who haven't yet realised MIDI should have been left in the 80's. Not all that complicated to implement, I imagine. Alternatively it would also be welcome to point me at where it says we allready have something like this; I looked and couldn't find a thing. Yours, Kas.

4 5

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