qlist.h File Reference

(7ce6920aacfcba485cd8017e01c6aeb324292e75)

#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>

Include dependency graph for qlist.h:

Go to the source code of this file.

Classes
struct	QListSpecialMethodsBase< T >
struct	QListSpecialMethods< T >
class	QList< T >
class	QList< T >::iterator
class	QList< T >::const_iterator

Namespaces
namespace	QtPrivate
	\macro QT_NO_KEYWORDS >

Macros
#define	QT_STRICT_QLIST_ITERATORS

Functions
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)

Macro Definition Documentation

QT_STRICT_QLIST_ITERATORS

#define QT_STRICT_QLIST_ITERATORS

Definition at line 63 of file qlist.h.

Function Documentation

erase()

template<typename T , typename AT >

qsizetype erase	(	QList< T > &	list,
		const AT &	t )

Definition at line 1007 of file qlist.h.

References list, and QtPrivate::sequential_erase().

Here is the call graph for this function:

erase_if()

template<typename T , typename Predicate >

qsizetype erase_if	(	QList< T > &	list,
		Predicate	pred )

Definition at line 1013 of file qlist.h.

References list, and QtPrivate::sequential_erase_if().

Here is the call graph for this function:

qHash()

template<typename T >

size_t qHash ( const QList< T > & key, size_t seed = 0 )

noexcept

Definition at line 1000 of file qlist.h.

References qHashRange(), and seed.

Here is the call graph for this function:

QList()

template<typename InputIterator , typename ValueType = typename std::iterator_traits<InputIterator>::value_type, QtPrivate::IfIsInputIterator< InputIterator > = true>

QList	(	InputIterator	,
		InputIterator	) -> QList< ValueType >

References capacity, d, QArrayData::GrowsAtEnd, and Q_ASSERT.

Referenced by QList< T >::mid().

Here is the caller graph for this function: