diff options
Diffstat (limited to 'src/corelib/tools/qlinkedlist.cpp')
-rw-r--r-- | src/corelib/tools/qlinkedlist.cpp | 211 |
1 files changed, 105 insertions, 106 deletions
diff --git a/src/corelib/tools/qlinkedlist.cpp b/src/corelib/tools/qlinkedlist.cpp index 642d2a28a0..d9d93862e5 100644 --- a/src/corelib/tools/qlinkedlist.cpp +++ b/src/corelib/tools/qlinkedlist.cpp @@ -118,13 +118,13 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedListIterator, QMutableLinkedListIterator, QList, QVector */ -/*! \fn QLinkedList::QLinkedList() +/*! \fn template <class T> QLinkedList<T>::QLinkedList() Constructs an empty list. */ /*! - \fn QLinkedList::QLinkedList(QLinkedList<T> &&other) + \fn template <class T> QLinkedList<T>::QLinkedList(QLinkedList<T> &&other) Move-constructs a QLinkedList instance, making it point at the same object that \a other was pointing to. @@ -132,7 +132,7 @@ const QLinkedListData QLinkedListData::shared_null = { \since 5.2 */ -/*! \fn QLinkedList::QLinkedList(const QLinkedList<T> &other) +/*! \fn template <class T> QLinkedList<T>::QLinkedList(const QLinkedList<T> &other) Constructs a copy of \a other. @@ -144,7 +144,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator=() */ -/*! \fn QLinkedList::QLinkedList(std::initializer_list<T> list) +/*! \fn template <class T> QLinkedList<T>::QLinkedList(std::initializer_list<T> list) \since 5.2 Constructs a list from the std::initializer_list specified by \a list. @@ -153,26 +153,26 @@ const QLinkedListData QLinkedListData::shared_null = { initializer lists. */ -/*! \fn QLinkedList::~QLinkedList() +/*! \fn template <class T> QLinkedList<T>::~QLinkedList() Destroys the list. References to the values in the list, and all iterators over this list, become invalid. */ -/*! \fn QLinkedList<T> &QLinkedList::operator=(const QLinkedList<T> &other) +/*! \fn template <class T> QLinkedList<T> &QLinkedList<T>::operator=(const QLinkedList<T> &other) Assigns \a other to this list and returns a reference to this list. */ -/*! \fn void QLinkedList::swap(QLinkedList<T> &other) +/*! \fn template <class T> void QLinkedList<T>::swap(QLinkedList<T> &other) \since 4.8 Swaps list \a other with this list. This operation is very fast and never fails. */ -/*! \fn bool QLinkedList::operator==(const QLinkedList<T> &other) const +/*! \fn template <class T> bool QLinkedList<T>::operator==(const QLinkedList<T> &other) const Returns \c true if \a other is equal to this list; otherwise returns false. @@ -186,7 +186,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator!=() */ -/*! \fn bool QLinkedList::operator!=(const QLinkedList<T> &other) const +/*! \fn template <class T> bool QLinkedList<T>::operator!=(const QLinkedList<T> &other) const Returns \c true if \a other is not equal to this list; otherwise returns \c false. @@ -200,34 +200,34 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator==() */ -/*! \fn int QLinkedList::size() const +/*! \fn template <class T> int QLinkedList<T>::size() const Returns the number of items in the list. \sa isEmpty(), count() */ -/*! \fn void QLinkedList::detach() +/*! \fn template <class T> void QLinkedList<T>::detach() \internal */ -/*! \fn bool QLinkedList::isDetached() const +/*! \fn template <class T> bool QLinkedList<T>::isDetached() const \internal */ -/*! \fn void QLinkedList::setSharable(bool sharable) +/*! \fn template <class T> void QLinkedList<T>::setSharable(bool sharable) \internal */ -/*! \fn bool QLinkedList::isSharedWith(const QLinkedList<T> &other) const +/*! \fn template <class T> bool QLinkedList<T>::isSharedWith(const QLinkedList<T> &other) const \internal */ -/*! \fn bool QLinkedList::isEmpty() const +/*! \fn template <class T> bool QLinkedList<T>::isEmpty() const Returns \c true if the list contains no items; otherwise returns false. @@ -235,14 +235,14 @@ const QLinkedListData QLinkedListData::shared_null = { \sa size() */ -/*! \fn void QLinkedList::clear() +/*! \fn template <class T> void QLinkedList<T>::clear() Removes all the items in the list. \sa removeAll() */ -/*! \fn void QLinkedList::append(const T &value) +/*! \fn template <class T> void QLinkedList<T>::append(const T &value) Inserts \a value at the end of the list. @@ -254,7 +254,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator<<(), prepend(), insert() */ -/*! \fn void QLinkedList::prepend(const T &value) +/*! \fn template <class T> void QLinkedList<T>::prepend(const T &value) Inserts \a value at the beginning of the list. @@ -266,7 +266,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa append(), insert() */ -/*! \fn int QLinkedList::removeAll(const T &value) +/*! \fn template <class T> int QLinkedList<T>::removeAll(const T &value) Removes all occurrences of \a value in the list. @@ -280,7 +280,7 @@ const QLinkedListData QLinkedListData::shared_null = { */ /*! - \fn bool QLinkedList::removeOne(const T &value) + \fn template <class T> bool QLinkedList<T>::removeOne(const T &value) \since 4.4 Removes the first occurrences of \a value in the list. Returns \c true on @@ -295,7 +295,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa insert() */ -/*! \fn bool QLinkedList::contains(const T &value) const +/*! \fn template <class T> bool QLinkedList<T>::contains(const T &value) const Returns \c true if the list contains an occurrence of \a value; otherwise returns \c false. @@ -306,7 +306,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedListIterator::findNext(), QLinkedListIterator::findPrevious() */ -/*! \fn int QLinkedList::count(const T &value) const +/*! \fn template <class T> int QLinkedList<T>::count(const T &value) const Returns the number of occurrences of \a value in the list. @@ -316,7 +316,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa contains() */ -/*! \fn bool QLinkedList::startsWith(const T &value) const +/*! \fn template <class T> bool QLinkedList<T>::startsWith(const T &value) const \since 4.5 Returns \c true if the list is not empty and its first @@ -325,7 +325,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa isEmpty(), first() */ -/*! \fn bool QLinkedList::endsWith(const T &value) const +/*! \fn template <class T> bool QLinkedList<T>::endsWith(const T &value) const \since 4.5 Returns \c true if the list is not empty and its last @@ -334,7 +334,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa isEmpty(), last() */ -/*! \fn QLinkedList::iterator QLinkedList::begin() +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::begin() Returns an \l{STL-style iterators}{STL-style iterator} pointing to the first item in the list. @@ -342,12 +342,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa constBegin(), end() */ -/*! \fn QLinkedList::const_iterator QLinkedList::begin() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::begin() const \overload */ -/*! \fn QLinkedList::const_iterator QLinkedList::cbegin() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::cbegin() const \since 5.0 Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the first item @@ -356,7 +356,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa begin(), cend() */ -/*! \fn QLinkedList::const_iterator QLinkedList::constBegin() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::constBegin() const Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the first item in the list. @@ -364,7 +364,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa begin(), constEnd() */ -/*! \fn QLinkedList::iterator QLinkedList::end() +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::end() Returns an \l{STL-style iterators}{STL-style iterator} pointing to the imaginary item after the last item in the list. @@ -372,12 +372,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa begin(), constEnd() */ -/*! \fn QLinkedList::const_iterator QLinkedList::end() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::end() const \overload */ -/*! \fn QLinkedList::const_iterator QLinkedList::cend() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::cend() const \since 5.0 Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the imaginary @@ -386,7 +386,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa cbegin(), end() */ -/*! \fn QLinkedList::const_iterator QLinkedList::constEnd() const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::constEnd() const Returns a const \l{STL-style iterators}{STL-style iterator} pointing to the imaginary item after the last item in the list. @@ -394,7 +394,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa constBegin(), end() */ -/*! \fn QLinkedList::reverse_iterator QLinkedList::rbegin() +/*! \fn template <class T> QLinkedList<T>::reverse_iterator QLinkedList<T>::rbegin() \since 5.6 Returns a \l{STL-style iterators}{STL-style} reverse iterator pointing to the first @@ -403,12 +403,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa begin(), crbegin(), rend() */ -/*! \fn QLinkedList::const_reverse_iterator QLinkedList::rbegin() const +/*! \fn template <class T> QLinkedList<T>::const_reverse_iterator QLinkedList<T>::rbegin() const \since 5.6 \overload */ -/*! \fn QLinkedList::const_reverse_iterator QLinkedList::crbegin() const +/*! \fn template <class T> QLinkedList<T>::const_reverse_iterator QLinkedList<T>::crbegin() const \since 5.6 Returns a const \l{STL-style iterators}{STL-style} reverse iterator pointing to the first @@ -417,7 +417,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa begin(), rbegin(), rend() */ -/*! \fn QLinkedList::reverse_iterator QLinkedList::rend() +/*! \fn template <class T> QLinkedList<T>::reverse_iterator QLinkedList<T>::rend() \since 5.6 Returns a \l{STL-style iterators}{STL-style} reverse iterator pointing to one past @@ -426,12 +426,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa end(), crend(), rbegin() */ -/*! \fn QLinkedList::const_reverse_iterator QLinkedList::rend() const +/*! \fn template <class T> QLinkedList<T>::const_reverse_iterator QLinkedList<T>::rend() const \since 5.6 \overload */ -/*! \fn QLinkedList::const_reverse_iterator QLinkedList::crend() const +/*! \fn template <class T> QLinkedList<T>::const_reverse_iterator QLinkedList<T>::crend() const \since 5.6 Returns a const \l{STL-style iterators}{STL-style} reverse iterator pointing to one @@ -440,7 +440,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa end(), rend(), rbegin() */ -/*! \fn QLinkedList::iterator QLinkedList::insert(iterator before, const T &value) +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::insert(iterator before, const T &value) Inserts \a value in front of the item pointed to by the iterator \a before. Returns an iterator pointing at the inserted item. @@ -448,7 +448,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa erase() */ -/*! \fn QLinkedList::iterator QLinkedList::erase(iterator pos) +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::erase(iterator pos) Removes the item pointed to by the iterator \a pos from the list, and returns an iterator to the next item in the list (which may be @@ -457,7 +457,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa insert() */ -/*! \fn QLinkedList::iterator QLinkedList::erase(iterator begin, iterator end) +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::erase(iterator begin, iterator end) \overload @@ -549,12 +549,12 @@ const QLinkedListData QLinkedListData::shared_null = { Typedef for ptrdiff_t. Provided for STL compatibility. */ -/*! \fn int QLinkedList::count() const +/*! \fn template <class T> int QLinkedList<T>::count() const Same as size(). */ -/*! \fn T& QLinkedList::first() +/*! \fn template <class T> T& QLinkedList<T>::first() Returns a reference to the first item in the list. This function assumes that the list isn't empty. @@ -562,12 +562,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa last(), isEmpty() */ -/*! \fn const T& QLinkedList::first() const +/*! \fn template <class T> const T& QLinkedList<T>::first() const \overload */ -/*! \fn T& QLinkedList::last() +/*! \fn template <class T> T& QLinkedList<T>::last() Returns a reference to the last item in the list. This function assumes that the list isn't empty. @@ -575,12 +575,12 @@ const QLinkedListData QLinkedListData::shared_null = { \sa first(), isEmpty() */ -/*! \fn const T& QLinkedList::last() const +/*! \fn template <class T> const T& QLinkedList<T>::last() const \overload */ -/*! \fn void QLinkedList::removeFirst() +/*! \fn template <class T> void QLinkedList<T>::removeFirst() Removes the first item in the list. @@ -589,14 +589,14 @@ const QLinkedListData QLinkedListData::shared_null = { \sa removeLast(), erase() */ -/*! \fn void QLinkedList::removeLast() +/*! \fn template <class T> void QLinkedList<T>::removeLast() Removes the last item in the list. \sa removeFirst(), erase() */ -/*! \fn T QLinkedList::takeFirst() +/*! \fn template <class T> T QLinkedList<T>::takeFirst() Removes the first item in the list and returns it. @@ -606,7 +606,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa takeLast(), removeFirst() */ -/*! \fn T QLinkedList::takeLast() +/*! \fn template <class T> T QLinkedList<T>::takeLast() Removes the last item in the list and returns it. @@ -616,59 +616,59 @@ const QLinkedListData QLinkedListData::shared_null = { \sa takeFirst(), removeLast() */ -/*! \fn void QLinkedList::push_back(const T &value) +/*! \fn template <class T> void QLinkedList<T>::push_back(const T &value) This function is provided for STL compatibility. It is equivalent to append(\a value). */ -/*! \fn void QLinkedList::push_front(const T &value) +/*! \fn template <class T> void QLinkedList<T>::push_front(const T &value) This function is provided for STL compatibility. It is equivalent to prepend(\a value). */ -/*! \fn T& QLinkedList::front() +/*! \fn template <class T> T& QLinkedList<T>::front() This function is provided for STL compatibility. It is equivalent to first(). */ -/*! \fn const T& QLinkedList::front() const +/*! \fn template <class T> const T& QLinkedList<T>::front() const \overload */ -/*! \fn T& QLinkedList::back() +/*! \fn template <class T> T& QLinkedList<T>::back() This function is provided for STL compatibility. It is equivalent to last(). */ -/*! \fn const T& QLinkedList::back() const +/*! \fn template <class T> const T& QLinkedList<T>::back() const \overload */ -/*! \fn void QLinkedList::pop_front() +/*! \fn template <class T> void QLinkedList<T>::pop_front() This function is provided for STL compatibility. It is equivalent to removeFirst(). */ -/*! \fn void QLinkedList::pop_back() +/*! \fn template <class T> void QLinkedList<T>::pop_back() This function is provided for STL compatibility. It is equivalent to removeLast(). */ -/*! \fn bool QLinkedList::empty() const +/*! \fn template <class T> bool QLinkedList<T>::empty() const This function is provided for STL compatibility. It is equivalent to isEmpty() and returns \c true if the list is empty. */ -/*! \fn QLinkedList<T> &QLinkedList::operator+=(const QLinkedList<T> &other) +/*! \fn template <class T> QLinkedList<T> &QLinkedList<T>::operator+=(const QLinkedList<T> &other) Appends the items of the \a other list to this list and returns a reference to this list. @@ -676,14 +676,14 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+(), append() */ -/*! \fn void QLinkedList::operator+=(const T &value) +/*! \fn template <class T> void QLinkedList<T>::operator+=(const T &value) \overload Appends \a value to the list. */ -/*! \fn QLinkedList<T> QLinkedList::operator+(const QLinkedList<T> &other) const +/*! \fn template <class T> QLinkedList<T> QLinkedList<T>::operator+(const QLinkedList<T> &other) const Returns a list that contains all the items in this list followed by all the items in the \a other list. @@ -691,7 +691,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+=() */ -/*! \fn QLinkedList<T> &QLinkedList::operator<<(const QLinkedList<T> &other) +/*! \fn template <class T> QLinkedList<T> &QLinkedList<T>::operator<<(const QLinkedList<T> &other) Appends the items of the \a other list to this list and returns a reference to this list. @@ -699,7 +699,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+=(), append() */ -/*! \fn QLinkedList<T> &QLinkedList::operator<<(const T &value) +/*! \fn template <class T> QLinkedList<T> &QLinkedList<T>::operator<<(const T &value) \overload @@ -777,7 +777,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedList::const_iterator, QMutableLinkedListIterator */ -/*! \fn QLinkedList::iterator::iterator() +/*! \fn template <class T> QLinkedList<T>::iterator::iterator() Constructs an uninitialized iterator. @@ -788,7 +788,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedList::begin(), QLinkedList::end() */ -/*! \fn QLinkedList::iterator::iterator(Node *node) +/*! \fn template <class T> QLinkedList<T>::iterator::iterator(Node *node) \internal */ @@ -818,25 +818,25 @@ const QLinkedListData QLinkedListData::shared_null = { \internal */ -/*! \fn QLinkedList::iterator::iterator(const iterator &other) +/*! \fn template <class T> QLinkedList<T>::iterator::iterator(const iterator &other) Constructs a copy of \a other. */ -/*! \fn QLinkedList::iterator &QLinkedList::iterator::operator=(const iterator &other) +/*! \fn template <class T> QLinkedList<T>::iterator &QLinkedList<T>::iterator::operator=(const iterator &other) Assigns \a other to this iterator. */ /*! - \fn QLinkedList<T> &QLinkedList::operator=(QLinkedList<T> &&other) + \fn template <class T> QLinkedList<T> &QLinkedList<T>::operator=(QLinkedList<T> &&other) Move-assigns \a other to this QLinkedList instance. \since 5.2 */ -/*! \fn T &QLinkedList::iterator::operator*() const +/*! \fn template <class T> T &QLinkedList<T>::iterator::operator*() const Returns a modifiable reference to the current item. @@ -848,7 +848,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator->() */ -/*! \fn T *QLinkedList::iterator::operator->() const +/*! \fn template <class T> T *QLinkedList<T>::iterator::operator->() const Returns a pointer to the current item. @@ -856,8 +856,8 @@ const QLinkedListData QLinkedListData::shared_null = { */ /*! - \fn bool QLinkedList::iterator::operator==(const iterator &other) const - \fn bool QLinkedList::iterator::operator==(const const_iterator &other) const + \fn template <class T> bool QLinkedList<T>::iterator::operator==(const iterator &other) const + \fn template <class T> bool QLinkedList<T>::iterator::operator==(const const_iterator &other) const Returns \c true if \a other points to the same item as this iterator; otherwise returns \c false. @@ -866,8 +866,8 @@ const QLinkedListData QLinkedListData::shared_null = { */ /*! - \fn bool QLinkedList::iterator::operator!=(const iterator &other) const - \fn bool QLinkedList::iterator::operator!=(const const_iterator &other) const + \fn template <class T> bool QLinkedList<T>::iterator::operator!=(const iterator &other) const + \fn template <class T> bool QLinkedList<T>::iterator::operator!=(const const_iterator &other) const Returns \c true if \a other points to a different item than this iterator; otherwise returns \c false. @@ -875,7 +875,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator==() */ -/*! \fn QLinkedList::iterator &QLinkedList::iterator::operator++() +/*! \fn template <class T> QLinkedList<T>::iterator &QLinkedList<T>::iterator::operator++() The prefix ++ operator (\c{++it}) advances the iterator to the next item in the list and returns an iterator to the new current @@ -887,7 +887,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator--() */ -/*! \fn QLinkedList::iterator QLinkedList::iterator::operator++(int) +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::iterator::operator++(int) \overload @@ -896,7 +896,7 @@ const QLinkedListData QLinkedListData::shared_null = { current item. */ -/*! \fn QLinkedList::iterator &QLinkedList::iterator::operator--() +/*! \fn template <class T> QLinkedList<T>::iterator &QLinkedList<T>::iterator::operator--() The prefix -- operator (\c{--it}) makes the preceding item current and returns an iterator to the new current item. @@ -907,7 +907,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator++() */ -/*! \fn QLinkedList::iterator QLinkedList::iterator::operator--(int) +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::iterator::operator--(int) \overload @@ -915,7 +915,7 @@ const QLinkedListData QLinkedListData::shared_null = { current and returns an iterator to the previously current item. */ -/*! \fn QLinkedList::iterator QLinkedList::iterator::operator+(int j) const +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::iterator::operator+(int j) const Returns an iterator to the item at \a j positions forward from this iterator. (If \a j is negative, the iterator goes backward.) @@ -926,7 +926,7 @@ const QLinkedListData QLinkedListData::shared_null = { */ -/*! \fn QLinkedList::iterator QLinkedList::iterator::operator-(int j) const +/*! \fn template <class T> QLinkedList<T>::iterator QLinkedList<T>::iterator::operator-(int j) const Returns an iterator to the item at \a j positions backward from this iterator. (If \a j is negative, the iterator goes forward.) @@ -936,7 +936,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+() */ -/*! \fn QLinkedList::iterator &QLinkedList::iterator::operator+=(int j) +/*! \fn template <class T> QLinkedList<T>::iterator &QLinkedList<T>::iterator::operator+=(int j) Advances the iterator by \a j items. (If \a j is negative, the iterator goes backward.) @@ -944,7 +944,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator-=(), operator+() */ -/*! \fn QLinkedList::iterator &QLinkedList::iterator::operator-=(int j) +/*! \fn template <class T> QLinkedList<T>::iterator &QLinkedList<T>::iterator::operator-=(int j) Makes the iterator go back by \a j items. (If \a j is negative, the iterator goes forward.) @@ -997,7 +997,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedList::iterator, QLinkedListIterator */ -/*! \fn QLinkedList::const_iterator::const_iterator() +/*! \fn template <class T> QLinkedList<T>::const_iterator::const_iterator() Constructs an uninitialized iterator. @@ -1008,7 +1008,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa QLinkedList::constBegin(), QLinkedList::constEnd() */ -/*! \fn QLinkedList::const_iterator::const_iterator(Node *node) +/*! \fn template <class T> QLinkedList<T>::const_iterator::const_iterator(Node *node) \internal */ @@ -1038,37 +1038,36 @@ const QLinkedListData QLinkedListData::shared_null = { \internal */ -/*! \fn QLinkedList::const_iterator::const_iterator(const const_iterator &other) +/*! \fn template <class T> QLinkedList<T>::const_iterator::const_iterator(const const_iterator &other) Constructs a copy of \a other. */ -/*! \fn QLinkedList::const_iterator::const_iterator(iterator other) +/*! \fn template <class T> QLinkedList<T>::const_iterator::const_iterator(iterator other) Constructs a copy of \a other. */ -/*! \fn QLinkedList::const_iterator &QLinkedList::const_iterator::operator=( \ - const const_iterator &other) +/*! \fn template <class T> typename QLinkedList<T>::const_iterator &QLinkedList<T>::const_iterator::operator=(const const_iterator &other) Assigns \a other to this iterator. */ -/*! \fn const T &QLinkedList::const_iterator::operator*() const +/*! \fn template <class T> const T &QLinkedList<T>::const_iterator::operator*() const Returns a reference to the current item. \sa operator->() */ -/*! \fn const T *QLinkedList::const_iterator::operator->() const +/*! \fn template <class T> const T *QLinkedList<T>::const_iterator::operator->() const Returns a pointer to the current item. \sa operator*() */ -/*! \fn bool QLinkedList::const_iterator::operator==(const const_iterator &other) const +/*! \fn template <class T> bool QLinkedList<T>::const_iterator::operator==(const const_iterator &other) const Returns \c true if \a other points to the same item as this iterator; otherwise returns \c false. @@ -1076,7 +1075,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator!=() */ -/*! \fn bool QLinkedList::const_iterator::operator!=(const const_iterator &other) const +/*! \fn template <class T> bool QLinkedList<T>::const_iterator::operator!=(const const_iterator &other) const Returns \c true if \a other points to a different item than this iterator; otherwise returns \c false. @@ -1084,19 +1083,19 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator==() */ -/*! \fn QLinkedList::const_iterator &QLinkedList::const_iterator::operator++() +/*! \fn template <class T> QLinkedList<T>::const_iterator &QLinkedList<T>::const_iterator::operator++() The prefix ++ operator (\c{++it}) advances the iterator to the next item in the list and returns an iterator to the new current item. - Calling this function on QLinkedList::constEnd() leads to + Calling this function on QLinkedList<T>::constEnd() leads to undefined results. \sa operator--() */ -/*! \fn QLinkedList::const_iterator QLinkedList::const_iterator::operator++(int) +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::const_iterator::operator++(int) \overload @@ -1105,7 +1104,7 @@ const QLinkedListData QLinkedListData::shared_null = { current item. */ -/*! \fn QLinkedList::const_iterator &QLinkedList::const_iterator::operator--() +/*! \fn template <class T> QLinkedList<T>::const_iterator &QLinkedList<T>::const_iterator::operator--() The prefix -- operator (\c{--it}) makes the preceding item current and returns an iterator to the new current item. @@ -1116,7 +1115,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator++() */ -/*! \fn QLinkedList::const_iterator QLinkedList::const_iterator::operator--(int) +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::const_iterator::operator--(int) \overload @@ -1124,7 +1123,7 @@ const QLinkedListData QLinkedListData::shared_null = { current and returns an iterator to the previously current item. */ -/*! \fn QLinkedList::const_iterator QLinkedList::const_iterator::operator+(int j) const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::const_iterator::operator+(int j) const Returns an iterator to the item at \a j positions forward from this iterator. (If \a j is negative, the iterator goes backward.) @@ -1134,7 +1133,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator-() */ -/*! \fn QLinkedList::const_iterator QLinkedList::const_iterator::operator-(int j) const +/*! \fn template <class T> QLinkedList<T>::const_iterator QLinkedList<T>::const_iterator::operator-(int j) const This function returns an iterator to the item at \a j positions backward from this iterator. (If \a j is negative, the iterator goes forward.) @@ -1144,7 +1143,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+() */ -/*! \fn QLinkedList::const_iterator &QLinkedList::const_iterator::operator+=(int j) +/*! \fn template <class T> QLinkedList<T>::const_iterator &QLinkedList<T>::const_iterator::operator+=(int j) Advances the iterator by \a j items. (If \a j is negative, the iterator goes backward.) @@ -1154,7 +1153,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator-=(), operator+() */ -/*! \fn QLinkedList::const_iterator &QLinkedList::const_iterator::operator-=(int j) +/*! \fn template <class T> QLinkedList<T>::const_iterator &QLinkedList<T>::const_iterator::operator-=(int j) Makes the iterator go back by \a j items. (If \a j is negative, the iterator goes forward.) @@ -1164,7 +1163,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa operator+=(), operator-() */ -/*! \fn QDataStream &operator<<(QDataStream &out, const QLinkedList<T> &list) +/*! \fn template <class T> QDataStream &operator<<(QDataStream &out, const QLinkedList<T> &list) \relates QLinkedList Writes the linked list \a list to stream \a out. @@ -1175,7 +1174,7 @@ const QLinkedListData QLinkedListData::shared_null = { \sa{Serializing Qt Data Types}{Format of the QDataStream operators} */ -/*! \fn QDataStream &operator>>(QDataStream &in, QLinkedList<T> &list) +/*! \fn template <class T> QDataStream &operator>>(QDataStream &in, QLinkedList<T> &list) \relates QLinkedList Reads a linked list from stream \a in into \a list. @@ -1187,7 +1186,7 @@ const QLinkedListData QLinkedListData::shared_null = { /*! \since 4.1 - \fn QLinkedList<T> QLinkedList<T>::fromStdList(const std::list<T> &list) + \fn template <class T> QLinkedList<T> QLinkedList<T>::fromStdList(const std::list<T> &list) Returns a QLinkedList object with the data contained in \a list. The order of the elements in the QLinkedList is the same as in \a @@ -1202,7 +1201,7 @@ const QLinkedListData QLinkedListData::shared_null = { /*! \since 4.1 - \fn std::list<T> QLinkedList<T>::toStdList() const + \fn template <class T> std::list<T> QLinkedList<T>::toStdList() const Returns a std::list object with the data contained in this QLinkedList. Example: |