Class Ase::SortedVector

template <class T, class Less>

ClassList > Ase > SortedVector

Vector that keeps its elements sorted.

• #include <sortnet.hh>

Inherits the following classes: std::less< T >

Public Types

Type	Name
typedef typename std::vector< T >::const_iterator	const_iterator
typedef typename std::vector< T >::const_reference	const_reference
typedef typename std::vector< T >::const_reverse_iterator	const_reverse_iterator
typedef typename std::vector< T >::iterator	iterator
typedef typename std::vector< T >::reverse_iterator	reverse_iterator
typedef typename std::vector< T >::size_type	size_type
typedef typename std::vector< T >::value_type	value_type

Public Functions

Type	Name
constexpr	SortedVector (InputIterator first, InputIterator last)
constexpr	SortedVector (std::initializer_list< value_type > l={})
constexpr void	assign (std::initializer_list< value_type > l)
constexpr const_reference	at (size_type n) const
constexpr const_reference	back () noexcept const
constexpr const_iterator	begin () noexcept const
constexpr size_type	capacity () noexcept const
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 () noexcept const
constexpr const_reverse_iterator	crend () noexcept const
constexpr const T *	data () noexcept const
constexpr T *	data () noexcept
constexpr bool	empty () noexcept const
constexpr const_iterator	end () noexcept const
constexpr iterator	erase (const_iterator first, const_iterator last)
constexpr iterator	erase (const_iterator position)
constexpr size_type	erase_if (Pred pred)
constexpr const_iterator	find (const value_type & val) const
constexpr iterator	find (const value_type & val)
constexpr const_reference	front () noexcept const
constexpr iterator	insert (const value_type & val, bool replace=false)
	vector< T > () const
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 const_reference	operator[] (size_type n) noexcept const
constexpr const_reverse_iterator	rbegin () noexcept const
constexpr const_reverse_iterator	rend () noexcept const
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 () noexcept const
constexpr void	sort ()
constexpr bool	sorted (const bool allow_multiple=false) const
constexpr bool	sorted (const Less & lesser, const bool allow_multiple=false) const
constexpr void	swap (std::vector< T > & other) noexcept
constexpr void	swap (SortedVector & other) noexcept

Public Types Documentation

typedef const_iterator

using Ase::SortedVector< T, Less >::const_iterator =  typename std::vector<T>::const_iterator;

---

typedef const_reference

using Ase::SortedVector< T, Less >::const_reference =  typename std::vector<T>::const_reference;

---

typedef const_reverse_iterator

using Ase::SortedVector< T, Less >::const_reverse_iterator =  typename std::vector<T>::const_reverse_iterator;

---

typedef iterator

using Ase::SortedVector< T, Less >::iterator =  typename std::vector<T>::iterator;

---

typedef reverse_iterator

using Ase::SortedVector< T, Less >::reverse_iterator =  typename std::vector<T>::reverse_iterator;

---

typedef size_type

using Ase::SortedVector< T, Less >::size_type =  typename std::vector<T>::size_type;

---

typedef value_type

using Ase::SortedVector< T, Less >::value_type =  typename std::vector<T>::value_type;

---

Public Functions Documentation

function SortedVector [1/2]

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

---

function SortedVector [2/2]

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

---

function assign

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

---

function at

inline constexpr const_reference Ase::SortedVector::at (
    size_type n
) const

---

function back

inline constexpr const_reference Ase::SortedVector::back () noexcept const

---

function begin

inline constexpr const_iterator Ase::SortedVector::begin () noexcept const

---

function capacity

inline constexpr size_type Ase::SortedVector::capacity () noexcept const

---

function clear

inline constexpr void Ase::SortedVector::clear () noexcept

---

function collapse

inline constexpr size_type Ase::SortedVector::collapse (
    bool delete_first=true
) 

---

function contains

inline constexpr bool Ase::SortedVector::contains (
    const value_type & val
) const

---

function crbegin

inline constexpr const_reverse_iterator Ase::SortedVector::crbegin () noexcept const

---

function crend

inline constexpr const_reverse_iterator Ase::SortedVector::crend () noexcept const

---

function data [1/2]

inline constexpr const T * Ase::SortedVector::data () noexcept const

---

function data [2/2]

inline constexpr T * Ase::SortedVector::data () noexcept

---

function empty

inline constexpr bool Ase::SortedVector::empty () noexcept const

---

function end

inline constexpr const_iterator Ase::SortedVector::end () noexcept const

---

function erase [1/2]

inline constexpr iterator Ase::SortedVector::erase (
    const_iterator first,
    const_iterator last
) 

---

function erase [2/2]

inline constexpr iterator Ase::SortedVector::erase (
    const_iterator position
) 

---

function erase_if [1/2]

template<class Pred>
inline constexpr size_type Ase::SortedVector::erase_if (
    Pred pred
) 

---

function find [1/2]

inline constexpr const_iterator Ase::SortedVector::find (
    const value_type & val
) const

---

function find [2/2]

inline constexpr iterator Ase::SortedVector::find (
    const value_type & val
) 

---

function front

inline constexpr const_reference Ase::SortedVector::front () noexcept const

---

function insert

inline constexpr iterator Ase::SortedVector::insert (
    const value_type & val,
    bool replace=false
) 

---

function vector< T >

inline Ase::SortedVector::vector< T > () const

---

function operator=

inline constexpr SortedVector & Ase::SortedVector::operator= (
    const SortedVector & other
) 

---

function operator=

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

---

function operator=

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

---

function operator=

inline constexpr SortedVector & Ase::SortedVector::operator= (
    SortedVector && other
) 

---

function operator=

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

---

function operator[]

inline constexpr const_reference Ase::SortedVector::operator[] (
    size_type n
) noexcept const

---

function rbegin

inline constexpr const_reverse_iterator Ase::SortedVector::rbegin () noexcept const

---

function rend

inline constexpr const_reverse_iterator Ase::SortedVector::rend () noexcept const

---

function replace

inline constexpr iterator Ase::SortedVector::replace (
    const value_type & val
) 

---

function reserve

inline constexpr void Ase::SortedVector::reserve (
    size_type n
) 

---

function resize

inline constexpr void Ase::SortedVector::resize (
    size_type n,
    const value_type & el
) 

---

function shrink_to_fit

inline constexpr void Ase::SortedVector::shrink_to_fit () 

---

function size

inline constexpr size_type Ase::SortedVector::size () noexcept const

---

function sort

inline constexpr void Ase::SortedVector::sort () 

---

function sorted [1/2]

inline constexpr bool Ase::SortedVector::sorted (
    const bool allow_multiple=false
) const

---

function sorted [2/2]

inline constexpr bool Ase::SortedVector::sorted (
    const Less & lesser,
    const bool allow_multiple=false
) const

---

function swap [1/2]

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

---

function swap [2/2]

inline constexpr void Ase::SortedVector::swap (
    SortedVector & other
) noexcept

---

Friends Documentation

friend erase_if [2/2]

template<class Pred>
inline constexpr size_type Ase::SortedVector::erase_if (
    SortedVector & self,
    Pred pred
) 

---

---

The documentation for this class was generated from the following file /__w/anklang/anklang/ase/sortnet.hh