API¶

Region¶

class dogpile.cache.region.CacheRegion(name=None, function_key_generator=<function function_key_generator>, function_multi_key_generator=<function function_multi_key_generator>, key_mangler=None, async_creation_runner=None)¶

A front end to a particular cache backend.

Parameters:

name¶ – Optional, a string name for the region. This isn’t used internally but can be accessed via the .name parameter, helpful for configuring a region from a config file.

function_key_generator¶ –

Optional. A function that will produce a “cache key” given a data creation function and arguments, when using the CacheRegion.cache_on_arguments() method. The structure of this function should be two levels: given the data creation function, return a new function that generates the key based on the given arguments. Such as:

def my_key_generator(namespace, fn, **kw):
    fname = fn.__name__
    def generate_key(*arg):
        return namespace + "_" + fname + "_".join(str(s) for s in arg)
    return generate_key


region = make_region(
    function_key_generator = my_key_generator
).configure(
    "dogpile.cache.dbm",
    expiration_time=300,
    arguments={
        "filename":"file.dbm"
    }
)

The namespace is that passed to CacheRegion.cache_on_arguments(). It’s not consulted outside this function, so in fact can be of any form. For example, it can be passed as a tuple, used to specify arguments to pluck from **kw:

def my_key_generator(namespace, fn):
    def generate_key(*arg, **kw):
        return ":".join(
                [kw[k] for k in namespace] +
                [str(x) for x in arg]
            )
    return generate_key

Where the decorator might be used as:

@my_region.cache_on_arguments(namespace=('x', 'y'))
def my_function(a, b, **kw):
    return my_data()

See also

function_key_generator() - default key generator

kwarg_function_key_generator() - optional gen that also uses keyword arguments

function_multi_key_generator¶ –

Optional. Similar to function_key_generator parameter, but it’s used in CacheRegion.cache_multi_on_arguments(). Generated function should return list of keys. For example:

def my_multi_key_generator(namespace, fn, **kw):
    namespace = fn.__name__ + (namespace or '')

    def generate_keys(*args):
        return [namespace + ':' + str(a) for a in args]

    return generate_keys

key_mangler¶ – Function which will be used on all incoming keys before passing to the backend. Defaults to None, in which case the key mangling function recommended by the cache backend will be used. A typical mangler is the SHA1 mangler found at sha1_mangle_key() which coerces keys into a SHA1 hash, so that the string length is fixed. To disable all key mangling, set to False. Another typical mangler is the built-in Python function str, which can be used to convert non-string or Unicode keys to bytestrings, which is needed when using a backend such as bsddb or dbm under Python 2.x in conjunction with Unicode keys.
async_creation_runner¶ –
A callable that, when specified, will be passed to and called by dogpile.lock when there is a stale value present in the cache. It will be passed the mutex and is responsible releasing that mutex when finished. This can be used to defer the computation of expensive creator functions to later points in the future by way of, for example, a background thread, a long-running queue, or a task manager system like Celery.

For a specific example using async_creation_runner, new values can be created in a background thread like so:
```
import threading

def async_creation_runner(cache, somekey, creator, mutex):
    ''' Used by dogpile.core:Lock when appropriate  '''
    def runner():
        try:
            value = creator()
            cache.set(somekey, value)
        finally:
            mutex.release()

    thread = threading.Thread(target=runner)
    thread.start()


region = make_region(
    async_creation_runner=async_creation_runner,
).configure(
    'dogpile.cache.memcached',
    expiration_time=5,
    arguments={
        'url': '127.0.0.1:11211',
        'distributed_lock': True,
    }
)
```
Remember that the first request for a key with no associated value will always block; async_creator will not be invoked. However, subsequent requests for cached-but-expired values will still return promptly. They will be refreshed by whatever asynchronous means the provided async_creation_runner callable implements.

By default the async_creation_runner is disabled and is set to None.

New in version 0.4.2: added the async_creation_runner feature.

cache_multi_on_arguments(namespace=None, expiration_time=None, should_cache_fn=None, asdict=False, to_str=<type 'str'>, function_multi_key_generator=None)¶

A function decorator that will cache multiple return values from the function using a sequence of keys derived from the function itself and the arguments passed to it.

This method is the “multiple key” analogue to the CacheRegion.cache_on_arguments() method.

Example:

@someregion.cache_multi_on_arguments()
def generate_something(*keys):
    return [
        somedatabase.query(key)
        for key in keys
    ]

The decorated function can be called normally. The decorator will produce a list of cache keys using a mechanism similar to that of CacheRegion.cache_on_arguments(), combining the name of the function with the optional namespace and with the string form of each key. It will then consult the cache using the same mechanism as that of CacheRegion.get_multi() to retrieve all current values; the originally passed keys corresponding to those values which aren’t generated or need regeneration will be assembled into a new argument list, and the decorated function is then called with that subset of arguments.

The returned result is a list:

result = generate_something("key1", "key2", "key3")

The decorator internally makes use of the CacheRegion.get_or_create_multi() method to access the cache and conditionally call the function. See that method for additional behavioral details.

Unlike the CacheRegion.cache_on_arguments() method, CacheRegion.cache_multi_on_arguments() works only with a single function signature, one which takes a simple list of keys as arguments.

Like CacheRegion.cache_on_arguments(), the decorated function is also provided with a set() method, which here accepts a mapping of keys and values to set in the cache:

generate_something.set({"k1": "value1",
                        "k2": "value2", "k3": "value3"})

…an invalidate() method, which has the effect of deleting the given sequence of keys using the same mechanism as that of CacheRegion.delete_multi():

generate_something.invalidate("k1", "k2", "k3")

…a refresh() method, which will call the creation function, cache the new values, and return them:

values = generate_something.refresh("k1", "k2", "k3")

…and a get() method, which will return values based on the given arguments:

values = generate_something.get("k1", "k2", "k3")

New in version 0.5.3: Added get() method to decorated function.

Parameters passed to CacheRegion.cache_multi_on_arguments() have the same meaning as those passed to CacheRegion.cache_on_arguments().

