diff options
Diffstat (limited to 'src/corelib/tools/qlinkedlist.cpp')
-rw-r--r-- | src/corelib/tools/qlinkedlist.cpp | 87 |
1 files changed, 0 insertions, 87 deletions
diff --git a/src/corelib/tools/qlinkedlist.cpp b/src/corelib/tools/qlinkedlist.cpp index 266fc7d3f1..97298dde3d 100644 --- a/src/corelib/tools/qlinkedlist.cpp +++ b/src/corelib/tools/qlinkedlist.cpp @@ -1054,93 +1054,6 @@ QLinkedListData QLinkedListData::shared_null = { */ /*! - \fn iterator QLinkedList::remove(iterator pos) - - Use erase() instead. -*/ - -/*! - \fn int QLinkedList::findIndex(const T& t) const - - If you need indexes then QList or QVector are better choices than - QLinkedList. - - \oldcode - int index = list->findIndex(value); - \newcode - int index = 0; - bool found = false; - for (const_iterator i = list->begin(); i != list->end(); ++i; ++index) - if (*i == value) { - found = true; - break; - } - if (!found) - index = -1; - \endcode -*/ - -/*! - \fn iterator QLinkedList::find(iterator from, const T& t) - - If you need random access to a data structure then QList, QVector, - QMap, or QHash, are all better choices than QLinkedList. - - \oldcode - QLinkedList::iterator i = list->find(from, value); - \newcode - QLinkedList::iterator i = from; - while (i != list->end() && *i != value) - ++i; - \endcode -*/ - -/*! - \fn iterator QLinkedList::find(const T& t) - - If you need random access to a data structure then QList, QVector, - QMap, or QHash, are all better choices than QLinkedList. - - \oldcode - QLinkedList::iterator i = list->find(value); - \newcode - QLinkedList::iterator i = list->begin(); - while (i != list->end() && *i != value) - ++i; - \endcode -*/ - -/*! - \fn const_iterator QLinkedList::find(const_iterator from, const T& t) const - - If you need random access to a data structure then QList, QVector, - QMap, or QHash, are all better choices than QLinkedList. - - \oldcode - QLinkedList::const_iterator i = list->find(from, value); - \newcode - QLinkedList::const_iterator i = from; - while (i != list->end() && *i != value) - ++i; - \endcode -*/ - -/*! - \fn const_iterator QLinkedList::find(const T& t) const - - If you need random access to a data structure then QList, QVector, - QMap, or QHash, are all better choices than QLinkedList. - - \oldcode - QLinkedList::const_iterator i = list->find(value); - \newcode - QLinkedList::const_iterator i = list->begin(); - while (i != list->end() && *i != value) - ++i; - \endcode -*/ - -/*! \since 4.1 \fn QLinkedList<T> QLinkedList<T>::fromStdList(const std::list<T> &list) |