![]() |
Qt 6.x
The Qt SDK
|
#include <qquickparticlesystem_p.h>
Public Member Functions | |
void | insert (const T &element) |
bool | removeOne (const T &element) |
![]() | |
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) |
void | clear () |
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) |
void | clear () |
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 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 |
Definition at line 36 of file qquickparticlesystem_p.h.
|
inline |
Definition at line 39 of file qquickparticlesystem_p.h.
References QVarLengthArray< T, Prealloc >::append(), and QVarLengthArray< T, Prealloc >::contains().
|
inline |
Definition at line 46 of file qquickparticlesystem_p.h.
References at, i, QVarLengthArray< T, Prealloc >::remove(), and QVLABaseBase::size().