#include <ESF_Proxy_RB_Tree.h>
Collaboration diagram for TAO_ESF_Proxy_RB_Tree< PROXY >:
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 *ACE_ENV_ARG_DECL_NOT_USED) |
Insert a new element to the collection. | |
void | reconnected (PROXY *ACE_ENV_ARG_DECL_NOT_USED) |
Insert a new element that could be there already. | |
void | disconnected (PROXY *ACE_ENV_ARG_DECL_NOT_USED) |
Remove an element from the collection. | |
void | shutdown (ACE_ENV_SINGLE_ARG_DECL_NOT_USED) |
Private Attributes | |
Implementation | impl_ |
The underlying implementation object. |
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.
|
A typedef for the underlying implementaiton class.
|
|
A typedef for the underlying iterator.
|
|
Constructor.
|
|
Return the first element in the collection, or end() if there are none |
|
Insert a new element to the collection.
|
|
Remove an element from the collection.
|
|
Return one past the last element in the collection.
|
|
Insert a new element that could be there already.
|
|
Shutdown the collection, i.e. remove all elements and release resources |
|
Return the number of elements in the collection.
|
|
The underlying implementation object.
|