
We bake cookies in your browser for a better experience. Using this site means that you consent.Read More
TheQLinkedList class is a template class that provides linked lists.More...
| Header: | #include <QLinkedList> |
| Inherited By: |
Note: All functions in this class arereentrant.
| class | const_iterator |
| class | iterator |
| typedef | ConstIterator |
| typedef | Iterator |
| typedef | const_pointer |
| typedef | const_reference |
| typedef | difference_type |
| typedef | pointer |
| typedef | reference |
| typedef | size_type |
| typedef | value_type |
| QLinkedList() | |
| QLinkedList(const QLinkedList<T> & other) | |
| ~QLinkedList() | |
| void | append(const T & value) |
| T & | back() |
| const T & | back() const |
| iterator | begin() |
| const_iterator | begin() const |
| void | clear() |
| const_iterator | constBegin() const |
| const_iterator | constEnd() const |
| bool | contains(const T & value) const |
| int | count(const T & value) const |
| int | count() const |
| bool | empty() const |
| iterator | end() |
| const_iterator | end() const |
| bool | endsWith(const T & value) const |
| iterator | erase(iterator pos) |
| iterator | erase(iterator begin, iterator end) |
| T & | first() |
| const T & | first() const |
| T & | front() |
| const T & | front() const |
| iterator | insert(iterator before, const T & value) |
| bool | isEmpty() const |
| T & | last() |
| const T & | last() const |
| void | pop_back() |
| void | pop_front() |
| void | prepend(const T & value) |
| void | push_back(const T & value) |
| void | push_front(const T & value) |
| int | removeAll(const T & value) |
| void | removeFirst() |
| void | removeLast() |
| bool | removeOne(const T & value) |
| int | size() const |
| bool | startsWith(const T & value) const |
| void | swap(QLinkedList<T> & other) |
| T | takeFirst() |
| T | takeLast() |
| std::list<T> | toStdList() const |
| bool | operator!=(const QLinkedList<T> & other) const |
| QLinkedList<T> | operator+(const QLinkedList<T> & other) const |
| QLinkedList<T> & | operator+=(const QLinkedList<T> & other) |
| QLinkedList<T> & | operator+=(const T & value) |
| QLinkedList<T> & | operator<<(const QLinkedList<T> & other) |
| QLinkedList<T> & | operator<<(const T & value) |
| QLinkedList<T> & | operator=(const QLinkedList<T> & other) |
| QLinkedList<T> & | operator=(QLinkedList<T> && other) |
| bool | operator==(const QLinkedList<T> & other) const |
| QLinkedList<T> | fromStdList(const std::list<T> & list) |
| QDataStream & | operator<<(QDataStream & out, const QLinkedList<T> & list) |
| QDataStream & | operator>>(QDataStream & in, QLinkedList<T> & list) |
TheQLinkedList class is a template class that provides linked lists.
QLinkedList<T> is one of Qt's genericcontainer classes. It stores a list of values and provides iterator-based access as well asconstant time insertions and removals.
QList<T>,QLinkedList<T>, andQVector<T> provide similar functionality. Here's an overview:
Here's an example of aQLinkedList that stores integers and aQLinkedList that storesQTime values:
QLinkedList<int> integerList;QLinkedList<QTime> timeList;
QLinkedList stores a list of items. The default constructor creates an empty list. To insert items into the list, you can use operator<<():
QLinkedList<QString> list;list<<"one"<<"two"<<"three";// list: ["one", "two", "three"]
If you want to get the first or last item in a linked list, usefirst() orlast(). If you want to remove an item from either end of the list, useremoveFirst() orremoveLast(). If you want to remove all occurrences of a given value in the list, useremoveAll().
A common requirement is to remove the first or last item in the list and do something with it. For this,QLinkedList providestakeFirst() andtakeLast(). Here's a loop that removes the items from a list one at a time and callsdelete on them:
QLinkedList<QWidget*> list;...while (!list.isEmpty())delete list.takeFirst();
QLinkedList's value type must be anassignable data type. This covers most data types that are commonly used, but the compiler won't let you, for example, store aQWidget as a value; instead, store aQWidget *. A few functions have additional requirements; for example,contains() andremoveAll() expect the value type to supportoperator==(). These requirements are documented on a per-function basis.
If you want to insert, modify, or remove items in the middle of the list, you must use an iterator.QLinkedList provides bothJava-style iterators (QLinkedListIterator andQMutableLinkedListIterator) andSTL-style iterators (QLinkedList::const_iterator andQLinkedList::iterator). See the documentation for these classes for details.
See alsoQLinkedListIterator,QMutableLinkedListIterator,QList, andQVector.
Qt-style synonym forQLinkedList::const_iterator.
Qt-style synonym forQLinkedList::iterator.
Typedef for const T *. Provided for STL compatibility.
Typedef for const T &. Provided for STL compatibility.
Typedef for ptrdiff_t. Provided for STL compatibility.
Typedef for T *. Provided for STL compatibility.
Typedef for T &. Provided for STL compatibility.
Typedef for int. Provided for STL compatibility.
Typedef for T. Provided for STL compatibility.
Constructs an empty list.
Constructs a copy ofother.
This operation occurs inconstant time, becauseQLinkedList isimplicitly shared. This makes returning aQLinkedList from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and this takeslinear time.
See alsooperator=().
Destroys the list. References to the values in the list, and all iterators over this list, become invalid.
Insertsvalue at the end of the list.
Example:
QLinkedList<QString> list;list.append("one");list.append("two");list.append("three");// list: ["one", "two", "three"]
This is the same as list.insert(end(),value).
See alsooperator<<(),prepend(), andinsert().
This function is provided for STL compatibility. It is equivalent tolast().
This is an overloaded function.
Returns an STL-style iterator pointing to the first item in the list.
See alsoconstBegin() andend().
This is an overloaded function.
Removes all the items in the list.
See alsoremoveAll().
Returns a const STL-style iterator pointing to the first item in the list.
See alsobegin() andconstEnd().
Returns a const STL-style iterator pointing to the imaginary item after the last item in the list.
See alsoconstBegin() andend().
Returns true if the list contains an occurrence ofvalue; otherwise returns false.
This function requires the value type to have an implementation ofoperator==().
See alsoQLinkedListIterator::findNext() andQLinkedListIterator::findPrevious().
Returns the number of occurrences ofvalue in the list.
This function requires the value type to have an implementation ofoperator==().
See alsocontains().
Same assize().
This function is provided for STL compatibility. It is equivalent toisEmpty() and returns true if the list is empty.
Returns an STL-style iterator pointing to the imaginary item after the last item in the list.
See alsobegin() andconstEnd().
This is an overloaded function.
Returns true if the list is not empty and its last item is equal tovalue; otherwise returns false.
This function was introduced in Qt 4.5.
Removes the item pointed to by the iteratorpos from the list, and returns an iterator to the next item in the list (which may beend()).
See alsoinsert().
This is an overloaded function.
Removes all the items frombegin up to (but not including)end.
Returns a reference to the first item in the list. This function assumes that the list isn't empty.
This is an overloaded function.
[static]QLinkedList<T> QLinkedList::fromStdList(conststd::list<T> & list)Returns aQLinkedList object with the data contained inlist. The order of the elements in theQLinkedList is the same as inlist.
Example:
std::list<double> stdlist;list.push_back(1.2);list.push_back(0.5);list.push_back(3.14);QLinkedList<double> list=QLinkedList<double>::fromStdList(stdlist);
This function was introduced in Qt 4.1.
See alsotoStdList().
This function is provided for STL compatibility. It is equivalent tofirst().
This is an overloaded function.
Insertsvalue in front of the item pointed to by the iteratorbefore. Returns an iterator pointing at the inserted item.
See alsoerase().
Returns true if the list contains no items; otherwise returns false.
See alsosize().
Returns a reference to the last item in the list. This function assumes that the list isn't empty.
This is an overloaded function.
This function is provided for STL compatibility. It is equivalent toremoveLast().
This function is provided for STL compatibility. It is equivalent toremoveFirst().
Insertsvalue at the beginning of the list.
Example:
QLinkedList<QString> list;list.prepend("one");list.prepend("two");list.prepend("three");// list: ["three", "two", "one"]
This is the same as list.insert(begin(),value).
This function is provided for STL compatibility. It is equivalent to append(value).
This function is provided for STL compatibility. It is equivalent to prepend(value).
Removes all occurrences ofvalue in the list.
Example:
QList<QString> list;list<<"sun"<<"cloud"<<"sun"<<"rain";list.removeAll("sun");// list: ["cloud", "rain"]
This function requires the value type to have an implementation ofoperator==().
See alsoinsert().
Removes the first item in the list.
This is the same as erase(begin()).
See alsoremoveLast() anderase().
Removes the last item in the list.
See alsoremoveFirst() anderase().
Removes the first occurrences ofvalue in the list. Returns true on success; otherwise returns false.
Example:
QList<QString> list;list<<"sun"<<"cloud"<<"sun"<<"rain";list.removeOne("sun");// list: ["cloud", "sun", "rain"]
This function requires the value type to have an implementation ofoperator==().
This function was introduced in Qt 4.4.
See alsoinsert().
Returns the number of items in the list.
Returns true if the list is not empty and its first item is equal tovalue; otherwise returns false.
This function was introduced in Qt 4.5.
Swaps listother with this list. This operation is very fast and never fails.
This function was introduced in Qt 4.8.
Removes the first item in the list and returns it.
If you don't use the return value,removeFirst() is more efficient.
See alsotakeLast() andremoveFirst().
Removes the last item in the list and returns it.
If you don't use the return value,removeLast() is more efficient.
See alsotakeFirst() andremoveLast().
Returns a std::list object with the data contained in thisQLinkedList. Example:
QLinkedList<double> list;list<<1.2<<0.5<<3.14;std::list<double> stdlist= list.toStdList();
This function was introduced in Qt 4.1.
See alsofromStdList().
Returns true ifother is not equal to this list; otherwise returns false.
Two lists are considered equal if they contain the same values in the same order.
This function requires the value type to implementoperator==().
See alsooperator==().
Returns a list that contains all the items in this list followed by all the items in theother list.
See alsooperator+=().
Appends the items of theother list to this list and returns a reference to this list.
See alsooperator+() andappend().
This is an overloaded function.
Appendsvalue to the list.
Appends the items of theother list to this list and returns a reference to this list.
See alsooperator+=() andappend().
This is an overloaded function.
Appendsvalue to the list.
Assignsother to this list and returns a reference to this list.
Returns true ifother is equal to this list; otherwise returns false.
Two lists are considered equal if they contain the same values in the same order.
This function requires the value type to implementoperator==().
See alsooperator!=().
Writes the linked listlist to streamout.
This function requires the value type to implementoperator<<().
See alsoFormat of the QDataStream operators.
Reads a linked list from streamin intolist.
This function requires the value type to implementoperator>>().
See alsoFormat of the QDataStream operators.
© 2016 The Qt Company Ltd. Documentation contributions included herein are the copyrights of their respective owners. The documentation provided herein is licensed under the terms of theGNU Free Documentation License version 1.3 as published by the Free Software Foundation. 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.