<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html>
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<!-- qlist.cpp -->
<title>QList Class | Qt Core 5.12.6</title>
<link rel="stylesheet" type="text/css" href="style/offline-simple.css" />
<script type="text/javascript">
document.getElementsByTagName("link").item(0).setAttribute("href", "style/offline.css");
// loading style sheet breaks anchors that were jumped to before
// so force jumping to anchor again
setTimeout(function() {
var anchor = location.hash;
// need to jump to different anchor first (e.g. none)
location.hash = "#";
setTimeout(function() {
location.hash = anchor;
}, 0);
}, 0);
</script>
</head>
<body>
<div class="header" id="qtdocheader">
<div class="main">
<div class="main-rounded">
<div class="navigationbar">
<table><tr>
<td >Qt 5.12</td><td ><a href="qtcore-index.html">Qt Core</a></td><td ><a href="qtcore-module.html">C++ Classes</a></td><td >QList</td></tr></table><table class="buildversion"><tr>
<td id="buildversion" width="100%" align="right"><a href="qtcore-index.html">Qt 5.12.6 Reference Documentation</a></td>
</tr></table>
</div>
</div>
<div class="content">
<div class="line">
<div class="content mainContent">
<div class="sidebar">
<div class="toc">
<h3><a name="toc">Contents</a></h3>
<ul>
<li class="level1"><a href="#public-types">Public Types</a></li>
<li class="level1"><a href="#public-functions">Public Functions</a></li>
<li class="level1"><a href="#static-public-members">Static Public Members</a></li>
<li class="level1"><a href="#related-non-members">Related Non-Members</a></li>
<li class="level1"><a href="#details">Detailed Description</a></li>
<li class="level2"><a href="#more-members">More Members</a></li>
<li class="level2"><a href="#more-information-on-using-qt-containers">More Information on Using Qt Containers</a></li>
</ul>
</div>
<div class="sidebar-content" id="sidebar-content"></div></div>
<h1 class="title">QList Class</h1>
<!-- $$$QList-brief -->
<p>The <a href="qlist.html">QList</a> class is a template class that provides lists. <a href="#details">More...</a></p>
<!-- @@@QList -->
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> Header:</td><td class="memItemRight bottomAlign"> <span class="preprocessor">#include <QList></span>
</td></tr><tr><td class="memItemLeft rightAlign topAlign"> qmake:</td><td class="memItemRight bottomAlign"> QT += core</td></tr><tr><td class="memItemLeft rightAlign topAlign"> Inherited By:</td><td class="memItemRight bottomAlign"> <p><a href="qbytearraylist.html">QByteArrayList</a>, <a href="qitemselection.html">QItemSelection</a>, <a href="qqueue.html">QQueue</a>, and <a href="qstringlist.html">QStringList</a></p>
</td></tr></table></div><ul>
<li><a href="qlist-members.html">List of all members, including inherited members</a></li>
</ul>
<p><b>Note:</b> All functions in this class are reentrant.</p>
<a name="public-types"></a>
<h2 id="public-types">Public Types</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> class </td><td class="memItemRight bottomAlign"><b><a href="qlist-memorylayout.html">MemoryLayout</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> class </td><td class="memItemRight bottomAlign"><b><a href="qlist-const-iterator.html">const_iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> class </td><td class="memItemRight bottomAlign"><b><a href="qlist-iterator.html">iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#ConstIterator-typedef">ConstIterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#Iterator-typedef">Iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#const_pointer-typedef">const_pointer</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#const_reference-typedef">const_reference</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#const_reverse_iterator-typedef">const_reverse_iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#difference_type-typedef">difference_type</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#pointer-typedef">pointer</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#reference-typedef">reference</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#reverse_iterator-typedef">reverse_iterator</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#size_type-typedef">size_type</a></b></td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> typedef </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#value_type-typedef">value_type</a></b></td></tr>
</table></div>
<a name="public-functions"></a>
<h2 id="public-functions">Public Functions</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#QList">QList</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#QList-1">QList</a></b>(const QList<T> &<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#QList-2">QList</a></b>(QList<T> &&<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#QList-3">QList</a></b>(std::initializer_list<T> <i>args</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#dtor.QList">~QList</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#append">append</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#append-1">append</a></b>(const QList<T> &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#at">at</a></b>(int <i>i</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#back">back</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#back-1">back</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#begin">begin</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#begin-1">begin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#cbegin">cbegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#cend">cend</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#clear">clear</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#constBegin">constBegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#constEnd">constEnd</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#constFirst">constFirst</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#constLast">constLast</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#contains">contains</a></b>(const T &<i>value</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#count">count</a></b>(const T &<i>value</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#count-1">count</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#crbegin">crbegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#crend">crend</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#empty">empty</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#end">end</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#end-1">end</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#endsWith">endsWith</a></b>(const T &<i>value</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#erase">erase</a></b>(QList::iterator <i>pos</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#erase-1">erase</a></b>(QList::iterator <i>begin</i>, QList::iterator <i>end</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#first">first</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#first-1">first</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#front">front</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#front-1">front</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#indexOf">indexOf</a></b>(const T &<i>value</i>, int <i>from</i> = ...) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#insert">insert</a></b>(int <i>i</i>, const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#insert-1">insert</a></b>(QList::iterator <i>before</i>, const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#isEmpty">isEmpty</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#last">last</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#last-1">last</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#lastIndexOf">lastIndexOf</a></b>(const T &<i>value</i>, int <i>from</i> = ...) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#length">length</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#mid">mid</a></b>(int <i>pos</i>, int <i>length</i> = -1) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#move">move</a></b>(int <i>from</i>, int <i>to</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#pop_back">pop_back</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#pop_front">pop_front</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#prepend">prepend</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#push_back">push_back</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#push_front">push_front</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#rbegin">rbegin</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#rbegin-1">rbegin</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#removeAll">removeAll</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#removeAt">removeAt</a></b>(int <i>i</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#removeFirst">removeFirst</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#removeLast">removeLast</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#removeOne">removeOne</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#rend">rend</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList::const_reverse_iterator </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#rend-1">rend</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#replace">replace</a></b>(int <i>i</i>, const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#reserve">reserve</a></b>(int <i>alloc</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#size">size</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#startsWith">startsWith</a></b>(const T &<i>value</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#swap">swap</a></b>(QList<T> &<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#swap-1">swap</a></b>(int <i>i</i>, int <i>j</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#takeAt">takeAt</a></b>(int <i>i</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#takeFirst">takeFirst</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#takeLast">takeLast</a></b>()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QSet<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#toSet">toSet</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> std::list<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#toStdList">toStdList</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QVector<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#toVector">toVector</a></b>() const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#value">value</a></b>(int <i>i</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#value-1">value</a></b>(int <i>i</i>, const T &<i>defaultValue</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-not-eq">operator!=</a></b>(const QList<T> &<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-2b">operator+</a></b>(const QList<T> &<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-2b-eq">operator+=</a></b>(const QList<T> &<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-2b-eq-1">operator+=</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-lt-lt">operator<<</a></b>(const QList<T> &<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-lt-lt-1">operator<<</a></b>(const T &<i>value</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-eq">operator=</a></b>(const QList<T> &<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-eq-1">operator=</a></b>(QList<T> &&<i>other</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-eq-eq">operator==</a></b>(const QList<T> &<i>other</i>) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-5b-5d">operator[]</a></b>(int <i>i</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-5b-5d-1">operator[]</a></b>(int <i>i</i>) const</td></tr>
</table></div>
<a name="static-public-members"></a>
<h2 id="static-public-members">Static Public Members</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#fromSet">fromSet</a></b>(const QSet<T> &<i>set</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#fromStdList">fromStdList</a></b>(const std::list<T> &<i>list</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QList<T> </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#fromVector">fromVector</a></b>(const QVector<T> &<i>vector</i>)</td></tr>
</table></div>
<a name="related-non-members"></a>
<h2 id="related-non-members">Related Non-Members</h2>
<div class="table"><table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> uint </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#qHash">qHash</a></b>(const QList<T> &<i>key</i>, uint <i>seed</i> = ...)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-lt">operator<</a></b>(const QList<T> &<i>lhs</i>, const QList<T> &<i>rhs</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QDataStream &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-lt-lt-2">operator<<</a></b>(QDataStream &<i>out</i>, const QList<T> &<i>list</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-lt-eq">operator<=</a></b>(const QList<T> &<i>lhs</i>, const QList<T> &<i>rhs</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-gt">operator></a></b>(const QList<T> &<i>lhs</i>, const QList<T> &<i>rhs</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-gt-eq">operator>=</a></b>(const QList<T> &<i>lhs</i>, const QList<T> &<i>rhs</i>)</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QDataStream &</td><td class="memItemRight bottomAlign"><b><a href="qlist.html#operator-gt-gt">operator>></a></b>(QDataStream &<i>in</i>, QList<T> &<i>list</i>)</td></tr>
</table></div>
<a name="details"></a>
<!-- $$$QList-description -->
<div class="descr">
<h2 id="details">Detailed Description</h2>
<p>The <a href="qlist.html">QList</a> class is a template class that provides lists.</p>
<p><a href="qlist.html">QList</a><T> is one of Qt's generic <a href="containers.html">container classes</a>. It stores items in a list that provides fast index-based access and index-based insertions and removals.</p>
<p><a href="qlist.html">QList</a><T>, <a href="qlinkedlist.html">QLinkedList</a><T>, and <a href="qvector.html">QVector</a><T> provide similar APIs and functionality. They are often interchangeable, but there are performance consequences. Here is an overview of use cases:</p>
<ul>
<li><a href="qvector.html">QVector</a> should be your default first choice. <a href="qvector.html">QVector</a><T> will usually give better performance than <a href="qlist.html">QList</a><T>, because <a href="qvector.html">QVector</a><T> always stores its items sequentially in memory, where <a href="qlist.html">QList</a><T> will allocate its items on the heap unless <code>sizeof(T) <= sizeof(void*)</code> and T has been declared to be either a <code>Q_MOVABLE_TYPE</code> or a <code>Q_PRIMITIVE_TYPE</code> using <a href="qtglobal.html#Q_DECLARE_TYPEINFO">Q_DECLARE_TYPEINFO</a>. See the <a href="http://marcmutz.wordpress.com/effective-qt/containers/#containers-qlist">Pros and Cons of Using QList</a> for an explanation.</li>
<li>However, <a href="qlist.html">QList</a> is used throughout the Qt APIs for passing parameters and for returning values. Use <a href="qlist.html">QList</a> to interface with those APIs.</li>
<li>If you need a real linked list, which guarantees <a href="containers.html#algorithmic-complexity">constant time</a> insertions mid-list and uses iterators to items rather than indexes, use <a href="qlinkedlist.html">QLinkedList</a>.</li>
</ul>
<p><b>Note: </b><a href="qvector.html">QVector</a> and <a href="qvarlengtharray.html">QVarLengthArray</a> both guarantee C-compatible array layout. <a href="qlist.html">QList</a> does not. This might be important if your application must interface with a C API.</p><p><b>Note: </b>Iterators into a <a href="qlinkedlist.html">QLinkedList</a> and references into heap-allocating QLists remain valid as long as the referenced items remain in the container. This is not true for iterators and references into a <a href="qvector.html">QVector</a> and non-heap-allocating QLists.</p><p>Internally, <a href="qlist.html">QList</a><T> is represented as an array of T if <code>sizeof(T) <= sizeof(void*)</code> and T has been declared to be either a <code>Q_MOVABLE_TYPE</code> or a <code>Q_PRIMITIVE_TYPE</code> using <a href="qtglobal.html#Q_DECLARE_TYPEINFO">Q_DECLARE_TYPEINFO</a>. Otherwise, <a href="qlist.html">QList</a><T> is represented as an array of T* and the items are allocated on the heap.</p>
<p>The array representation allows very fast insertions and index-based access. The <a href="qlist.html#prepend">prepend</a>() and <a href="qlist.html#append">append</a>() operations are also very fast because <a href="qlist.html">QList</a> preallocates memory at both ends of its internal array. (See <a href="containers.html#algorithmic-complexity">Algorithmic Complexity</a> for details.</p>
<p>Note, however, that when the conditions specified above are not met, each append or insert of a new item requires allocating the new item on the heap, and this per item allocation will make <a href="qvector.html">QVector</a> a better choice for use cases that do a lot of appending or inserting, because <a href="qvector.html">QVector</a> can allocate memory for many items in a single heap allocation.</p>
<p>Note that the internal array only ever gets bigger over the life of the list. It never shrinks. The internal array is deallocated by the destructor and by the assignment operator, when one list is assigned to another.</p>
<p>Here's an example of a <a href="qlist.html">QList</a> that stores integers and a <a href="qlist.html">QList</a> that stores <a href="qdate.html">QDate</a> values:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">></span> integerList;
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qdate.html">QDate</a></span><span class="operator">></span> dateList;
</pre>
<p>Qt includes a <a href="qstringlist.html">QStringList</a> class that inherits <a href="qlist.html">QList</a><<a href="qstring.html">QString</a>> and adds a few convenience functions, such as <a href="qstringlist.html#join">QStringList::join</a>() and <a href="qstringlist.html#filter">QStringList::filter</a>(). <a href="qstring.html#split">QString::split</a>() creates QStringLists from strings.</p>
<p><a href="qlist.html">QList</a> stores a list of items. The default constructor creates an empty list. You can use the initializer-list constructor to create a list with elements:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list <span class="operator">=</span> { <span class="string">"one"</span><span class="operator">,</span> <span class="string">"two"</span><span class="operator">,</span> <span class="string">"three"</span> };
</pre>
<p><a href="qlist.html">QList</a> provides these basic functions to add, move, and remove items: <a href="qlist.html#insert">insert</a>(), <a href="qlist.html#replace">replace</a>(), <a href="qlist.html#removeAt">removeAt</a>(), <a href="qlist.html#move">move</a>(), and <a href="qlist.html#swap">swap</a>(). In addition, it provides the following convenience functions: <a href="qlist.html#append">append</a>(), <a href="qlist.html#operator-lt-lt">operator<<</a>(), <a href="qlist.html#operator-2b-eq">operator+=</a>(), <a href="qlist.html#prepend">prepend</a>(), <a href="qlist.html#removeFirst">removeFirst</a>(), and <a href="qlist.html#removeLast">removeLast</a>().</p>
<p><a href="qlist.html#operator-lt-lt">operator<<</a>() allows to conveniently add multiple elements to a list:</p>
<pre class="cpp">
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"four"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"five"</span>;
</pre>
<p><a href="qlist.html">QList</a> uses 0-based indexes, just like C++ arrays. To access the item at a particular index position, you can use operator[](). On non-const lists, operator[]() returns a reference to the item and can be used on the left side of an assignment:</p>
<pre class="cpp">
<span class="keyword">if</span> (list<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span><span class="operator">=</span> <span class="string">"Bob"</span>)
list<span class="operator">[</span><span class="number">0</span><span class="operator">]</span> <span class="operator">=</span> <span class="string">"Robert"</span>;
</pre>
<p>Because <a href="qlist.html">QList</a> is implemented as an array of pointers for types that are larger than a pointer or are not movable, this operation requires (<a href="containers.html#algorithmic-complexity">constant time</a>). For read-only access, an alternative syntax is to use <a href="qlist.html#at">at</a>():</p>
<pre class="cpp">
<span class="keyword">for</span> (<span class="type">int</span> i <span class="operator">=</span> <span class="number">0</span>; i <span class="operator"><</span> list<span class="operator">.</span>size(); <span class="operator">+</span><span class="operator">+</span>i) {
<span class="keyword">if</span> (list<span class="operator">.</span>at(i) <span class="operator">=</span><span class="operator">=</span> <span class="string">"Jane"</span>)
cout <span class="operator"><</span><span class="operator"><</span> <span class="string">"Found Jane at position "</span> <span class="operator"><</span><span class="operator"><</span> i <span class="operator"><</span><span class="operator"><</span> endl;
}
</pre>
<p><a href="qlist.html#at">at</a>() can be faster than operator[](), because it never causes a <a href="implicit-sharing.html#deep-copy">deep copy</a> to occur.</p>
<p>A common requirement is to remove an item from a list and do something with it. For this, <a href="qlist.html">QList</a> provides <a href="qlist.html#takeAt">takeAt</a>(), <a href="qlist.html#takeFirst">takeFirst</a>(), and <a href="qlist.html#takeLast">takeLast</a>(). Here's a loop that removes the items from a list one at a time and calls <code>delete</code> on them:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="../qtwidgets/qwidget.html">QWidget</a></span> <span class="operator">*</span><span class="operator">></span> list;
<span class="operator">.</span><span class="operator">.</span><span class="operator">.</span>
<span class="keyword">while</span> (<span class="operator">!</span>list<span class="operator">.</span>isEmpty())
<span class="keyword">delete</span> list<span class="operator">.</span>takeFirst();
</pre>
<p>Inserting and removing items at either end of the list is very fast (<a href="containers.html#algorithmic-complexity">constant time</a> in most cases), because <a href="qlist.html">QList</a> preallocates extra space on both sides of its internal buffer to allow for fast growth at both ends of the list.</p>
<p>If you want to find all occurrences of a particular value in a list, use <a href="qlist.html#indexOf">indexOf</a>() or <a href="qlist.html#lastIndexOf">lastIndexOf</a>(). The former searches forward starting from a given index position, the latter searches backward. Both return the index of a matching item if they find it; otherwise, they return -1. For example:</p>
<pre class="cpp">
<span class="type">int</span> i <span class="operator">=</span> list<span class="operator">.</span>indexOf(<span class="string">"Jane"</span>);
<span class="keyword">if</span> (i <span class="operator">!</span><span class="operator">=</span> <span class="operator">-</span><span class="number">1</span>)
cout <span class="operator"><</span><span class="operator"><</span> <span class="string">"First occurrence of Jane is at position "</span> <span class="operator"><</span><span class="operator"><</span> i <span class="operator"><</span><span class="operator"><</span> endl;
</pre>
<p>If you simply want to check whether a list contains a particular value, use <a href="qlist.html#contains">contains</a>(). If you want to find out how many times a particular value occurs in the list, use <a href="qlist.html#count-1">count</a>(). If you want to replace all occurrences of a particular value with another, use <a href="qlist.html#replace">replace</a>().</p>
<p><a href="qlist.html">QList</a>'s value type must be an <a href="containers.html#assignable-data-type">assignable data type</a>. This covers most data types that are commonly used, but the compiler won't let you, for example, store a <a href="../qtwidgets/qwidget.html">QWidget</a> as a value; instead, store a <a href="../qtwidgets/qwidget.html">QWidget</a> *. A few functions have additional requirements; for example, <a href="qlist.html#indexOf">indexOf</a>() and <a href="qlist.html#lastIndexOf">lastIndexOf</a>() expect the value type to support <code>operator==()</code>. These requirements are documented on a per-function basis.</p>
<p>Like the other container classes, <a href="qlist.html">QList</a> provides <a href="containers.html#java-style-iterators">Java-style iterators</a> (<a href="qlistiterator.html">QListIterator</a> and <a href="qmutablelistiterator.html">QMutableListIterator</a>) and <a href="containers.html#stl-style-iterators">STL-style iterators</a> (<a href="qlist-const-iterator.html">QList::const_iterator</a> and <a href="qlist-iterator.html">QList::iterator</a>). In practice, these are rarely used, because you can use indexes into the <a href="qlist.html">QList</a>. <a href="qlist.html">QList</a> is implemented in such a way that direct index-based access is just as fast as using iterators.</p>
<p><a href="qlist.html">QList</a> does <i>not</i> support inserting, prepending, appending or replacing with references to its own values. Doing so will cause your application to abort with an error message.</p>
<p>To make <a href="qlist.html">QList</a> as efficient as possible, its member functions don't validate their input before using it. Except for <a href="qlist.html#isEmpty">isEmpty</a>(), member functions always assume the list is <i>not</i> empty. Member functions that take index values as parameters always assume their index value parameters are in the valid range. This means <a href="qlist.html">QList</a> member functions can fail. If you define QT_NO_DEBUG when you compile, failures will not be detected. If you <i>don't</i> define QT_NO_DEBUG, failures will be detected using <a href="qtglobal.html#Q_ASSERT">Q_ASSERT</a>() or <a href="qtglobal.html#Q_ASSERT_X">Q_ASSERT_X</a>() with an appropriate message.</p>
<p>To avoid failures when your list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling other member functions. If you must pass an index value that might not be in the valid range, check that it is less than the value returned by <a href="qlist.html#size">size</a>() but <i>not</i> less than 0.</p>
<a name="more-members"></a>
<h3 id="more-members">More Members</h3>
<p>If T is a <a href="qbytearray.html">QByteArray</a>, this class has a couple more members that can be used. See the documentation for <a href="qbytearraylist.html">QByteArrayList</a> for more information.</p>
<p>If T is <a href="qstring.html">QString</a>, this class has the following additional members: <a href="qstringlist.html#filter">filter</a>, <a href="qstringlist.html#join">join</a>, <a href="qstringlist.html#removeDuplicates">removeDuplicates</a>, <a href="qstringlist.html#sort">sort</a>.</p>
<a name="more-information-on-using-qt-containers"></a>
<h3 id="more-information-on-using-qt-containers">More Information on Using Qt Containers</h3>
<p>For a detailed discussion comparing Qt containers with each other and with STL containers, see <a href="http://marcmutz.wordpress.com/effective-qt/containers/">Understand the Qt Containers</a>.</p>
</div>
<p><b>See also </b><a href="qlistiterator.html">QListIterator</a>, <a href="qmutablelistiterator.html">QMutableListIterator</a>, <a href="qlinkedlist.html">QLinkedList</a>, and <a href="qvector.html">QVector</a>.</p>
<!-- @@@QList -->
<div class="types">
<h2>Member Type Documentation</h2>
<!-- $$$ConstIterator -->
<h3 class="fn" id="ConstIterator-typedef"><a name="ConstIterator-typedef"></a>typedef QList::<span class="name">ConstIterator</span></h3>
<p>Qt-style synonym for <a href="qlist-const-iterator.html">QList::const_iterator</a>.</p>
<!-- @@@ConstIterator -->
<!-- $$$Iterator -->
<h3 class="fn" id="Iterator-typedef"><a name="Iterator-typedef"></a>typedef QList::<span class="name">Iterator</span></h3>
<p>Qt-style synonym for <a href="qlist-iterator.html">QList::iterator</a>.</p>
<!-- @@@Iterator -->
<!-- $$$const_pointer -->
<h3 class="fn" id="const_pointer-typedef"><a name="const_pointer-typedef"></a>typedef QList::<span class="name">const_pointer</span></h3>
<p>Typedef for const T *. Provided for STL compatibility.</p>
<!-- @@@const_pointer -->
<!-- $$$const_reference -->
<h3 class="fn" id="const_reference-typedef"><a name="const_reference-typedef"></a>typedef QList::<span class="name">const_reference</span></h3>
<p>Typedef for const T &. Provided for STL compatibility.</p>
<!-- @@@const_reference -->
<!-- $$$const_reverse_iterator -->
<h3 class="fn" id="const_reverse_iterator-typedef"><a name="const_reverse_iterator-typedef"></a>typedef QList::<span class="name">const_reverse_iterator</span></h3>
<p>The QList::const_reverse_iterator typedef provides an STL-style const reverse iterator for <a href="qlist.html">QList</a>.</p>
<p>It is simply a typedef for <code>std::reverse_iterator<const_iterator></code>.</p>
<p><b>Warning:</b> Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read <a href="containers.html#implicit-sharing-iterator-problem">Implicit sharing iterator problem</a>.</p>
<p>This typedef was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#rbegin">QList::rbegin</a>(), <a href="qlist.html#rend">QList::rend</a>(), <a href="qlist.html#reverse_iterator-typedef">QList::reverse_iterator</a>, and <a href="qlist-const-iterator.html">QList::const_iterator</a>.</p>
<!-- @@@const_reverse_iterator -->
<!-- $$$difference_type -->
<h3 class="fn" id="difference_type-typedef"><a name="difference_type-typedef"></a>typedef QList::<span class="name">difference_type</span></h3>
<p>Typedef for ptrdiff_t. Provided for STL compatibility.</p>
<!-- @@@difference_type -->
<!-- $$$pointer -->
<h3 class="fn" id="pointer-typedef"><a name="pointer-typedef"></a>typedef QList::<span class="name">pointer</span></h3>
<p>Typedef for T *. Provided for STL compatibility.</p>
<!-- @@@pointer -->
<!-- $$$reference -->
<h3 class="fn" id="reference-typedef"><a name="reference-typedef"></a>typedef QList::<span class="name">reference</span></h3>
<p>Typedef for T &. Provided for STL compatibility.</p>
<!-- @@@reference -->
<!-- $$$reverse_iterator -->
<h3 class="fn" id="reverse_iterator-typedef"><a name="reverse_iterator-typedef"></a>typedef QList::<span class="name">reverse_iterator</span></h3>
<p>The QList::reverse_iterator typedef provides an STL-style non-const reverse iterator for <a href="qlist.html">QList</a>.</p>
<p>It is simply a typedef for <code>std::reverse_iterator<iterator></code>.</p>
<p><b>Warning:</b> Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read <a href="containers.html#implicit-sharing-iterator-problem">Implicit sharing iterator problem</a>.</p>
<p>This typedef was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#rbegin">QList::rbegin</a>(), <a href="qlist.html#rend">QList::rend</a>(), <a href="qlist.html#const_reverse_iterator-typedef">QList::const_reverse_iterator</a>, and <a href="qlist-iterator.html">QList::iterator</a>.</p>
<!-- @@@reverse_iterator -->
<!-- $$$size_type -->
<h3 class="fn" id="size_type-typedef"><a name="size_type-typedef"></a>typedef QList::<span class="name">size_type</span></h3>
<p>Typedef for int. Provided for STL compatibility.</p>
<!-- @@@size_type -->
<!-- $$$value_type -->
<h3 class="fn" id="value_type-typedef"><a name="value_type-typedef"></a>typedef QList::<span class="name">value_type</span></h3>
<p>Typedef for T. Provided for STL compatibility.</p>
<!-- @@@value_type -->
</div>
<div class="func">
<h2>Member Function Documentation</h2>
<!-- $$$QList[overload1]$$$QList -->
<h3 class="fn" id="QList"><a name="QList"></a>QList::<span class="name">QList</span>()</h3>
<p>Constructs an empty list.</p>
<!-- @@@QList -->
<!-- $$$QList$$$QListconstQList<T>& -->
<h3 class="fn" id="QList-1"><a name="QList-1"></a>QList::<span class="name">QList</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>)</h3>
<p>Constructs a copy of <i>other</i>.</p>
<p>This operation takes <a href="containers.html#algorithmic-complexity">constant time</a>, because <a href="qlist.html">QList</a> is <a href="implicit-sharing.html">implicitly shared</a>. This makes returning a <a href="qlist.html">QList</a> from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and that takes <a href="containers.html#algorithmic-complexity">linear time</a>.</p>
<p><b>See also </b><a href="qlist.html#operator-eq">operator=</a>().</p>
<!-- @@@QList -->
<!-- $$$QList$$$QListQList<T>&& -->
<h3 class="fn" id="QList-2"><a name="QList-2"></a>QList::<span class="name">QList</span>(<span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &&<i>other</i>)</h3>
<p>Move-constructs a <a href="qlist.html">QList</a> instance, making it point at the same object that <i>other</i> was pointing to.</p>
<p>This function was introduced in Qt 5.2.</p>
<!-- @@@QList -->
<!-- $$$QList$$$QListstd::initializer_list<T> -->
<h3 class="fn" id="QList-3"><a name="QList-3"></a>QList::<span class="name">QList</span>(<span class="type">std::initializer_list</span><<span class="type">T</span>> <i>args</i>)</h3>
<p>Construct a list from the std::initializer_list specified by <i>args</i>.</p>
<p>This constructor is only enabled if the compiler supports C++11 initializer lists.</p>
<p>This function was introduced in Qt 4.8.</p>
<!-- @@@QList -->
<!-- $$$~QList[overload1]$$$~QList -->
<h3 class="fn" id="dtor.QList"><a name="dtor.QList"></a>QList::<span class="name">~QList</span>()</h3>
<p>Destroys the list. References to the values in the list and all iterators of this list become invalid.</p>
<!-- @@@~QList -->
<!-- $$$append[overload1]$$$appendconstT& -->
<h3 class="fn" id="append"><a name="append"></a><span class="type">void</span> QList::<span class="name">append</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>Inserts <i>value</i> at the end of the list.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list<span class="operator">.</span>append(<span class="string">"one"</span>);
list<span class="operator">.</span>append(<span class="string">"two"</span>);
list<span class="operator">.</span>append(<span class="string">"three"</span>);
<span class="comment">// list: ["one", "two", "three"]</span>
</pre>
<p>This is the same as list.insert(<a href="qlist.html#size">size</a>(), <i>value</i>).</p>
<p>If this list is not shared, this operation is typically very fast (amortized <a href="containers.html#algorithmic-complexity">constant time</a>), because <a href="qlist.html">QList</a> preallocates extra space on both sides of its internal buffer to allow for fast growth at both ends of the list.</p>
<p><b>See also </b><a href="qlist.html#operator-lt-lt">operator<<</a>(), <a href="qlist.html#prepend">prepend</a>(), and <a href="qlist.html#insert">insert</a>().</p>
<!-- @@@append -->
<!-- $$$append$$$appendconstQList<T>& -->
<h3 class="fn" id="append-1"><a name="append-1"></a><span class="type">void</span> QList::<span class="name">append</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>value</i>)</h3>
<p>This is an overloaded function.</p>
<p>Appends the items of the <i>value</i> list to this list.</p>
<p>This function was introduced in Qt 4.5.</p>
<p><b>See also </b><a href="qlist.html#operator-lt-lt">operator<<</a>() and <a href="qlist.html#operator-2b-eq">operator+=</a>().</p>
<!-- @@@append -->
<!-- $$$at[overload1]$$$atint -->
<h3 class="fn" id="at"><a name="at"></a>const <span class="type">T</span> &QList::<span class="name">at</span>(<span class="type">int</span> <i>i</i>) const</h3>
<p>Returns the item at index position <i>i</i> in the list. <i>i</i> must be a valid index position in the list (i.e., 0 <= <i>i</i> < <a href="qlist.html#size">size</a>()).</p>
<p>This function is very fast (<a href="containers.html#algorithmic-complexity">constant time</a>).</p>
<p><b>See also </b><a href="qlist.html#value">value</a>() and <a href="qlist.html#operator-5b-5d">operator[]</a>().</p>
<!-- @@@at -->
<!-- $$$back[overload1]$$$back -->
<h3 class="fn" id="back"><a name="back"></a><span class="type">T</span> &QList::<span class="name">back</span>()</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#last">last</a>(). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<!-- @@@back -->
<!-- $$$back$$$back -->
<h3 class="fn" id="back-1"><a name="back-1"></a>const <span class="type">T</span> &QList::<span class="name">back</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@back -->
<!-- $$$begin[overload1]$$$begin -->
<h3 class="fn" id="begin"><a name="begin"></a><span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> QList::<span class="name">begin</span>()</h3>
<p>Returns an <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the first item in the list.</p>
<p><b>See also </b><a href="qlist.html#constBegin">constBegin</a>() and <a href="qlist.html#end">end</a>().</p>
<!-- @@@begin -->
<!-- $$$begin$$$begin -->
<h3 class="fn" id="begin-1"><a name="begin-1"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">begin</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@begin -->
<!-- $$$cbegin[overload1]$$$cbegin -->
<h3 class="fn" id="cbegin"><a name="cbegin"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">cbegin</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the first item in the list.</p>
<p>This function was introduced in Qt 5.0.</p>
<p><b>See also </b><a href="qlist.html#begin">begin</a>() and <a href="qlist.html#cend">cend</a>().</p>
<!-- @@@cbegin -->
<!-- $$$cend[overload1]$$$cend -->
<h3 class="fn" id="cend"><a name="cend"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">cend</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the imaginary item after the last item in the list.</p>
<p>This function was introduced in Qt 5.0.</p>
<p><b>See also </b><a href="qlist.html#cbegin">cbegin</a>() and <a href="qlist.html#end">end</a>().</p>
<!-- @@@cend -->
<!-- $$$clear[overload1]$$$clear -->
<h3 class="fn" id="clear"><a name="clear"></a><span class="type">void</span> QList::<span class="name">clear</span>()</h3>
<p>Removes all items from the list.</p>
<p><b>See also </b><a href="qlist.html#removeAll">removeAll</a>().</p>
<!-- @@@clear -->
<!-- $$$constBegin[overload1]$$$constBegin -->
<h3 class="fn" id="constBegin"><a name="constBegin"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">constBegin</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the first item in the list.</p>
<p><b>See also </b><a href="qlist.html#begin">begin</a>() and <a href="qlist.html#constEnd">constEnd</a>().</p>
<!-- @@@constBegin -->
<!-- $$$constEnd[overload1]$$$constEnd -->
<h3 class="fn" id="constEnd"><a name="constEnd"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">constEnd</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the imaginary item after the last item in the list.</p>
<p><b>See also </b><a href="qlist.html#constBegin">constBegin</a>() and <a href="qlist.html#end">end</a>().</p>
<!-- @@@constEnd -->
<!-- $$$constFirst[overload1]$$$constFirst -->
<h3 class="fn" id="constFirst"><a name="constFirst"></a>const <span class="type">T</span> &QList::<span class="name">constFirst</span>() const</h3>
<p>Returns a const reference to the first item in the list. The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#constLast">constLast</a>(), <a href="qlist.html#isEmpty">isEmpty</a>(), and <a href="qlist.html#first">first</a>().</p>
<!-- @@@constFirst -->
<!-- $$$constLast[overload1]$$$constLast -->
<h3 class="fn" id="constLast"><a name="constLast"></a>const <span class="type">T</span> &QList::<span class="name">constLast</span>() const</h3>
<p>Returns a reference to the last item in the list. The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#constFirst">constFirst</a>(), <a href="qlist.html#isEmpty">isEmpty</a>(), and <a href="qlist.html#last">last</a>().</p>
<!-- @@@constLast -->
<!-- $$$contains[overload1]$$$containsconstT& -->
<h3 class="fn" id="contains"><a name="contains"></a><span class="type">bool</span> QList::<span class="name">contains</span>(const <span class="type">T</span> &<i>value</i>) const</h3>
<p>Returns <code>true</code> if the list contains an occurrence of <i>value</i>; otherwise returns <code>false</code>.</p>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p><b>See also </b><a href="qlist.html#indexOf">indexOf</a>() and <a href="qlist.html#count-1">count</a>().</p>
<!-- @@@contains -->
<!-- $$$count[overload1]$$$countconstT& -->
<h3 class="fn" id="count"><a name="count"></a><span class="type">int</span> QList::<span class="name">count</span>(const <span class="type">T</span> &<i>value</i>) const</h3>
<p>Returns the number of occurrences of <i>value</i> in the list.</p>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p><b>See also </b><a href="qlist.html#contains">contains</a>() and <a href="qlist.html#indexOf">indexOf</a>().</p>
<!-- @@@count -->
<!-- $$$count$$$count -->
<h3 class="fn" id="count-1"><a name="count-1"></a><span class="type">int</span> QList::<span class="name">count</span>() const</h3>
<p>Returns the number of items in the list. This is effectively the same as <a href="qlist.html#size">size</a>().</p>
<!-- @@@count -->
<!-- $$$crbegin[overload1]$$$crbegin -->
<h3 class="fn" id="crbegin"><a name="crbegin"></a><span class="type"><a href="qlist.html#const_reverse_iterator-typedef">QList::const_reverse_iterator</a></span> QList::<span class="name">crbegin</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style</a> reverse iterator pointing to the first item in the list, in reverse order.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#begin">begin</a>(), <a href="qlist.html#rbegin">rbegin</a>(), and <a href="qlist.html#rend">rend</a>().</p>
<!-- @@@crbegin -->
<!-- $$$crend[overload1]$$$crend -->
<h3 class="fn" id="crend"><a name="crend"></a><span class="type"><a href="qlist.html#const_reverse_iterator-typedef">QList::const_reverse_iterator</a></span> QList::<span class="name">crend</span>() const</h3>
<p>Returns a const <a href="containers.html#stl-style-iterators">STL-style</a> reverse iterator pointing to one past the last item in the list, in reverse order.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#end">end</a>(), <a href="qlist.html#rend">rend</a>(), and <a href="qlist.html#rbegin">rbegin</a>().</p>
<!-- @@@crend -->
<!-- $$$empty[overload1]$$$empty -->
<h3 class="fn" id="empty"><a name="empty"></a><span class="type">bool</span> QList::<span class="name">empty</span>() const</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#isEmpty">isEmpty</a>() and returns <code>true</code> if the list is empty.</p>
<!-- @@@empty -->
<!-- $$$end[overload1]$$$end -->
<h3 class="fn" id="end"><a name="end"></a><span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> QList::<span class="name">end</span>()</h3>
<p>Returns an <a href="containers.html#stl-style-iterators">STL-style iterator</a> pointing to the imaginary item after the last item in the list.</p>
<p><b>See also </b><a href="qlist.html#begin">begin</a>() and <a href="qlist.html#constEnd">constEnd</a>().</p>
<!-- @@@end -->
<!-- $$$end$$$end -->
<h3 class="fn" id="end-1"><a name="end-1"></a><span class="type"><a href="qlist-const-iterator.html">QList::const_iterator</a></span> QList::<span class="name">end</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@end -->
<!-- $$$endsWith[overload1]$$$endsWithconstT& -->
<h3 class="fn" id="endsWith"><a name="endsWith"></a><span class="type">bool</span> QList::<span class="name">endsWith</span>(const <span class="type">T</span> &<i>value</i>) const</h3>
<p>Returns <code>true</code> if this list is not empty and its last item is equal to <i>value</i>; otherwise returns <code>false</code>.</p>
<p>This function was introduced in Qt 4.5.</p>
<p><b>See also </b><a href="qlist.html#isEmpty">isEmpty</a>() and <a href="qlist.html#contains">contains</a>().</p>
<!-- @@@endsWith -->
<!-- $$$erase[overload1]$$$eraseQList::iterator -->
<h3 class="fn" id="erase"><a name="erase"></a><span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> QList::<span class="name">erase</span>(<span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> <i>pos</i>)</h3>
<p>Removes the item associated with the iterator <i>pos</i> from the list, and returns an iterator to the next item in the list (which may be <a href="qlist.html#end">end</a>()).</p>
<p><b>See also </b><a href="qlist.html#insert">insert</a>() and <a href="qlist.html#removeAt">removeAt</a>().</p>
<!-- @@@erase -->
<!-- $$$erase$$$eraseQList::iteratorQList::iterator -->
<h3 class="fn" id="erase-1"><a name="erase-1"></a><span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> QList::<span class="name">erase</span>(<span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> <i>begin</i>, <span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> <i>end</i>)</h3>
<p>This is an overloaded function.</p>
<p>Removes all the items from <i>begin</i> up to (but not including) <i>end</i>. Returns an iterator to the same item that <i>end</i> referred to before the call.</p>
<!-- @@@erase -->
<!-- $$$first[overload1]$$$first -->
<h3 class="fn" id="first"><a name="first"></a><span class="type">T</span> &QList::<span class="name">first</span>()</h3>
<p>Returns a reference to the first item in the list. The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p><b>See also </b><a href="qlist.html#constFirst">constFirst</a>(), <a href="qlist.html#last">last</a>(), and <a href="qlist.html#isEmpty">isEmpty</a>().</p>
<!-- @@@first -->
<!-- $$$first$$$first -->
<h3 class="fn" id="first-1"><a name="first-1"></a>const <span class="type">T</span> &QList::<span class="name">first</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@first -->
<!-- $$$fromSet[overload1]$$$fromSetconstQSet<T>& -->
<h3 class="fn" id="fromSet"><a name="fromSet"></a><code>[static] </code><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> QList::<span class="name">fromSet</span>(const <span class="type"><a href="qset.html">QSet</a></span><<span class="type">T</span>> &<i>set</i>)</h3>
<p>Returns a <a href="qlist.html">QList</a> object with the data contained in <i>set</i>. The order of the elements in the <a href="qlist.html">QList</a> is undefined.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qset.html">QSet</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">></span> set;
set <span class="operator"><</span><span class="operator"><</span> <span class="number">20</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">30</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">40</span> <span class="operator"><</span><span class="operator"><</span> <span class="operator">.</span><span class="operator">.</span><span class="operator">.</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">70</span>;
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">></span> list <span class="operator">=</span> <span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">></span><span class="operator">::</span>fromSet(set);
<a href="qtalgorithms-obsolete.html#qSort">qSort</a>(list);
</pre>
<p><b>See also </b><a href="qlist.html#fromVector">fromVector</a>(), <a href="qlist.html#toSet">toSet</a>(), and <a href="qset.html#toList">QSet::toList</a>().</p>
<!-- @@@fromSet -->
<!-- $$$fromStdList[overload1]$$$fromStdListconststd::list<T>& -->
<h3 class="fn" id="fromStdList"><a name="fromStdList"></a><code>[static] </code><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> QList::<span class="name">fromStdList</span>(const <span class="type">std::list</span><<span class="type">T</span>> &<i>list</i>)</h3>
<p>Returns a <a href="qlist.html">QList</a> object with the data contained in <i>list</i>. The order of the elements in the <a href="qlist.html">QList</a> is the same as in <i>list</i>.</p>
<p>Example:</p>
<pre class="cpp">
std<span class="operator">::</span>list<span class="operator"><</span><span class="type">double</span><span class="operator">></span> stdlist;
list<span class="operator">.</span>push_back(<span class="number">1.2</span>);
list<span class="operator">.</span>push_back(<span class="number">0.5</span>);
list<span class="operator">.</span>push_back(<span class="number">3.14</span>);
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">double</span><span class="operator">></span> list <span class="operator">=</span> <span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">double</span><span class="operator">></span><span class="operator">::</span>fromStdList(stdlist);
</pre>
<p><b>See also </b><a href="qlist.html#toStdList">toStdList</a>() and <a href="qvector.html#fromStdVector">QVector::fromStdVector</a>().</p>
<!-- @@@fromStdList -->
<!-- $$$fromVector[overload1]$$$fromVectorconstQVector<T>& -->
<h3 class="fn" id="fromVector"><a name="fromVector"></a><code>[static] </code><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> QList::<span class="name">fromVector</span>(const <span class="type"><a href="qvector.html">QVector</a></span><<span class="type">T</span>> &<i>vector</i>)</h3>
<p>Returns a <a href="qlist.html">QList</a> object with the data contained in <i>vector</i>.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qvector.html">QVector</a></span><span class="operator"><</span><span class="type">double</span><span class="operator">></span> vect;
vect <span class="operator"><</span><span class="operator"><</span> <span class="number">20.0</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">30.0</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">40.0</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">50.0</span>;
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">double</span><span class="operator">></span> list <span class="operator">=</span> <span class="type"><a href="qvector.html">QVector</a></span><span class="operator"><</span>T<span class="operator">></span><span class="operator">::</span>fromVector(vect);
<span class="comment">// list: [20.0, 30.0, 40.0, 50.0]</span>
</pre>
<p><b>See also </b><a href="qlist.html#fromSet">fromSet</a>(), <a href="qlist.html#toVector">toVector</a>(), and <a href="qvector.html#toList">QVector::toList</a>().</p>
<!-- @@@fromVector -->
<!-- $$$front[overload1]$$$front -->
<h3 class="fn" id="front"><a name="front"></a><span class="type">T</span> &QList::<span class="name">front</span>()</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#first">first</a>(). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<!-- @@@front -->
<!-- $$$front$$$front -->
<h3 class="fn" id="front-1"><a name="front-1"></a>const <span class="type">T</span> &QList::<span class="name">front</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@front -->
<!-- $$$indexOf[overload1]$$$indexOfconstT&int -->
<h3 class="fn" id="indexOf"><a name="indexOf"></a><span class="type">int</span> QList::<span class="name">indexOf</span>(const <span class="type">T</span> &<i>value</i>, <span class="type">int</span> <i>from</i> = ...) const</h3>
<p>Returns the index position of the first occurrence of <i>value</i> in the list, searching forward from index position <i>from</i>. Returns -1 if no item matched.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"C"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span>;
list<span class="operator">.</span>indexOf(<span class="string">"B"</span>); <span class="comment">// returns 1</span>
list<span class="operator">.</span>indexOf(<span class="string">"B"</span><span class="operator">,</span> <span class="number">1</span>); <span class="comment">// returns 1</span>
list<span class="operator">.</span>indexOf(<span class="string">"B"</span><span class="operator">,</span> <span class="number">2</span>); <span class="comment">// returns 3</span>
list<span class="operator">.</span>indexOf(<span class="string">"X"</span>); <span class="comment">// returns -1</span>
</pre>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p>Note that <a href="qlist.html">QList</a> uses 0-based indexes, just like C++ arrays. Negative indexes are not supported with the exception of the value mentioned above.</p>
<p><b>See also </b><a href="qlist.html#lastIndexOf">lastIndexOf</a>() and <a href="qlist.html#contains">contains</a>().</p>
<!-- @@@indexOf -->
<!-- $$$insert[overload1]$$$insertintconstT& -->
<h3 class="fn" id="insert"><a name="insert"></a><span class="type">void</span> QList::<span class="name">insert</span>(<span class="type">int</span> <i>i</i>, const <span class="type">T</span> &<i>value</i>)</h3>
<p>Inserts <i>value</i> at index position <i>i</i> in the list. If <i>i</i> <= 0, the value is prepended to the list. If <i>i</i> >= <a href="qlist.html#size">size</a>(), the value is appended to the list.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"alpha"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"beta"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"delta"</span>;
list<span class="operator">.</span>insert(<span class="number">2</span><span class="operator">,</span> <span class="string">"gamma"</span>);
<span class="comment">// list: ["alpha", "beta", "gamma", "delta"]</span>
</pre>
<p><b>See also </b><a href="qlist.html#append">append</a>(), <a href="qlist.html#prepend">prepend</a>(), <a href="qlist.html#replace">replace</a>(), and <a href="qlist.html#removeAt">removeAt</a>().</p>
<!-- @@@insert -->
<!-- $$$insert$$$insertQList::iteratorconstT& -->
<h3 class="fn" id="insert-1"><a name="insert-1"></a><span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> QList::<span class="name">insert</span>(<span class="type"><a href="qlist-iterator.html">QList::iterator</a></span> <i>before</i>, const <span class="type">T</span> &<i>value</i>)</h3>
<p>This is an overloaded function.</p>
<p>Inserts <i>value</i> in front of the item pointed to by the iterator <i>before</i>. Returns an iterator pointing at the inserted item. Note that the iterator passed to the function will be invalid after the call; the returned iterator should be used instead.</p>
<!-- @@@insert -->
<!-- $$$isEmpty[overload1]$$$isEmpty -->
<h3 class="fn" id="isEmpty"><a name="isEmpty"></a><span class="type">bool</span> QList::<span class="name">isEmpty</span>() const</h3>
<p>Returns <code>true</code> if the list contains no items; otherwise returns false.</p>
<p><b>See also </b><a href="qlist.html#size">size</a>().</p>
<!-- @@@isEmpty -->
<!-- $$$last[overload1]$$$last -->
<h3 class="fn" id="last"><a name="last"></a><span class="type">T</span> &QList::<span class="name">last</span>()</h3>
<p>Returns a reference to the last item in the list. The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p><b>See also </b><a href="qlist.html#constLast">constLast</a>(), <a href="qlist.html#first">first</a>(), and <a href="qlist.html#isEmpty">isEmpty</a>().</p>
<!-- @@@last -->
<!-- $$$last$$$last -->
<h3 class="fn" id="last-1"><a name="last-1"></a>const <span class="type">T</span> &QList::<span class="name">last</span>() const</h3>
<p>This is an overloaded function.</p>
<!-- @@@last -->
<!-- $$$lastIndexOf[overload1]$$$lastIndexOfconstT&int -->
<h3 class="fn" id="lastIndexOf"><a name="lastIndexOf"></a><span class="type">int</span> QList::<span class="name">lastIndexOf</span>(const <span class="type">T</span> &<i>value</i>, <span class="type">int</span> <i>from</i> = ...) const</h3>
<p>Returns the index position of the last occurrence of <i>value</i> in the list, searching backward from index position <i>from</i>. If <i>from</i> is -1 (the default), the search starts at the last item. Returns -1 if no item matched.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"C"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span>;
list<span class="operator">.</span>lastIndexOf(<span class="string">"B"</span>); <span class="comment">// returns 3</span>
list<span class="operator">.</span>lastIndexOf(<span class="string">"B"</span><span class="operator">,</span> <span class="number">3</span>); <span class="comment">// returns 3</span>
list<span class="operator">.</span>lastIndexOf(<span class="string">"B"</span><span class="operator">,</span> <span class="number">2</span>); <span class="comment">// returns 1</span>
list<span class="operator">.</span>lastIndexOf(<span class="string">"X"</span>); <span class="comment">// returns -1</span>
</pre>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p>Note that <a href="qlist.html">QList</a> uses 0-based indexes, just like C++ arrays. Negative indexes are not supported with the exception of the value mentioned above.</p>
<p><b>See also </b><a href="qlist.html#indexOf">indexOf</a>().</p>
<!-- @@@lastIndexOf -->
<!-- $$$length[overload1]$$$length -->
<h3 class="fn" id="length"><a name="length"></a><span class="type">int</span> QList::<span class="name">length</span>() const</h3>
<p>This function is identical to <a href="qlist.html#count-1">count</a>().</p>
<p>This function was introduced in Qt 4.5.</p>
<p><b>See also </b><a href="qlist.html#count-1">count</a>().</p>
<!-- @@@length -->
<!-- $$$mid[overload1]$$$midintint -->
<h3 class="fn" id="mid"><a name="mid"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> QList::<span class="name">mid</span>(<span class="type">int</span> <i>pos</i>, <span class="type">int</span> <i>length</i> = -1) const</h3>
<p>Returns a sub-list which includes elements from this list, starting at position <i>pos</i>. If <i>length</i> is -1 (the default), all elements from <i>pos</i> are included; otherwise <i>length</i> elements (or all remaining elements if there are less than <i>length</i> elements) are included.</p>
<!-- @@@mid -->
<!-- $$$move[overload1]$$$moveintint -->
<h3 class="fn" id="move"><a name="move"></a><span class="type">void</span> QList::<span class="name">move</span>(<span class="type">int</span> <i>from</i>, <span class="type">int</span> <i>to</i>)</h3>
<p>Moves the item at index position <i>from</i> to index position <i>to</i>.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"C"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"D"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"E"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"F"</span>;
list<span class="operator">.</span>move(<span class="number">1</span><span class="operator">,</span> <span class="number">4</span>);
<span class="comment">// list: ["A", "C", "D", "E", "B", "F"]</span>
</pre>
<p>This is the same as insert(<i>to</i>, <a href="qlist.html#takeAt">takeAt</a>(<i>from</i>)).This function assumes that both <i>from</i> and <i>to</i> are at least 0 but less than <a href="qlist.html#size">size</a>(). To avoid failure, test that both <i>from</i> and <i>to</i> are at least 0 and less than <a href="qlist.html#size">size</a>().</p>
<p><b>See also </b><a href="qlist.html#swap">swap</a>(), <a href="qlist.html#insert">insert</a>(), and <a href="qlist.html#takeAt">takeAt</a>().</p>
<!-- @@@move -->
<!-- $$$pop_back[overload1]$$$pop_back -->
<h3 class="fn" id="pop_back"><a name="pop_back"></a><span class="type">void</span> QList::<span class="name">pop_back</span>()</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#removeLast">removeLast</a>(). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<!-- @@@pop_back -->
<!-- $$$pop_front[overload1]$$$pop_front -->
<h3 class="fn" id="pop_front"><a name="pop_front"></a><span class="type">void</span> QList::<span class="name">pop_front</span>()</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#removeFirst">removeFirst</a>(). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<!-- @@@pop_front -->
<!-- $$$prepend[overload1]$$$prependconstT& -->
<h3 class="fn" id="prepend"><a name="prepend"></a><span class="type">void</span> QList::<span class="name">prepend</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>Inserts <i>value</i> at the beginning of the list.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list<span class="operator">.</span>prepend(<span class="string">"one"</span>);
list<span class="operator">.</span>prepend(<span class="string">"two"</span>);
list<span class="operator">.</span>prepend(<span class="string">"three"</span>);
<span class="comment">// list: ["three", "two", "one"]</span>
</pre>
<p>This is the same as list.insert(0, <i>value</i>).</p>
<p>If this list is not shared, this operation is typically very fast (amortized <a href="containers.html#algorithmic-complexity">constant time</a>), because <a href="qlist.html">QList</a> preallocates extra space on both sides of its internal buffer to allow for fast growth at both ends of the list.</p>
<p><b>See also </b><a href="qlist.html#append">append</a>() and <a href="qlist.html#insert">insert</a>().</p>
<!-- @@@prepend -->
<!-- $$$push_back[overload1]$$$push_backconstT& -->
<h3 class="fn" id="push_back"><a name="push_back"></a><span class="type">void</span> QList::<span class="name">push_back</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#append">append</a>(<i>value</i>).</p>
<!-- @@@push_back -->
<!-- $$$push_front[overload1]$$$push_frontconstT& -->
<h3 class="fn" id="push_front"><a name="push_front"></a><span class="type">void</span> QList::<span class="name">push_front</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>This function is provided for STL compatibility. It is equivalent to <a href="qlist.html#prepend">prepend</a>(<i>value</i>).</p>
<!-- @@@push_front -->
<!-- $$$rbegin[overload1]$$$rbegin -->
<h3 class="fn" id="rbegin"><a name="rbegin"></a><span class="type"><a href="qlist.html#reverse_iterator-typedef">QList::reverse_iterator</a></span> QList::<span class="name">rbegin</span>()</h3>
<p>Returns a <a href="containers.html#stl-style-iterators">STL-style</a> reverse iterator pointing to the first item in the list, in reverse order.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#begin">begin</a>(), <a href="qlist.html#crbegin">crbegin</a>(), and <a href="qlist.html#rend">rend</a>().</p>
<!-- @@@rbegin -->
<!-- $$$rbegin$$$rbegin -->
<h3 class="fn" id="rbegin-1"><a name="rbegin-1"></a><span class="type"><a href="qlist.html#const_reverse_iterator-typedef">QList::const_reverse_iterator</a></span> QList::<span class="name">rbegin</span>() const</h3>
<p>This is an overloaded function.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@rbegin -->
<!-- $$$removeAll[overload1]$$$removeAllconstT& -->
<h3 class="fn" id="removeAll"><a name="removeAll"></a><span class="type">int</span> QList::<span class="name">removeAll</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>Removes all occurrences of <i>value</i> in the list and returns the number of entries removed.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"sun"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"cloud"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"sun"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"rain"</span>;
list<span class="operator">.</span>removeAll(<span class="string">"sun"</span>);
<span class="comment">// list: ["cloud", "rain"]</span>
</pre>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p><b>See also </b><a href="qlist.html#removeOne">removeOne</a>(), <a href="qlist.html#removeAt">removeAt</a>(), <a href="qlist.html#takeAt">takeAt</a>(), and <a href="qlist.html#replace">replace</a>().</p>
<!-- @@@removeAll -->
<!-- $$$removeAt[overload1]$$$removeAtint -->
<h3 class="fn" id="removeAt"><a name="removeAt"></a><span class="type">void</span> QList::<span class="name">removeAt</span>(<span class="type">int</span> <i>i</i>)</h3>
<p>Removes the item at index position <i>i</i>. <i>i</i> must be a valid index position in the list (i.e., 0 <= <i>i</i> < <a href="qlist.html#size">size</a>()).</p>
<p><b>See also </b><a href="qlist.html#takeAt">takeAt</a>(), <a href="qlist.html#removeFirst">removeFirst</a>(), <a href="qlist.html#removeLast">removeLast</a>(), and <a href="qlist.html#removeOne">removeOne</a>().</p>
<!-- @@@removeAt -->
<!-- $$$removeFirst[overload1]$$$removeFirst -->
<h3 class="fn" id="removeFirst"><a name="removeFirst"></a><span class="type">void</span> QList::<span class="name">removeFirst</span>()</h3>
<p>Removes the first item in the list. Calling this function is equivalent to calling <a href="qlist.html#removeAt">removeAt</a>(0). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p><b>See also </b><a href="qlist.html#removeAt">removeAt</a>() and <a href="qlist.html#takeFirst">takeFirst</a>().</p>
<!-- @@@removeFirst -->
<!-- $$$removeLast[overload1]$$$removeLast -->
<h3 class="fn" id="removeLast"><a name="removeLast"></a><span class="type">void</span> QList::<span class="name">removeLast</span>()</h3>
<p>Removes the last item in the list. Calling this function is equivalent to calling <a href="qlist.html#removeAt">removeAt</a>(<a href="qlist.html#size">size</a>() - 1). The list must not be empty. If the list can be empty, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p><b>See also </b><a href="qlist.html#removeAt">removeAt</a>() and <a href="qlist.html#takeLast">takeLast</a>().</p>
<!-- @@@removeLast -->
<!-- $$$removeOne[overload1]$$$removeOneconstT& -->
<h3 class="fn" id="removeOne"><a name="removeOne"></a><span class="type">bool</span> QList::<span class="name">removeOne</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>Removes the first occurrence of <i>value</i> in the list and returns true on success; otherwise returns <code>false</code>.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"sun"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"cloud"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"sun"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"rain"</span>;
list<span class="operator">.</span>removeOne(<span class="string">"sun"</span>);
<span class="comment">// list: ["cloud", "sun", "rain"]</span>
</pre>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p>This function was introduced in Qt 4.4.</p>
<p><b>See also </b><a href="qlist.html#removeAll">removeAll</a>(), <a href="qlist.html#removeAt">removeAt</a>(), <a href="qlist.html#takeAt">takeAt</a>(), and <a href="qlist.html#replace">replace</a>().</p>
<!-- @@@removeOne -->
<!-- $$$rend[overload1]$$$rend -->
<h3 class="fn" id="rend"><a name="rend"></a><span class="type"><a href="qlist.html#reverse_iterator-typedef">QList::reverse_iterator</a></span> QList::<span class="name">rend</span>()</h3>
<p>Returns a <a href="containers.html#stl-style-iterators">STL-style</a> reverse iterator pointing to one past the last item in the list, in reverse order.</p>
<p>This function was introduced in Qt 5.6.</p>
<p><b>See also </b><a href="qlist.html#end">end</a>(), <a href="qlist.html#crend">crend</a>(), and <a href="qlist.html#rbegin">rbegin</a>().</p>
<!-- @@@rend -->
<!-- $$$rend$$$rend -->
<h3 class="fn" id="rend-1"><a name="rend-1"></a><span class="type"><a href="qlist.html#const_reverse_iterator-typedef">QList::const_reverse_iterator</a></span> QList::<span class="name">rend</span>() const</h3>
<p>This is an overloaded function.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@rend -->
<!-- $$$replace[overload1]$$$replaceintconstT& -->
<h3 class="fn" id="replace"><a name="replace"></a><span class="type">void</span> QList::<span class="name">replace</span>(<span class="type">int</span> <i>i</i>, const <span class="type">T</span> &<i>value</i>)</h3>
<p>Replaces the item at index position <i>i</i> with <i>value</i>. <i>i</i> must be a valid index position in the list (i.e., 0 <= <i>i</i> < <a href="qlist.html#size">size</a>()).</p>
<p><b>See also </b><a href="qlist.html#operator-5b-5d">operator[]</a>() and <a href="qlist.html#removeAt">removeAt</a>().</p>
<!-- @@@replace -->
<!-- $$$reserve[overload1]$$$reserveint -->
<h3 class="fn" id="reserve"><a name="reserve"></a><span class="type">void</span> QList::<span class="name">reserve</span>(<span class="type">int</span> <i>alloc</i>)</h3>
<p>Reserve space for <i>alloc</i> elements.</p>
<p>If <i>alloc</i> is smaller than the current size of the list, nothing will happen.</p>
<p>Use this function to avoid repetetive reallocation of <a href="qlist.html">QList</a>'s internal data if you can predict how many elements will be appended. Note that the reservation applies only to the internal pointer array.</p>
<p>This function was introduced in Qt 4.7.</p>
<!-- @@@reserve -->
<!-- $$$size[overload1]$$$size -->
<h3 class="fn" id="size"><a name="size"></a><span class="type">int</span> QList::<span class="name">size</span>() const</h3>
<p>Returns the number of items in the list.</p>
<p><b>See also </b><a href="qlist.html#isEmpty">isEmpty</a>() and <a href="qlist.html#count-1">count</a>().</p>
<!-- @@@size -->
<!-- $$$startsWith[overload1]$$$startsWithconstT& -->
<h3 class="fn" id="startsWith"><a name="startsWith"></a><span class="type">bool</span> QList::<span class="name">startsWith</span>(const <span class="type">T</span> &<i>value</i>) const</h3>
<p>Returns <code>true</code> if this list is not empty and its first item is equal to <i>value</i>; otherwise returns <code>false</code>.</p>
<p>This function was introduced in Qt 4.5.</p>
<p><b>See also </b><a href="qlist.html#isEmpty">isEmpty</a>() and <a href="qlist.html#contains">contains</a>().</p>
<!-- @@@startsWith -->
<!-- $$$swap[overload1]$$$swapQList<T>& -->
<h3 class="fn" id="swap"><a name="swap"></a><span class="type">void</span> QList::<span class="name">swap</span>(<span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>)</h3>
<p>Swaps list <i>other</i> with this list. This operation is very fast and never fails.</p>
<p>This function was introduced in Qt 4.8.</p>
<!-- @@@swap -->
<!-- $$$swap$$$swapintint -->
<h3 class="fn" id="swap-1"><a name="swap-1"></a><span class="type">void</span> QList::<span class="name">swap</span>(<span class="type">int</span> <i>i</i>, <span class="type">int</span> <i>j</i>)</h3>
<p>Exchange the item at index position <i>i</i> with the item at index position <i>j</i>. This function assumes that both <i>i</i> and <i>j</i> are at least 0 but less than <a href="qlist.html#size">size</a>(). To avoid failure, test that both <i>i</i> and <i>j</i> are at least 0 and less than <a href="qlist.html#size">size</a>().</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"A"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"B"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"C"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"D"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"E"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"F"</span>;
list<span class="operator">.</span>swap(<span class="number">1</span><span class="operator">,</span> <span class="number">4</span>);
<span class="comment">// list: ["A", "E", "C", "D", "B", "F"]</span>
</pre>
<p><b>See also </b><a href="qlist.html#move">move</a>().</p>
<!-- @@@swap -->
<!-- $$$takeAt[overload1]$$$takeAtint -->
<h3 class="fn" id="takeAt"><a name="takeAt"></a><span class="type">T</span> QList::<span class="name">takeAt</span>(<span class="type">int</span> <i>i</i>)</h3>
<p>Removes the item at index position <i>i</i> and returns it. <i>i</i> must be a valid index position in the list (i.e., 0 <= <i>i</i> < <a href="qlist.html#size">size</a>()).</p>
<p>If you don't use the return value, <a href="qlist.html#removeAt">removeAt</a>() is more efficient.</p>
<p><b>See also </b><a href="qlist.html#removeAt">removeAt</a>(), <a href="qlist.html#takeFirst">takeFirst</a>(), and <a href="qlist.html#takeLast">takeLast</a>().</p>
<!-- @@@takeAt -->
<!-- $$$takeFirst[overload1]$$$takeFirst -->
<h3 class="fn" id="takeFirst"><a name="takeFirst"></a><span class="type">T</span> QList::<span class="name">takeFirst</span>()</h3>
<p>Removes the first item in the list and returns it. This is the same as <a href="qlist.html#takeAt">takeAt</a>(0). This function assumes the list is not empty. To avoid failure, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p>If this list is not shared, this operation takes <a href="containers.html#algorithmic-complexity">constant time</a>.</p>
<p>If you don't use the return value, <a href="qlist.html#removeFirst">removeFirst</a>() is more efficient.</p>
<p><b>See also </b><a href="qlist.html#takeLast">takeLast</a>(), <a href="qlist.html#takeAt">takeAt</a>(), and <a href="qlist.html#removeFirst">removeFirst</a>().</p>
<!-- @@@takeFirst -->
<!-- $$$takeLast[overload1]$$$takeLast -->
<h3 class="fn" id="takeLast"><a name="takeLast"></a><span class="type">T</span> QList::<span class="name">takeLast</span>()</h3>
<p>Removes the last item in the list and returns it. This is the same as <a href="qlist.html#takeAt">takeAt</a>(<a href="qlist.html#size">size</a>() - 1). This function assumes the list is not empty. To avoid failure, call <a href="qlist.html#isEmpty">isEmpty</a>() before calling this function.</p>
<p>If this list is not shared, this operation takes <a href="containers.html#algorithmic-complexity">constant time</a>.</p>
<p>If you don't use the return value, <a href="qlist.html#removeLast">removeLast</a>() is more efficient.</p>
<p><b>See also </b><a href="qlist.html#takeFirst">takeFirst</a>(), <a href="qlist.html#takeAt">takeAt</a>(), and <a href="qlist.html#removeLast">removeLast</a>().</p>
<!-- @@@takeLast -->
<!-- $$$toSet[overload1]$$$toSet -->
<h3 class="fn" id="toSet"><a name="toSet"></a><span class="type"><a href="qset.html">QSet</a></span><<span class="type">T</span>> QList::<span class="name">toSet</span>() const</h3>
<p>Returns a <a href="qset.html">QSet</a> object with the data contained in this <a href="qlist.html">QList</a>. Since <a href="qset.html">QSet</a> doesn't allow duplicates, the resulting <a href="qset.html">QSet</a> might be smaller than the original list was.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qstringlist.html">QStringList</a></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"Julia"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Mike"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Mike"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Julia"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Julia"</span>;
<span class="type"><a href="qset.html">QSet</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> set <span class="operator">=</span> list<span class="operator">.</span>toSet();
set<span class="operator">.</span>contains(<span class="string">"Julia"</span>); <span class="comment">// returns true</span>
set<span class="operator">.</span>contains(<span class="string">"Mike"</span>); <span class="comment">// returns true</span>
set<span class="operator">.</span>size(); <span class="comment">// returns 2</span>
</pre>
<p><b>See also </b><a href="qlist.html#toVector">toVector</a>(), <a href="qlist.html#fromSet">fromSet</a>(), and <a href="qset.html#fromList">QSet::fromList</a>().</p>
<!-- @@@toSet -->
<!-- $$$toStdList[overload1]$$$toStdList -->
<h3 class="fn" id="toStdList"><a name="toStdList"></a><span class="type">std::list</span><<span class="type">T</span>> QList::<span class="name">toStdList</span>() const</h3>
<p>Returns a std::list object with the data contained in this <a href="qlist.html">QList</a>. Example:</p>
<pre class="cpp">
<span class="type"><a href="qlist.html#QList">QList</a></span><span class="operator"><</span><span class="type">double</span><span class="operator">></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="number">1.2</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">0.5</span> <span class="operator"><</span><span class="operator"><</span> <span class="number">3.14</span>;
std<span class="operator">::</span>list<span class="operator"><</span><span class="type">double</span><span class="operator">></span> stdlist <span class="operator">=</span> list<span class="operator">.</span>toStdList();
</pre>
<p><b>See also </b><a href="qlist.html#fromStdList">fromStdList</a>() and <a href="qvector.html#toStdVector">QVector::toStdVector</a>().</p>
<!-- @@@toStdList -->
<!-- $$$toVector[overload1]$$$toVector -->
<h3 class="fn" id="toVector"><a name="toVector"></a><span class="type"><a href="qvector.html">QVector</a></span><<span class="type">T</span>> QList::<span class="name">toVector</span>() const</h3>
<p>Returns a <a href="qvector.html">QVector</a> object with the data contained in this <a href="qlist.html">QList</a>.</p>
<p>Example:</p>
<pre class="cpp">
<span class="type"><a href="qstringlist.html">QStringList</a></span> list;
list <span class="operator"><</span><span class="operator"><</span> <span class="string">"Sven"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Kim"</span> <span class="operator"><</span><span class="operator"><</span> <span class="string">"Ola"</span>;
<span class="type"><a href="qvector.html">QVector</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> vect <span class="operator">=</span> list<span class="operator">.</span>toVector();
<span class="comment">// vect: ["Sven", "Kim", "Ola"]</span>
</pre>
<p><b>See also </b><a href="qlist.html#toSet">toSet</a>(), <a href="qlist.html#fromVector">fromVector</a>(), and <a href="qvector.html#fromList">QVector::fromList</a>().</p>
<!-- @@@toVector -->
<!-- $$$value[overload1]$$$valueint -->
<h3 class="fn" id="value"><a name="value"></a><span class="type">T</span> QList::<span class="name">value</span>(<span class="type">int</span> <i>i</i>) const</h3>
<p>Returns the value at index position <i>i</i> in the list.</p>
<p>If the index <i>i</i> is out of bounds, the function returns a <a href="containers.html#default-constructed-value">default-constructed value</a>. If you are certain that the index is going to be within bounds, you can use <a href="qlist.html#at">at</a>() instead, which is slightly faster.</p>
<p><b>See also </b><a href="qlist.html#at">at</a>() and <a href="qlist.html#operator-5b-5d">operator[]</a>().</p>
<!-- @@@value -->
<!-- $$$value$$$valueintconstT& -->
<h3 class="fn" id="value-1"><a name="value-1"></a><span class="type">T</span> QList::<span class="name">value</span>(<span class="type">int</span> <i>i</i>, const <span class="type">T</span> &<i>defaultValue</i>) const</h3>
<p>This is an overloaded function.</p>
<p>If the index <i>i</i> is out of bounds, the function returns <i>defaultValue</i>.</p>
<!-- @@@value -->
<!-- $$$operator!=[overload1]$$$operator!=constQList<T>& -->
<h3 class="fn" id="operator-not-eq"><a name="operator-not-eq"></a><span class="type">bool</span> QList::<span class="name">operator!=</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>) const</h3>
<p>Returns <code>true</code> if <i>other</i> is not equal to this list; otherwise returns <code>false</code>.</p>
<p>Two lists are considered equal if they contain the same values in the same order.</p>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p><b>See also </b><a href="qlist.html#operator-eq-eq">operator==</a>().</p>
<!-- @@@operator!= -->
<!-- $$$operator+[overload1]$$$operator+constQList<T>& -->
<h3 class="fn" id="operator-2b"><a name="operator-2b"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> QList::<span class="name">operator+</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>) const</h3>
<p>Returns a list that contains all the items in this list followed by all the items in the <i>other</i> list.</p>
<p><b>See also </b><a href="qlist.html#operator-2b-eq">operator+=</a>().</p>
<!-- @@@operator+ -->
<!-- $$$operator+=[overload1]$$$operator+=constQList<T>& -->
<h3 class="fn" id="operator-2b-eq"><a name="operator-2b-eq"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator+=</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>)</h3>
<p>Appends the items of the <i>other</i> list to this list and returns a reference to this list.</p>
<p><b>See also </b><a href="qlist.html#operator-2b">operator+</a>() and <a href="qlist.html#append">append</a>().</p>
<!-- @@@operator+= -->
<!-- $$$operator+=$$$operator+=constT& -->
<h3 class="fn" id="operator-2b-eq-1"><a name="operator-2b-eq-1"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator+=</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>This is an overloaded function.</p>
<p>Appends <i>value</i> to the list.</p>
<p><b>See also </b><a href="qlist.html#append">append</a>() and <a href="qlist.html#operator-lt-lt">operator<<</a>().</p>
<!-- @@@operator+= -->
<!-- $$$operator<<[overload1]$$$operator<<constQList<T>& -->
<h3 class="fn" id="operator-lt-lt"><a name="operator-lt-lt"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator<<</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>)</h3>
<p>Appends the items of the <i>other</i> list to this list and returns a reference to this list.</p>
<p><b>See also </b><a href="qlist.html#operator-2b-eq">operator+=</a>() and <a href="qlist.html#append">append</a>().</p>
<!-- @@@operator<< -->
<!-- $$$operator<<$$$operator<<constT& -->
<h3 class="fn" id="operator-lt-lt-1"><a name="operator-lt-lt-1"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator<<</span>(const <span class="type">T</span> &<i>value</i>)</h3>
<p>This is an overloaded function.</p>
<p>Appends <i>value</i> to the list.</p>
<!-- @@@operator<< -->
<!-- $$$operator=[overload1]$$$operator=constQList<T>& -->
<h3 class="fn" id="operator-eq"><a name="operator-eq"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator=</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>)</h3>
<p>Assigns <i>other</i> to this list and returns a reference to this list.</p>
<!-- @@@operator= -->
<!-- $$$operator=$$$operator=QList<T>&& -->
<h3 class="fn" id="operator-eq-1"><a name="operator-eq-1"></a><span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &QList::<span class="name">operator=</span>(<span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &&<i>other</i>)</h3>
<p>Move-assigns <i>other</i> to this <a href="qlist.html">QList</a> instance.</p>
<p>This function was introduced in Qt 5.2.</p>
<!-- @@@operator= -->
<!-- $$$operator==[overload1]$$$operator==constQList<T>& -->
<h3 class="fn" id="operator-eq-eq"><a name="operator-eq-eq"></a><span class="type">bool</span> QList::<span class="name">operator==</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>other</i>) const</h3>
<p>Returns <code>true</code> if <i>other</i> is equal to this list; otherwise returns false.</p>
<p>Two lists are considered equal if they contain the same values in the same order.</p>
<p>This function requires the value type to have an implementation of <code>operator==()</code>.</p>
<p><b>See also </b><a href="qlist.html#operator-not-eq">operator!=</a>().</p>
<!-- @@@operator== -->
<!-- $$$operator[][overload1]$$$operator[]int -->
<h3 class="fn" id="operator-5b-5d"><a name="operator-5b-5d"></a><span class="type">T</span> &QList::<span class="name">operator[]</span>(<span class="type">int</span> <i>i</i>)</h3>
<p>Returns the item at index position <i>i</i> as a modifiable reference. <i>i</i> must be a valid index position in the list (i.e., 0 <= <i>i</i> < <a href="qlist.html#size">size</a>()).</p>
<p>If this function is called on a list that is currently being shared, it will trigger a copy of all elements. Otherwise, this function runs in <a href="containers.html#algorithmic-complexity">constant time</a>. If you do not want to modify the list you should use <a href="qlist.html#at">QList::at</a>().</p>
<p><b>See also </b><a href="qlist.html#at">at</a>() and <a href="qlist.html#value">value</a>().</p>
<!-- @@@operator[] -->
<!-- $$$operator[]$$$operator[]int -->
<h3 class="fn" id="operator-5b-5d-1"><a name="operator-5b-5d-1"></a>const <span class="type">T</span> &QList::<span class="name">operator[]</span>(<span class="type">int</span> <i>i</i>) const</h3>
<p>This is an overloaded function.</p>
<p>Same as <a href="qlist.html#at">at</a>(). This function runs in <a href="containers.html#algorithmic-complexity">constant time</a>.</p>
<!-- @@@operator[] -->
</div>
<div class="relnonmem">
<h2>Related Non-Members</h2>
<!-- $$$qHash[overload1]$$$qHashconstQList<T>&uint -->
<h3 class="fn" id="qHash"><a name="qHash"></a><span class="type"><a href="qtglobal.html#uint-typedef">uint</a></span> <span class="name">qHash</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>key</i>, <span class="type"><a href="qtglobal.html#uint-typedef">uint</a></span> <i>seed</i> = ...)</h3>
<p>Returns the hash value for <i>key</i>, using <i>seed</i> to seed the calculation.</p>
<p>This function requires <a href="qstringview.html#qHash">qHash</a>() to be overloaded for the value type <code>T</code>.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@qHash -->
<!-- $$$operator<[overload1]$$$operator<constQList<T>&constQList<T>& -->
<h3 class="fn" id="operator-lt"><a name="operator-lt"></a><span class="type">bool</span> <span class="name">operator<</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>lhs</i>, const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>rhs</i>)</h3>
<p>Returns <code>true</code> if list <i>lhs</i> is <a href="http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare">lexicographically less than</a> <i>rhs</i>; otherwise returns <code>false</code>.</p>
<p>This function requires the value type to have an implementation of <code>operator<()</code>.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@operator< -->
<!-- $$$operator<<$$$operator<<QDataStream&constQList<T>& -->
<h3 class="fn" id="operator-lt-lt-2"><a name="operator-lt-lt-2"></a><span class="type"><a href="qdatastream.html">QDataStream</a></span> &<span class="name">operator<<</span>(<span class="type"><a href="qdatastream.html">QDataStream</a></span> &<i>out</i>, const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>list</i>)</h3>
<p>Writes the list <i>list</i> to stream <i>out</i>.</p>
<p>This function requires the value type to implement <code>operator<<()</code>.</p>
<p><b>See also </b><a href="datastreamformat.html">Format of the QDataStream operators</a>.</p>
<!-- @@@operator<< -->
<!-- $$$operator<=[overload1]$$$operator<=constQList<T>&constQList<T>& -->
<h3 class="fn" id="operator-lt-eq"><a name="operator-lt-eq"></a><span class="type">bool</span> <span class="name">operator<=</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>lhs</i>, const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>rhs</i>)</h3>
<p>Returns <code>true</code> if list <i>lhs</i> is <a href="http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare">lexicographically less than or equal to</a> <i>rhs</i>; otherwise returns <code>false</code>.</p>
<p>This function requires the value type to have an implementation of <code>operator<()</code>.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@operator<= -->
<!-- $$$operator>[overload1]$$$operator>constQList<T>&constQList<T>& -->
<h3 class="fn" id="operator-gt"><a name="operator-gt"></a><span class="type">bool</span> <span class="name">operator></span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>lhs</i>, const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>rhs</i>)</h3>
<p>Returns <code>true</code> if list <i>lhs</i> is <a href="http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare">lexicographically greater than</a> <i>rhs</i>; otherwise returns <code>false</code>.</p>
<p>This function requires the value type to have an implementation of <code>operator<()</code>.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@operator> -->
<!-- $$$operator>=[overload1]$$$operator>=constQList<T>&constQList<T>& -->
<h3 class="fn" id="operator-gt-eq"><a name="operator-gt-eq"></a><span class="type">bool</span> <span class="name">operator>=</span>(const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>lhs</i>, const <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>rhs</i>)</h3>
<p>Returns <code>true</code> if list <i>lhs</i> is <a href="http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare">lexicographically greater than or equal to</a> <i>rhs</i>; otherwise returns <code>false</code>.</p>
<p>This function requires the value type to have an implementation of <code>operator<()</code>.</p>
<p>This function was introduced in Qt 5.6.</p>
<!-- @@@operator>= -->
<!-- $$$operator>>[overload1]$$$operator>>QDataStream&QList<T>& -->
<h3 class="fn" id="operator-gt-gt"><a name="operator-gt-gt"></a><span class="type"><a href="qdatastream.html">QDataStream</a></span> &<span class="name">operator>></span>(<span class="type"><a href="qdatastream.html">QDataStream</a></span> &<i>in</i>, <span class="type"><a href="qlist.html#QList">QList</a></span><<span class="type">T</span>> &<i>list</i>)</h3>
<p>Reads a list from stream <i>in</i> into <i>list</i>.</p>
<p>This function requires the value type to implement <code>operator>>()</code>.</p>
<p><b>See also </b><a href="datastreamformat.html">Format of the QDataStream operators</a>.</p>
<!-- @@@operator>> -->
</div>
</div>
</div>
</div>
</div>
</div>
<div class="footer">
<p>
<acronym title="Copyright">©</acronym> 2019 The Qt Company Ltd.
Documentation contributions included herein are the copyrights of
their respective owners.<br/> The documentation provided herein is licensed under the terms of the <a href="http://www.gnu.org/licenses/fdl.html">GNU Free Documentation License version 1.3</a> as published by the Free Software Foundation.<br/> Qt and respective logos are trademarks of The Qt Company Ltd. in Finland and/or other countries worldwide. All other trademarks are property
of their respective owners. </p>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
d5e62c01ae8d1e579463c6a871dd44bf
>
files
>
531
