tpie::sort_manager< T, I, M > Class Template Reference

A class of manager objects for merge sorting objects of type T. More...

#include <tpie/sort_manager.h>

Public Member Functions
	sort_manager (I *isort, M *mheap)
void	sort (file_stream< T > *in, file_stream< T > *out, progress_indicator_base *indicator=NULL)
	Sort in stream to out stream an save in stream (uses 3x space) More...
void	sort (file_stream< T > *in, progress_indicator_base *indicator=NULL)
	Sort in stream and overwrite unsorted input with sorted output (uses 2x space) More...

Detailed Description

template<class T, class I, class M>
class tpie::sort_manager< T, I, M >

A class of manager objects for merge sorting objects of type T.

We will actually use one of two subclasses of this class which use either a comparison object, or the binary comparison operator <.

Definition at line 58 of file sort_manager.h.

Member Function Documentation

template<class T , class I , class M >

void tpie::sort_manager< T, I, M >::sort	(	file_stream< T > *	in,
		file_stream< T > *	out,
		progress_indicator_base *	indicator = NULL
	)

Sort in stream to out stream an save in stream (uses 3x space)

Definition at line 174 of file sort_manager.h.

References tpie::file_stream< T >::read(), tpie::stream_crtp< child_t >::seek(), tpie::stream_crtp< child_t >::size(), and tpie::file_stream< T >::write().

Referenced by tpie::sort().

                                                                  {
    m_indicator = indicator;

    // if the input and output stream are the same, we only use 2x space.
    // otherwise, we need 3x space. (input, current temp runs, output runs)
    use2xSpace = (in == out);

    inStream = in;
    outStream = out;

    // Basic checks that input is ok
    if (in==NULL || out==NULL) {
        if (m_indicator) {m_indicator->init(1); m_indicator->step(); m_indicator->done();}
        throw exception("NULL_POINTER");
    }

    if (inStream->size() < 2) {
        if (m_indicator) {m_indicator->init(1); m_indicator->step(); m_indicator->done();}
        in->seek(0);
        if (in != out) {
            out->seek(0);
            if (in->size() == 1)
                out->write(in->read());
        }
        return;
    }
        
    // Else, there is something to sort, do it
    start_sort();
}

template<class T , class I , class M >

void tpie::sort_manager< T, I, M >::sort	(	file_stream< T > *	in,
		progress_indicator_base *	indicator = NULL
	)

Sort in stream and overwrite unsorted input with sorted output (uses 2x space)

Definition at line 207 of file sort_manager.h.

References tpie::sort().

                                                                                    {
    sort(in, in, indicator);
}

---

The documentation for this class was generated from the following file:

• sort_manager.h