#include <Cache_Map_Manager_T.h>
Public Types | |
| typedef KEY | key_type |
| typedef VALUE | mapped_type |
| typedef MAP | map_type |
| typedef CACHING_STRATEGY | caching_strategy_type |
| typedef ITERATOR_IMPL | ITERATOR_IMPLEMENTATION |
| typedef REVERSE_ITERATOR_IMPL | REVERSE_ITERATOR_IMPLEMENTATION |
| typedef ACE_Cache_Map_Iterator< KEY, VALUE, ITERATOR_IMPLEMENTATION, CACHING_STRATEGY, ATTRIBUTES > | ITERATOR |
| typedef ACE_Cache_Map_Reverse_Iterator< KEY, VALUE, REVERSE_ITERATOR_IMPLEMENTATION, CACHING_STRATEGY, ATTRIBUTES > | REVERSE_ITERATOR |
| typedef ITERATOR | iterator |
| typedef REVERSE_ITERATOR | reverse_iterator |
| typedef ACE_Pair< VALUE, ATTRIBUTES > | CACHE_VALUE |
Public Methods | |
| ACE_Cache_Map_Manager (CACHING_STRATEGY &caching_strategy, size_t size=ACE_DEFAULT_MAP_SIZE, ACE_Allocator *alloc=0) | |
| virtual | ~ACE_Cache_Map_Manager (void) |
| int | open (size_t length=ACE_DEFAULT_MAP_SIZE, ACE_Allocator *alloc=0) |
| Initialize a cache with size <length>. | |
| int | close (void) |
| Close down a cache and release dynamically allocated resources. | |
| int | bind (const KEY &key, const VALUE &value) |
| int | find (const KEY &key, VALUE &value) |
| int | find (const KEY &key) |
| int | rebind (const KEY &key, const VALUE &value) |
| int | rebind (const KEY &key, const VALUE &value, VALUE &old_value) |
| int | rebind (const KEY &key, const VALUE &value, KEY &old_key, VALUE &old_value) |
| int | trybind (const KEY &key, VALUE &value) |
| int | unbind (const KEY &key) |
| Remove <key> from the cache. | |
| int | unbind (const KEY &key, VALUE &value) |
| int | purge (void) |
| Remove entries from the cache depending upon the strategy. | |
| size_t | current_size (void) const |
| Return the current size of the cache. | |
| size_t | total_size (void) const |
| Return the total size of the cache. | |
| void | dump (void) const |
| Dumps the state of the object. | |
| ITERATOR | begin (void) |
| Return forward iterator. | |
| ITERATOR | end (void) |
| REVERSE_ITERATOR | rbegin (void) |
| Return reverse iterator. | |
| REVERSE_ITERATOR | rend (void) |
| MAP & | map (void) |
| The map managed by the Cache_Map_Manager. | |
| CACHING_STRATEGY & | caching_strategy (void) |
| The caching strategy used on the cache. | |
Protected Attributes | |
| MAP | map_ |
| The underlying map which needs to be cached. | |
| CACHING_STRATEGY & | caching_strategy_ |
| The strategy to be followed for caching entries in the map. | |
Private Methods | |
| void | operator= (const ACMM< KEY, VALUE, MAP, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES > &) |
| ACMM (const ACMM< KEY, VALUE, MAP, ITERATOR_IMPL, REVERSE_ITERATOR_IMPL, CACHING_STRATEGY, ATTRIBUTES > &) | |
Friends | |
| class | ACE_Cache_Map_Iterator< KEY, VALUE, ITERATOR_IMPLEMENTATION, CACHING_STRATEGY, ATTRIBUTES > |
| class | ACE_Cache_Map_Reverse_Iterator< KEY, VALUE, REVERSE_ITERATOR_IMPLEMENTATION, CACHING_STRATEGY, ATTRIBUTES > |
The <ACE_Cache_Map_Manager> will manage the map it contains and provide purging on demand from the map. The strategy for caching is decided by the user and provided to the Cache Manager. The Cache Manager acts as a agent and communicates between the Map and the Strategy for purging entries from the map. No locking mechanism provided since locking at this level isn't efficient. Locking has to be provided by the application.
|
|||||
|
The actual value mapped to the key in the map. The <attributes> are used by the strategy and is transparent to the user of this class. |
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
||||||||||||||||||||
|
Initialize a <Cache_Map_Manager> with <caching_strategy> and <size> entries. |
|
||||||||||
|
Close down a <Cache_Map_Manager> and release dynamically allocated resources. |
|
||||||||||
|
|
|
||||||||||
|
Return forward iterator.
|
|
||||||||||||||||
|
Associate <key> with <value>. If <key> is already in the MAP then the ENTRY is not changed. Returns 0 if a new entry is bound successfully, returns 1 if an attempt is made to bind an existing entry, and returns -1 if failures occur. |
|
||||||||||
|
The caching strategy used on the cache.
|
|
||||||||||
|
Close down a cache and release dynamically allocated resources.
|
|
||||||||||
|
Return the current size of the cache.
|
|
||||||||||
|
Dumps the state of the object.
|
|
||||||||||
|
|
|
||||||||||
|
Lookup entry<key,value> in the cache. If it is not found, returns -1. If the <key> is located in the MAP object, the CACHING_STRATEGY is notified of it via notify_find (int result, ATTRIBUTES &attribute). If notify_find also returns 0 (success), then this function returns 0 (success). |
|
||||||||||||||||
|
Lookup entry<key,value> in the cache. If it is not found, returns -1. If the <key> is located in the MAP object, the CACHING_STRATEGY is notified of it via notify_find (int result, ATTRIBUTES &attribute). If notify_find also returns 0 (success), then this function returns 0 (success) and sets the cached value in <value>. |
|
||||||||||
|
The map managed by the Cache_Map_Manager.
|
|
||||||||||||||||
|
Initialize a cache with size <length>.
|
|
||||||||||
|
|
|
||||||||||
|
Remove entries from the cache depending upon the strategy.
|
|
||||||||||
|
Return reverse iterator.
|
|
||||||||||||||||||||||||
|
Reassociate <key> with <value>, storing the old key and value into the "out" parameters <old_key> and <old_value>. The function fails if <key> is not in the cache for caches that do not allow user specified keys. However, for caches that allow user specified keys, if the key is not in the cache, a new <key>/<value> association is created. |
|
||||||||||||||||||||
|
Reassociate <key> with <value>, storing the old value into the "out" parameter <old_value>. The function fails if <key> is not in the cache for caches that do not allow user specified keys. However, for caches that allow user specified keys, if the key is not in the cache, a new <key>/<value> association is created. |
|
||||||||||||||||
|
Reassociate the <key> with <value>. If the <key> already exists in the cache then returns 1, on a new bind returns 0 and returns -1 in case of any failures. |
|
||||||||||
|
|
|
||||||||||
|
Return the total size of the cache.
|
|
||||||||||||||||
|
Associate <key> with <value> if and only if <key> is not in the cache. If <key> is already in the cache, then the <value> parameter is overwritten with the existing value in the cache. Returns 0 if a new <key>/<value> association is created. Returns 1 if an attempt is made to bind an existing entry. This function fails for maps that do not allow user specified keys. |
|
||||||||||||||||
|
Remove <key> from the cache, and return the <value> associated with <key>. |
|
||||||||||
|
Remove <key> from the cache.
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
The strategy to be followed for caching entries in the map.
|
|
|||||
|
The underlying map which needs to be cached.
|
1.2.18