BINARY_TREE_NODE< BINARY_NODE > Class Template Reference

#include <btree.h>

List of all members.

Public Member Functions
	BINARY_TREE_NODE (BINARY_NODE data)
BINARY_TREE_NODE< BINARY_NODE > *	Enter (BINARY_NODE node, MEM_POOL *pool)
BINARY_TREE_NODE< BINARY_NODE > *	Find (BINARY_NODE node) const
	~BINARY_TREE_NODE ()
BINARY_NODE *	Get_Data ()
const BINARY_NODE *	Get_Data () const
Private Attributes
BINARY_TREE_NODE< BINARY_NODE > *	_left
BINARY_TREE_NODE< BINARY_NODE > *	_right
BINARY_NODE	_data

---

Detailed Description

template<class BINARY_NODE>
class BINARY_TREE_NODE< BINARY_NODE >

This file contains a template for BINARY TREES This must be instantiated with a BINARY_NODE that has the operators <, == and = defined

template <class binary_node>=""> class BINARY_TREE

BINARY_TREE(MEM_POOL *pool)

Create a new binary tree.

void Enter(BINARY_NODE NODE)

Enter a copy of NODE into the tree. Does nothing if it's already in the tree.

BOOL *Find(BINARY_NODE element) const

Is element in the tree?

~BINARY_TREE()

Definition at line 79 of file btree.h.

---

Constructor & Destructor Documentation

template<class BINARY_NODE >

BINARY_TREE_NODE< BINARY_NODE >::BINARY_TREE_NODE

(

BINARY_NODE

data

)

[inline]

Definition at line 85 of file btree.h.

References BINARY_TREE_NODE< BINARY_NODE >::_data, BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, and NULL.

template<class BINARY_NODE >

BINARY_TREE_NODE< BINARY_NODE >::~BINARY_TREE_NODE

(

)

[inline]

Definition at line 91 of file btree.h.

References BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, CXX_DELETE, and Default_Mem_Pool.

---

Member Function Documentation

template<class BINARY_NODE >

BINARY_TREE_NODE< BINARY_NODE > * BINARY_TREE_NODE< BINARY_NODE >::Enter	(	BINARY_NODE	node,
		MEM_POOL *	pool
	)			[inline]

Definition at line 49 of file btree.cxx.

References BINARY_TREE_NODE< BINARY_NODE >::_data, BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, CXX_NEW, FALSE, and TRUE.

template<class BINARY_NODE >

BINARY_TREE_NODE< BINARY_NODE > * BINARY_TREE_NODE< BINARY_NODE >::Find

(

BINARY_NODE

node

)

const [inline]

Definition at line 79 of file btree.cxx.

References BINARY_TREE_NODE< BINARY_NODE >::_data, BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, and NULL.

template<class BINARY_NODE >

const BINARY_NODE* BINARY_TREE_NODE< BINARY_NODE >::Get_Data

(

)

const [inline]

Definition at line 96 of file btree.h.

References BINARY_TREE_NODE< BINARY_NODE >::_data.

template<class BINARY_NODE >

BINARY_NODE* BINARY_TREE_NODE< BINARY_NODE >::Get_Data

(

)

[inline]

Definition at line 95 of file btree.h.

References BINARY_TREE_NODE< BINARY_NODE >::_data.

---

Member Data Documentation

template<class BINARY_NODE >

BINARY_NODE BINARY_TREE_NODE< BINARY_NODE >::_data [private]

Definition at line 82 of file btree.h.

Referenced by BINARY_TREE_NODE< BINARY_NODE >::BINARY_TREE_NODE(), BINARY_TREE_NODE< BINARY_NODE >::Enter(), BINARY_TREE_NODE< BINARY_NODE >::Find(), and BINARY_TREE_NODE< BINARY_NODE >::Get_Data().

template<class BINARY_NODE >

BINARY_TREE_NODE<BINARY_NODE>* BINARY_TREE_NODE< BINARY_NODE >::_left [private]

Definition at line 80 of file btree.h.

Referenced by BINARY_TREE_NODE< BINARY_NODE >::BINARY_TREE_NODE(), BINARY_TREE_NODE< BINARY_NODE >::Enter(), BINARY_TREE_NODE< BINARY_NODE >::Find(), and BINARY_TREE_NODE< BINARY_NODE >::~BINARY_TREE_NODE().

template<class BINARY_NODE >

BINARY_TREE_NODE<BINARY_NODE>* BINARY_TREE_NODE< BINARY_NODE >::_right [private]

Definition at line 81 of file btree.h.

Referenced by BINARY_TREE_NODE< BINARY_NODE >::BINARY_TREE_NODE(), BINARY_TREE_NODE< BINARY_NODE >::Enter(), BINARY_TREE_NODE< BINARY_NODE >::Find(), and BINARY_TREE_NODE< BINARY_NODE >::~BINARY_TREE_NODE().

---

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

• Open64/osprey1.0/be/com/btree.h
• Open64/osprey1.0/be/com/btree.cxx