#include <ace/RB_Tree.h>
template<class EXT_ID, class INT_ID, class COMPARE_KEYS, class ACE_LOCK> class ACE_RB_Tree_Iterator_Base {
public:void operator= ( const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &iter );int done (void) const;ACE_RB_Tree_Node<EXT_ID, INT_ID> & operator* (void) const;const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree ( void );int operator== ( const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & ) const;int operator!= ( const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> & ) const;ACE_ALLOC_HOOK_DECLARE;protected:ACE_RB_Tree_Iterator_Base ( const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree, int set_first );ACE_RB_Tree_Iterator_Base ( const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &iter );~ACE_RB_Tree_Iterator_Base (void);int forward_i (void);int reverse_i (void);void dump_i (void) const;const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> *tree_;ACE_RB_Tree_Node <EXT_ID, INT_ID> *node_;};
int done (void) const;
ACE_RB_Tree_Node<EXT_ID, INT_ID> & operator* (void) const;
const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree (
void
);
int operator== (
const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &
) const;
int operator!= (
const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &
) const;
ACE_ALLOC_HOOK_DECLARE;
ACE_RB_Tree_Iterator_Base (
const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &tree,
int set_first
);
ACE_RB_Tree_Iterator_Base (
const ACE_RB_Tree_Iterator_Base<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> &iter
);
~ACE_RB_Tree_Iterator_Base (void);
int forward_i (void);
int reverse_i (void);
void dump_i (void) const;
const ACE_RB_Tree<EXT_ID, INT_ID, COMPARE_KEYS, ACE_LOCK> *tree_;
ACE_RB_Tree_Node <EXT_ID, INT_ID> *node_;