TAO_ESF
2.0.8
|
Concrete Proxy collection based on ACE_RB_Tree. More...
#include <ESF_Proxy_RB_Tree.h>
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. |
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.
typedef ACE_RB_Tree<PROXY*,int,ACE_Less_Than<PROXY*>,ACE_Null_Mutex> TAO_ESF_Proxy_RB_Tree< PROXY >::Implementation |
A typedef for the underlying implementaiton class.
typedef TAO_ESF_Proxy_RB_Tree_Iterator<PROXY> TAO_ESF_Proxy_RB_Tree< PROXY >::Iterator |
A typedef for the underlying iterator.
TAO_ESF_Proxy_RB_Tree< PROXY >::TAO_ESF_Proxy_RB_Tree | ( | void | ) |
Constructor.
TAO_ESF_Proxy_RB_Tree_Iterator< PROXY > TAO_ESF_Proxy_RB_Tree< PROXY >::begin | ( | void | ) |
Return the first element in the collection, or end() if there are none
void TAO_ESF_Proxy_RB_Tree< PROXY >::connected | ( | PROXY * | proxy | ) |
Insert a new element to the collection.
void TAO_ESF_Proxy_RB_Tree< PROXY >::disconnected | ( | PROXY * | proxy | ) |
Remove an element from the collection.
TAO_ESF_Proxy_RB_Tree_Iterator< PROXY > TAO_ESF_Proxy_RB_Tree< PROXY >::end | ( | void | ) |
Return one past the last element in the collection.
void TAO_ESF_Proxy_RB_Tree< PROXY >::reconnected | ( | PROXY * | proxy | ) |
Insert a new element that could be there already.
void TAO_ESF_Proxy_RB_Tree< PROXY >::shutdown | ( | void | ) |
Shutdown the collection, i.e. remove all elements and release resources
size_t TAO_ESF_Proxy_RB_Tree< PROXY >::size | ( | void | ) | const |
Return the number of elements in the collection.
Implementation TAO_ESF_Proxy_RB_Tree< PROXY >::impl_ [private] |
The underlying implementation object.