rem: QList<T>::Iterator it = lst.begin();
add: typename QList<T>::Iterator it = lst.begin();
context: /*Q_INLINE_TEMPLATES*/ void qSortUnique( QList<T> &lst ){  qSort( lst );  if ( lst.isEmpty() ) return;  // Remove all duplicates from the times list  // TODO: Make this more efficient!  QList<T>::Iterator it = lst.begin();  T last = *it;  ++it;  T newlast;  while ( it != lst.end() ) {    newlast = (*it);    if ( newlast == last ) it = lst.remove( it );    else {      last = newlast;      ++it;    }  }}