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
@@ -236,198 +236,194 @@ QGList::QGList( const QGList & list )
     curIndex  = -1;
     iterators = 0;				// initialize iterator list
     QLNode *n = list.firstNode;
     while ( n ) {				// copy all items from list
 	append( n->data );
 	n = n->next;
     }
 }
 
 /*!
   Removes all items from the list and destroys the list.
 */
 
 QGList::~QGList()
 {
     clear();
     delete iterators;
     // Workaround for GCC 2.7.* bug. Compiler constructs 'static' QGList
     // instances twice on the same address and therefore tries to destruct
     // twice on the same address! This is insane but let's try not to crash
     // here.
     iterators = 0;
 }
 
 
 /*!
   Assigns \a list to this list.
 */
 
 QGList& QGList::operator=( const QGList &list )
 {
     if ( &list == this )
 	return *this;
 
     clear();
     if ( list.count() > 0 ) {
 	QLNode *n = list.firstNode;
 	while ( n ) {				// copy all items from list
 	    append( n->data );
 	    n = n->next;
 	}
 	curNode	 = firstNode;
 	curIndex = 0;
     }
     return *this;
 }
 
 /*!
   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.
 */
 
 void QGList::prepend( QPtrCollection::Item d )
 {
     register QLNode *n = new QLNode( newItem(d) );
     Q_CHECK_PTR( n );
     n->prev = 0;
     if ( (n->next = firstNode) )		// list is not empty
 	firstNode->prev = n;
     else					// initialize list
 	lastNode = n;
     firstNode = curNode = n;			// curNode affected
     numNodes++;
     curIndex = 0;
 }
 
 
 /*!
   Inserts item \a d at the end of the list.
 */
 
 void QGList::append( QPtrCollection::Item d )
 {
     register QLNode *n = new QLNode( newItem(d) );
     Q_CHECK_PTR( n );
     n->next = 0;
     if ( (n->prev = lastNode) )			// list is not empty
 	lastNode->next = n;
     else					// initialize list
 	firstNode = n;
     lastNode = curNode = n;			// curNode affected
     curIndex = numNodes;
     numNodes++;
 }
 
 
 /*!
   Inserts item \a d at position \a index in the list.
 */
 
 bool QGList::insertAt( uint index, QPtrCollection::Item d )
 {
     if ( index == 0 ) {
 	prepend( d );
 	return TRUE;
     } else if ( index == numNodes ) {
 	append( d );
 	return TRUE;
     }