|
| QVarLengthArray () noexcept |
|
| QVarLengthArray (qsizetype size) |
|
| QVarLengthArray (const QVarLengthArray &other) |
|
| QVarLengthArray (QVarLengthArray &&other) noexcept(std::is_nothrow_move_constructible_v< T >) |
|
| QVarLengthArray (std::initializer_list< T > args) |
|
template<typename InputIterator , QtPrivate::IfIsInputIterator< InputIterator > = true> |
| QVarLengthArray (InputIterator first, InputIterator last) |
|
| ~QVarLengthArray () |
|
QVarLengthArray< T, Prealloc > & | operator= (const QVarLengthArray< T, Prealloc > &other) |
|
QVarLengthArray & | operator= (QVarLengthArray &&other) noexcept(std::is_nothrow_move_constructible_v< T >) |
|
QVarLengthArray< T, Prealloc > & | operator= (std::initializer_list< T > list) |
|
void | removeLast () |
|
qsizetype | count () const |
|
qsizetype | length () const |
|
T & | first () |
|
const T & | first () const |
|
T & | last () |
|
const T & | last () const |
|
bool | isEmpty () const |
|
void | resize (qsizetype sz) |
|
void | clear () |
|
void | squeeze () |
|
void | reserve (qsizetype sz) |
|
const T & | at (qsizetype idx) const |
|
void | append (const T &t) |
|
void | append (T &&t) |
|
void | append (const T *buf, qsizetype sz) |
|
QVarLengthArray< T, Prealloc > & | operator<< (const T &t) |
|
QVarLengthArray< T, Prealloc > & | operator<< (T &&t) |
|
QVarLengthArray< T, Prealloc > & | operator+= (const T &t) |
|
QVarLengthArray< T, Prealloc > & | operator+= (T &&t) |
|
void | insert (qsizetype i, T &&t) |
|
void | insert (qsizetype i, const T &t) |
|
void | insert (qsizetype i, qsizetype n, const T &t) |
|
const T * | constData () const |
|
auto | constBegin () const -> const_iterator |
|
const_iterator | constEnd () const |
|
iterator | insert (const_iterator before, qsizetype n, const T &x) |
|
iterator | insert (const_iterator before, T &&x) |
|
iterator | insert (const_iterator before, const T &x) |
|
void | push_back (const T &t) |
|
void | push_back (T &&t) |
|
void | shrink_to_fit () |
|
template<typename... Args> |
iterator | emplace (const_iterator pos, Args &&...args) |
|
template<typename... Args> |
T & | emplace_back (Args &&...args) |
|
template<typename AT = T> |
qsizetype | indexOf (const AT &t, qsizetype from=0) const |
|
template<typename AT > |
Q_INLINE_TEMPLATE qsizetype | indexOf (const AT &t, qsizetype from) const |
|
template<typename AT = T> |
qsizetype | lastIndexOf (const AT &t, qsizetype from=-1) const |
|
template<typename AT > |
Q_INLINE_TEMPLATE qsizetype | lastIndexOf (const AT &t, qsizetype from) const |
|
template<typename AT = T> |
bool | contains (const AT &t) const |
|
template<typename AT > |
Q_INLINE_TEMPLATE bool | contains (const AT &t) const |
|
value_type | value (qsizetype i) const |
|
value_type | value (qsizetype i, const T &defaultValue) const |
|
void | replace (qsizetype i, const T &t) |
|
void | remove (qsizetype i, qsizetype n=1) |
|
template<typename AT = T> |
qsizetype | removeAll (const AT &t) |
|
template<typename AT = T> |
bool | removeOne (const AT &t) |
|
template<typename Predicate > |
qsizetype | removeIf (Predicate pred) |
|
T * | data () noexcept |
|
const T * | data () const noexcept |
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
|
const_iterator | cbegin () const noexcept |
|
iterator | end () noexcept |
|
const_iterator | end () const noexcept |
|
const_iterator | cend () const noexcept |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rbegin () const noexcept |
|
const_reverse_iterator | crbegin () const noexcept |
|
reverse_iterator | rend () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
const_reverse_iterator | crend () const noexcept |
|
iterator | erase (const_iterator begin, const_iterator end) |
|
iterator | erase (const_iterator pos) |
|
void | pop_back () |
|
reference | front () |
|
const_reference | front () const |
|
reference | back () |
|
const_reference | back () const |
|
T * | data () noexcept |
|
const T * | data () const noexcept |
|
iterator | begin () noexcept |
|
const_iterator | begin () const noexcept |
|
const_iterator | cbegin () const noexcept |
|
iterator | end () noexcept |
|
const_iterator | end () const noexcept |
|
const_iterator | cend () const noexcept |
|
reverse_iterator | rbegin () noexcept |
|
const_reverse_iterator | rbegin () const noexcept |
|
const_reverse_iterator | crbegin () const noexcept |
|
reverse_iterator | rend () noexcept |
|
const_reverse_iterator | rend () const noexcept |
|
const_reverse_iterator | crend () const noexcept |
|
reference | front () |
|
const_reference | front () const |
|
reference | back () |
|
const_reference | back () const |
|
void | pop_back () |
|
template<typename AT = T> |
qsizetype | indexOf (const AT &t, qsizetype from=0) const |
|
template<typename AT = T> |
qsizetype | lastIndexOf (const AT &t, qsizetype from=-1) const |
|
template<typename AT = T> |
bool | contains (const AT &t) const |
|
reference | operator[] (qsizetype idx) |
|
const_reference | operator[] (qsizetype idx) const |
|
value_type | value (qsizetype i) const |
|
value_type | value (qsizetype i, const T &defaultValue) const |
|
void | replace (qsizetype i, const T &t) |
|
void | remove (qsizetype i, qsizetype n=1) |
|
template<typename AT = T> |
qsizetype | removeAll (const AT &t) |
|
template<typename AT = T> |
bool | removeOne (const AT &t) |
|
template<typename Predicate > |
qsizetype | removeIf (Predicate pred) |
|
iterator | erase (const_iterator begin, const_iterator end) |
|
iterator | erase (const_iterator pos) |
|
size_t | hash (size_t seed) const noexcept(QtPrivate::QNothrowHashable_v< T >) |
|
template<typename AT > |
Q_INLINE_TEMPLATE qsizetype | indexOf (const AT &t, qsizetype from) const |
|
template<typename AT > |
Q_INLINE_TEMPLATE qsizetype | lastIndexOf (const AT &t, qsizetype from) const |
|
template<typename AT > |
Q_INLINE_TEMPLATE bool | contains (const AT &t) const |
|
template<typename... Args> |
Q_OUTOFLINE_TEMPLATE auto | emplace_impl (qsizetype prealloc, void *array, const_iterator before, Args &&...args) -> iterator |
|
constexpr size_type | capacity () const noexcept |
|
constexpr size_type | size () const noexcept |
|
constexpr bool | empty () const noexcept |
|
|
template<class S , qsizetype Prealloc2> |
class | QVarLengthArray |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_eq_result< U > | operator== (const QVarLengthArray< T, Prealloc > &l, const QVarLengthArray< T, Prealloc2 > &r) |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_eq_result< U > | operator!= (const QVarLengthArray< T, Prealloc > &l, const QVarLengthArray< T, Prealloc2 > &r) |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_lt_result< U > | operator< (const QVarLengthArray< T, Prealloc > &lhs, const QVarLengthArray< T, Prealloc2 > &rhs) noexcept(noexcept(std::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end()))) |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_lt_result< U > | operator> (const QVarLengthArray< T, Prealloc > &lhs, const QVarLengthArray< T, Prealloc2 > &rhs) noexcept(noexcept(lhs< rhs)) |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_lt_result< U > | operator<= (const QVarLengthArray< T, Prealloc > &lhs, const QVarLengthArray< T, Prealloc2 > &rhs) noexcept(noexcept(lhs< rhs)) |
|
template<typename U = T, qsizetype Prealloc2 = Prealloc> |
QTypeTraits::compare_lt_result< U > | operator>= (const QVarLengthArray< T, Prealloc > &lhs, const QVarLengthArray< T, Prealloc2 > &rhs) noexcept(noexcept(lhs< rhs)) |
|
|
using | malloced_ptr = std::unique_ptr< void, free_deleter > |
|
| ~QVLABase ()=default |
|
template<typename... Args> |
reference | emplace_back_impl (qsizetype prealloc, void *array, Args &&...args) |
|
template<typename... Args> |
iterator | emplace_impl (qsizetype prealloc, void *array, const_iterator pos, Args &&...arg) |
|
iterator | insert_impl (qsizetype prealloc, void *array, const_iterator pos, qsizetype n, const T &t) |
|
template<typename S > |
bool | equal (const QVLABase< S > &other) const |
|
template<typename S > |
bool | less_than (const QVLABase< S > &other) const |
|
void | append_impl (qsizetype prealloc, void *array, const T *buf, qsizetype n) |
|
void | reallocate_impl (qsizetype prealloc, void *array, qsizetype size, qsizetype alloc) |
|
void | resize_impl (qsizetype prealloc, void *array, qsizetype sz) |
|
bool | isValidIterator (const const_iterator &i) const |
|
| ~QVLABaseBase ()=default |
|
constexpr Q_ALWAYS_INLINE void | verify (qsizetype pos=0, qsizetype n=1) const |
|
| ~QVLAStorage ()=default |
|
qsizetype | a |
|
qsizetype | s |
|
void * | ptr |
|
char | array [Prealloc *(Align > Size ? Align :Size)] |
|
QT_WARNING_PUSH | QT_WARNING_DISABLE_DEPRECATED |
|
template<class T, qsizetype Prealloc>
class QVarLengthArray< T, Prealloc >
Definition at line 258 of file qvarlengtharray.h.