LibreOffice Module o3tl (master)  1
Public Types | Public Member Functions | List of all members
o3tl::sorted_vector< Value, Compare, Find, false > Class Template Reference

#include <sorted_vector.hxx>

Inheritance diagram for o3tl::sorted_vector< Value, Compare, Find, false >:
[legend]
Collaboration diagram for o3tl::sorted_vector< Value, Compare, Find, false >:
[legend]

Public Types

typedef sorted_vector< Value, Compare, Find, true > super_sorted_vector
 
- Public Types inherited from o3tl::sorted_vector< Value, Compare, Find, true >
typedef std::vector< Value >::const_iterator const_iterator
 
typedef std::vector< Value >::const_reverse_iterator const_reverse_iterator
 
typedef std::vector< Value >::difference_type difference_type
 
typedef std::vector< Value >::size_type size_type
 
typedef Value value_type
 

Public Member Functions

 sorted_vector (sorted_vector const &)=delete
 
sorted_vectoroperator= (sorted_vector const &)=delete
 
 sorted_vector ()=default
 
 sorted_vector (sorted_vector &&)=default
 
sorted_vectoroperator= (sorted_vector &&)=default
 
super_sorted_vector::const_iterator find (typename Value::element_type const *x) const
 implement find for sorted_vectors containing std::unique_ptr More...
 
super_sorted_vector::const_iterator upper_bound (typename Value::element_type const *x) const
 implement upper_bound for sorted_vectors containing std::unique_ptr More...
 
super_sorted_vector::const_iterator lower_bound (typename Value::element_type const *x) const
 implement lower_bound for sorted_vectors containing std::unique_ptr More...
 
- Public Member Functions inherited from o3tl::sorted_vector< Value, Compare, Find, true >
constexpr sorted_vector (std::initializer_list< Value > init)
 
 sorted_vector ()=default
 
 sorted_vector (sorted_vector const &)=default
 
 sorted_vector (sorted_vector &&)=default
 
sorted_vectoroperator= (sorted_vector const &)=default
 
sorted_vectoroperator= (sorted_vector &&)=default
 
std::pair< const_iterator, bool > insert (Value &&x)
 
std::pair< const_iterator, bool > insert (const Value &x)
 
void insert (sorted_vector< Value, Compare, Find > const &rOther)
 
size_type erase (const Value &x)
 
void erase (size_t index)
 
const_iterator erase (const_iterator const &position)
 
void erase (const_iterator const &first, const_iterator const &last)
 
Value erase_extract (size_t index)
 make erase return the removed element, otherwise there is no useful way of extracting a std::unique_ptr from this. More...
 
void clear ()
 
void swap (sorted_vector &other)
 
void reserve (size_type amount)
 
size_type size () const
 
bool empty () const
 
const_iterator begin () const
 
const_iterator end () const
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator rend () const
 
const Valuefront () const
 
const Valueback () const
 
const Valueoperator[] (size_t index) const
 
const_iterator lower_bound (const Value &x) const
 
const_iterator upper_bound (const Value &x) const
 
const_iterator find (const Value &x) const
 
size_type count (const Value &v) const
 
bool operator== (const sorted_vector &other) const
 
bool operator!= (const sorted_vector &other) const
 
void DeleteAndDestroyAll ()
 
void Resort ()
 

Detailed Description

template<typename Value, typename Compare, template< typename, typename > class Find>
class o3tl::sorted_vector< Value, Compare, Find, false >

Definition at line 280 of file sorted_vector.hxx.

Member Typedef Documentation

template<typename Value , typename Compare , template< typename, typename > class Find>
typedef sorted_vector<Value, Compare, Find, true> o3tl::sorted_vector< Value, Compare, Find, false >::super_sorted_vector

Definition at line 284 of file sorted_vector.hxx.

Constructor & Destructor Documentation

template<typename Value , typename Compare , template< typename, typename > class Find>
o3tl::sorted_vector< Value, Compare, Find, false >::sorted_vector ( sorted_vector< Value, Compare, Find, false > const &  )
delete
template<typename Value , typename Compare , template< typename, typename > class Find>
o3tl::sorted_vector< Value, Compare, Find, false >::sorted_vector ( )
default
template<typename Value , typename Compare , template< typename, typename > class Find>
o3tl::sorted_vector< Value, Compare, Find, false >::sorted_vector ( sorted_vector< Value, Compare, Find, false > &&  )
default

Member Function Documentation

template<typename Value , typename Compare , template< typename, typename > class Find>
super_sorted_vector::const_iterator o3tl::sorted_vector< Value, Compare, Find, false >::find ( typename Value::element_type const *  x) const
inline

implement find for sorted_vectors containing std::unique_ptr

Definition at line 296 of file sorted_vector.hxx.

References Value.

template<typename Value , typename Compare , template< typename, typename > class Find>
super_sorted_vector::const_iterator o3tl::sorted_vector< Value, Compare, Find, false >::lower_bound ( typename Value::element_type const *  x) const
inline

implement lower_bound for sorted_vectors containing std::unique_ptr

Definition at line 316 of file sorted_vector.hxx.

References Value.

template<typename Value , typename Compare , template< typename, typename > class Find>
sorted_vector& o3tl::sorted_vector< Value, Compare, Find, false >::operator= ( sorted_vector< Value, Compare, Find, false > const &  )
delete
template<typename Value , typename Compare , template< typename, typename > class Find>
sorted_vector& o3tl::sorted_vector< Value, Compare, Find, false >::operator= ( sorted_vector< Value, Compare, Find, false > &&  )
default
template<typename Value , typename Compare , template< typename, typename > class Find>
super_sorted_vector::const_iterator o3tl::sorted_vector< Value, Compare, Find, false >::upper_bound ( typename Value::element_type const *  x) const
inline

implement upper_bound for sorted_vectors containing std::unique_ptr

Definition at line 306 of file sorted_vector.hxx.

References Value.


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