Graph Drawing Toolkit

An object-oriented C++ library for handling and drawing graphs

---

gdt::gdtbinary_heap2< P, I, less > Class Template Reference

#include <gdtbinary_heap2.h>

Inheritance diagram for gdt::gdtbinary_heap2< P, I, less >:

[legend]

Collaboration diagram for gdt::gdtbinary_heap2< P, I, less >:

[legend]

List of all members.

Public Types
typedef heap_item	item
Public Member Functions
const P &	prio (list_item i) const
const I &	inf (list_item i) const
	gdtbinary_heap2 ()
	~gdtbinary_heap2 ()
void	increase_key (heap_item it, const P &p)
list_item	insert (const P &pr, const I &info)
void	remove (list_item it)
const I &	extract_max ()
const I &	get_max () const
heap_item	find_max () const
Size	size () const
bool	consistency_check () const
bool	consistent_list () const
bool	is_heap (Index i) const
void	show_list () const
void	show_heap () const
void	show () const
heap_item	first_item () const
heap_item	last_item () const
heap_item	next_item (heap_item p) const
heap_item	pred_item (heap_item p) const

---

Detailed Description

template<class P, class I, class less = stdless<P>>
class gdt::gdtbinary_heap2< P, I, less >

Definition at line 27 of file gdtbinary_heap2.h.

---

Member Typedef Documentation

template<class P, class I, class less = stdless<P>>

typedef heap_item gdt::gdtbinary_heap2< P, I, less >::item

Reimplemented in gdt::gdtp_queue< P, I, less >, and gdt::gdtp_queue< P, struct_gdtnode >.

Definition at line 326 of file gdtbinary_heap2.h.

---

Constructor & Destructor Documentation

template<class P, class I, class less = stdless<P>>

gdt::gdtbinary_heap2< P, I, less >::gdtbinary_heap2

(

)

[inline]

Definition at line 153 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

gdt::gdtbinary_heap2< P, I, less >::~gdtbinary_heap2

(

)

[inline]

Definition at line 157 of file gdtbinary_heap2.h.

---

Member Function Documentation

template<class P, class I, class less = stdless<P>>

const P& gdt::gdtbinary_heap2< P, I, less >::prio

(

list_item

i

)

const [inline]

Definition at line 143 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::del_min(), gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::increase_key(), gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::insert(), gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::is_heap(), and gdt::gdtp_queue< P, struct_gdtnode >::prio().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

const I& gdt::gdtbinary_heap2< P, I, less >::inf

(

list_item

i

)

const [inline]

Definition at line 148 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::inf().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

void gdt::gdtbinary_heap2< P, I, less >::increase_key	(	heap_item	it,
		const P &	p
	)			[inline]

Definition at line 162 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::decrease_p().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

list_item gdt::gdtbinary_heap2< P, I, less >::insert	(	const P &	pr,
		const I &	info
	)			[inline]

Reimplemented in gdt::gdtp_queue< P, I, less >.

Definition at line 178 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::insert().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

void gdt::gdtbinary_heap2< P, I, less >::remove

(

list_item

it

)

[inline]

Definition at line 197 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::del_item().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

const I& gdt::gdtbinary_heap2< P, I, less >::extract_max

(

)

[inline]

Definition at line 229 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::del_min().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

const I& gdt::gdtbinary_heap2< P, I, less >::get_max

(

)

const [inline]

Definition at line 247 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

heap_item gdt::gdtbinary_heap2< P, I, less >::find_max

(

)

const [inline]

Definition at line 252 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::del_min(), and gdt::gdtp_queue< P, struct_gdtnode >::find_min().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

Size gdt::gdtbinary_heap2< P, I, less >::size

(

)

const [inline]

Definition at line 256 of file gdtbinary_heap2.h.

Referenced by gdt::gdtp_queue< P, struct_gdtnode >::del_min(), and gdt::gdtp_queue< P, struct_gdtnode >::empty().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

bool gdt::gdtbinary_heap2< P, I, less >::consistency_check

(

)

const [inline]

Definition at line 264 of file gdtbinary_heap2.h.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::extract_max(), gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::increase_key(), gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::insert(), and gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::remove().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

bool gdt::gdtbinary_heap2< P, I, less >::consistent_list

(

)

const [inline]

Definition at line 272 of file gdtbinary_heap2.h.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::consistency_check().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

bool gdt::gdtbinary_heap2< P, I, less >::is_heap

(

Index

i

)

const [inline]

Definition at line 280 of file gdtbinary_heap2.h.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::consistency_check(), and gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::is_heap().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

void gdt::gdtbinary_heap2< P, I, less >::show_list

(

)

const [inline]

Definition at line 296 of file gdtbinary_heap2.h.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::show().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

void gdt::gdtbinary_heap2< P, I, less >::show_heap

(

)

const [inline]

Definition at line 306 of file gdtbinary_heap2.h.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::show().

Here is the caller graph for this function:

template<class P, class I, class less = stdless<P>>

void gdt::gdtbinary_heap2< P, I, less >::show

(

)

const [inline]

Definition at line 315 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

heap_item gdt::gdtbinary_heap2< P, I, less >::first_item

(

)

const [inline]

Reimplemented in gdt::gdtp_queue< P, I, less >, and gdt::gdtp_queue< P, struct_gdtnode >.

Definition at line 328 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

heap_item gdt::gdtbinary_heap2< P, I, less >::last_item

(

)

const [inline]

Reimplemented in gdt::gdtp_queue< P, I, less >, and gdt::gdtp_queue< P, struct_gdtnode >.

Definition at line 329 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

heap_item gdt::gdtbinary_heap2< P, I, less >::next_item

(

heap_item

p

)

const [inline]

Reimplemented in gdt::gdtp_queue< P, I, less >, and gdt::gdtp_queue< P, struct_gdtnode >.

Definition at line 330 of file gdtbinary_heap2.h.

template<class P, class I, class less = stdless<P>>

heap_item gdt::gdtbinary_heap2< P, I, less >::pred_item

(

heap_item

p

)

const [inline]

Reimplemented in gdt::gdtp_queue< P, I, less >, and gdt::gdtp_queue< P, struct_gdtnode >.

Definition at line 331 of file gdtbinary_heap2.h.

---

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

• gdtbinary_heap2.h

---