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