QLinkedList 类是提供链接列表的模板类。 更多...
| 头： | #include <QLinkedList> |
| CMake: |
find_package(Qt6 REQUIRED COMPONENTS Core5Compat)
target_link_libraries(mytarget PRIVATE Qt6::Core5Compat) |
| qmake: | QT += core5compat |
注意： 此类的所有函数 可重入 .
| class | const_iterator |
| class | iterator |
| ConstIterator | |
| Iterator | |
| const_pointer | |
| const_reference | |
| const_reverse_iterator | |
| difference_type | |
| pointer | |
| reference | |
| reverse_iterator | |
| size_type | |
| value_type |
| QLinkedList () | |
| QLinkedList (const QLinkedList<T> & other ) | |
| QLinkedList (std::initializer_list<T> list ) | |
| QLinkedList (InputIterator first , InputIterator last ) | |
| QLinkedList (QLinkedList<T> && other ) | |
| ~QLinkedList () | |
| void | append (const T & value ) |
| T & | back () |
| const T & | back () const |
| QLinkedList::iterator | begin () |
| QLinkedList::const_iterator | begin () const |
| QLinkedList::const_iterator | cbegin () const |
| QLinkedList::const_iterator | cend () const |
| void | clear () |
| QLinkedList::const_iterator | constBegin () const |
| QLinkedList::const_iterator | constEnd () const |
| bool | contains (const T & value ) const |
| int | count (const T & value ) const |
| int | count () const |
| QLinkedList::const_reverse_iterator | crbegin () const |
| QLinkedList::const_reverse_iterator | crend () const |
| bool | empty () const |
| QLinkedList::iterator | end () |
| QLinkedList::const_iterator | end () const |
| bool | endsWith (const T & value ) const |
| QLinkedList::iterator | erase (QLinkedList::iterator pos ) |
| QLinkedList::iterator | erase (QLinkedList::iterator begin , QLinkedList::iterator end ) |
| T & | first () |
| const T & | first () const |
| T & | front () |
| const T & | front () const |
| QLinkedList::iterator | insert (QLinkedList::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 ) |
| QLinkedList::reverse_iterator | rbegin () |
| QLinkedList::const_reverse_iterator | rbegin () const |
| int | removeAll (const T & value ) |
| void | removeFirst () |
| void | removeLast () |
| bool | removeOne (const T & value ) |
| QLinkedList::reverse_iterator | rend () |
| QLinkedList::const_reverse_iterator | rend () const |
| 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 ) |
| bool | operator== (const QLinkedList<T> & other ) const |
| QLinkedList<T> | fromStdList (const std::list<T> & list ) |
| QDataStreamIfHasOStreamOperatorsContainer<QLinkedList<T>, T> | operator<< (QDataStream & out , const QLinkedList<T> & list ) |
| QDataStreamIfHasIStreamOperatorsContainer<QLinkedList<T>, T> | operator>> (QDataStream & in , QLinkedList<T> & list ) |
QLinkedList<T> is one of Qt's generic 容器类 . It stores a list of values and provides iterator-based access as well as 常量时间 insertions and removals.
QList <T> and QLinkedList<T> provide similar functionality. Here's an overview:
Here's an example of a QLinkedList that stores integers and a QLinkedList that stores QTime 值：
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, use first () 或 last (). If you want to remove an item from either end of the list, use removeFirst () 或 removeLast (). If you want to remove all occurrences of a given value in the list, use removeAll ().
A common requirement is to remove the first or last item in the list and do something with it. For this, QLinkedList provides
takeFirst
() 和
takeLast
(). Here's a loop that removes the items from a list one at a time and calls
delete
on them:
QLinkedList<QWidget *> list; ... while (!list.isEmpty()) delete list.takeFirst();
QLinkedList's value type must be an
可赋值数据类型
. This covers most data types that are commonly used, but the compiler won't let you, for example, store a QWidget as a value; instead, store a QWidget *. A few functions have additional requirements; for example,
contains
() 和
removeAll
() expect the value type to support
operator==()
. 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 both Java 风格迭代器 ( QLinkedListIterator and QMutableLinkedListIterator ) 和 STL 样式迭代器 ( QLinkedList::const_iterator and QLinkedList::iterator ). See the documentation for these classes for details.
另请参阅 QLinkedListIterator , QMutableLinkedListIterator ，和 QList .
Qt 样式同义词 QLinkedList::const_iterator .
Qt 样式同义词 QLinkedList::iterator .
Typedef for const T *. Provided for STL compatibility.
Typedef for const T &. Provided for STL compatibility.
The QLinkedList::const_reverse_iterator typedef provides an STL-style const reverse iterator for QLinkedList .
It is simply a typedef for
std::reverse_iterator<QLinkedList::const_iterator>
.
警告： 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 隐式共享迭代器问题 .
另请参阅 QLinkedList::rbegin (), QLinkedList::rend (), QLinkedList::reverse_iterator ，和 QLinkedList::const_iterator .
typedef 对于 ptrdiff_t。为兼容 STL 提供。
Typedef for T *. Provided for STL compatibility.
Typedef for T &. Provided for STL compatibility.
The QLinkedList::reverse_iterator typedef provides an STL-style non-const reverse iterator for QLinkedList .
It is simply a typedef for
std::reverse_iterator<QLinkedList::iterator>
.
警告： 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 隐式共享迭代器问题 .
另请参阅 QLinkedList::rbegin (), QLinkedList::rend (), QLinkedList::const_reverse_iterator ，和 QLinkedList::iterator .
typedef 对于 int。为兼容 STL 提供。
typedef 对于 T。为兼容 STL 提供。
构造空列表。
构造副本为 other .
This operation occurs in 常量时间 , because QLinkedList is 隐式共享 . This makes returning a QLinkedList from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and this takes 线性时间 .
另请参阅 operator= ().
Constructs a list from the std::initializer_list specified by list .
This constructor is only enabled if the compiler supports C++11 initializer lists.
Constructs a list with the contents in the iterator range [ first , last ).
The value type of
InputIterator
must be convertible to
T
.
Move-constructs a QLinkedList instance, making it point at the same object that other 所指向的。
Destroys the list. References to the values in the list, and all iterators over this list, become invalid.
插入 value 在列表末尾。
范例：
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 ).
另请参阅 operator<< (), prepend ()，和 insert ().
此函数为兼容 STL (标准模板库) 提供。它相当于 last ().
这是重载函数。
返回 STL 样式迭代器 指向列表首项。
另请参阅 constBegin () 和 end ().
这是重载函数。
返回常量 STL 样式迭代器 指向列表首项。
返回常量 STL 样式迭代器 pointing to the imaginary item after the last item in the list.
Removes all the items in the list.
另请参阅 removeAll ().
返回常量 STL 样式迭代器 指向列表首项。
返回常量 STL 样式迭代器 pointing to the imaginary item after the last item in the list.
另请参阅 constBegin () 和 end ().
返回
true
if the list contains an occurrence of
value
；否则返回
false
.
This function requires the value type to have an implementation of
operator==()
.
另请参阅 QLinkedListIterator::findNext () 和 QLinkedListIterator::findPrevious ().
Returns the number of occurrences of value 在列表中。
This function requires the value type to have an implementation of
operator==()
.
另请参阅 contains ().
如同 size ().
返回常量 STL-style reverse iterator pointing to the first item in the list, in reverse order.
另请参阅 begin (), rbegin ()，和 rend ().
返回常量 STL-style reverse iterator pointing to one past the last item in the list, in reverse order.
另请参阅 end (), rend ()，和 rbegin ().
此函数为兼容 STL (标准模板库) 提供。它相当于
isEmpty
() 并返回
true
if the list is empty.
返回 STL 样式迭代器 pointing to the imaginary item after the last item in the list.
这是重载函数。
返回
true
if the list is not empty and its last item is equal to
value
；否则返回
false
.
Removes the item pointed to by the iterator pos from the list, and returns an iterator to the next item in the list (which may be end ()).
另请参阅 insert ().
这是重载函数。
Removes all the items from begin 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.
这是重载函数。
[static]
QLinkedList
<
T
> QLinkedList::
fromStdList
(const
std::list
<
T
> &
list
)
返回 QLinkedList object with the data contained in list . The order of the elements in the QLinkedList is the same as in list .
范例：
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);
另请参阅 toStdList ().
此函数为兼容 STL (标准模板库) 提供。它相当于 first ().
这是重载函数。
插入 value in front of the item pointed to by the iterator before . Returns an iterator pointing at the inserted item.
另请参阅 erase ().
返回
true
if the list contains no items; otherwise returns false.
另请参阅 size ().
Returns a reference to the last item in the list. This function assumes that the list isn't empty.
这是重载函数。
此函数为兼容 STL (标准模板库) 提供。它相当于 removeLast ().
此函数为兼容 STL (标准模板库) 提供。它相当于 removeFirst ().
插入 value 在列表的开头。
范例：
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 ).
返回 STL-style reverse iterator pointing to the first item in the list, in reverse order.
另请参阅 begin (), crbegin ()，和 rend ().
这是重载函数。
Removes all occurrences of value 在列表中。
范例：
QList<QString> list; list << "sun" << "cloud" << "sun" << "rain"; list.removeAll("sun"); // list: ["cloud", "rain"]
This function requires the value type to have an implementation of
operator==()
.
另请参阅 insert ().
Removes the first item in the list.
This is the same as erase( begin ()).
另请参阅 removeLast () 和 erase ().
Removes the last item in the list.
另请参阅 removeFirst () 和 erase ().
Removes the first occurrences of
value
in the list. Returns
true
当成功时；否则返回
false
.
范例：
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 of
operator==()
.
另请参阅 insert ().
返回 STL-style reverse iterator pointing to one past the last item in the list, in reverse order.
另请参阅 end (), crend ()，和 rbegin ().
这是重载函数。
Returns the number of items in the list.
返回
true
if the list is not empty and its first item is equal to
value
；否则返回
false
.
Swaps list other with this list. This operation is very fast and never fails.
Removes the first item in the list and returns it.
若不使用返回值， removeFirst () 效率更高。
另请参阅 takeLast () 和 removeFirst ().
Removes the last item in the list and returns it.
若不使用返回值， removeLast () 效率更高。
另请参阅 takeFirst () 和 removeLast ().
Returns a std::list object with the data contained in this QLinkedList 。范例：
QLinkedList<double> list; list << 1.2 << 0.5 << 3.14; std::list<double> stdlist = list.toStdList();
另请参阅 fromStdList ().
返回
true
if
other
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 implement
operator==()
.
另请参阅 operator== ().
Returns a list that contains all the items in this list followed by all the items in the other 列表。
另请参阅 operator+= ().
Appends the items of the other list to this list and returns a reference to this list.
另请参阅 operator+ () 和 append ().
这是重载函数。
追加 value to the list.
Appends the items of the other list to this list and returns a reference to this list.
另请参阅 operator+= () 和 append ().
这是重载函数。
追加 value to the list.
赋值 other to this list and returns a reference to this list.
返回
true
if
other
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 implement
operator==()
.
另请参阅 operator!= ().
Writes the linked list list 到流 out .
This function requires the value type to implement
operator<<()
.
另请参阅 QDataStream 运算符格式 .
Reads a linked list from stream in into list .
This function requires the value type to implement
operator>>()
.
另请参阅 QDataStream 运算符格式 .