TAO_ESF_Proxy_RB_Tree Class Reference

Concrete Proxy collection based on ACE_RB_Tree. More...

#include <ESF_Proxy_RB_Tree.h>

Collaboration diagram for TAO_ESF_Proxy_RB_Tree:

List of all members.

Public Types
typedef ACE_RB_Tree< PROXY *, int, ACE_Less_Than< PROXY * > , ACE_Null_Mutex >	Implementation
	A typedef for the underlying implementaiton class.
typedef TAO_ESF_Proxy_RB_Tree_Iterator < PROXY >	Iterator
	A typedef for the underlying iterator.
Public Member Functions
	TAO_ESF_Proxy_RB_Tree (void)
	Constructor.
TAO_ESF_Proxy_RB_Tree_Iterator < PROXY >	begin (void)
TAO_ESF_Proxy_RB_Tree_Iterator < PROXY >	end (void)
	Return one past the last element in the collection.
size_t	size (void) const
	Return the number of elements in the collection.
void	connected (PROXY *)
	Insert a new element to the collection.
void	reconnected (PROXY *)
	Insert a new element that could be there already.
void	disconnected (PROXY *)
	Remove an element from the collection.
void	shutdown (void)
Private Attributes
Implementation	impl_
	The underlying implementation object.

---

Detailed Description

Concrete Proxy collection based on ACE_RB_Tree.

The Event Service Framework provides several alternatives for the underlying proxy collections. This version is based on Red-Black trees that offer good insertion, removal and lookup performance, but the iteration is slightly degraded.

---

Member Typedef Documentation

typedef ACE_RB_Tree<PROXY*,int,ACE_Less_Than<PROXY*>,ACE_Null_Mutex> TAO_ESF_Proxy_RB_Tree::Implementation

A typedef for the underlying implementaiton class.

typedef TAO_ESF_Proxy_RB_Tree_Iterator<PROXY> TAO_ESF_Proxy_RB_Tree::Iterator

A typedef for the underlying iterator.

---

Constructor & Destructor Documentation

TAO_ESF_Proxy_RB_Tree::TAO_ESF_Proxy_RB_Tree

(

void

)

Constructor.

---

Member Function Documentation

TAO_ESF_Proxy_RB_Tree_Iterator< PROXY > TAO_ESF_Proxy_RB_Tree::begin

(

void

)

Return the first element in the collection, or end() if there are none

void TAO_ESF_Proxy_RB_Tree::connected

(

PROXY *

proxy

)

Insert a new element to the collection.

void TAO_ESF_Proxy_RB_Tree::disconnected

(

PROXY *

proxy

)

Remove an element from the collection.

TAO_ESF_Proxy_RB_Tree_Iterator< PROXY > TAO_ESF_Proxy_RB_Tree::end

(

void

)

Return one past the last element in the collection.

void TAO_ESF_Proxy_RB_Tree::reconnected

(

PROXY *

proxy

)

Insert a new element that could be there already.

void TAO_ESF_Proxy_RB_Tree::shutdown

(

void

)

Shutdown the collection, i.e. remove all elements and release resources

size_t TAO_ESF_Proxy_RB_Tree::size

(

void

)

const

Return the number of elements in the collection.

---

Member Data Documentation

Implementation TAO_ESF_Proxy_RB_Tree::impl_ [private]

The underlying implementation object.

---

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

• ESF_Proxy_RB_Tree.h
• ESF_Proxy_RB_Tree.cpp
• ESF_Proxy_RB_Tree.inl