Defines a helper class for the Caching Strategies. More...
#include <Caching_Utility_T.h>


Public Types | |
| typedef ACE_Refcounted_Recyclable_Handler_Cleanup_Strategy < KEY, VALUE, CONTAINER > | CLEANUP_STRATEGY |
| typedef ACE_Cleanup_Strategy < KEY, VALUE, CONTAINER > | CLEANUP_STRATEGY_BASE |
Public Member Functions | |
| ACE_Refcounted_Recyclable_Handler_Caching_Utility (ACE_Cleanup_Strategy< KEY, VALUE, CONTAINER > *cleanup_strategy=0, bool delete_cleanup_strategy=false) | |
| Constructor. | |
| ~ACE_Refcounted_Recyclable_Handler_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) |
| Find the entry with minimum caching attributes. | |
Protected Attributes | |
| CLEANUP_STRATEGY_BASE * | cleanup_strategy_ |
| This is the default Cleanup Strategy for this utility. | |
| bool | delete_cleanup_strategy_ |
| Whether the cleanup_strategy should be destroyed or not. | |
| size_t | marked_as_closed_entries_ |
Defines a helper class for the Caching Strategies.
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_Refcounted_Recyclable_Handler_Cleanup_Strategy<KEY, VALUE, CONTAINER> ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::CLEANUP_STRATEGY |
| typedef ACE_Cleanup_Strategy<KEY, VALUE, CONTAINER> ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::CLEANUP_STRATEGY_BASE |
| ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::ACE_Refcounted_Recyclable_Handler_Caching_Utility | ( | ACE_Cleanup_Strategy< KEY, VALUE, CONTAINER > * | cleanup_strategy = 0, |
| bool | delete_cleanup_strategy = false |
||
| ) |
Constructor.
| ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::~ACE_Refcounted_Recyclable_Handler_Caching_Utility | ( | void | ) |
Destructor.
| int ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::clear_cache | ( | CONTAINER & | container, |
| double | purge_percent | ||
| ) |
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_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::minimum | ( | CONTAINER & | container, |
| KEY *& | key_to_remove, | ||
| VALUE *& | value_to_remove | ||
| ) | [protected] |
Find the entry with minimum caching attributes.
CLEANUP_STRATEGY_BASE* ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::cleanup_strategy_ [protected] |
This is the default Cleanup Strategy for this utility.
bool ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::delete_cleanup_strategy_ [protected] |
Whether the cleanup_strategy should be destroyed or not.
size_t ACE_Refcounted_Recyclable_Handler_Caching_Utility< KEY, VALUE, CONTAINER, ITERATOR, ATTRIBUTES >::marked_as_closed_entries_ [protected] |
This figure denotes the number of entries are there in the container which have been marked as closed already but might not have been unbound from the container.
1.7.2