Vector class template.
More...
#include <WVector.h>
|
using | Comparer = int(*)(const Element &lhs, const Element &rhs) |
|
template<typename Element>
class Vector< Element >
Vector class template.
◆ Comparer
template<typename Element >
using Vector< Element >::Comparer = int (*)(const Element& lhs, const Element& rhs) |
◆ ElementList
template<typename Element >
◆ Vector() [1/2]
template<typename Element >
◆ Vector() [2/2]
template<typename Element >
◆ add()
template<typename Element >
bool Vector< Element >::add |
( |
const Element & |
obj | ) |
|
|
inline |
◆ addElement() [1/2]
template<class Element >
bool Vector< Element >::addElement |
( |
const Element & |
obj | ) |
|
◆ addElement() [2/2]
template<class Element >
bool Vector< Element >::addElement |
( |
Element * |
objp | ) |
|
◆ begin() [1/2]
template<typename Element >
◆ begin() [2/2]
template<typename Element >
◆ capacity()
template<typename Element >
◆ clear()
template<typename Element >
void Vector< Element >::clear |
( |
void |
| ) |
|
|
inline |
◆ contains()
template<typename Element >
template<typename T >
bool Vector< Element >::contains |
( |
const T & |
elem | ) |
const |
|
inline |
◆ copyFrom()
template<class Element >
void Vector< Element >::copyFrom |
( |
const Vector< Element > & |
rhv | ) |
|
|
protected |
◆ copyInto()
template<class Element >
void Vector< Element >::copyInto |
( |
Element * |
array | ) |
const |
◆ count()
template<typename Element >
◆ elementAt()
template<typename Element >
const Element& Vector< Element >::elementAt |
( |
unsigned int |
index | ) |
const |
|
inline |
◆ end() [1/2]
template<typename Element >
◆ end() [2/2]
template<typename Element >
◆ ensureCapacity()
◆ firstElement()
template<typename Element >
const Element& Vector< Element >::firstElement |
( |
| ) |
const |
|
inline |
◆ get()
template<typename Element >
◆ indexOf()
template<class Element >
template<typename T >
int Vector< Element >::indexOf |
( |
const T & |
elem | ) |
const |
◆ insertElementAt()
template<class Element >
bool Vector< Element >::insertElementAt |
( |
const Element & |
obj, |
|
|
unsigned int |
index |
|
) |
| |
◆ isEmpty()
template<typename Element >
bool Vector< Element >::isEmpty |
( |
| ) |
const |
|
inline |
◆ lastElement()
template<typename Element >
const Element& Vector< Element >::lastElement |
( |
| ) |
const |
|
inline |
◆ lastIndexOf()
template<class Element >
template<typename T >
int Vector< Element >::lastIndexOf |
( |
const T & |
elem | ) |
const |
◆ operator=() [1/2]
template<typename Element >
◆ operator=() [2/2]
template<typename Element >
◆ operator[]() [1/2]
template<typename Element >
const Element& Vector< Element >::operator[] |
( |
unsigned int |
index | ) |
const |
|
inlineoverridevirtual |
◆ operator[]() [2/2]
template<typename Element >
◆ remove()
template<typename Element >
◆ removeAllElements()
template<typename Element >
void Vector< Element >::removeAllElements |
( |
| ) |
|
|
inline |
◆ removeElement()
template<typename Element >
template<typename T >
bool Vector< Element >::removeElement |
( |
const T & |
elem | ) |
|
|
inline |
◆ removeElementAt()
◆ setElementAt()
template<class Element >
bool Vector< Element >::setElementAt |
( |
const Element & |
obj, |
|
|
unsigned int |
index |
|
) |
| |
◆ setSize()
Reduce or increase number of items.
- Return values
-
true | on success, false on memory reallocation failure |
If increasing number of items, new items will be set to current nil
value. If reducing number of items, old items will be deleted.
◆ size()
template<typename Element >
◆ sort()
◆ trimToSize()
template<typename Element >
void Vector< Element >::trimToSize |
( |
| ) |
|
|
inline |
Reduce capacity to match current size.
◆ _data
template<typename Element >
◆ _increment
template<typename Element >
◆ _size
template<typename Element >
The documentation for this class was generated from the following file: