<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE html> <html lang="en"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <!-- qset.qdoc --> <title>List of All Members for QSet | 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 >QSet</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="sidebar-content" id="sidebar-content"></div></div> <h1 class="title">List of All Members for QSet</h1> <p>This is the complete list of members for <a href="qset.html">QSet</a>, including inherited members.</p> <div class="table"><table class="propsummary"> <tr><td class="topAlign"><ul> <li class="fn">class <span class="name"><b><a href="qset-const-iterator.html">const_iterator</a></b></span></li> <li class="fn">class <span class="name"><b><a href="qset-iterator.html">iterator</a></b></span></li> <li class="fn"><span class="name"><b></b></span></li> <li class="fn"><span class="name"><b></b></span></li> <li class="fn"><span class="name"><b></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#ConstIterator-typedef">ConstIterator</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#Iterator-typedef">Iterator</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#const_pointer-typedef">const_pointer</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#const_reference-typedef">const_reference</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#const_reverse_iterator-typedef">const_reverse_iterator</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#difference_type-typedef">difference_type</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#key_type-typedef">key_type</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#pointer-typedef">pointer</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#reference-typedef">reference</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#reverse_iterator-typedef">reverse_iterator</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#size_type-typedef">size_type</a></b></span></li> <li class="fn">typedef <span class="name"><b><a href="qset.html#value_type-typedef">value_type</a></b></span></li> <li class="fn"><span class="name"><b><a href="qset.html#QSet">QSet</a></b></span>()</li> <li class="fn"><span class="name"><b><a href="qset.html#QSet-1">QSet</a></b></span>(std::initializer_list<T> )</li> <li class="fn"><span class="name"><b><a href="qset.html#begin">begin</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#begin-1">begin</a></b></span>() : QSet::iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#capacity">capacity</a></b></span>() const : int</li> <li class="fn"><span class="name"><b><a href="qset.html#cbegin">cbegin</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#cend">cend</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#clear">clear</a></b></span>()</li> <li class="fn"><span class="name"><b><a href="qset.html#constBegin">constBegin</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#constEnd">constEnd</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#constFind">constFind</a></b></span>(const T &) const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#contains">contains</a></b></span>(const T &) const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#contains-1">contains</a></b></span>(const QSet<T> &) const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#count">count</a></b></span>() const : int</li> <li class="fn"><span class="name"><b><a href="qset.html#crbegin">crbegin</a></b></span>() const : QSet::const_reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#crend">crend</a></b></span>() const : QSet::const_reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#empty">empty</a></b></span>() const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#end">end</a></b></span>() const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#end-1">end</a></b></span>() : QSet::iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#erase">erase</a></b></span>(QSet::const_iterator ) : QSet::iterator</li> </ul></td><td class="topAlign"><ul> <li class="fn"><span class="name"><b><a href="qset.html#erase-1">erase</a></b></span>(QSet::iterator ) : QSet::iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#find">find</a></b></span>(const T &) const : QSet::const_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#find-1">find</a></b></span>(const T &) : QSet::iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#fromList">fromList</a></b></span>(const QList<T> &) : QSet<T></li> <li class="fn"><span class="name"><b><a href="qset.html#insert">insert</a></b></span>(const T &) : QSet::iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#intersect">intersect</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#intersects">intersects</a></b></span>(const QSet<T> &) const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#isEmpty">isEmpty</a></b></span>() const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#rbegin">rbegin</a></b></span>() : QSet::reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#rbegin-1">rbegin</a></b></span>() const : QSet::const_reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#remove">remove</a></b></span>(const T &) : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#rend">rend</a></b></span>() : QSet::reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#rend-1">rend</a></b></span>() const : QSet::const_reverse_iterator</li> <li class="fn"><span class="name"><b><a href="qset.html#reserve">reserve</a></b></span>(int )</li> <li class="fn"><span class="name"><b><a href="qset.html#size">size</a></b></span>() const : int</li> <li class="fn"><span class="name"><b><a href="qset.html#squeeze">squeeze</a></b></span>()</li> <li class="fn"><span class="name"><b><a href="qset.html#subtract">subtract</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#swap">swap</a></b></span>(QSet<T> &)</li> <li class="fn"><span class="name"><b><a href="qset.html#toList">toList</a></b></span>() const : QList<T></li> <li class="fn"><span class="name"><b><a href="qset.html#unite">unite</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#values">values</a></b></span>() const : QList<T></li> <li class="fn"><span class="name"><b><a href="qset.html#operator-not-eq">operator!=</a></b></span>(const QSet<T> &) const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-and">operator&</a></b></span>(const QSet<T> &) const : QSet<T></li> <li class="fn"><span class="name"><b><a href="qset.html#operator-and-eq">operator&=</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-and-eq-1">operator&=</a></b></span>(const T &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-2b">operator+</a></b></span>(const QSet<T> &) const : QSet<T></li> <li class="fn"><span class="name"><b><a href="qset.html#operator-2b-eq">operator+=</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-2b-eq-1">operator+=</a></b></span>(const T &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-">operator-</a></b></span>(const QSet<T> &) const : QSet<T></li> <li class="fn"><span class="name"><b><a href="qset.html#operator--eq">operator-=</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator--eq-1">operator-=</a></b></span>(const T &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-lt-lt">operator<<</a></b></span>(const T &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-eq-eq">operator==</a></b></span>(const QSet<T> &) const : bool</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-7c">operator|</a></b></span>(const QSet<T> &) const : QSet<T></li> <li class="fn"><span class="name"><b><a href="qset.html#operator-7c-eq">operator|=</a></b></span>(const QSet<T> &) : QSet<T> &</li> <li class="fn"><span class="name"><b><a href="qset.html#operator-7c-eq-1">operator|=</a></b></span>(const T &) : QSet<T> &</li> </ul> </td></tr> </table></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>