rem: T last, newlast; for ( QValueListIterator<T> it = lst.begin(); it != lst.end(); ++it ) {
add: QValueListIterator<T> it = lst.begin(); T last = *it++; T newlast; while ( it != lst.end() ) {
context: Q_INLINE_TEMPLATES void qSortUnique( QValueList<T> &lst ){  qHeapSort( lst );  // Remove all duplicates from the times list  // TODO: Make this more efficient!  T last, newlast;  for ( QValueListIterator<T> it = lst.begin(); it != lst.end(); ++it ) {    newlast = (*it);    if ( newlast == last ) it = lst.remove( it );    last = newlast;  }}