#include <Caching_Utility_T.h>
Public Types | |
typedef ACE_Null_Cleanup_Strategy< KEY, VALUE, CONTAINER > | CLEANUP_STRATEGY |
typedef ACE_Cleanup_Strategy < KEY, VALUE, CONTAINER > | CLEANUP_STRATEGY_BASE |
Public Member Functions | |
ACE_Null_Caching_Utility (ACE_Cleanup_Strategy< KEY, VALUE, CONTAINER > *cleanup_strategy=0, int delete_cleanup_strategy=0) | |
Constructor. | |
~ACE_Null_Caching_Utility (void) | |
Destructor. | |
int | clear_cache (CONTAINER &container, double purge_percent) |
Protected Member Functions | |
void | minimum (CONTAINER &container, KEY *&key_to_remove, VALUE *&value_to_remove) |
Protected Attributes | |
CLEANUP_STRATEGY_BASE * | cleanup_strategy_ |
int | delete_cleanup_strategy_ |
Whether the cleanup_strategy should be destroyed or not. | |
Private Member Functions | |
void | operator= (const ANUTIL< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES > &) |
ANUTIL (const ANUTIL< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES > &) |
This class defines the methods commonly used by the different caching strategies. For instance: <clear_cache> method which decides and purges the entry from the container.
typedef ACE_Null_Cleanup_Strategy<KEY, VALUE, CONTAINER> ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::CLEANUP_STRATEGY |
typedef ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::CLEANUP_STRATEGY_BASE |
ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::ACE_Null_Caching_Utility | ( | ACE_Cleanup_Strategy< KEY, VALUE, CONTAINER > * | cleanup_strategy = 0 , |
|
int | delete_cleanup_strategy = 0 | |||
) | [inline] |
Constructor.
ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::~ACE_Null_Caching_Utility | ( | void | ) | [inline] |
Destructor.
int ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::clear_cache | ( | CONTAINER & | container, | |
double | purge_percent | |||
) | [inline] |
Purge entries from the <container>. The Cleanup_Strategy will do the actual job of cleanup once the entries to be cleaned up are decided.
void ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::minimum | ( | CONTAINER & | container, | |
KEY *& | key_to_remove, | |||
VALUE *& | value_to_remove | |||
) | [inline, protected] |
Find the entry with minimum caching attributes. This is handler specific since this utility is to be used very specifically for handler who have caching_attributes for server side acched connection management.
void ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::operator= | ( | const ANUTIL< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES > & | ) | [private] |
ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::ANUTIL | ( | const ANUTIL< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES > & | ) | [private] |
CLEANUP_STRATEGY_BASE* ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::cleanup_strategy_ [protected] |
The cleanup strategy which can be used to destroy the entries of the container.
int ACE_Null_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::delete_cleanup_strategy_ [protected] |
Whether the cleanup_strategy should be destroyed or not.