NAME

RB_Tree_Node - Implements a node in a Red-Black Tree ADT.

SYNOPSIS

#include <ace/RB_Tree.h>

template<class KEY, class T> class RB_Tree_Node : public RB_Tree_Node_Base { public: RB_Tree_Node (const KEY &k, const T &t); ~RB_Tree_Node (void); KEY &key (void); T &item (void); void color (RB_Tree_Node_Color c); RB_Tree_Node_Color color (void); RB_Tree_Node<KEY, T> *parent (void); void parent (RB_Tree_Node<KEY, T> * p); RB_Tree_Node<KEY, T> *left (void); void left (RB_Tree_Node<KEY, T> *l); RB_Tree_Node<KEY, T> *right (void); void right (RB_Tree_Node<KEY, T> * r); private: KEY k_; T t_; RB_Tree_Node_Color color_; RB_Tree_Node<KEY, T> *parent_; RB_Tree_Node<KEY, T> *left_; RB_Tree_Node<KEY, T> *right_; };

PUBLIC MEMBERS

RB_Tree_Node (const KEY &k, const T &t);

~RB_Tree_Node (void);

KEY &key (void);

T &item (void);

void color (RB_Tree_Node_Color c);

RB_Tree_Node_Color color (void);

RB_Tree_Node<KEY, T> *parent (void);

void parent (RB_Tree_Node<KEY, T> * p);

RB_Tree_Node<KEY, T> *left (void);

void left (RB_Tree_Node<KEY, T> *l);

RB_Tree_Node<KEY, T> *right (void);

void right (RB_Tree_Node<KEY, T> * r);

PRIVATE MEMBERS

KEY k_;

T t_;

RB_Tree_Node_Color color_;

RB_Tree_Node<KEY, T> *parent_;

RB_Tree_Node<KEY, T> *left_;

RB_Tree_Node<KEY, T> *right_;

AUTHOR

Chris Gill

LIBRARY

ace