|
| | QVarLengthArray () noexcept |
| | QVarLengthArray (qsizetype size) |
| template<typename U = T, if_copyable< U > = true> |
| | QVarLengthArray (qsizetype sz, const T &v) |
| | QVarLengthArray (const QVarLengthArray &other) |
| | QVarLengthArray (QVarLengthArray &&other) noexcept(std::is_nothrow_move_constructible_v< T >) |
| | QVarLengthArray (std::initializer_list< T > args) |
| template<typename InputIterator, if_input_iterator< 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) |
| template<typename U = T, if_copyable< U > = true> |
| void | resize (qsizetype sz, const T &v) |
| 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) |
| QVarLengthArray & | assign (qsizetype n, const T &t) |
| template<typename InputIterator, if_input_iterator< InputIterator > = true> |
| QVarLengthArray & | assign (InputIterator first, InputIterator last) |
| QVarLengthArray & | assign (std::initializer_list< T > list) |
| 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) |
| constexpr qsizetype | max_size () const noexcept |
| void | clear () |
| 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) |
| 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) |
| void | clear () |
| iterator | erase (const_iterator begin, const_iterator end) |
| iterator | erase (const_iterator pos) |
| constexpr qsizetype | max_size () const noexcept |
| 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 Iterator> |
| Q_OUTOFLINE_TEMPLATE void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last, std::forward_iterator_tag) |
| template<typename Iterator> |
| Q_OUTOFLINE_TEMPLATE void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last, std::input_iterator_tag) |
| template<typename Iterator> |
| Q_OUTOFLINE_TEMPLATE void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last) |
| 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, Qt::if_has_qt_compare_three_way< U, U > = true> |
| auto | compareThreeWay (const QVarLengthArray &lhs, const QVarLengthArray< T, Prealloc2 > &rhs) |
| 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)) |
|
| static constexpr qsizetype | maxSize () noexcept |
| using | malloced_ptr = std::unique_ptr<void, free_deleter> |
| | QVLAStorage ()=default |
| | QVLABase ()=default |
| void | growBy (qsizetype prealloc, void *array, qsizetype increment) |
| 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, const T &v) |
| void | resize_impl (qsizetype prealloc, void *array, qsizetype sz) |
| void | assign_impl (qsizetype prealloc, void *array, qsizetype n, const T &t) |
| template<typename Iterator> |
| void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last, std::forward_iterator_tag) |
| template<typename Iterator> |
| void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last, std::input_iterator_tag) |
| template<typename Iterator> |
| void | assign_impl (qsizetype prealloc, void *array, Iterator first, Iterator last) |
| bool | isValidIterator (const const_iterator &i) const |
| | QVLABaseBase ()=default |
| Q_ALWAYS_INLINE constexpr void | verify (qsizetype pos=0, qsizetype n=1) const |
| char | array [Prealloc *(Align > Size ? Align :Size)] |
| QT_WARNING_PUSH | QT_WARNING_DISABLE_DEPRECATED |
| qsizetype | a |
| qsizetype | s |
| void * | ptr |
template<class T,
qsizetype Prealloc>
class QVarLengthArray< T, Prealloc >
Definition at line 281 of file qvarlengtharray.h.