Re: Choosing a different data structure

Not to advertise but if you're looking for a decent generic library of  
data-structures, you might want to check at cl-containers (http://common-lisp.net/project/cl-containers 
) (note, I maintain this). If you just want a quick queue, use  
structure that has a place to hold the tail and a place to hold the  
head and the queue itself. There are probably many implementations out  
there...


On Apr 25, 2008, at 11:11 AM, Mauricio Toro wrote:

> Hello again,
> Thanks for your replies.
>
> I was asking all this about the append, because I want to make
> very efficient dynamic size queue. I tough that using lists with
> an efficient append operation would be efficient.
> What do you sugest me?
>
> thanks
>
> -- 
> Mauricio Toro Bermudez
> Estudiante de Ingeniería de Sistemas
> Pontificia Universidad Javeriana, Colombia
>
> Stagiare à l'Ircam
> 1, place Igor-Stravinsky 75004 Paris,
> France de 2008 à 2009

--
Gary Warren King, metabang.com
Cell: (413) 559 8738
Fax: (206) 338-4052
gwkkwg on Skype * garethsan on AIM