TPIE

11a2c2d
mergeheap.h File Reference

Go to the source code of this file.

Classes

class  tpie::ami::heap_ptr< REC >
 This is a record pointer element. More...
 
class  tpie::ami::merge_heap_ptr_op< REC, comp_t >
 A record pointer heap base class - also serves as the full implementation for objects with a < comparison operator. More...
 
class  tpie::ami::merge_heap_ptr_obj< REC, CMPR >
 A record pointer heap that uses a comparison object. More...
 
class  tpie::ami::heap_element< KEY >
 This is a heap element. More...
 
class  tpie::ami::merge_heap_op< REC, comp_t >
 A merge heap object base class - also serves as the full implementation for objects with a < comparison operator. More...
 
class  tpie::ami::merge_heap_obj< REC, Compare >
 

Namespaces

 tpie
 
 tpie::ami
 A version of sort that takes an input stream of elements of type T, and an output stream, and and uses the < operator to sort, see also Sorting in TPIE.
 

Detailed Description

Merge heap templates. Originally written by Rakesh Barve.

Modified by David Hutchinson 2000 03 02

Modified by Jakob Truelsen 2011, to contain simple wrappers for the internal heap

Definition in file mergeheap.h.