Re: Efficiency of arrays in LISP
- From: "JohnFredCee" <johnc@xxxxxxxxxxxxxx>
- Date: 30 Oct 2006 07:27:34 -0800
Actually I had a similar more newbie - ish question relating to
SBCL/CMUCL: when passing small tuples (vectors, matrices for 3d and 2d
around) a lot - which is more efficent, small arrays, a struct or
multiple-values?
My guess was multiple values for the 2-3-4 tuples (they live in
registors or on the stack, don't they?) and small arrays of single
floats for the 9-16 tuples (matrices)..
I guess I should DISSASEMBLE and find out, rather than be lazy and ask
the group. Although the group might know of implementation gotchas that
I don't
On Oct 30, 3:22 am, "robinganemcca...@xxxxxxxxx"
<robinganemcca...@xxxxxxxxx> wrote:
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.
Thanks in advance.
.
- Follow-Ups:
- Re: Efficiency of arrays in LISP
- From: nikodemus
- Re: Efficiency of arrays in LISP
- References:
- Efficiency of arrays in LISP
- From: robinganemccalla@xxxxxxxxx
- Efficiency of arrays in LISP
- Prev by Date: Re: Current state of Symbolics
- Next by Date: (asdf:oos 'asdf:unload-op 'cl-spont)
- Previous by thread: Re: Efficiency of arrays in LISP
- Next by thread: Re: Efficiency of arrays in LISP
- Index(es):
Relevant Pages
|