tpie::ami::merge_heap_ptr_op< REC, comp_t > Class Template Reference

A record pointer heap base class - also serves as the full implementation for objects with a < comparison operator. More...

#include <tpie/mergeheap.h>

Public Member Functions
	merge_heap_ptr_op (comp_t c=comp_t())
size_t	sizeofheap ()
	Reports the size of Heap (number of elements). More...
size_t	get_min_run_id ()
	Returns the run with the minimum key. More...
void	allocate (size_t size)
	Allocates space for the heap. More...
void	insert (const REC *ptr, size_t run_id)
	Copies an (initial) element into the heap array. More...
void	extract_min (REC &el, size_t &run_id)
	Extracts minimum element from heap array. More...
void	deallocate ()
	Deallocates the space used by the heap. More...
void	initialize ()
	Heapifies an initial array of elements;. More...
void	delete_min_and_insert (const REC *nextelement_same_run)
size_t	space_per_item ()
	Returns the main memory space usage per item. More...
size_t	space_overhead ()
	Returns the fixed main memory space overhead, regardless of item count. More...

Detailed Description

template<class REC, class comp_t = std::less<REC>>
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.

Definition at line 59 of file mergeheap.h.

Member Function Documentation

template<class REC, class comp_t = std::less<REC>>

void tpie::ami::merge_heap_ptr_op< REC, comp_t >::allocate ( size_t  size )

inline

Allocates space for the heap.

Definition at line 87 of file mergeheap.h.

{pq.resize(size);}

template<class REC, class comp_t = std::less<REC>>

void tpie::ami::merge_heap_ptr_op< REC, comp_t >::deallocate ( void  )

inline

Deallocates the space used by the heap.

Definition at line 108 of file mergeheap.h.

{pq.resize(0);}

template<class REC, class comp_t = std::less<REC>>

void tpie::ami::merge_heap_ptr_op< REC, comp_t >::extract_min ( REC &  el, size_t &  run_id  )

inline

Extracts minimum element from heap array.

If you follow this with an immediate insert, consider using delete_min_and_insert().

Definition at line 99 of file mergeheap.h.

                                                      {
                el=*pq.top().ptr;
                run_id=*pq.top().run_id();
                pq.pop();
            }

template<class REC, class comp_t = std::less<REC>>

size_t tpie::ami::merge_heap_ptr_op< REC, comp_t >::get_min_run_id ( )

inline

Returns the run with the minimum key.

Definition at line 82 of file mergeheap.h.

{return pq.top().run_id;}

template<class REC, class comp_t = std::less<REC>>

void tpie::ami::merge_heap_ptr_op< REC, comp_t >::initialize ( )

inline

Heapifies an initial array of elements;.

Definition at line 113 of file mergeheap.h.

{pq.make_safe(); }

template<class REC, class comp_t = std::less<REC>>

void tpie::ami::merge_heap_ptr_op< REC, comp_t >::insert ( const REC *  ptr, size_t  run_id  )

inline

Copies an (initial) element into the heap array.

Definition at line 92 of file mergeheap.h.

{pq.unsafe_push(heap_ptr<REC>(ptr, run_id) );}

template<class REC, class comp_t = std::less<REC>>

size_t tpie::ami::merge_heap_ptr_op< REC, comp_t >::sizeofheap ( )

inline

Reports the size of Heap (number of elements).

Definition at line 77 of file mergeheap.h.

{return pq.size();}

template<class REC, class comp_t = std::less<REC>>

size_t tpie::ami::merge_heap_ptr_op< REC, comp_t >::space_overhead ( void  )

inline

Returns the fixed main memory space overhead, regardless of item count.

Definition at line 134 of file mergeheap.h.

{ return static_cast<size_t>(pq.memory_overhead()); }

template<class REC, class comp_t = std::less<REC>>

size_t tpie::ami::merge_heap_ptr_op< REC, comp_t >::space_per_item ( void  )

inline

Returns the main memory space usage per item.

Definition at line 129 of file mergeheap.h.

{ return static_cast<size_t>(pq.memory_coefficient()); }

---

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

• mergeheap.h