gistfile1.cpp

#ifndef SORTEDLIST_H
#define SORTEDLIST_H

#include <QList>
#include <QObject>
#include <QtAlgorithms>

template <typename T>
class SortedList : public QList<T>
{
public:
    explicit SortedList();
    int insert(const T &t);
private:
    QList<int>::iterator itr;
};

template <typename T>
SortedList<T>::insert(const T &t)
{
    // Find where the new item is or should be inserted
    // This requires that the template class T implement
    // both operator<() and operator==().
    itr = qLowerBound(list.begin(), list.end(), t);
    if(t != at(itr))
    {
        insert(itr, t);
    }
}

#endif // SORTEDLIST_H