Parameters:

namespace¶ – optional string argument which will be established as part of each cache key.
expiration_time¶ – if not None, will override the normal expiration time. May be passed as an integer or a callable.
should_cache_fn¶ – passed to CacheRegion.get_or_create_multi(). This function is given a value as returned by the creator, and only if it returns True will that value be placed in the cache.
asdict¶ –
if True, the decorated function should return its result as a dictionary of keys->values, and the final result of calling the decorated function will also be a dictionary. If left at its default value of False, the decorated function should return its result as a list of values, and the final result of calling the decorated function will also be a list.

When asdict==True if the dictionary returned by the decorated function is missing keys, those keys will not be cached.
to_str¶ – callable, will be called on each function argument in order to convert to a string. Defaults to str(). If the function accepts non-ascii unicode arguments on Python 2.x, the unicode() builtin can be substituted, but note this will produce unicode cache keys which may require key mangling before reaching the cache.

New in version 0.5.0.

Parameters:	function_multi_key_generator¶ – a function that will produce a list of keys. This function will supersede the one configured on the `CacheRegion` itself. New in version 0.5.5.

See also

CacheRegion.cache_on_arguments()

CacheRegion.get_or_create_multi()

cache_on_arguments(namespace=None, expiration_time=None, should_cache_fn=None, to_str=<type 'str'>, function_key_generator=None)¶

A function decorator that will cache the return value of the function using a key derived from the function itself and its arguments.

The decorator internally makes use of the CacheRegion.get_or_create() method to access the cache and conditionally call the function. See that method for additional behavioral details.

E.g.:

@someregion.cache_on_arguments()
def generate_something(x, y):
    return somedatabase.query(x, y)

The decorated function can then be called normally, where data will be pulled from the cache region unless a new value is needed:

result = generate_something(5, 6)

The function is also given an attribute invalidate(), which provides for invalidation of the value. Pass to invalidate() the same arguments you’d pass to the function itself to represent a particular value:

generate_something.invalidate(5, 6)

Another attribute set() is added to provide extra caching possibilities relative to the function. This is a convenience method for CacheRegion.set() which will store a given value directly without calling the decorated function. The value to be cached is passed as the first argument, and the arguments which would normally be passed to the function should follow:

generate_something.set(3, 5, 6)

The above example is equivalent to calling generate_something(5, 6), if the function were to produce the value 3 as the value to be cached.

New in version 0.4.1: Added set() method to decorated function.

Similar to set() is refresh(). This attribute will invoke the decorated function and populate a new value into the cache with the new value, as well as returning that value:

newvalue = generate_something.refresh(5, 6)

New in version 0.5.0: Added refresh() method to decorated function.

Lastly, the get() method returns either the value cached for the given key, or the token NO_VALUE if no such key exists:

value = generate_something.get(5, 6)

New in version 0.5.3: Added get() method to decorated function.

The default key generation will use the name of the function, the module name for the function, the arguments passed, as well as an optional “namespace” parameter in order to generate a cache key.

Given a function one inside the module myapp.tools:

@region.cache_on_arguments(namespace="foo")
def one(a, b):
    return a + b

Above, calling one(3, 4) will produce a cache key as follows:

myapp.tools:one|foo|3 4

The key generator will ignore an initial argument of self or cls, making the decorator suitable (with caveats) for use with instance or class methods. Given the example:

class MyClass(object):
    @region.cache_on_arguments(namespace="foo")
    def one(self, a, b):
        return a + b

The cache key above for MyClass().one(3, 4) will again produce the same cache key of myapp.tools:one|foo|3 4 - the name self is skipped.

The namespace parameter is optional, and is used normally to disambiguate two functions of the same name within the same module, as can occur when decorating instance or class methods as below:

class MyClass(object):
    @region.cache_on_arguments(namespace='MC')
    def somemethod(self, x, y):
        ""

class MyOtherClass(object):
    @region.cache_on_arguments(namespace='MOC')
    def somemethod(self, x, y):
        ""

Above, the namespace parameter disambiguates between somemethod on MyClass and MyOtherClass. Python class declaration mechanics otherwise prevent the decorator from having awareness of the MyClass and MyOtherClass names, as the function is received by the decorator before it becomes an instance method.

The function key generation can be entirely replaced on a per-region basis using the function_key_generator argument present on make_region() and CacheRegion. If defaults to function_key_generator().

Parameters:

namespace¶ – optional string argument which will be established as part of the cache key. This may be needed to disambiguate functions of the same name within the same source file, such as those associated with classes - note that the decorator itself can’t see the parent class on a function as the class is being declared.
expiration_time¶ –
if not None, will override the normal expiration time.

May be specified as a callable, taking no arguments, that returns a value to be used as the expiration_time. This callable will be called whenever the decorated function itself is called, in caching or retrieving. Thus, this can be used to determine a dynamic expiration time for the cached function result. Example use cases include “cache the result until the end of the day, week or time period” and “cache until a certain date or time passes”.

Changed in version 0.5.0: expiration_time may be passed as a callable to CacheRegion.cache_on_arguments().
should_cache_fn¶ –
passed to CacheRegion.get_or_create().

New in version 0.4.3.
to_str¶ –
callable, will be called on each function argument in order to convert to a string. Defaults to str(). If the function accepts non-ascii unicode arguments on Python 2.x, the unicode() builtin can be substituted, but note this will produce unicode cache keys which may require key mangling before reaching the cache.

New in version 0.5.0.
function_key_generator¶ –
a function that will produce a “cache key”. This function will supersede the one configured on the CacheRegion itself.

New in version 0.5.5.

CacheRegion.get_or_create()

configure(backend, expiration_time=None, arguments=None, _config_argument_dict=None, _config_prefix=None, wrap=None, replace_existing_backend=False, region_invalidator=None)¶

Configure a CacheRegion.

The CacheRegion itself is returned.

Parameters:

