What is the data you're using to represent the shorts in Racket?
Robby
On Sat, Jul 23, 2011 at 1:42 PM, John Clements
<cleme...@brinckerhoff.org> wrote:
> This C code adds the content of one buffer to another one, with no checking.
> The corresponding racket code runs about 10x slower. Do you folks think that
> it should be possible to do better? (One salient fact: these are
> shorts--16-bit-ints--not 32-bit ints.)
>
> John
>
>
>
> void addOn(short *dst, int dstOffset, short *src, int srcOffset, int len) {
> int i;
> for (i = 0; i<len; i++) {
> dst[i+dstOffset] += src[i+srcOffset];
> }}
>
>
> _________________________________________________
> For list-related administrative tasks:
> http://lists.racket-lang.org/listinfo/dev
>
_________________________________________________
For list-related administrative tasks:
http://lists.racket-lang.org/listinfo/dev
