Cluster lib/storage/collection

ARRAY

General purpose resizable ARRAYs as they are define in the Eiffel language definition.


 
FAST_ARRAY

General purpose resizable FAST_ARRAYs.


 
LINKED_LIST

One way linked list implementation with internal automatic cached memorization of the last access.


 
RING_ARRAY

The main purpose of the RING_ARRAY implementation is to allow efficient manipulation of the queue concept (i.e. using for example add_last / first / remove_first). Actually, the RING_ARRAY implementation provides very good performance for all of the following features: add_last, last, remove_last, add_first, first, remove_first.


 
TWO_WAY_LINKED_LIST

Two way linked list with internal automatic memorization of the last access.