Detailed Description

template<typename T, typename LessThan = fl::less<T>>
class fl::SortedHeapVector< T, LessThan >

Definition at line 747 of file vector.h.

#include <vector.h>

Inheritance diagram for fl::SortedHeapVector< T, LessThan >:

Collaboration diagram for fl::SortedHeapVector< T, LessThan >:

Public Types
typedef HeapVector< T >::const_iterator	const_iterator

typedef HeapVector< T >::iterator	iterator

Public Member Functions
	SortedHeapVector (LessThan less=LessThan())

	~SortedHeapVector ()

T &	back ()

const T &	back () const

iterator	begin ()

const_iterator	begin () const

fl::size	capacity () const

void	clear ()

T *	data ()

const T *	data () const

bool	empty () const

iterator	end ()

const_iterator	end () const

bool	erase (const T &value)

bool	erase (iterator pos)

iterator	find (const T &value)

const_iterator	find (const T &value) const

T &	front ()

const T &	front () const

bool	full () const

bool	has (const T &value) const

bool	insert (const T &value, InsertResult *result=nullptr)

iterator	lower_bound (const T &value)

const_iterator	lower_bound (const T &value) const

T &	operator[] (fl::size index)

const T &	operator[] (fl::size index) const

void	reserve (fl::size n)

void	setMaxSize (fl::size n)

fl::size	size () const

void	swap (SortedHeapVector &other)

The documentation for this class was generated from the following file:

Public Types