bt::SortVoidVector< T > Class Template Reference

SortVoidVector - continuous sorted array of pointers of type T. More...

Classes
class	iterator
	The object that abstracts a single interface access to the items in the collection. More...

Public Member Functions
_FORCEINLINE void	assign (T *_val)
	Adds a new element.
_FORCEINLINE T *&	at (unsigned int id)
	Returns the element of the selected position of the array.
_FORCEINLINE iterator	begin ()
	Returns an iterator pointing to the first element in the sequence.
_FORCEINLINE void	clear ()
	Frees an array of completely deleting the allocated memory.
_FORCEINLINE unsigned int	count ()
	Number of array elements.
_FORCEINLINE T **	data ()
	Returns an array of data in a continuous sequence of elements.
_FORCEINLINE int	del (T *_val)
	Removes the element with the specified value and returns its position, otherwise-1.
_FORCEINLINE iterator	end ()
	Returns an iterator to the conditional end in the sequence.
_FORCEINLINE int	find (T *_val)
	Returns the position of the element with the specified value, if not -1.
_FORCEINLINE T *&	first ()
	Returns the first element of the array.
_FORCEINLINE bool	isEmpty ()
	Returns true if the array does not contain any element.
_FORCEINLINE T *&	last ()
	Returns the last element of the array.
_FORCEINLINE unsigned int	size ()
	Number of array elements.

Detailed Description

template<typename T>
class bt::SortVoidVector< T >

SortVoidVector - continuous sorted array of pointers of type T.

Unlike VoidVector has a faster search.

See Also

BaseSortVoidVector