#include <Caching_Utility_T.h>
Collaboration diagram for ACE_Pair_Caching_Utility:
Public Types | |
typedef ACE_Cleanup_Strategy< KEY, VALUE, CONTAINER> | CLEANUP_STRATEGY |
Public Methods | |
ACE_Pair_Caching_Utility (ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> *cleanup_strategy = 0, int delete_cleanup_strategy = 0) | |
~ACE_Pair_Caching_Utility (void) | |
Destructor. | |
int | clear_cache (CONTAINER &container, double purge_percent) |
Protected Methods | |
void | minimum (CONTAINER &container, KEY *&key_to_remove, VALUE *&value_to_remove) |
Find the entry with minimum caching attributes. | |
void | operator= (const APUTIL <KEY,VALUE,CONTAINER,ITERATOR,ATTRIBUTES> &) |
APUTIL (const APUTIL <KEY,VALUE,CONTAINER,ITERATOR,ATTRIBUTES> &) | |
Protected Attributes | |
CLEANUP_STRATEGY* | cleanup_strategy_ |
The cleanup strategy which can be used to destroy the entries of the container. | |
int | delete_cleanup_strategy_ |
Whether the cleanup_strategy should be destroyed or not. |
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. Note: This class helps in the caching_strategies using a container containing entries of <KEY, ACE_Pair<VALUE, attributes>> kind. The attributes helps in deciding the entries to be purged. The Cleanup_Strategy is the callback class to which the entries to be cleaned up will be delegated.
|
|
|
|
|
Destructor.
|
|
|
|
|
|
Find the entry with minimum caching attributes.
|
|
|
|
The cleanup strategy which can be used to destroy the entries of the container.
|
|
Whether the cleanup_strategy should be destroyed or not.
|