KNLooserTree< Key, Value > Class Template Reference

#include <knheap.h>

Public Member Functions
	KNLooserTree ()
void	init (Key sup)
void	multiMergeUnrolled3 (Element *to, int l)
void	multiMergeUnrolled4 (Element *to, int l)
void	multiMergeUnrolled5 (Element *to, int l)
void	multiMergeUnrolled6 (Element *to, int l)
void	multiMergeUnrolled7 (Element *to, int l)
void	multiMergeUnrolled8 (Element *to, int l)
void	multiMergeUnrolled9 (Element *to, int l)
void	multiMergeUnrolled10 (Element *to, int l)
void	multiMerge (Element *to, int l)
void	multiMergeK (Element *to, int l)
int	spaceIsAvailable ()
void	insertSegment (Element *to, int sz)
int	getSize ()
Key	getSupremum ()
	KNLooserTree ()
void	init (Key sup)
void	multiMergeUnrolled3 (Element *to, int l)
void	multiMergeUnrolled4 (Element *to, int l)
void	multiMergeUnrolled5 (Element *to, int l)
void	multiMergeUnrolled6 (Element *to, int l)
void	multiMergeUnrolled7 (Element *to, int l)
void	multiMergeUnrolled8 (Element *to, int l)
void	multiMergeUnrolled9 (Element *to, int l)
void	multiMergeUnrolled10 (Element *to, int l)
void	multiMerge (Element *to, int l)
void	multiMergeK (Element *to, int l)
int	spaceIsAvailable ()
void	insertSegment (Element *to, int sz)
int	getSize ()
Key	getSupremum ()
	KNLooserTree ()
void	init (Key sup)
void	multiMergeUnrolled3 (Element *to, int l)
void	multiMergeUnrolled4 (Element *to, int l)
void	multiMergeUnrolled5 (Element *to, int l)
void	multiMergeUnrolled6 (Element *to, int l)
void	multiMergeUnrolled7 (Element *to, int l)
void	multiMergeUnrolled8 (Element *to, int l)
void	multiMergeUnrolled9 (Element *to, int l)
void	multiMergeUnrolled10 (Element *to, int l)
void	multiMerge (Element *to, int l)
void	multiMergeK (Element *to, int l)
int	spaceIsAvailable ()
void	insertSegment (Element *to, int sz)
int	getSize ()
Key	getSupremum ()

Detailed Description

template<class Key, class Value>
class KNLooserTree< Key, Value >

Definition at line 177 of file knheap.h.

Constructor & Destructor Documentation

KNLooserTree() [1/3]

template<class Key , class Value >

KNLooserTree< Key, Value >::KNLooserTree

(

)

KNLooserTree() [2/3]

template<class Key , class Value >

KNLooserTree< Key, Value >::KNLooserTree

(

)

KNLooserTree() [3/3]

template<class Key , class Value >

KNLooserTree< Key, Value >::KNLooserTree

(

)

Member Function Documentation

getSize() [1/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::getSize ( )

inline

Definition at line 234 of file knheap.h.

getSize() [2/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::getSize ( )

inline

Definition at line 234 of file knheap.h.

getSize() [3/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::getSize ( )

inline

Definition at line 234 of file knheap.h.

getSupremum() [1/3]

template<class Key , class Value >

Key KNLooserTree< Key, Value >::getSupremum ( )

inline

Definition at line 235 of file knheap.h.

getSupremum() [2/3]

template<class Key , class Value >

Key KNLooserTree< Key, Value >::getSupremum ( )

inline

Definition at line 235 of file knheap.h.

getSupremum() [3/3]

template<class Key , class Value >

Key KNLooserTree< Key, Value >::getSupremum ( )

inline

Definition at line 235 of file knheap.h.

init() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::init

(

Key

sup

)

init() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::init

(

Key

sup

)

init() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::init

(

Key

sup

)

insertSegment() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::insertSegment	(	Element *	to,
		int	sz
	)

insertSegment() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::insertSegment	(	Element *	to,
		int	sz
	)

insertSegment() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::insertSegment	(	Element *	to,
		int	sz
	)

multiMerge() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMerge	(	Element *	to,
		int	l
	)

multiMerge() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMerge	(	Element *	to,
		int	l
	)

multiMerge() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMerge	(	Element *	to,
		int	l
	)

multiMergeK() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeK	(	Element *	to,
		int	l
	)

multiMergeK() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeK	(	Element *	to,
		int	l
	)

multiMergeK() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeK	(	Element *	to,
		int	l
	)

multiMergeUnrolled10() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled10	(	Element *	to,
		int	l
	)

multiMergeUnrolled10() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled10	(	Element *	to,
		int	l
	)

multiMergeUnrolled10() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled10	(	Element *	to,
		int	l
	)

multiMergeUnrolled3() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled3	(	Element *	to,
		int	l
	)

multiMergeUnrolled3() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled3	(	Element *	to,
		int	l
	)

multiMergeUnrolled3() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled3	(	Element *	to,
		int	l
	)

multiMergeUnrolled4() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled4	(	Element *	to,
		int	l
	)

multiMergeUnrolled4() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled4	(	Element *	to,
		int	l
	)

multiMergeUnrolled4() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled4	(	Element *	to,
		int	l
	)

multiMergeUnrolled5() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled5	(	Element *	to,
		int	l
	)

multiMergeUnrolled5() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled5	(	Element *	to,
		int	l
	)

multiMergeUnrolled5() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled5	(	Element *	to,
		int	l
	)

multiMergeUnrolled6() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled6	(	Element *	to,
		int	l
	)

multiMergeUnrolled6() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled6	(	Element *	to,
		int	l
	)

multiMergeUnrolled6() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled6	(	Element *	to,
		int	l
	)

multiMergeUnrolled7() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled7	(	Element *	to,
		int	l
	)

multiMergeUnrolled7() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled7	(	Element *	to,
		int	l
	)

multiMergeUnrolled7() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled7	(	Element *	to,
		int	l
	)

multiMergeUnrolled8() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled8	(	Element *	to,
		int	l
	)

multiMergeUnrolled8() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled8	(	Element *	to,
		int	l
	)

multiMergeUnrolled8() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled8	(	Element *	to,
		int	l
	)

multiMergeUnrolled9() [1/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled9	(	Element *	to,
		int	l
	)

multiMergeUnrolled9() [2/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled9	(	Element *	to,
		int	l
	)

multiMergeUnrolled9() [3/3]

template<class Key , class Value >

void KNLooserTree< Key, Value >::multiMergeUnrolled9	(	Element *	to,
		int	l
	)

spaceIsAvailable() [1/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::spaceIsAvailable ( )

inline

Definition at line 231 of file knheap.h.

spaceIsAvailable() [2/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::spaceIsAvailable ( )

inline

Definition at line 231 of file knheap.h.

spaceIsAvailable() [3/3]

template<class Key , class Value >

int KNLooserTree< Key, Value >::spaceIsAvailable ( )

inline

Definition at line 231 of file knheap.h.

---

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