backend¶ – Required. This is the name of the CacheBackend to use, and is resolved by loading the class from the dogpile.cache entrypoint.
expiration_time¶ –
Optional. The expiration time passed to the dogpile system. May be passed as an integer number of seconds, or as a datetime.timedelta value.

The CacheRegion.get_or_create() method as well as the CacheRegion.cache_on_arguments() decorator (though note: not the CacheRegion.get() method) will call upon the value creation function after this time period has passed since the last generation.
arguments¶ – Optional. The structure here is passed directly to the constructor of the CacheBackend in use, though is typically a dictionary.
wrap¶ –
Optional. A list of ProxyBackend classes and/or instances, each of which will be applied in a chain to ultimately wrap the original backend, so that custom functionality augmentation can be applied.

New in version 0.5.0.

See also

Changing Backend Behavior
replace_existing_backend¶ –
if True, the existing cache backend will be replaced. Without this flag, an exception is raised if a backend is already configured.

New in version 0.5.7.
region_invalidator¶ –
Optional. Override default invalidation strategy with custom implementation of RegionInvalidationStrategy.

New in version 0.6.2.

configure_from_config(config_dict, prefix)¶

Configure from a configuration dictionary and a prefix.

Example:

local_region = make_region()
memcached_region = make_region()

# regions are ready to use for function
# decorators, but not yet for actual caching

# later, when config is available
myconfig = {
    "cache.local.backend":"dogpile.cache.dbm",
    "cache.local.arguments.filename":"/path/to/dbmfile.dbm",
    "cache.memcached.backend":"dogpile.cache.pylibmc",
    "cache.memcached.arguments.url":"127.0.0.1, 10.0.0.1",
}
local_region.configure_from_config(myconfig, "cache.local.")
memcached_region.configure_from_config(myconfig,
                                    "cache.memcached.")

delete(key)¶

Remove a value from the cache.

This operation is idempotent (can be called multiple times, or on a non-existent key, safely)

delete_multi(keys)¶

Remove multiple values from the cache.

This operation is idempotent (can be called multiple times, or on a non-existent key, safely)

New in version 0.5.0.

get(key, expiration_time=None, ignore_expiration=False)¶

Return a value from the cache, based on the given key.

If the value is not present, the method returns the token NO_VALUE. NO_VALUE evaluates to False, but is separate from None to distinguish between a cached value of None.

By default, the configured expiration time of the CacheRegion, or alternatively the expiration time supplied by the expiration_time argument, is tested against the creation time of the retrieved value versus the current time (as reported by time.time()). If stale, the cached value is ignored and the NO_VALUE token is returned. Passing the flag ignore_expiration=True bypasses the expiration time check.

Changed in version 0.3.0: CacheRegion.get() now checks the value’s creation time against the expiration time, rather than returning the value unconditionally.

The method also interprets the cached value in terms of the current “invalidation” time as set by the invalidate() method. If a value is present, but its creation time is older than the current invalidation time, the NO_VALUE token is returned. Passing the flag ignore_expiration=True bypasses the invalidation time check.

New in version 0.3.0: Support for the CacheRegion.invalidate() method.

Parameters:

key¶ – Key to be retrieved. While it’s typical for a key to be a string, it is ultimately passed directly down to the cache backend, before being optionally processed by the key_mangler function, so can be of any type recognized by the backend or by the key_mangler function, if present.
expiration_time¶ –
Optional expiration time value which will supersede that configured on the CacheRegion itself.

New in version 0.3.0.
ignore_expiration¶ –
if True, the value is returned from the cache if present, regardless of configured expiration times or whether or not invalidate() was called.

New in version 0.3.0.

get_multi(keys, expiration_time=None, ignore_expiration=False)¶

Return multiple values from the cache, based on the given keys.

Returns values as a list matching the keys given.

E.g.:

values = region.get_multi(["one", "two", "three"])

To convert values to a dictionary, use zip():

keys = ["one", "two", "three"]
values = region.get_multi(keys)
dictionary = dict(zip(keys, values))

Keys which aren’t present in the list are returned as the NO_VALUE token. NO_VALUE evaluates to False, but is separate from None to distinguish between a cached value of None.

By default, the configured expiration time of the CacheRegion, or alternatively the expiration time supplied by the expiration_time argument, is tested against the creation time of the retrieved value versus the current time (as reported by time.time()). If stale, the cached value is ignored and the NO_VALUE token is returned. Passing the flag ignore_expiration=True bypasses the expiration time check.

New in version 0.5.0.

get_or_create(key, creator, expiration_time=None, should_cache_fn=None)¶

Return a cached value based on the given key.

If the value does not exist or is considered to be expired based on its creation time, the given creation function may or may not be used to recreate the value and persist the newly generated value in the cache.

Whether or not the function is used depends on if the dogpile lock can be acquired or not. If it can’t, it means a different thread or process is already running a creation function for this key against the cache. When the dogpile lock cannot be acquired, the method will block if no previous value is available, until the lock is released and a new value available. If a previous value is available, that value is returned immediately without blocking.

If the invalidate() method has been called, and the retrieved value’s timestamp is older than the invalidation timestamp, the value is unconditionally prevented from being returned. The method will attempt to acquire the dogpile lock to generate a new value, or will wait until the lock is released to return the new value.

Changed in version 0.3.0: The value is unconditionally regenerated if the creation time is older than the last call to invalidate().

Parameters:

key¶ – Key to be retrieved. While it’s typical for a key to be a string, it is ultimately passed directly down to the cache backend, before being optionally processed by the key_mangler function, so can be of any type recognized by the backend or by the key_mangler function, if present.
creator¶ – function which creates a new value.
expiration_time¶ – optional expiration time which will overide the expiration time already configured on this CacheRegion if not None. To set no expiration, use the value -1.
should_cache_fn¶ –
optional callable function which will receive the value returned by the “creator”, and will then return True or False, indicating if the value should actually be cached or not. If it returns False, the value is still returned, but isn’t cached. E.g.:
```
def dont_cache_none(value):
    return value is not None

value = region.get_or_create("some key",
                    create_value,
                    should_cache_fn=dont_cache_none)
```
Above, the function returns the value of create_value() if the cache is invalid, however if the return value is None, it won’t be cached.

