ListFixed.h

Go to the documentation of this file.

#pragma once

#pragma warning( push, 3 )
#include <list>

template<class T>
class listFixed : public std::list< T >
{
#if _MSC_VER < 1300 // these problems don't affect VS7
    public:
            void sort()
            {
                    if (2 <= size())
                    {
                            const size_t _MAXN = 25;
                            _Myt _X(allocator), _A[_MAXN + 1];
                            size_t _N = 0;
                            while (!empty())
                            {
                                    _X.splice(_X.begin(), *this, begin());
                                    size_t _I;
                                    for (_I = 0; _I < _N && !_A[_I].empty(); ++_I)
                                    {
                                            _A[_I].merge(_X);
                                            _A[_I].swap(_X); 
                                    }
                                    if (_I == _MAXN)
                                    //  _A[_I].merge(_X); <---------- old line
                                            _A[_I - 1].merge(_X); // <--- bugfixed line
                                    else
                                    {
                                            _A[_I].swap(_X);
                                            if (_I == _N)
                                                    ++_N; 
                                    }
                            }
                            while (0 < _N)
                                    merge(_A[--_N]); 
                    }
            }

        void sort(_Pr3 _Pr)
            {
                    if (2 <= size())
                    {
                            const size_t _MAXN = 15;
                            _Myt _X(allocator), _A[_MAXN + 1];
                            size_t _N = 0;
                            while (!empty())
                            {
                                    _X.splice(_X.begin(), *this, begin());
                                    size_t _I;
                                    for (_I = 0; _I < _N && !_A[_I].empty(); ++_I)
                                    {
                                            _A[_I].merge(_X, _Pr);
                                            _A[_I].swap(_X); 
                                    }
                                    if (_I == _MAXN)
                                            //_A[_I].merge(_X, _Pr); <---------- old line
                                            _A[_I - 1].merge(_X, _Pr); // <----- bugfixed line
                                    else
                                    {
                                            _A[_I].swap(_X);
                                            if (_I == _N)
                                                    ++_N; 
                                    }
                            }
                            while (0 < _N)
                                    merge(_A[--_N], _Pr); 
                    }
            }
#endif // _MSC_VER < 1300 
};
   
#pragma warning ( pop )

---