#include <QtCore/qarraydatapointer.h>
#include <QtCore/qnamespace.h>
#include <QtCore/qhashfunctions.h>
#include <QtCore/qiterator.h>
#include <QtCore/qcontainertools_impl.h>
#include <functional>
#include <limits>
#include <initializer_list>
#include <type_traits>
#include <QtCore/qbytearraylist.h>
#include <QtCore/qstringlist.h>
Go to the source code of this file.
|
template<typename V , typename U > |
qsizetype | QtPrivate::indexOf (const QList< V > &list, const U &u, qsizetype from) noexcept |
|
template<typename V , typename U > |
qsizetype | QtPrivate::lastIndexOf (const QList< V > &list, const U &u, qsizetype from) noexcept |
|
template<typename InputIterator , typename ValueType = typename std::iterator_traits<InputIterator>::value_type, QtPrivate::IfIsInputIterator< InputIterator > = true> |
| QList (InputIterator, InputIterator) -> QList< ValueType > |
|
template<typename T , typename U > |
qsizetype | QtPrivate::indexOf (const QList< T > &vector, const U &u, qsizetype from) noexcept |
|
template<typename T , typename U > |
qsizetype | QtPrivate::lastIndexOf (const QList< T > &vector, const U &u, qsizetype from) noexcept |
|
template<typename T > |
size_t | qHash (const QList< T > &key, size_t seed=0) noexcept(noexcept(qHashRange(key.cbegin(), key.cend(), seed))) |
|
template<typename T , typename AT > |
qsizetype | erase (QList< T > &list, const AT &t) |
|
template<typename T , typename Predicate > |
qsizetype | erase_if (QList< T > &list, Predicate pred) |
|
◆ QT_STRICT_QLIST_ITERATORS
#define QT_STRICT_QLIST_ITERATORS |
◆ erase()
template<typename T , typename AT >
◆ erase_if()
template<typename T , typename Predicate >
◆ qHash()
template<typename T >
size_t qHash |
( |
const QList< T > & |
key, |
|
|
size_t |
seed = 0 |
|
) |
| |
|
noexcept |
◆ QList()
template<typename InputIterator , typename ValueType = typename std::iterator_traits<InputIterator>::value_type, QtPrivate::IfIsInputIterator< InputIterator > = true>