New in version 0.4.3.

See also

CacheRegion.cache_on_arguments() - applies get_or_create() to any function using a decorator.

CacheRegion.get_or_create_multi() - multiple key/value: version

get_or_create_multi(keys, creator, expiration_time=None, should_cache_fn=None)¶

Return a sequence of cached values based on a sequence of keys.

The behavior for generation of values based on keys corresponds to that of Region.get_or_create(), with the exception that the creator() function may be asked to generate any subset of the given keys. The list of keys to be generated is passed to creator(), and creator() should return the generated values as a sequence corresponding to the order of the keys.

The method uses the same approach as Region.get_multi() and Region.set_multi() to get and set values from the backend.

If you are using a CacheBackend or ProxyBackend that modifies values, take note this function invokes .set_multi() for newly generated values using the same values it returns to the calling function. A correct implementation of .set_multi() will not modify values in-place on the submitted mapping dict.

Parameters:

keys¶ – Sequence of keys to be retrieved.
creator¶ – function which accepts a sequence of keys and returns a sequence of new values.
expiration_time¶ – optional expiration time which will overide the expiration time already configured on this CacheRegion if not None. To set no expiration, use the value -1.
should_cache_fn¶ – optional callable function which will receive each value returned by the “creator”, and will then return True or False, indicating if the value should actually be cached or not. If it returns False, the value is still returned, but isn’t cached.

New in version 0.5.0.

CacheRegion.get_or_create()

invalidate(hard=True)¶

Invalidate this CacheRegion.

The default invalidation system works by setting a current timestamp (using time.time()) representing the “minimum creation time” for a value. Any retrieved value whose creation time is prior to this timestamp is considered to be stale. It does not affect the data in the cache in any way, and is also local to this instance of CacheRegion.

Once set, the invalidation time is honored by the CacheRegion.get_or_create(), CacheRegion.get_or_create_multi() and CacheRegion.get() methods.

The method supports both “hard” and “soft” invalidation options. With “hard” invalidation, CacheRegion.get_or_create() will force an immediate regeneration of the value which all getters will wait for. With “soft” invalidation, subsequent getters will return the “old” value until the new one is available.

Usage of “soft” invalidation requires that the region or the method is given a non-None expiration time.

New in version 0.3.0.

Parameters:	hard¶ – if True, cache values will all require immediate regeneration; dogpile logic won’t be used. If False, the creation time of existing values will be pushed back before the expiration time so that a return+regen will be invoked. New in version 0.5.1.

is_configured¶: Return True if the backend has been configured via the CacheRegion.configure() method already.

New in version 0.5.1.

set(key, value)¶: Place a new value in the cache under the given key.

set_multi(mapping)¶: Place new values in the cache under the given keys.

New in version 0.5.0.

wrap(proxy)¶: Takes a ProxyBackend instance or class and wraps the attached backend.

class dogpile.cache.region.DefaultInvalidationStrategy¶

invalidate(hard=True)¶

Region invalidation.

CacheRegion propagated call. The default invalidation system works by setting a current timestamp (using time.time()) to consider all older timestamps effectively invalidated.

is_hard_invalidated(timestamp)¶

Check timestamp to determine if it was hard invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time and region is invalidated in hard mode.

is_invalidated(timestamp)¶

Check timestamp to determine if it was invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time.

is_soft_invalidated(timestamp)¶

Check timestamp to determine if it was soft invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time and region is invalidated in soft mode.

was_hard_invalidated()¶

Indicate the region was invalidated in hard mode.

Returns:	Boolean. True if region was invalidated in hard mode.

was_soft_invalidated()¶

Indicate the region was invalidated in soft mode.

Returns:	Boolean. True if region was invalidated in soft mode.

class dogpile.cache.region.RegionInvalidationStrategy¶

Region invalidation strategy interface

Implement this interface and pass implementation instance to CacheRegion.configure() to override default region invalidation.

Example:

class CustomInvalidationStrategy(RegionInvalidationStrategy):

    def __init__(self):
        self._soft_invalidated = None
        self._hard_invalidated = None

    def invalidate(self, hard=None):
        if hard:
            self._soft_invalidated = None
            self._hard_invalidated = time.time()
        else:
            self._soft_invalidated = time.time()
            self._hard_invalidated = None

    def is_invalidated(self, timestamp):
        return ((self._soft_invalidated and
                 timestamp < self._soft_invalidated) or
                (self._hard_invalidated and
                 timestamp < self._hard_invalidated))

    def was_hard_invalidated(self):
        return bool(self._hard_invalidated)

    def is_hard_invalidated(self, timestamp):
        return (self._hard_invalidated and
                timestamp < self._hard_invalidated)

    def was_soft_invalidated(self):
        return bool(self._soft_invalidated)

    def is_soft_invalidated(self, timestamp):
        return (self._soft_invalidated and
                timestamp < self._soft_invalidated)

The custom implementation is injected into a CacheRegion at configure time using the CacheRegion.configure.region_invalidator parameter:

region = CacheRegion()

region = region.configure(region_invalidator=CustomInvalidationStrategy())

Invalidation strategies that wish to have access to the CacheRegion itself should construct the invalidator given the region as an argument:

class MyInvalidator(RegionInvalidationStrategy):
    def __init__(self, region):
        self.region = region
        # ...

    # ...

region = CacheRegion()
region = region.configure(region_invalidator=MyInvalidator(region))

New in version 0.6.2.

invalidate(hard=True)¶

Region invalidation.

CacheRegion propagated call. The default invalidation system works by setting a current timestamp (using time.time()) to consider all older timestamps effectively invalidated.

is_hard_invalidated(timestamp)¶

Check timestamp to determine if it was hard invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time and region is invalidated in hard mode.

is_invalidated(timestamp)¶

Check timestamp to determine if it was invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time.

is_soft_invalidated(timestamp)¶

Check timestamp to determine if it was soft invalidated.

