#include <Cache_Entries.h>
Collaboration diagram for TAO_Cache_IntId:

Public Methods | |
| TAO_Cache_IntId (void) | |
| Constructor. | |
| TAO_Cache_IntId (TAO_Transport *transport) | |
| Constructor. | |
| TAO_Cache_IntId (const TAO_Cache_IntId & rhs) | |
| Copy constructor. | |
| ~TAO_Cache_IntId (void) | |
| Destructor. | |
| TAO_Cache_IntId& | operator= (const TAO_Cache_IntId &rhs) |
| Assignment operator(does copy memory). | |
| int | operator== (const TAO_Cache_IntId &rhs) const |
| Equality comparison operator(must match both id_ and kind_). | |
| int | operator!= (const TAO_Cache_IntId &rhs) const |
| Inequality comparison operator. | |
| TAO_Transport* | transport (void) |
| Return the underlying transport. | |
| const TAO_Transport* | transport (void) const |
| Return the underlying transport. | |
| void | recycle_state (ACE_Recyclable_State new_state) |
| ACE_Recyclable_State | recycle_state (void) |
| Get/Set <recycle_state>. | |
| TAO_Transport* | relinquish_transport (void) |
| Relinquish ownership of the TAO_Transport object associated with this TAO_Cache_IntId. More... | |
Private Attributes | |
| TAO_Transport* | transport_ |
| The transport that needs to be cached. | |
| ACE_Recyclable_State | recycle_state_ |
| The state of the handle. | |
Helper class that wraps the <value> part of the Map or table holding the Transport state.: unifies data items, so they can be stored together as a <value> for a <key> in a table holding the state of the Transport Cache.
|
|
Constructor.
|
|
|
Constructor.
|
|
|
Copy constructor.
|
|
|
Destructor.
|
|
|
Inequality comparison operator.
|
|
|
Assignment operator(does copy memory).
|
|
|
Equality comparison operator(must match both id_ and kind_).
|
|
|
Get/Set <recycle_state>.
|
|
|
|
|
|
Relinquish ownership of the TAO_Transport object associated with this TAO_Cache_IntId.
|
|
|
Return the underlying transport.
|
|
|
Return the underlying transport.
|
|
|
The state of the handle.
|
|
|
The transport that needs to be cached.
|
1.2.3 written by Dimitri van Heesch,
© 1997-2000