Simple queue implemented as a singly linked list with a tail pointer.
Needed in some D:YAML code that needs a queue-like structure without too much reallocation that goes with an array.
Allocations are non-GC and are damped by a free-list based on the nodes that are removed. Note that elements lifetime must be managed outside.
A destructor is present on this object, but not explicitly documented in the source.
Copying this object is disabled.
A postblit is present on this object, but not explicitly documented in the source.
Insert a new item putting it to specified index in the linked list.
Push a new item to the queue.
Start iterating over the queue.