finding prime form

[Celso Aguiar]

I don't know what lisp version you're using but generally in this cases
the right thing to do is to write a C routine and call it via the foreign
function interface. That's actually what CLM does (please, Bil, correct
me if I'm wrong) in its run loop which is all compiled into C. I've done 
a lot of that and found it an extremely useful resource for sound
computation, for example. In your case it should probably take recoding 
just one function into C, wherever the bottle-neck is.

+-----------------------------------------------------+
| Celso Aguiar - aguiar@ccrma.stanford.edu            |
| http://www-ccrma.stanford.edu/~aguiar               |
| Center for Computer Research in Music and Acoustics |
| CCRMA - Stanford University                         |
+-----------------------------------------------------+

On Mon, 3 Nov 1997, Sean Ferguson wrote:

> Hi.
> 
> I'm wondering if anyone might have an *efficient* lisp program for finding
> the prime form of a given set.  I've written my own and it works fine, but
> when given many chords (ie 10s of thousands) with many voices, it is
> extremely slow. I've compiled it and run it on a 200 MHz SGI and it still
> is very bad.
> 
> I'm a composer, not a programmer, so I'm afraid that perhaps I've written
> a slow version.  I'm hoping that someone who is more skilled has written a
> version that would run faster.
> 
> Please email me at ferguson@music.mcgill.ca
> 
> Note that because of network problems my return address may be incorrect.
> Use the one I've given, please.
> 
> Thanks in advance,
> 
> Sean Ferguson
> 
> 
>