19 #ifndef __TPIE_INTERNAL_VECTOR_H__
20 #define __TPIE_INTERNAL_VECTOR_H__
136 #endif //__TPIE_INTERNAL_VECTOR_H__
const_iterator begin() const
Get an iterator to the beginning of the structure.
iterator find(size_t idx)
Return an iterator to the i'th element of the array.
const T & back() const
Get the last item pushed. Requires !empty().
size_t m_size
Number of elements pushed to the structure.
A generic array with a fixed size.
Generic base for internal stack and vector with known memory requirements.
size_t size() const
Return the number of elements in the data structure.
T & push_back(const T &val)
Add an element to the end of the vector.
A base class for a generic internal fixed size stack and vector.
T & front()
Get the first item pushed. Requires !empty().
void pop_back()
Remove the last element from the vector.
const T & front() const
Get the first item pushed. Requires !empty().
Generic internal array with known memory requirements.
const_iterator end() const
Get an iterator to the end of the structure.
Class storring a reference to a memory bucket.
A generic internal vector.
Miscellaneous utility functions.
const T & operator[](size_t s) const
Element access. No range checking is done.
iterator begin()
Get an iterator to the beginning of the structure.
T & back()
Get the last item pushed. Requires !empty().
internal_vector(size_t size=0, tpie::memory_bucket_ref bucket=memory_bucket_ref())
Construct structure with given capacity.
T & push_back()
If an item was previously popped from this point in the structure, push it to the structure again; ot...
iterator begin()
Return an iterator to the beginning of the array.
iterator end()
Get an iterator to the end of the structure.
array< T > m_elements
Element storage.
T & operator[](size_t s)
Element access. No range checking is done.