Generated on Wed Jan 24 2018 21:22:26 for Gecode by doxygen 1.8.13
Gecode::Support::DynamicStack< T, A > Class Template Reference

Stack with arbitrary number of elements. More...

#include <dynamic-stack.hpp>

Public Member Functions

 DynamicStack (A &a, int n=64)
 Initialize stack with n elements. More...
 
 ~DynamicStack (void)
 Release memory. More...
 
bool empty (void) const
 Test whether stack is empty. More...
 
int entries (void) const
 Return number of entries currently on stack. More...
 
T pop (void)
 Pop topmost element from stack and return it. More...
 
T & top (void) const
 Return element on top of stack. More...
 
T & last (void) const
 Return element that has just been popped. More...
 
void push (const T &x)
 Push element x on top of stack. More...
 
T & operator[] (int i)
 Return entry at position i. More...
 
const T & operator[] (int i) const
 Return entry at position i. More...
 

Detailed Description

template<class T, class A>
class Gecode::Support::DynamicStack< T, A >

Stack with arbitrary number of elements.

Definition at line 46 of file dynamic-stack.hpp.

Constructor & Destructor Documentation

◆ DynamicStack()

template<class T , class A>
Gecode::Support::DynamicStack< T, A >::DynamicStack ( A &  a,
int  n = 64 
)
inline

Initialize stack with n elements.

Definition at line 115 of file dynamic-stack.hpp.

◆ ~DynamicStack()

template<class T , class A >
Gecode::Support::DynamicStack< T, A >::~DynamicStack ( void  )
inline

Release memory.

Definition at line 120 of file dynamic-stack.hpp.

Member Function Documentation

◆ empty()

template<class T , class A >
bool Gecode::Support::DynamicStack< T, A >::empty ( void  ) const
inline

Test whether stack is empty.

Definition at line 152 of file dynamic-stack.hpp.

◆ entries()

template<class T , class A >
int Gecode::Support::DynamicStack< T, A >::entries ( void  ) const
inline

Return number of entries currently on stack.

Definition at line 158 of file dynamic-stack.hpp.

◆ pop()

template<class T , class A >
T Gecode::Support::DynamicStack< T, A >::pop ( void  )
inline

Pop topmost element from stack and return it.

Definition at line 126 of file dynamic-stack.hpp.

◆ top()

template<class T , class A >
T & Gecode::Support::DynamicStack< T, A >::top ( void  ) const
inline

Return element on top of stack.

Definition at line 132 of file dynamic-stack.hpp.

◆ last()

template<class T , class A >
T & Gecode::Support::DynamicStack< T, A >::last ( void  ) const
inline

Return element that has just been popped.

Definition at line 138 of file dynamic-stack.hpp.

◆ push()

template<class T, class A >
void Gecode::Support::DynamicStack< T, A >::push ( const T &  x)
inline

Push element x on top of stack.

Definition at line 144 of file dynamic-stack.hpp.

◆ operator[]() [1/2]

template<class T , class A >
T & Gecode::Support::DynamicStack< T, A >::operator[] ( int  i)
inline

Return entry at position i.

Position 0 corresponds to the element first pushed, whereas position entries()-1 corresponds to the element pushed last.

Definition at line 164 of file dynamic-stack.hpp.

◆ operator[]() [2/2]

template<class T , class A >
const T & Gecode::Support::DynamicStack< T, A >::operator[] ( int  i) const
inline

Return entry at position i.

Position 0 corresponds to the element first pushed, whereas position entries()-1 corresponds to the element pushed last.

Definition at line 170 of file dynamic-stack.hpp.


The documentation for this class was generated from the following file: