fairport::bth_nonleaf_node< K, V > Class Template Reference

Contains references to other bth_node allocations. More...

#include <heap.h>

Inheritance diagram for fairport::bth_nonleaf_node< K, V >:

Collaboration diagram for fairport::bth_nonleaf_node< K, V >:

List of all members.

Public Member Functions
	bth_nonleaf_node (const heap_ptr &h, heap_id id, ushort level, std::vector< std::pair< K, heap_id > > bth_info)
	Construct a bth_nonleaf_node.
const K &	get_key (uint pos) const
	Returns the key at the specified position.
bth_node< K, V > *	get_child (uint pos)
	Returns the child btree_node at the requested location.
const bth_node< K, V > *	get_child (uint pos) const
	Returns the child btree_node at the requested location.
uint	num_values () const
	Returns the number of entries in this btree_node.

---

Detailed Description

template<typename K, typename V>
class fairport::bth_nonleaf_node< K, V >

Contains references to other bth_node allocations.

Template Parameters:

K	The key type for this BTH
V	The value type for this BTH

See also:

[MS-PST] 2.3.2.2

Definition at line 348 of file heap.h.

---

Constructor & Destructor Documentation

template<typename K , typename V >

fairport::bth_nonleaf_node< K, V >::bth_nonleaf_node	(	const heap_ptr &	h,
		heap_id	id,
		ushort	level,
		std::vector< std::pair< K, heap_id > >	bth_info
	)		[inline]

Construct a bth_nonleaf_node.

Parameters:

[in]	h	The heap to open out of
[in]	id	The id to interpret as a non-leaf BTH node
[in]	level	The level of this bth_nonleaf_node (non-zero)
[in]	bth_info	The info about child bth_node allocations

Definition at line 359 of file heap.h.

---

Member Function Documentation

template<typename K , typename V >

fairport::bth_node< K, V > * fairport::bth_nonleaf_node< K, V >::get_child

(

uint

i

)

[inline, virtual]

Returns the child btree_node at the requested location.

Parameters:

[in]

i

The position at which to get the child

Returns:

a non-owning pointer of the child btree_node

Implements fairport::btree_node_nonleaf< K, V >.

Definition at line 508 of file heap.h.

template<typename K , typename V >

const fairport::bth_node< K, V > * fairport::bth_nonleaf_node< K, V >::get_child

(

uint

i

)

const [inline, virtual]

Returns the child btree_node at the requested location.

Parameters:

[in]

i

The position at which to get the child

Returns:

a non-owning pointer of the child btree_node

Implements fairport::btree_node_nonleaf< K, V >.

Definition at line 522 of file heap.h.

template<typename K , typename V >

const K& fairport::bth_nonleaf_node< K, V >::get_key

(

uint

pos

)

const [inline, virtual]

Returns the key at the specified position.

This is specific to this btree_node, not the entire tree

Parameters:

[in]

pos

The position to retrieve the key for

Returns:

The key at the requested position

Implements fairport::btree_node< K, V >.

Definition at line 366 of file heap.h.

template<typename K , typename V >

uint fairport::bth_nonleaf_node< K, V >::num_values

(

)

const [inline, virtual]

Returns the number of entries in this btree_node.

This is specific to this btree_node, not the entire tree

Returns:

The number of keys in this btree_node

Implements fairport::btree_node< K, V >.

Definition at line 369 of file heap.h.

---

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

• fairport/ltp/heap.h