Re: Decent datastructure for queue operations
- From: "meng" <meng234@xxxxxxxxx>
- Date: 31 Jan 2006 01:42:49 -0800
mmcconnell17, thanks for your idea. Actually, this is what I've been
using but as I said enqueue is not just append an item like that. The
queue entries are somehow required to be unique.
By the way, LISP has a function `last' which points directly to the
last item of a list without needing to traverse it.
--Meng
.
- Follow-Ups:
- Re: Decent datastructure for queue operations
- From: meng
- Re: Decent datastructure for queue operations
- From: Edi Weitz
- Re: Decent datastructure for queue operations
- References:
- Decent datastructure for queue operations
- From: meng
- Re: Decent datastructure for queue operations
- From: mmcconnell17704
- Decent datastructure for queue operations
- Prev by Date: Re: Problems writing to clisp mailing list
- Next by Date: Re: Decent datastructure for queue operations
- Previous by thread: Re: Decent datastructure for queue operations
- Next by thread: Re: Decent datastructure for queue operations
- Index(es):