From ff63d0f28c56af711b84967a5a4012f0359eb9e0 Mon Sep 17 00:00:00 2001
From: David Boddie <david.boddie@nokia.com>
Date: Tue, 19 Jul 2011 14:42:08 +0200
Subject: Doc: Removed documentation for deleted code.

Change-Id: Icdbc05decac3dfe3fc18ce073c494e1fce4ea347
Reviewed-on: http://codereview.qt.nokia.com/1824
Reviewed-by: Qt Sanity Bot <qt_sanity_bot@ovi.com>
Reviewed-by: David Boddie
---
 src/corelib/tools/qlinkedlist.cpp | 87 ---------------------------------------
 1 file changed, 87 deletions(-)

(limited to 'src/corelib/tools/qlinkedlist.cpp')

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
@@ -1053,93 +1053,6 @@ QLinkedListData QLinkedListData::shared_null = {
     \sa \link datastreamformat.html Format of the QDataStream operators \endlink
 */
 
-/*!
-    \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)
-- 
cgit v1.2.3