Returns:	Boolean. True if `timestamp` is older than the last region invalidation time and region is invalidated in soft mode.

was_hard_invalidated()¶

Indicate the region was invalidated in hard mode.

Returns:	Boolean. True if region was invalidated in hard mode.

was_soft_invalidated()¶

Indicate the region was invalidated in soft mode.

Returns:	Boolean. True if region was invalidated in soft mode.

dogpile.cache.region.make_region(*arg, **kw)¶

Instantiate a new CacheRegion.

Currently, make_region() is a passthrough to CacheRegion. See that class for constructor arguments.

dogpile.cache.region.value_version = 1¶: An integer placed in the CachedValue so that new versions of dogpile.cache can detect cached values from a previous, backwards-incompatible version.

Backend API¶

See the section Creating Backends for details on how to register new backends or Changing Backend Behavior for details on how to alter the behavior of existing backends.

class dogpile.cache.api.CacheBackend(arguments)¶

Base class for backend implementations.

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

key_mangler = None¶

Key mangling function.

May be None, or otherwise declared as an ordinary instance method.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

class dogpile.cache.api.CachedValue¶

Represent a value stored in the cache.

CachedValue is a two-tuple of (payload, metadata), where metadata is dogpile.cache’s tracking information ( currently the creation time). The metadata and tuple structure is pickleable, if the backend requires serialization.

metadata¶: Named accessor for the dogpile.cache metadata dictionary.

payload¶: Named accessor for the payload.

dogpile.cache.api.NO_VALUE = <dogpile.cache.api.NoValue object>¶: Value returned from get() that describes a key not present.

class dogpile.cache.api.NoValue¶

Describe a missing cache value.

The NO_VALUE module global should be used.

Backends¶

Memory Backends¶

Provides simple dictionary-based backends.

The two backends are MemoryBackend and MemoryPickleBackend; the latter applies a serialization step to cached values while the former places the value as given into the dictionary.

class dogpile.cache.backends.memory.MemoryBackend(arguments)¶

A backend that uses a plain dictionary.

There is no size management, and values which are placed into the dictionary will remain until explicitly removed. Note that Dogpile’s expiration of items is based on timestamps and does not remove them from the cache.

E.g.:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.memory'
)

To use a Python dictionary of your choosing, it can be passed in with the cache_dict argument:

my_dictionary = {}
region = make_region().configure(
    'dogpile.cache.memory',
    arguments={
        "cache_dict":my_dictionary
    }
)

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

class dogpile.cache.backends.memory.MemoryPickleBackend(arguments)¶

A backend that uses a plain dictionary, but serializes objects on MemoryBackend.set() and deserializes MemoryBackend.get().

E.g.:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.memory_pickle'
)

The usage of pickle to serialize cached values allows an object as placed in the cache to be a copy of the original given object, so that any subsequent changes to the given object aren’t reflected in the cached value, thus making the backend behave the same way as other backends which make use of serialization.

The serialization is performed via pickle, and incurs the same performance hit in doing so as that of other backends; in this way the MemoryPickleBackend performance is somewhere in between that of the pure MemoryBackend and the remote server oriented backends such as that of Memcached or Redis.

Pickle behavior here is the same as that of the Redis backend, using either cPickle or pickle and specifying HIGHEST_PROTOCOL upon serialize.

New in version 0.5.3.

Memcached Backends¶

Provides backends for talking to memcached.

class dogpile.cache.backends.memcached.GenericMemcachedBackend(arguments)¶

Base class for memcached backends.

This base class accepts a number of paramters common to all backends.

Parameters:

url¶ – the string URL to connect to. Can be a single string or a list of strings. This is the only argument that’s required.
distributed_lock¶ – boolean, when True, will use a memcached-lock as the dogpile lock (see MemcachedLock). Use this when multiple processes will be talking to the same memcached instance. When left at False, dogpile will coordinate on a regular threading mutex.
lock_timeout¶ –
integer, number of seconds after acquiring a lock that memcached should expire it. This argument is only valid when distributed_lock is True.

New in version 0.5.7.
memcached_expire_time¶ –
integer, when present will be passed as the time parameter to pylibmc.Client.set. This is used to set the memcached expiry time for a value.

Note

This parameter is different from Dogpile’s own expiration_time, which is the number of seconds after which Dogpile will consider the value to be expired. When Dogpile considers a value to be expired, it continues to use the value until generation of a new value is complete, when using CacheRegion.get_or_create(). Therefore, if you are setting memcached_expire_time, you’ll want to make sure it is greater than expiration_time by at least enough seconds for new values to be generated, else the value won’t be available during a regeneration, forcing all threads to wait for a regeneration each time a value expires.

The GenericMemachedBackend uses a threading.local() object to store individual client objects per thread, as most modern memcached clients do not appear to be inherently threadsafe.

In particular, threading.local() has the advantage over pylibmc’s built-in thread pool in that it automatically discards objects associated with a particular thread when that thread ends.

client¶

Return the memcached client.

This uses a threading.local by default as it appears most modern memcached libs aren’t inherently threadsafe.

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_arguments = {}¶: Additional arguments which will be passed to the set() method.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

class dogpile.cache.backends.memcached.MemcachedBackend(arguments)¶

A backend using the standard Python-memcached library.

Example:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.memcached',
    expiration_time = 3600,
    arguments = {
        'url':"127.0.0.1:11211"
    }
)

class dogpile.cache.backends.memcached.PylibmcBackend(arguments)¶

A backend for the pylibmc memcached client.

A configuration illustrating several of the optional arguments described in the pylibmc documentation:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.pylibmc',
    expiration_time = 3600,
    arguments = {
        'url':["127.0.0.1"],
        'binary':True,
        'behaviors':{"tcp_nodelay": True,"ketama":True}
    }
)

Arguments accepted here include those of GenericMemcachedBackend, as well as those below.

Parameters:	binary¶ – sets the `binary` flag understood by `pylibmc.Client`. behaviors¶ – a dictionary which will be passed to `pylibmc.Client` as the `behaviors` parameter. min_compress_len¶ – Integer, will be passed as the `min_compress_len` parameter to the `pylibmc.Client.set` method.

