Re: Efficiency of arrays in LISP
- From: Pascal Bourguignon <pjb@xxxxxxxxxxxxxxxxx>
- Date: Mon, 30 Oct 2006 10:42:40 +0100
"robinganemccalla@xxxxxxxxx" <robinganemccalla@xxxxxxxxx> writes:
I have a list of data that I'm going to need to remove elements from,
and select elements from randomly. I am wondering the array functions
in common lisp would be more effective (in terms of execution time)
then using remove to remove and creating a loop that takes the car if
iterations has reached the random number, and recursively calls itself
on the cdr with a greater value of iterations otherwise. Coding
complexity is not an issue.
Ah good. Since coding complexity is not an issue, you might consider
rewriting the Judy algorithm in CL (or writting a FFI to the C
library, but this might be more complex to use).
http://judy.sourceforge.net/
--
__Pascal Bourguignon__ http://www.informatimago.com/
HEALTH WARNING: Care should be taken when lifting this product,
since its mass, and thus its weight, is dependent on its velocity
relative to the user.
.
- References:
- Efficiency of arrays in LISP
- From: robinganemccalla@xxxxxxxxx
- Efficiency of arrays in LISP
- Prev by Date: Re: [OT] How do you read usenet news (c.l.l of course!)
- Next by Date: Re: Hunchentoot in SBCL on Intel OS X
- Previous by thread: Re: Efficiency of arrays in LISP
- Next by thread: Re: Efficiency of arrays in LISP
- Index(es):
Relevant Pages
|
