The unrolled-lists vocabulary provides an implementation of the deque protocol with constant time insertion and removal at both ends, and lower memory overhead than a dlist due to packing 32 elements per every node. The one tradeoff is that unlike dlists, delete-node is not supported for unrolled lists.
unrolled-list
<unrolled-list> ( -- list )
<hashed-unrolled-list> ( -- search-deque )
unrolled-list <unrolled-list> ( -- list ) <hashed-unrolled-list> ( -- search-deque )