SortedVector< T, Less >

#include "sortnet.hh"

Inherits less< T >.

Public Types
using	const_iterator = typename std::vector< T >::const_iterator
using	const_reference = typename std::vector< T >::const_reference
using	const_reverse_iterator = typename std::vector< T >::const_reverse_iterator
using	iterator = typename std::vector< T >::iterator
using	reverse_iterator = typename std::vector< T >::reverse_iterator
using	size_type = typename std::vector< T >::size_type
using	value_type = typename std::vector< T >::value_type

Public Member Functions
constexpr void	assign (std::initializer_list< value_type > l)
constexpr const_reference	at (size_type n) const
constexpr const_reference	back () const noexcept
constexpr const_iterator	begin () const noexcept
constexpr size_type	capacity () const noexcept
constexpr void	clear () noexcept
constexpr size_type	collapse (bool delete_first=true)
constexpr bool	contains (const value_type &val) const
constexpr const_reverse_iterator	crbegin () const noexcept
constexpr const_reverse_iterator	crend () const noexcept
constexpr const T *	data () const noexcept
constexpr T *	data () noexcept
constexpr bool	empty () const noexcept
constexpr const_iterator	end () const noexcept
constexpr iterator	erase (const_iterator first, const_iterator last)
constexpr iterator	erase (const_iterator position)
template<class Pred >
constexpr size_type	erase_if (Pred pred)
constexpr iterator	find (const value_type &val)
constexpr const_iterator	find (const value_type &val) const
constexpr const_reference	front () const noexcept
constexpr iterator	insert (const value_type &val, bool replace=false)
	operator const std::vector< T > () const
constexpr SortedVector &	operator= (const SortedVector &other)
constexpr SortedVector &	operator= (const std::vector< T > &other)
constexpr SortedVector &	operator= (SortedVector &&other)
constexpr SortedVector &	operator= (std::initializer_list< value_type > l)
constexpr SortedVector &	operator= (std::vector< T > &&other)
constexpr const_reference	operator[] (size_type n) const noexcept
constexpr const_reverse_iterator	rbegin () const noexcept
constexpr const_reverse_iterator	rend () const noexcept
constexpr iterator	replace (const value_type &val)
constexpr void	reserve (size_type n)
constexpr void	resize (size_type n, const value_type &el)
constexpr void	shrink_to_fit ()
constexpr size_type	size () const noexcept
constexpr void	sort ()
constexpr bool	sorted (const bool allow_multiple=false) const
constexpr bool	sorted (const Less &lesser, const bool allow_multiple=false) const
template<class InputIterator >
constexpr	SortedVector (InputIterator first, InputIterator last)
constexpr	SortedVector (std::initializer_list< value_type > l={})
constexpr void	swap (SortedVector &other) noexcept
constexpr void	swap (std::vector< T > &other) noexcept

Detailed Description

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

Vector that keeps its elements sorted.

Member Typedef Documentation

size_type

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

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

value_type

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

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

iterator

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

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

const_iterator

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

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

reverse_iterator

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

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

const_reverse_iterator

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

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

const_reference

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

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

Constructor & Destructor Documentation

SortedVector() [1/2]

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

template<class InputIterator >

constexpr SortedVector ( InputIterator first, InputIterator last )

constexpr

SortedVector() [2/2]

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

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

constexpr

Member Function Documentation

reserve()

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

constexpr void reserve ( size_type n )

constexpr

capacity()

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

constexpr size_type capacity ( ) const

constexprnoexcept

begin()

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

constexpr const_iterator begin ( ) const

constexprnoexcept

end()

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

constexpr const_iterator end ( ) const

constexprnoexcept

crbegin()

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

constexpr const_reverse_iterator crbegin ( ) const

constexprnoexcept

crend()

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

constexpr const_reverse_iterator crend ( ) const

constexprnoexcept

rbegin()

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

constexpr const_reverse_iterator rbegin ( ) const

constexprnoexcept

rend()

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

constexpr const_reverse_iterator rend ( ) const

constexprnoexcept

clear()

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

constexpr void clear ( )

constexprnoexcept

empty()

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

constexpr bool empty ( ) const

constexprnoexcept

erase() [1/2]

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

constexpr iterator erase ( const_iterator first, const_iterator last )

constexpr

erase() [2/2]

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

constexpr iterator erase ( const_iterator position )

constexpr

replace()

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

constexpr iterator replace ( const value_type & val )

constexpr

size()

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

constexpr size_type size ( ) const

constexprnoexcept

shrink_to_fit()

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

constexpr void shrink_to_fit ( )

constexpr

sorted() [1/2]

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

constexpr bool sorted ( const bool allow_multiple = false ) const

constexpr

contains()

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

constexpr bool contains ( const value_type & val ) const

constexpr

find() [1/2]

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

constexpr const_iterator find ( const value_type & val ) const

constexpr

front()

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

constexpr const_reference front ( ) const

constexprnoexcept

back()

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

constexpr const_reference back ( ) const

constexprnoexcept

data() [1/2]

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

constexpr const T * data ( ) const

constexprnoexcept

data() [2/2]

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

constexpr T * data ( )

constexprnoexcept

swap() [1/2]

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

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

constexprnoexcept

swap() [2/2]

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

constexpr void swap ( SortedVector< T, Less > & other )

constexprnoexcept

at()

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

constexpr const_reference at ( size_type n ) const

constexpr

operator[]()

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

constexpr const_reference operator[] ( size_type n ) const

constexprnoexcept

operator=() [1/5]

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

constexpr SortedVector & operator= ( const SortedVector< T, Less > & other )

constexpr

operator=() [2/5]

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

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

constexpr

operator=() [3/5]

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

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

constexpr

operator=() [4/5]

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

constexpr SortedVector & operator= ( SortedVector< T, Less > && other )

constexpr

operator=() [5/5]

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

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

constexpr

resize()

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

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

constexpr

assign()

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

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

constexpr

sort()

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

constexpr void sort ( )

constexpr

find() [2/2]

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

constexpr iterator find ( const value_type & val )

constexpr

insert()

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

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

constexpr

sorted() [2/2]

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

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

constexpr

collapse()

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

constexpr size_type collapse ( bool delete_first = true )

constexpr

erase_if()

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

template<class Pred >

constexpr size_type erase_if ( Pred pred )

constexpr

operator const std::vector< T >()

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

operator const std::vector< T >

(

)

const