One consequence of perl's list implementation is that queues implemented using perl lists end up "creeping forward" through the preallocated array space leading to reallocations even though the queue itself may never contain many elements.What is the proper (and perlish) way to implement a queue that won't leak memory? And is there already a CPAN module that implements it?
In reply to How to implement a Queue that doesn't leak memory? by Anonymous Monk
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |