public interface ArcacheSpeedupConfigurationSetInterface
| Modifier and Type | Method and Description |
|---|---|
void |
setBackendClient(ArcacheBackendClient backendClient)
Set the inner backend client
|
void |
setExpirationProbabilityFunction(ProbabilityFunction probabilityFunction)
Set the probability function to be used in expiration evaluation
|
void |
setInvalidationKeysCacheSize(int cacheSize)
Set the maximum size of invalidationKeys Cache in number of elements
|
void |
setInvalidationKeysExpirationMillis(long expirationMillis)
Set the expiration of the stored values in milliseconds
|
void |
setMissesCacheSize(int cacheSize)
Set the maximum size of misses Cache in number of elements
|
void |
setMissesExpirationMillis(long expirationMillis)
Set the expiration of the stored values in milliseconds
|
void |
setObjectsCacheSize(int cacheSize)
Set the maximum size of objects Cache in number of elements
|
void |
setObjectsExpirationMillis(long expirationMillis)
Set the expiration of the stored values in milliseconds
|
void |
setProtectAgainstBackendFailures(boolean protect)
Allow some protection against backend failures.
|
void |
setSpeedupCacheTTLMillis(long ttlMillis)
Set the speedup cache ttl in milli seconds, this value must be restricted by
the cache size, the ttl is allowed to make a hard expiration if its needed.
|
void |
setTracker(ArcacheSpeedupTracker tracker)
Set a tracker to keep control of speedup performance and malfunctions
|
void setBackendClient(ArcacheBackendClient backendClient)
void setInvalidationKeysCacheSize(int cacheSize)
void setObjectsCacheSize(int cacheSize)
void setMissesCacheSize(int cacheSize)
void setInvalidationKeysExpirationMillis(long expirationMillis)
void setObjectsExpirationMillis(long expirationMillis)
void setMissesExpirationMillis(long expirationMillis)
void setProtectAgainstBackendFailures(boolean protect)
void setSpeedupCacheTTLMillis(long ttlMillis)
void setExpirationProbabilityFunction(ProbabilityFunction probabilityFunction)
void setTracker(ArcacheSpeedupTracker tracker)
Copyright © 2019. All rights reserved.