Sequence containers

---

Conception

The Sequential containers are in their turn divided into two major groups:

• Static containers
• and Dynamic containers

A Static container interface provides an interface to iterate and access to the elements the amount of which is not changed during container’s object life time. But the Dynamic container interface extends the Static container interface by an ability to modify quantity of the elements by inserting and erasing them from/to the container.
The Dynamic::Array container interface is an extention of the Dynamic container and exposes an interface to the specific functionality of the array-like dynamic containers.
Both the Static and Dynamic container interfaces extend the Forward functionality by ability to access and modify the container in the Reverse manner.

There are several containers which implement the Static/Dynamic container conception as depicted above:

• Static
  • Range
    Represents a range beetwen two iterators as the Static container
  • Array
    Represent a plain C++ array as the Static container
• Dymanic
  • Forwart::List
    The same as the std::forward_list
  • List
    The same as the std::list
  • Dynamic::Array
    • Reversible::Array
      • Vector
        The same as the std::vector but allows push and pop at front
      • Deque
        The same as the std::deque
    • Ring::Array
      • Ring::Vector
      • Ring::Deque
        Both are based on corresponding Reversible:: version of containers but implement the ring allocation and iteration behaviours.
  • Adaptors
    • SCO (Short/Small Container Optimization)
      Implements an optimization for short containers of the elements of small size
    • COW (Copy-On-Write)
      Implements the COW optimization
    • Restricted adaptors
      • Stack
        Implements the LIFO conception like the std::stack
      • Queue
        Implements the FIFO conception like the std::queue. But as opposed to the std::queue it takes a Ring::Deque as base container by default

Extended member map