BLOCXX_NAMESPACE::Stack< T > Class Template Reference
#include <Stack.hpp>
Inheritance diagram for BLOCXX_NAMESPACE::Stack< T >:
Public Types | |
| typedef Array< T >::size_type | size_type |
| typedef Array< T >::reference | reference |
| typedef Array< T >::const_reference | const_reference |
Public Member Functions | |
| Stack () | |
| bool | empty () const |
| reference | top () |
| const_reference | top () const |
| void | pop () |
| void | push (const T &x) |
| int | search (const T &x) const |
| size_type | size () const |
Additional Inherited Members | |
 Private Types inherited from BLOCXX_NAMESPACE::Array< T > | |
| typedef V::value_type | value_type |
| typedef V::pointer | pointer |
| typedef V::const_pointer | const_pointer |
| typedef V::iterator | iterator |
| typedef V::const_iterator | const_iterator |
| typedef V::reference | reference |
| typedef V::const_reference | const_reference |
| typedef V::size_type | size_type |
| typedef V::difference_type | difference_type |
| typedef V::reverse_iterator | reverse_iterator |
| typedef V::const_reverse_iterator | const_reverse_iterator |
| Private Member Functions inherited from BLOCXX_NAMESPACE::Array< T > | |
| Array () | |
| Default Constructor. | |
| ~Array () | |
| Destructor. | |
| Array (V *toWrap) | |
| Constructor. | |
| Array (size_type n, const T &value) | |
| Construct an Array that consist of a specified number of elements that are copies of a given object. | |
| Array (int n, const T &value) | |
| Construct an Array that consist of a specified number of elements that are copies of a given object. | |
| Array (long n, const T &value) | |
| Construct an Array that consist of a specified number of elements that are copies of a given object. | |
| Array (size_type n) | |
| Construct an Array that consist of a specified number of elements that have be constructed using the default constructor of class T. | |
| template<class InputIterator > | |
| Array (InputIterator first, InputIterator last) | |
| Construct an Array from a range specified with InputIterators. | |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
| reverse_iterator | rbegin () |
| const_reverse_iterator | rbegin () const |
| reverse_iterator | rend () |
| const_reverse_iterator | rend () const |
| size_type | size () const |
| size_type | max_size () const |
| size_type | capacity () const |
| bool | empty () const |
| reference | operator[] (size_type n) |
| Retrieve A read/write reference to an object in the Array at a given index. | |
| const_reference | operator[] (size_type n) const |
| Retrieve A read only reference to an object in the Array at a given index. | |
| Array< T > & | operator+= (const T &x) |
| Append an object to the end of the Array. | |
| void | reserve (size_type n) |
| Ensure the capacity is at least the size of a given value. | |
| reference | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| void | push_back (const T &x) |
| Append an element to the end of the Array. | |
| void | append (const T &x) |
| Append an element to the end of the Array. | |
| void | swap (Array< T > &x) |
| Swap the elements of this Array with the elements of another. | |
| iterator | insert (iterator position, const T &x) |
| Insert an element in the Array before an element specified by an iterator. | |
| void | insert (size_type position, const T &x) |
| Insert an element in the Array before an element specified by an index. | |
| void | remove (size_type index) |
| Remove an element from the Array at a given index. | |
| void | remove (size_type begin, size_type end) |
| Remove an element specified by a range. | |
| template<class InputIterator > | |
| void | insert (iterator position, InputIterator first, InputIterator last) |
| Insert a range of elements before a given position in the Array. | |
| void | appendArray (const Array< T > &x) |
| Append the elements of another Array to the end of this Array. | |
| void | pop_back () |
| Remove the last element of the Array. | |
| iterator | erase (iterator position) |
| Remove an element of the Array specified with an iterator. | |
| iterator | erase (iterator first, iterator last) |
| Remove elements of the Array specified by a beginning and ending iterator. | |
| void | resize (size_type new_size, const T &x) |
| Ensure the Array is a given size. | |
| void | resize (size_type new_size) |
| Ensure the Array is a given size. | |
| void | clear () |
| Remove all items from the Array. | |
| const_iterator | find (const T &x, const_iterator first, const_iterator last) const |
| Find element x in the array range specified by the first and last iterators. | |
| const_iterator | find (const T &x) const |
| Find element x in the array. | |
| iterator | find (const T &x, iterator first, iterator last) |
| Find element x in the array range specified by the first and last iterators. | |
| iterator | find (const T &x) |
| Find element x in the array. | |
| bool | contains (const T &x, const_iterator first, const_iterator last) const |
| Determine if element x is contained in the array range specified by the first and last iterators. | |
| bool | contains (const T &x) const |
| Determine if element x is contained in the array. | |
Detailed Description
Member Typedef Documentation
◆ const_reference
template<class T >
| Array<T>::const_reference BLOCXX_NAMESPACE::Stack< T >::const_reference |
◆ reference
template<class T >
| Array<T>::reference BLOCXX_NAMESPACE::Stack< T >::reference |
◆ size_type
template<class T >
| Array<T>::size_type BLOCXX_NAMESPACE::Stack< T >::size_type |
Constructor & Destructor Documentation
◆ Stack()
template<class T >
|
inline |
Member Function Documentation
◆ empty()
template<class T >
|
inline |
Definition at line 56 of file Stack.hpp.
References BLOCXX_NAMESPACE::Stack< T >::size().
◆ pop()
template<class T >
|
inline |
Definition at line 59 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::pop_back().
◆ push()
template<class T >
|
inline |
Definition at line 60 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::push_back().
◆ search()
template<class T >
|
inline |
Definition at line 61 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::find(), i, and BLOCXX_NAMESPACE::Stack< T >::size().
◆ size()
template<class T >
|
inline |
Definition at line 66 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::size().
Referenced by BLOCXX_NAMESPACE::Stack< T >::empty(), and BLOCXX_NAMESPACE::Stack< T >::search().
◆ top() [1/2]
template<class T >
|
inline |
Definition at line 57 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::back().
◆ top() [2/2]
template<class T >
|
inline |
Definition at line 58 of file Stack.hpp.
References BLOCXX_NAMESPACE::Array< T >::back().
The documentation for this class was generated from the following file:
Generated by
1.12.0