Vector that keeps its elements sorted. More...

#include "sortnet.hh"

Inheritance diagram for Ase::SortedVector< T, Less >:

Public Types
using	size_type = typename std::vector< T >::size_type

using	value_type = typename std::vector< T >::value_type

using	iterator = typename std::vector< T >::iterator

using	const_iterator = typename std::vector< T >::const_iterator

using	reverse_iterator = typename std::vector< T >::reverse_iterator

using	const_reverse_iterator = typename std::vector< T >::const_reverse_iterator

using	const_reference = typename std::vector< T >::const_reference

Public Member Functions
constexpr void	reserve (size_type n)

constexpr size_type	capacity () const noexcept

constexpr const_iterator	begin () const noexcept

constexpr const_iterator	end () const noexcept

constexpr const_reverse_iterator	crbegin () const noexcept

constexpr const_reverse_iterator	crend () const noexcept

constexpr const_reverse_iterator	rbegin () const noexcept

constexpr const_reverse_iterator	rend () const noexcept

constexpr void	clear () noexcept

constexpr bool	empty () const noexcept

constexpr iterator	erase (const_iterator first, const_iterator last)

constexpr iterator	erase (const_iterator position)

constexpr iterator	replace (const value_type &val)

constexpr size_type	size () const noexcept

constexpr void	shrink_to_fit ()

constexpr bool	sorted (const bool allow_multiple=false) const

constexpr bool	contains (const value_type &val) const

constexpr const_iterator	find (const value_type &val) const

constexpr const_reference	front () const noexcept

constexpr const_reference	back () const noexcept

constexpr const T *	data () const noexcept

constexpr T *	data () noexcept

constexpr void	swap (std::vector< T > &other) noexcept

constexpr void	swap (SortedVector &other) noexcept

constexpr const_reference	at (size_type n) const

constexpr const_reference	operator[] (size_type n) const noexcept

constexpr SortedVector &	operator= (const SortedVector &other)

constexpr SortedVector &	operator= (const std::vector< T > &other)

constexpr SortedVector &	operator= (std::initializer_list< value_type > l)

constexpr SortedVector &	operator= (SortedVector &&other)

constexpr SortedVector &	operator= (std::vector< T > &&other)

constexpr void	resize (size_type n, const value_type &el)

constexpr void	assign (std::initializer_list< value_type > l)

constexpr void	sort ()

constexpr iterator	find (const value_type &val)

constexpr iterator	insert (const value_type &val, bool replace=false)

constexpr bool	sorted (const Less &lesser, const bool allow_multiple=false) const

constexpr size_type	collapse (bool delete_first=true)

template<class Pred >
constexpr size_type	erase_if (Pred pred)

template<class InputIterator >
constexpr	SortedVector (InputIterator first, InputIterator last)

constexpr	SortedVector (std::initializer_list< value_type > l={})

	operator const std::vector< T > () const

Friends
template<class Pred >
constexpr size_type	erase_if (SortedVector &self, Pred pred)

Detailed Description

template<class T, class Less = std::less<T>>
class Ase::SortedVector< T, Less >

Vector that keeps its elements sorted.

Definition at line 223 of file sortnet.hh.