INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Create queue for at most `n' items.
-- Oldest item.
-- Does queue include `v'?
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Number of items that may be kept.
-- Number of items.
-- Is there no current item?
-- Move cursor to first position.
-- Move cursor to last position.
-- Move cursor to next position.
-- Add `v' as newest element.
-- Replace oldest item by `v'.
-- Remove oldest item.
-- Remove all items.
-- Representation as a linear structure
-- (in the original insertion order)
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |