1 files changed, 1 insertions, 5 deletions

diff --git a/qmake/tools/qglist.cpp b/qmake/tools/qglist.cpp
index 155d585..bd27f8a 100644
--- a/qmake/tools/qglist.cpp
+++ b/qmake/tools/qglist.cpp
@@ -284,102 +284,98 @@ QGList& QGList::operator=( const QGList &list )
   Compares this list with \a list. Returns TRUE if the lists
   contain the same data, otherwise FALSE.
 */
 
 bool QGList::operator==( const QGList &list ) const
 {
     if ( count() != list.count() )
         return FALSE;
 
     if ( count() == 0 )
         return TRUE;
 
     QLNode *n1 = firstNode;
     QLNode *n2 = list.firstNode;
     while ( n1 && n2 ) {
         // should be mutable
         if ( ( (QGList*)this )->compareItems( n1->data, n2->data ) != 0 )
             return FALSE;
         n1 = n1->next;
         n2 = n2->next;
     }
 
     return TRUE;
 }
 
 /*!
   \fn uint QGList::count() const
 
   Returns the number of items in the list.
 */
 
 
 /*!
   Returns the node at position \a index.  Sets this node to current.
 */
 
 QLNode *QGList::locate( uint index )
 {
             if ( index == (uint)curIndex )      // current node ?
         return curNode;
             if ( !curNode && firstNode ) {      // set current node
                 curNode = firstNode;
         curIndex = 0;
     }
     register QLNode *node;
             int          distance = index - curIndex;   // node distance to cur node
             bool forward;                       // direction to traverse
 
-    if ( index >= numNodes ) {
-#if defined(QT_CHECK_RANGE)
-        qWarning( "QGList::locate: Index %d out of range", index );
-#endif
+    if ( index >= numNodes )
         return 0;
-    }
 
     if ( distance < 0 )
         distance = -distance;
     if ( (uint)distance < index && (uint)distance < numNodes - index ) {
                 node =  curNode;                // start from current node
         forward = index > (uint)curIndex;
             } else if ( index < numNodes - index ) {// start from first node
         node = firstNode;
         distance = index;
         forward = TRUE;
             } else {                            // start from last node
         node = lastNode;
         distance = numNodes - index - 1;
         if ( distance < 0 )
             distance = 0;
         forward = FALSE;
     }
             if ( forward ) {                    // now run through nodes
         while ( distance-- )
             node = node->next;
     } else {
         while ( distance-- )
             node = node->prev;
     }
             curIndex = index;                   // must update index
     return curNode = node;
 }
 
 
 /*!
   Inserts item \a d at its sorted position in the list.
 */
 
 void QGList::inSort( QPtrCollection::Item d )
 {
     int index = 0;
     register QLNode *n = firstNode;
     while ( n && compareItems(n->data,d) < 0 ){ // find position in list
         n = n->next;
         index++;
     }
     insertAt( index, d );
 }
 
 
 /*!
   Inserts item \a d at the start of the list.
 */