Detailed Description

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

Definition at line 973 of file vector.h.

#include <vector.h>

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

Public Types
typedef vector< T >::const_iterator	const_iterator

typedef vector< T >::const_reverse_iterator	const_reverse_iterator

enum	insert_result { inserted = 0 , exists = 1 , at_capacity = 2 }

typedef vector< T >::iterator	iterator

typedef vector< T >::reverse_iterator	reverse_iterator

typedef T	value_type

Public Member Functions
	SortedHeapVector (const SortedHeapVector &other)=default

	SortedHeapVector (LessThan less=LessThan()) FL_NOEXCEPT

	SortedHeapVector (SortedHeapVector &&other) FL_NOEXCEPT

	~SortedHeapVector () FL_NOEXCEPT

const T &	back () const FL_NOEXCEPT

T &	back () FL_NOEXCEPT

const_iterator	begin () const FL_NOEXCEPT

iterator	begin () FL_NOEXCEPT

fl::size	capacity () const FL_NOEXCEPT

void	clear () FL_NOEXCEPT

const T *	data () const FL_NOEXCEPT

T *	data () FL_NOEXCEPT

bool	empty () const FL_NOEXCEPT

const_iterator	end () const FL_NOEXCEPT

iterator	end () FL_NOEXCEPT

bool	erase (const T &value) FL_NOEXCEPT

iterator	erase (iterator pos) FL_NOEXCEPT

const_iterator	find (const T &value) const FL_NOEXCEPT

iterator	find (const T &value) FL_NOEXCEPT

const T &	front () const FL_NOEXCEPT

T &	front () FL_NOEXCEPT

bool	full () const FL_NOEXCEPT

bool	has (const T &value) const FL_NOEXCEPT

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

const_iterator	lower_bound (const T &value) const FL_NOEXCEPT

iterator	lower_bound (const T &value) FL_NOEXCEPT

SortedHeapVector &	operator= (const SortedHeapVector &other)=default

SortedHeapVector &	operator= (SortedHeapVector &&other) FL_NOEXCEPT

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

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

const_reverse_iterator	rbegin () const FL_NOEXCEPT

reverse_iterator	rbegin () FL_NOEXCEPT

const_reverse_iterator	rend () const FL_NOEXCEPT

reverse_iterator	rend () FL_NOEXCEPT

void	reserve (fl::size n) FL_NOEXCEPT

void	setMaxSize (fl::size n) FL_NOEXCEPT

fl::size	size () const FL_NOEXCEPT

void	swap (SortedHeapVector &other) FL_NOEXCEPT

Private Attributes
vector< T >	mArray

LessThan	mLess

fl::size	mMaxSize = fl::size(-1)

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

fl/stl/vector.h

Detailed Description

Public Types

Public Member Functions

Private Attributes