class dogpile.cache.backends.memcached.BMemcachedBackend(arguments)¶

A backend for the python-binary-memcached memcached client.

This is a pure Python memcached client which includes the ability to authenticate with a memcached server using SASL.

A typical configuration using username/password:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.bmemcached',
    expiration_time = 3600,
    arguments = {
        'url':["127.0.0.1"],
        'username':'scott',
        'password':'tiger'
    }
)

Arguments which can be passed to the arguments dictionary include:

Parameters:	username¶ – optional username, will be used for SASL authentication. password¶ – optional password, will be used for SASL authentication.

delete_multi(keys)¶: python-binary-memcached api does not implements delete_multi

class dogpile.cache.backends.memcached.MemcachedLock(client_fn, key, timeout=0)¶

Simple distributed lock using memcached.

This is an adaptation of the lock featured at http://amix.dk/blog/post/19386

Redis Backends¶

Provides backends for talking to Redis.

class dogpile.cache.backends.redis.RedisBackend(arguments)¶

A Redis backend, using the redis-py backend.

Example configuration:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.redis',
    arguments = {
        'host': 'localhost',
        'port': 6379,
        'db': 0,
        'redis_expiration_time': 60*60*2,   # 2 hours
        'distributed_lock': True
        }
)

Arguments accepted in the arguments dictionary:

Parameters:

url¶ –
string. If provided, will override separate host/port/db params. The format is that accepted by StrictRedis.from_url().

New in version 0.4.1.
host¶ – string, default is localhost.
password¶ –
string, default is no password.

New in version 0.4.1.
port¶ – integer, default is 6379.
db¶ – integer, default is 0.
redis_expiration_time¶ – integer, number of seconds after setting a value that Redis should expire it. This should be larger than dogpile’s cache expiration. By default no expiration is set.
distributed_lock¶ – boolean, when True, will use a redis-lock as the dogpile lock. Use this when multiple processes will be talking to the same redis instance. When left at False, dogpile will coordinate on a regular threading mutex.
lock_timeout¶ –
integer, number of seconds after acquiring a lock that Redis should expire it. This argument is only valid when distributed_lock is True.

New in version 0.5.0.
socket_timeout¶ –
float, seconds for socket timeout. Default is None (no timeout).

New in version 0.5.4.
lock_sleep¶ –
integer, number of seconds to sleep when failed to acquire a lock. This argument is only valid when distributed_lock is True.

New in version 0.5.0.
connection_pool¶ –
redis.ConnectionPool object. If provided, this object supersedes other connection arguments passed to the redis.StrictRedis instance, including url and/or host as well as socket_timeout, and will be passed to redis.StrictRedis as the source of connectivity.

New in version 0.5.4.

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

File Backends¶

Provides backends that deal with local filesystem access.

class dogpile.cache.backends.file.DBMBackend(arguments)¶

A file-backend using a dbm file to store keys.

Basic usage:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.dbm',
    expiration_time = 3600,
    arguments = {
        "filename":"/path/to/cachefile.dbm"
    }
)

DBM access is provided using the Python anydbm module, which selects a platform-specific dbm module to use. This may be made to be more configurable in a future release.

Note that different dbm modules have different behaviors. Some dbm implementations handle their own locking, while others don’t. The DBMBackend uses a read/write lockfile by default, which is compatible even with those DBM implementations for which this is unnecessary, though the behavior can be disabled.

The DBM backend by default makes use of two lockfiles. One is in order to protect the DBM file itself from concurrent writes, the other is to coordinate value creation (i.e. the dogpile lock). By default, these lockfiles use the flock() system call for locking; this is only available on Unix platforms. An alternative lock implementation, such as one which is based on threads or uses a third-party system such as portalocker, can be dropped in using the lock_factory argument in conjunction with the AbstractFileLock base class.

Currently, the dogpile lock is against the entire DBM file, not per key. This means there can only be one “creator” job running at a time per dbm file.

A future improvement might be to have the dogpile lock using a filename that’s based on a modulus of the key. Locking on a filename that uniquely corresponds to the key is problematic, since it’s not generally safe to delete lockfiles as the application runs, implying an unlimited number of key-based files would need to be created and never deleted.

Parameters to the arguments dictionary are below.

Parameters:

filename¶ – path of the filename in which to create the DBM file. Note that some dbm backends will change this name to have additional suffixes.
rw_lockfile¶ – the name of the file to use for read/write locking. If omitted, a default name is used by appending the suffix “.rw.lock” to the DBM filename. If False, then no lock is used.
dogpile_lockfile¶ – the name of the file to use for value creation, i.e. the dogpile lock. If omitted, a default name is used by appending the suffix “.dogpile.lock” to the DBM filename. If False, then dogpile.cache uses the default dogpile lock, a plain thread-based mutex.

lock_factory¶ –

a function or class which provides for a read/write lock. Defaults to FileLock. Custom implementations need to implement context-manager based read() and write() functions - the AbstractFileLock class is provided as a base class which provides these methods based on individual read/write lock functions. E.g. to replace the lock with the dogpile.core ReadWriteMutex:

from dogpile.core.readwrite_lock import ReadWriteMutex
from dogpile.cache.backends.file import AbstractFileLock

class MutexLock(AbstractFileLock):
    def __init__(self, filename):
        self.mutex = ReadWriteMutex()

    def acquire_read_lock(self, wait):
        ret = self.mutex.acquire_read_lock(wait)
        return wait or ret

    def acquire_write_lock(self, wait):
        ret = self.mutex.acquire_write_lock(wait)
        return wait or ret

    def release_read_lock(self):
        return self.mutex.release_read_lock()

    def release_write_lock(self):
        return self.mutex.release_write_lock()

from dogpile.cache import make_region

region = make_region().configure(
    "dogpile.cache.dbm",
    expiration_time=300,
    arguments={
        "filename": "file.dbm",
        "lock_factory": MutexLock
    }
)

