LibreOffice Module o3tl (master)
1
|
Represents a sorted vector of values. More...
#include <sorted_vector.hxx>
Public Types | |
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 | |
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) |
size_type | erase (const Value &x) |
void | erase_at (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 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_vector< Value, Compare, Find > const &rOther) |
void | DeleteAndDestroyAll () |
void | Resort () |
Private Types | |
typedef Find< Value, Compare > | Find_t |
typedef std::vector< Value > | vector_t |
typedef std::vector< Value >::iterator | iterator |
Private Attributes | |
vector_t | m_vector |
Represents a sorted vector of values.
Definition at line 37 of file sorted_vector.hxx.
typedef std::vector<Value>::const_iterator o3tl::sorted_vector< Value, Compare, Find, bool >::const_iterator |
Definition at line 44 of file sorted_vector.hxx.
typedef std::vector<Value>::const_reverse_iterator o3tl::sorted_vector< Value, Compare, Find, bool >::const_reverse_iterator |
Definition at line 45 of file sorted_vector.hxx.
typedef std::vector<Value>::difference_type o3tl::sorted_vector< Value, Compare, Find, bool >::difference_type |
Definition at line 46 of file sorted_vector.hxx.
|
private |
Definition at line 40 of file sorted_vector.hxx.
|
private |
Definition at line 42 of file sorted_vector.hxx.
typedef std::vector<Value>::size_type o3tl::sorted_vector< Value, Compare, Find, bool >::size_type |
Definition at line 47 of file sorted_vector.hxx.
typedef Value o3tl::sorted_vector< Value, Compare, Find, bool >::value_type |
Definition at line 48 of file sorted_vector.hxx.
|
private |
Definition at line 41 of file sorted_vector.hxx.
|
inline |
Definition at line 50 of file sorted_vector.hxx.
|
default |
|
default |
|
default |
|
inline |
Definition at line 181 of file sorted_vector.hxx.
|
inline |
Definition at line 153 of file sorted_vector.hxx.
|
inline |
Definition at line 125 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::DeleteAndDestroyAll().
|
inline |
Definition at line 215 of file sorted_vector.hxx.
|
inline |
Definition at line 248 of file sorted_vector.hxx.
|
inline |
Definition at line 147 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::insert().
|
inline |
Definition at line 159 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::count().
|
inline |
Definition at line 86 of file sorted_vector.hxx.
|
inline |
Definition at line 103 of file sorted_vector.hxx.
|
inline |
Definition at line 108 of file sorted_vector.hxx.
|
inline |
Definition at line 97 of file sorted_vector.hxx.
|
inline |
make erase return the removed element, otherwise there is no useful way of extracting a std::unique_ptr from this.
Definition at line 118 of file sorted_vector.hxx.
|
inline |
Definition at line 209 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::count().
|
inline |
Definition at line 176 of file sorted_vector.hxx.
|
inline |
Definition at line 64 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::insert().
|
inline |
Definition at line 75 of file sorted_vector.hxx.
|
inline |
Definition at line 230 of file sorted_vector.hxx.
|
inline |
Definition at line 193 of file sorted_vector.hxx.
|
inline |
Definition at line 225 of file sorted_vector.hxx.
|
default |
|
default |
|
inline |
Definition at line 220 of file sorted_vector.hxx.
|
inline |
Definition at line 186 of file sorted_vector.hxx.
|
inline |
Definition at line 165 of file sorted_vector.hxx.
|
inline |
Definition at line 171 of file sorted_vector.hxx.
|
inline |
Definition at line 135 of file sorted_vector.hxx.
|
inline |
Definition at line 263 of file sorted_vector.hxx.
|
inline |
Definition at line 142 of file sorted_vector.hxx.
|
inline |
Definition at line 130 of file sorted_vector.hxx.
|
inline |
Definition at line 198 of file sorted_vector.hxx.
|
private |
Definition at line 270 of file sorted_vector.hxx.
Referenced by o3tl::sorted_vector< ScFormulaCellGroup * >::back(), o3tl::sorted_vector< ScFormulaCellGroup * >::begin(), o3tl::sorted_vector< ScFormulaCellGroup * >::clear(), o3tl::sorted_vector< ScFormulaCellGroup * >::DeleteAndDestroyAll(), o3tl::sorted_vector< ScFormulaCellGroup * >::empty(), o3tl::sorted_vector< ScFormulaCellGroup * >::end(), o3tl::sorted_vector< ScFormulaCellGroup * >::erase(), o3tl::sorted_vector< ScFormulaCellGroup * >::erase_at(), o3tl::sorted_vector< ScFormulaCellGroup * >::erase_extract(), o3tl::sorted_vector< ScFormulaCellGroup * >::find(), o3tl::sorted_vector< ScFormulaCellGroup * >::front(), o3tl::sorted_vector< ScFormulaCellGroup * >::insert(), o3tl::sorted_vector< ScFormulaCellGroup * >::lower_bound(), o3tl::sorted_vector< ScFormulaCellGroup * >::operator!=(), o3tl::sorted_vector< ScFormulaCellGroup * >::operator==(), o3tl::sorted_vector< ScFormulaCellGroup * >::operator[](), o3tl::sorted_vector< ScFormulaCellGroup * >::rbegin(), o3tl::sorted_vector< ScFormulaCellGroup * >::rend(), o3tl::sorted_vector< ScFormulaCellGroup * >::reserve(), o3tl::sorted_vector< ScFormulaCellGroup * >::Resort(), o3tl::sorted_vector< ScFormulaCellGroup * >::size(), o3tl::sorted_vector< ScFormulaCellGroup * >::sorted_vector(), o3tl::sorted_vector< ScFormulaCellGroup * >::swap(), and o3tl::sorted_vector< ScFormulaCellGroup * >::upper_bound().