Simple++
Powerfull and lightning fast C++ Library
OrderedVector< T, Compare > Member List

This is the complete list of members for OrderedVector< T, Compare >, including all inherited members.

_allocateNoNull(const Size &newMax)Vector< T >private
_allocateNoNullDelete(const Size &newMax)Vector< T >private
_erasei(Size index)Vector< T >private
_eraseit(RandomAccessIterator it)Vector< T >private
_extendBuffer(const Size &newSizeNeeded)Vector< T >private
_updateIterators()Vector< T >private
allocate(Size newMax)Vector< T >private
assign(Size index1, Size index2)Vector< T >private
begin() const Vector< T >private
clear()Vector< T >private
copy(Vector vector, Size indexSrc, Size indexDest, Size size)Vector< T >private
copy(Vector< C > vector, typename Vector< C >::Size indexSrc, Size indexDest, typename Vector< C >::Size size)Vector< T >private
copy(const C *datas, Size index, Size size)Vector< T >private
copy(const C *datas, Size size)Vector< T >private
copy(C *destinationBuffer, const D *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(char *destinationBuffer, const char *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(unsigned char *destinationBuffer, const unsigned char *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(short *destinationBuffer, const short *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(unsigned short *destinationBuffer, const unsigned short *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(int *destinationBuffer, const int *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(unsigned int *destinationBuffer, const unsigned int *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(long *destinationBuffer, const long *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(unsigned long *destinationBuffer, const unsigned long *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(long long *destinationBuffer, const long long *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(unsigned long long *destinationBuffer, const unsigned long long *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(float *destinationBuffer, const float *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(double *destinationBuffer, const double *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(wchar_t *destinationBuffer, const wchar_t *sourceBuffer, const Size &size)Vector< T >privatestatic
copy(Vector< T > vector, typename Vector< T >::Size indexSrc, typename Vector< T >::Size indexDst, typename Vector< T >::Size size)Vector< T >private
copy(Vector< C > vector, typename Vector< C >::Size indexSrc, typename Vector< T >::Size indexDst, typename Vector< C >::Size size)Vector< T >private
createFromData(const T *dataTable, Size size)Vector< T >private
createFromData(const C *dataTable, Size size)Vector< T >private
createFromData(const T *dataTable, typename Vector< T >::Size size)Vector< T >private
createFromData(const C *dataTable, typename Vector< T >::Size size)Vector< T >private
ctor enum nameVector< T >private
data() const Vector< T >private
data()Vector< T >private
dataTableVector< T >private
elemType typedefVector< T >private
end() const Vector< T >private
eraseAll(const T &value)Vector< T >private
eraseFirst(const T &value)Vector< T >private
eraseIndex(Size index)Vector< T >private
exists(const T &data)OrderedVector< T, Compare >
Vector::exists(const T &value) const Vector< T >private
fill(const T &data)Vector< T >private
getBegin() const Vector< T >private
getData() const Vector< T >private
getData()Vector< T >private
getEnd() const Vector< T >private
getFirst() const Vector< T >private
getFirst()Vector< T >private
getLast() const Vector< T >private
getLast()Vector< T >private
getMaxSize() const Vector< T >private
getNumEntries(const T &value)OrderedVector< T, Compare >
getSize() const Vector< T >private
getSizeBytes() const Vector< T >private
getValuei(Size i)Vector< T >private
getValuei(Size i) const Vector< T >private
getValueit(RandomAccessIterator i)Vector< T >private
getValueit(RandomAccessIterator i) const Vector< T >private
insert(const T &data)OrderedVector< T, Compare >
insertFast(const T &data)OrderedVector< T, Compare >
iterate(RandomAccessIterator *it, elemType **e)Vector< T >private
iteratorEndVector< T >private
maxSizeVector< T >private
null enum valueVector< T >private
operator!=(const Vector< T > &v) const Vector< T >private
operator!=(const T &v) const Vector< T >private
operator+=(const Vector< T > &vector)Vector< T >private
operator<(const Vector< T > &v) const Vector< T >private
operator<(const T &v) const Vector< T >private
operator<=(const Vector< T > &v) const Vector< T >private
operator<=(const T &v) const Vector< T >private
operator=(const OrderedVector< T, Compare > &vector)OrderedVector< T, Compare >
operator=(OrderedVector< T, Compare > &&vector)OrderedVector< T, Compare >
Vector::operator=(const Vector< T > &vector)Vector< T >private
Vector::operator=(Vector &&v)Vector< T >private
Vector::operator=(const Vector< C > &vector)Vector< T >private
operator==(const Vector< T > &v) const Vector< T >private
operator==(const T &v) const Vector< T >private
operator>(const Vector< T > &v) const Vector< T >private
operator>(const T &v) const Vector< T >private
operator>=(const Vector< T > &v) const Vector< T >private
operator>=(const T &v) const Vector< T >private
operator[](Size index) const Vector< T >private
operator[](Size index)Vector< T >private
OrderedVector(const Compare &compareFunc=Compare())OrderedVector< T, Compare >
OrderedVector(const OrderedVector &vector)OrderedVector< T, Compare >
OrderedVector(OrderedVector &&v)OrderedVector< T, Compare >
overflowVector< T >privatestatic
pop()Vector< T >private
push(const T &data)Vector< T >private
quicksort(RandomAccessIterator start, RandomAccessIterator end, Compare func=Logical::less< T >)Vector< T >private
RandomAccessIterator typedefVector< T >private
read(std::fstream *fileStream)OrderedVector< T, Compare >
replaceAll(const T &search, const T &data)Vector< T >private
replaceFirst(const T &search, const T &data)Vector< T >private
reserve(Size newMax)Vector< T >private
reset()Vector< T >private
resize(Size newSize)Vector< T >private
search(const T &data)OrderedVector< T, Compare >
Vector::search(const T &data) const Vector< T >private
setValuei(Size i, const T &data)Vector< T >private
setValueit(RandomAccessIterator i, const T &data)Vector< T >private
sizeVector< T >private
Size typedefVector< T >private
sort(Func functor)Vector< T >private
sortAsc()Vector< T >private
sortDesc()Vector< T >private
swap(Size index1, Size index2)Vector< T >private
swap(RandomAccessIterator index1, RandomAccessIterator index2)Vector< T >private
Vector(void)Vector< T >private
Vector(Size size, Size maxSize)Vector< T >private
Vector(Size maxSize)Vector< T >private
Vector(const Vector &vector)Vector< T >private
Vector(const Vector< C > &vector)Vector< T >private
Vector(Vector &&v)Vector< T >private
Vector(const C(&data)[N])Vector< T >private
Vector(const C *data, Size maxSize)Vector< T >private
Vector(const C *data, Size size, Size maxSize)Vector< T >private
Vector(ctor)Vector< T >private
Vector(const C *data, typename Vector< T >::Size size)Vector< T >private
Vector(const C *data, typename Vector< T >::Size size, typename Vector< T >::Size maxSize)Vector< T >private
write(std::fstream *fileStream) const OrderedVector< T, Compare >
~OrderedVector(void)OrderedVector< T, Compare >
~Vector(void)Vector< T >private