While the included FileLock uses os.flock(), a windows-compatible implementation can be built using a library such as portalocker.

New in version 0.5.2.

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

class dogpile.cache.backends.file.FileLock(filename)¶

Use lockfiles to coordinate read/write access to a file.

Only works on Unix systems, using fcntl.flock().

acquire_read_lock(wait)¶

Acquire a ‘reader’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

acquire_write_lock(wait)¶

Acquire a ‘write’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

release_read_lock()¶

Release a ‘reader’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

release_write_lock()¶

Release a ‘writer’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

class dogpile.cache.backends.file.AbstractFileLock(filename)¶

Coordinate read/write access to a file.

typically is a file-based lock but doesn’t necessarily have to be.

The default implementation here is FileLock.

Implementations should provide the following methods:

* __init__()
* acquire_read_lock()
* acquire_write_lock()
* release_read_lock()
* release_write_lock()

The __init__() method accepts a single argument “filename”, which may be used as the “lock file”, for those implementations that use a lock file.

Note that multithreaded environments must provide a thread-safe version of this lock. The recommended approach for file- descriptor-based locks is to use a Python threading.local() so that a unique file descriptor is held per thread. See the source code of FileLock for an implementation example.

acquire(wait=True)¶

Acquire the “write” lock.

This is a direct call to AbstractFileLock.acquire_write_lock().

acquire_read_lock(wait)¶

Acquire a ‘reader’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

acquire_write_lock(wait)¶

Acquire a ‘write’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

is_open¶: optional method.

read(**kwds)¶

Provide a context manager for the “read” lock.

This method makes use of AbstractFileLock.acquire_read_lock() and AbstractFileLock.release_read_lock()

release()¶

Release the “write” lock.

This is a direct call to AbstractFileLock.release_write_lock().

release_read_lock()¶

Release a ‘reader’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

release_write_lock()¶

Release a ‘writer’ lock.

Raises NotImplementedError by default, must be implemented by subclasses.

write(**kwds)¶

Provide a context manager for the “write” lock.

This method makes use of AbstractFileLock.acquire_write_lock() and AbstractFileLock.release_write_lock()

Proxy Backends¶

Provides a utility and a decorator class that allow for modifying the behavior of different backends without altering the class itself or having to extend the base backend.

New in version 0.5.0: Added support for the ProxyBackend class.

class dogpile.cache.proxy.ProxyBackend(*args, **kwargs)¶

A decorator class for altering the functionality of backends.

Basic usage:

from dogpile.cache import make_region
from dogpile.cache.proxy import ProxyBackend

class MyFirstProxy(ProxyBackend):
    def get(self, key):
        # ... custom code goes here ...
        return self.proxied.get(key)

    def set(self, key, value):
        # ... custom code goes here ...
        self.proxied.set(key)

class MySecondProxy(ProxyBackend):
    def get(self, key):
        # ... custom code goes here ...
        return self.proxied.get(key)


region = make_region().configure(
    'dogpile.cache.dbm',
    expiration_time = 3600,
    arguments = {
        "filename":"/path/to/cachefile.dbm"
    },
    wrap = [ MyFirstProxy, MySecondProxy ]
)

Classes that extend ProxyBackend can be stacked together. The .proxied property will always point to either the concrete backend instance or the next proxy in the chain that a method can be delegated towards.

New in version 0.5.0.

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

wrap(backend)¶: Take a backend as an argument and setup the self.proxied property. Return an object that be used as a backend by a CacheRegion object.

Null Backend¶

The Null backend does not do any caching at all. It can be used to test behavior without caching, or as a means of disabling caching for a region that is otherwise used normally.

New in version 0.5.4.

class dogpile.cache.backends.null.NullBackend(arguments)¶

A “null” backend that effectively disables all cache operations.

Basic usage:

from dogpile.cache import make_region

region = make_region().configure(
    'dogpile.cache.null'
)

delete(key)¶

Delete a value from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

delete_multi(keys)¶

Delete multiple values from the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any.

The behavior here should be idempotent, that is, can be called any number of times regardless of whether or not the key exists.

New in version 0.5.0.

get(key)¶

Retrieve a value from the cache.

The returned value should be an instance of CachedValue, or NO_VALUE if not present.

get_multi(keys)¶

Retrieve multiple values from the cache.

The returned value should be a list, corresponding to the list of keys given.

New in version 0.5.0.

get_mutex(key)¶

Return an optional mutexing object for the given key.

This object need only provide an acquire() and release() method.

May return None, in which case the dogpile lock will use a regular threading.Lock object to mutex concurrent threads for value creation. The default implementation returns None.

Different backends may want to provide various kinds of “mutex” objects, such as those which link to lock files, distributed mutexes, memcached semaphores, etc. Whatever kind of system is best suited for the scope and behavior of the caching backend.

A mutex that takes the key into account will allow multiple regenerate operations across keys to proceed simultaneously, while a mutex that does not will serialize regenerate operations to just one at a time across all keys in the region. The latter approach, or a variant that involves a modulus of the given key’s hash value, can be used as a means of throttling the total number of value recreation operations that may proceed at one time.

set(key, value)¶

Set a value in the cache.

The key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

set_multi(mapping)¶

Set multiple values in the cache.

mapping is a dict in which the key will be whatever was passed to the registry, processed by the “key mangling” function, if any. The value will always be an instance of CachedValue.

When implementing a new CacheBackend or cutomizing via ProxyBackend, be aware that when this method is invoked by Region.get_or_create_multi(), the mapping values are the same ones returned to the upstream caller. If the subclass alters the values in any way, it must not do so ‘in-place’ on the mapping dict – that will have the undesirable effect of modifying the returned values as well.

New in version 0.5.0.

Plugins¶

Mako Integration¶

dogpile.cache includes a Mako plugin that replaces Beaker as the cache backend. Setup a Mako template lookup using the “dogpile.cache” cache implementation and a region dictionary:

from dogpile.cache import make_region
from mako.lookup import TemplateLookup

