[armedbear-devel] (lisp) Stack management efficiency

[Ville Voutilainen]

On Tue, Jul 21, 2009 at 2:33 PM, Ville
Voutilainen<ville.voutilainen at gmail.com> wrote:
> 1) per-thread (in order to avoid synchronisation overhead)
> 2) chunked-allocated (set aside a bunch, when all are unwound, remove
> a chunk, before that, mark them unused for re-use)
> I don't yet know what would be a proper data structure for 2).

ArrayDeque would do, but that's java 1.6. Vector would otherwise do,
but it's synchronised.
I want something like c++ deque, but I'm not sure if it's available in java 1.5.