| 
|   | stack () | 
|   | 
|   | stack (const stack &other) | 
|   | 
|   | stack (size_type nb, const value_type &val) | 
|   | 
|   | ~stack () | 
|   | 
| size_type  | size () const  | 
|   | 
| bool  | full () const  | 
|   | 
| bool  | empty () const  | 
|   | 
| bool  | partial () const  | 
|   | 
| void  | push_front (const value_type &x) | 
|   | 
| void  | push_back (const value_type &x) | 
|   | 
| value_type &  | front () const  | 
|   | 
| value_type &  | back () const  | 
|   | 
| value_type  | pop_front () | 
|   | 
| value_type  | pop_back () | 
|   | 
| void  | frontn (value_type *dst, size_type nb) | 
|   | 
| void  | backn (value_type *dst, size_type nb) | 
|   | 
| void  | pushn_front (const value_type *xs, size_type nb) | 
|   | 
| void  | pushn_back (const value_type *xs, size_type nb) | 
|   | 
| template<class Body >  | 
| void  | pushn_back (const Body &body, size_type nb) | 
|   | 
| void  | popn_front (size_type nb) | 
|   | 
| void  | popn_back (size_type nb) | 
|   | 
| void  | popn_front (value_type *dst, size_type nb) | 
|   | 
| void  | popn_back (value_type *dst, size_type nb) | 
|   | 
| void  | transfer_from_back_to_front (stack &target, size_type nb) | 
|   | 
| void  | transfer_from_front_to_back (stack &target, size_type nb) | 
|   | 
| value_type &  | operator[] (size_type ix) const  | 
|   | 
| value_type &  | operator[] (size_t ix) const  | 
|   | 
| void  | clear () | 
|   | 
| void  | swap (stack &other) | 
|   | 
| size_type  | index_of_last_item () const  | 
|   | 
| segment_type  | segment_by_index (size_type ix) const  | 
|   | 
| size_type  | index_of_pointer (const value_type *p) const  | 
|   | 
| template<class Body >  | 
| void  | for_each (const Body &body) const  | 
|   | 
| template<class Body >  | 
| void  | for_each_segment (size_type lo, size_type hi, const Body &body) const  | 
|   | 
template<class Array_alloc, class Item_alloc = std::allocator<typename Array_alloc::value_type>>
class pasl::data::fixedcapacity::base::stack< Array_alloc, Item_alloc >
Fixed-capacity contiguous stack
Although supported, pushes and pops on the front of the container take time linear in the size of the container.
Container properties 
- Template Parameters
 - 
  
    | Array_alloc | Type of the allocator object used to define the storage policy of the array that is used by the stack to store the items of the stack.  | 
    | Item_alloc | Type of the allocator object used to define the storage allocation model. By default, the allocator class template is used, which defines the simplest memory allocation model and is value-independent. Aliased as member type vector::allocator_type.  | 
  
   
Definition at line 1581 of file fixedcapacitybase.hpp.