my_regions = {
    "local":make_region().configure(
                "dogpile.cache.dbm",
                expiration_time=360,
                arguments={"filename":"file.dbm"}
            ),
    "memcached":make_region().configure(
                "dogpile.cache.pylibmc",
                expiration_time=3600,
                arguments={"url":["127.0.0.1"]}
            )
}

mako_lookup = TemplateLookup(
    directories=["/myapp/templates"],
    cache_impl="dogpile.cache",
    cache_args={
        'regions':my_regions
    }
)

To use the above configuration in a template, use the cached=True argument on any Mako tag which accepts it, in conjunction with the name of the desired region as the cache_region argument:

<%def name="mysection()" cached="True" cache_region="memcached">
    some content that's cached
</%def>

class dogpile.cache.plugins.mako_cache.MakoPlugin(cache)¶

A Mako CacheImpl which talks to dogpile.cache.

get(key, **kw)¶

Retrieve a value from the cache.

Parameters:	key¶ – the value’s key. **kw¶ – cache configuration arguments.

get_or_create(key, creation_function, **kw)¶

Retrieve a value from the cache, using the given creation function to generate a new value.

This function must return a value, either from the cache, or via the given creation function. If the creation function is called, the newly created value should be populated into the cache under the given key before being returned.

Parameters:	key¶ – the value’s key. creation_function¶ – function that when called generates a new value. **kw¶ – cache configuration arguments.

invalidate(key, **kw)¶

Invalidate a value in the cache.

Parameters:	key¶ – the value’s key. **kw¶ – cache configuration arguments.

Utilities¶

dogpile.cache.util.function_key_generator(namespace, fn, to_str=<type 'str'>)¶

Return a function that generates a string key, based on a given function as well as arguments to the returned function itself.

This is used by CacheRegion.cache_on_arguments() to generate a cache key from a decorated function.

An alternate function may be used by specifying the CacheRegion.function_key_generator argument for CacheRegion.

See also

kwarg_function_key_generator() - similar function that also takes keyword arguments into account

dogpile.cache.util.kwarg_function_key_generator(namespace, fn, to_str=<type 'str'>)¶

Return a function that generates a string key, based on a given function as well as arguments to the returned function itself.

For kwargs passed in, we will build a dict of all argname (key) argvalue (values) including default args from the argspec and then alphabetize the list before generating the key.

New in version 0.6.2.

See also

function_key_generator() - default key generation function

dogpile.cache.util.sha1_mangle_key(key)¶: a SHA1 key mangler.

dogpile.cache.util.length_conditional_mangler(length, mangler)¶: a key mangler that mangles if the length of the key is past a certain threshold.

dogpile Core¶

class dogpile.Lock(mutex, creator, value_and_created_fn, expiretime, async_creator=None)¶

Dogpile lock class.

Provides an interface around an arbitrary mutex that allows one thread/process to be elected as the creator of a new value, while other threads/processes continue to return the previous version of that value.

Parameters:

mutex¶ – A mutex object that provides acquire() and release() methods.
creator¶ – Callable which returns a tuple of the form (new_value, creation_time). “new_value” should be a newly generated value representing completed state. “creation_time” should be a floating point time value which is relative to Python’s time.time() call, representing the time at which the value was created. This time value should be associated with the created value.
value_and_created_fn¶ – Callable which returns a tuple of the form (existing_value, creation_time). This basically should return what the last local call to the creator() callable has returned, i.e. the value and the creation time, which would be assumed here to be from a cache. If the value is not available, the NeedRegenerationException exception should be thrown.
expiretime¶ – Expiration time in seconds. Set to None for never expires. This timestamp is compared to the creation_time result and time.time() to determine if the value returned by value_and_created_fn is “expired”.
async_creator¶ – A callable. If specified, this callable will be passed the mutex as an argument and is responsible for releasing the mutex after it finishes some asynchronous value creation. The intent is for this to be used to defer invocation of the creator callable until some later time.

class dogpile.NeedRegenerationException¶: An exception that when raised in the ‘with’ block, forces the ‘has_value’ flag to False and incurs a regeneration of the value.

class dogpile.util.ReadWriteMutex¶

A mutex which allows multiple readers, single writer.

ReadWriteMutex uses a Python threading.Condition to provide this functionality across threads within a process.

The Beaker package also contained a file-lock based version of this concept, so that readers/writers could be synchronized across processes with a common filesystem. A future Dogpile release may include this additional class at some point.

acquire_read_lock(wait=True)¶: Acquire the ‘read’ lock.

acquire_write_lock(wait=True)¶: Acquire the ‘write’ lock.

release_read_lock()¶: Release the ‘read’ lock.

release_write_lock()¶: Release the ‘write’ lock.

class dogpile.util.NameRegistry(creator)¶

Generates and return an object, keeping it as a singleton for a certain identifier for as long as its strongly referenced.

e.g.:

class MyFoo(object):
    "some important object."
    def __init__(self, identifier):
        self.identifier = identifier

registry = NameRegistry(MyFoo)

# thread 1:
my_foo = registry.get("foo1")

# thread 2
my_foo = registry.get("foo1")

Above, my_foo in both thread #1 and #2 will be the same object. The constructor for MyFoo will be called once, passing the identifier foo1 as the argument.

When thread 1 and thread 2 both complete or otherwise delete references to my_foo, the object is removed from the NameRegistry as a result of Python garbage collection.

Parameters:	creator¶ – A function that will create a new value, given the identifier passed to the `NameRegistry.get()` method.

get(identifier, *args, **kw)¶

Get and possibly create the value.

Parameters:	identifier¶ – Hash key for the value. If the creation function is called, this identifier will also be passed to the creation function. *kw¶ (args,) – Additional arguments which will also be passed to the creation function if it is called.

API¶

Region¶

Backend API¶

Backends¶

Memory Backends¶

Memcached Backends¶

Redis Backends¶

File Backends¶

Proxy Backends¶

Null Backend¶

Plugins¶

Mako Integration¶

Utilities¶

dogpile Core¶

Table of Contents

Previous topic

Next topic

This Page