#include <sorted_vector.hxx>
Inheritance diagram for o3tl::sorted_vector< Value, Compare, Find, false >:
Collaboration diagram for o3tl::sorted_vector< Value, Compare, Find, false >:
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_vector & | operator= (sorted_vector const &)=delete |
| sorted_vector ()=default | |
| sorted_vector (sorted_vector &&)=default | |
| sorted_vector & | operator= (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_vector & | operator= (sorted_vector const &)=default |
| sorted_vector & | operator= (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) |
| const_iterator | erase (const_iterator const &position) |
| void | erase (const_iterator const &first, const_iterator const &last) |
| void | erase_at (size_t index) |
| 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 Value & | front () const |
| const Value & | back () const |
| const Value & | operator[] (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 | insert_sorted_unique_vector (const std::vector< Value > &rOther) |
| void | insert_sorted_unique_vector (std::vector< Value > &&rOther) |
| void | DeleteAndDestroyAll () |
| void | Resort () |
Detailed Description
template<typename Value, typename Compare, template< typename, typename > class Find>
class o3tl::sorted_vector< Value, Compare, Find, false >
class o3tl::sorted_vector< Value, Compare, Find, false >
Definition at line 311 of file sorted_vector.hxx.
Member Typedef Documentation
◆ super_sorted_vector
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 315 of file sorted_vector.hxx.
Constructor & Destructor Documentation
◆ sorted_vector() [1/3]
template<typename Value , typename Compare , template< typename, typename > class Find>
|
delete |
◆ sorted_vector() [2/3]
template<typename Value , typename Compare , template< typename, typename > class Find>
|
default |
◆ sorted_vector() [3/3]
template<typename Value , typename Compare , template< typename, typename > class Find>
|
default |
Member Function Documentation
◆ find()
template<typename Value , typename Compare , template< typename, typename > class Find>
|
inline |
implement find for sorted_vectors containing std::unique_ptr
Definition at line 327 of file sorted_vector.hxx.
◆ lower_bound()
template<typename Value , typename Compare , template< typename, typename > class Find>
|
inline |
implement lower_bound for sorted_vectors containing std::unique_ptr
Definition at line 349 of file sorted_vector.hxx.
◆ operator=() [1/2]
template<typename Value , typename Compare , template< typename, typename > class Find>
|
default |
◆ operator=() [2/2]
template<typename Value , typename Compare , template< typename, typename > class Find>
|
delete |
◆ upper_bound()
template<typename Value , typename Compare , template< typename, typename > class Find>
|
inline |
implement upper_bound for sorted_vectors containing std::unique_ptr
Definition at line 338 of file sorted_vector.hxx.
The documentation for this class was generated from the following file:
