rem: last = newlast;
add: else { last = newlast; ++it; }
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;  }}