COMBINATORIAL_BLAS: BinaryHeap< Key, Value, capacity > Class Template Reference

COMBINATORIAL_BLAS 1.6

Loading...

Searching...

No Matches

#include <knheap.h>

Public Member Functions
	BinaryHeap (Key sup, Key infimum)

Key	getSupremum ()

void	reset ()

int	getSize () const

Key	getMinKey () const

Value	getMinValue () const

void	deleteMin ()

void	deleteMinFancy (Key key, Value value)

void	insert (Key k, Value v)

void	sortTo (Element *to)

	BinaryHeap (Key sup, Key infimum)

Key	getSupremum ()

void	reset ()

int	getSize () const

Key	getMinKey () const

Value	getMinValue () const

void	deleteMin ()

void	deleteMinFancy (Key key, Value value)

void	insert (Key k, Value v)

void	sortTo (Element *to)

	BinaryHeap (Key sup, Key infimum)

Key	getSupremum ()

void	reset ()

int	getSize () const

Key	getMinKey () const

Value	getMinValue () const

void	deleteMin ()

void	deleteMinFancy (Key key, Value value)

void	insert (Key k, Value v)

void	sortTo (Element *to)

Detailed Description

template<class Key, class Value, int capacity>
class BinaryHeap< Key, Value, capacity >

Definition at line 24 of file knheap.h.

Constructor & Destructor Documentation

◆ BinaryHeap() [1/3]

template<class Key , class Value , int capacity>

BinaryHeap< Key, Value, capacity >::BinaryHeap	(	Key	sup,
		Key	infimum
	)

inline

Definition at line 31 of file knheap.h.

◆ BinaryHeap() [2/3]

template<class Key , class Value , int capacity>

BinaryHeap< Key, Value, capacity >::BinaryHeap	(	Key	sup,
		Key	infimum
	)

inline

Definition at line 31 of file knheap.h.

◆ BinaryHeap() [3/3]

template<class Key , class Value , int capacity>

BinaryHeap< Key, Value, capacity >::BinaryHeap	(	Key	sup,
		Key	infimum
	)

inline

Definition at line 31 of file knheap.h.

Member Function Documentation

◆ deleteMin() [1/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMin ( )

inline

Definition at line 68 of file knheap.h.

◆ deleteMin() [2/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMin ( )

◆ deleteMin() [3/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMin ( )

◆ deleteMinFancy() [1/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMinFancy	(	Key *	key,
		Value *	value
	)

inline

Definition at line 42 of file knheap.h.

◆ deleteMinFancy() [2/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMinFancy	(	Key *	key,
		Value *	value
	)

inline

Definition at line 42 of file knheap.h.

◆ deleteMinFancy() [3/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::deleteMinFancy	(	Key *	key,
		Value *	value
	)

inline

Definition at line 42 of file knheap.h.

◆ getMinKey() [1/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getMinKey ( ) const

inline

Definition at line 39 of file knheap.h.

◆ getMinKey() [2/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getMinKey ( ) const

inline

Definition at line 39 of file knheap.h.

◆ getMinKey() [3/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getMinKey ( ) const

inline

Definition at line 39 of file knheap.h.

◆ getMinValue() [1/3]

template<class Key , class Value , int capacity>

Value BinaryHeap< Key, Value, capacity >::getMinValue ( ) const

inline

Definition at line 40 of file knheap.h.

◆ getMinValue() [2/3]

template<class Key , class Value , int capacity>

Value BinaryHeap< Key, Value, capacity >::getMinValue ( ) const

inline

Definition at line 40 of file knheap.h.

◆ getMinValue() [3/3]

template<class Key , class Value , int capacity>

Value BinaryHeap< Key, Value, capacity >::getMinValue ( ) const

inline

Definition at line 40 of file knheap.h.

◆ getSize() [1/3]

template<class Key , class Value , int capacity>

int BinaryHeap< Key, Value, capacity >::getSize ( ) const

inline

Definition at line 38 of file knheap.h.

◆ getSize() [2/3]

template<class Key , class Value , int capacity>

int BinaryHeap< Key, Value, capacity >::getSize ( ) const

inline

Definition at line 38 of file knheap.h.

◆ getSize() [3/3]

template<class Key , class Value , int capacity>

int BinaryHeap< Key, Value, capacity >::getSize ( ) const

inline

Definition at line 38 of file knheap.h.

◆ getSupremum() [1/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getSupremum ( )

inline

Definition at line 36 of file knheap.h.

◆ getSupremum() [2/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getSupremum ( )

inline

Definition at line 36 of file knheap.h.

◆ getSupremum() [3/3]

template<class Key , class Value , int capacity>

Key BinaryHeap< Key, Value, capacity >::getSupremum ( )

inline

Definition at line 36 of file knheap.h.

◆ insert() [1/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::insert	(	Key	k,
		Value	v
	)

inline

Definition at line 151 of file knheap.h.

◆ insert() [2/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::insert	(	Key	k,
		Value	v
	)

◆ insert() [3/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::insert	(	Key	k,
		Value	v
	)

◆ reset() [1/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::reset ( )

inline

Definition at line 55 of file knheap.h.

◆ reset() [2/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::reset ( )

◆ reset() [3/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::reset ( )

◆ sortTo() [1/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::sortTo ( Element * to )

inline

Definition at line 113 of file knheap.h.

◆ sortTo() [2/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::sortTo ( Element * to )

◆ sortTo() [3/3]

template<class Key , class Value , int capacity>

void BinaryHeap< Key, Value, capacity >::sortTo ( Element * to )

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

debian/libcombblas-dev/usr/include/CombBLAS/SequenceHeaps/knheap.h
debian/tmp/usr/include/CombBLAS/SequenceHeaps/knheap.h
include/CombBLAS/SequenceHeaps/knheap.h

BinaryHeap
Generated by 1.9.8