Detailed Description

template<typename T, typename Allocator = fl::allocator<T>>
class fl::HeapVector< T, Allocator >

Definition at line 305 of file vector.h.

#include <vector.h>

Inheritance diagram for fl::HeapVector< T, Allocator >:

Public Member Functions
	HeapVector (const HeapVector< T > &other)

	HeapVector (HeapVector< T > &&other)

	HeapVector (size_t size=0, const T &value=T())

template<size_t N>
	HeapVector (T(&values)[N])

	~HeapVector ()

template<typename InputIt, typename = fl::enable_if_t<!fl::is_integral<InputIt>::value>>
void	assign (InputIt begin, InputIt end)

void	assign (size_t new_cap, const T &value)

T &	back ()

const T &	back () const

iterator	begin ()

const_iterator	begin () const

size_t	capacity () const

void	clear ()

T *	data ()

const T *	data () const

bool	empty () const

iterator	end ()

const_iterator	end () const

void	ensure_size (size_t n)

void	erase (const T &value)

bool	erase (iterator pos, T *out_value=nullptr)

iterator	find (const T &value)

const_iterator	find (const T &value) const

template<typename Predicate>
iterator	find_if (Predicate pred)

T &	front ()

const T &	front () const

bool	full () const

bool	has (const T &value) const

bool	insert (iterator pos, const T &value)

bool	operator!= (const HeapVector< T > &other) const

HeapVector &	operator= (const HeapVector< T > &other)

bool	operator== (const HeapVector< T > &other) const

T &	operator[] (size_t index)

const T &	operator[] (size_t index) const

void	pop_back ()

void	push_back (const T &value)

reverse_iterator	rbegin ()

reverse_iterator	rend ()

void	reserve (size_t n)

void	resize (size_t n)

void	resize (size_t n, const T &value)

size_t	size () const

void	swap (HeapVector< T > &other)

void	swap (iterator a, iterator b)

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

Classes