#include <btree.h>

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 |
Definition at line 80 of file btree.h.
| BINARY_TREE_NODE< BINARY_NODE >::BINARY_TREE_NODE | ( | BINARY_NODE | data | ) | [inline] |
Definition at line 86 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.
| BINARY_TREE_NODE< BINARY_NODE >::~BINARY_TREE_NODE | ( | ) | [inline] |
Definition at line 92 of file btree.h.
References BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, CXX_DELETE, and Default_Mem_Pool.
| BINARY_TREE_NODE< BINARY_NODE > * BINARY_TREE_NODE< BINARY_NODE >::Enter | ( | BINARY_NODE | node, | |
| MEM_POOL * | pool | |||
| ) | [inline] |
Definition at line 55 of file btree.cxx.
References BINARY_TREE_NODE< BINARY_NODE >::_data, BINARY_TREE_NODE< BINARY_NODE >::_left, BINARY_TREE_NODE< BINARY_NODE >::_right, BOOL, CXX_NEW, FALSE, and TRUE.
| BINARY_TREE_NODE< BINARY_NODE > * BINARY_TREE_NODE< BINARY_NODE >::Find | ( | BINARY_NODE | node | ) | const [inline] |
Definition at line 85 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.
| BINARY_NODE* BINARY_TREE_NODE< BINARY_NODE >::Get_Data | ( | ) | [inline] |
Definition at line 96 of file btree.h.
References BINARY_TREE_NODE< BINARY_NODE >::_data.
Referenced by TRANSPOSE_DIRECTED_GRAPH16::Build_Snl_Array(), TRANSPOSE_DIRECTED_GRAPH16::Gather_Arrays(), DISTRIBUTION::Process_Memory(), TRANSPOSE_DIRECTED_GRAPH16::Record(), Register_Name_To_Statement(), and TRANSPOSE_DIRECTED_GRAPH16::Transpose().
| const BINARY_NODE* BINARY_TREE_NODE< BINARY_NODE >::Get_Data | ( | ) | const [inline] |
BINARY_TREE_NODE<BINARY_NODE>* BINARY_TREE_NODE< BINARY_NODE >::_left [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().
BINARY_TREE_NODE<BINARY_NODE>* BINARY_TREE_NODE< BINARY_NODE >::_right [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 >::~BINARY_TREE_NODE().
BINARY_NODE BINARY_TREE_NODE< BINARY_NODE >::_data [private] |
Definition at line 83 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().
1.5.6