fleche.caches

Attributes

logger
DigestedIterable
DigestedDict

Exceptions

Rejected

Cache refused to cache the call for some reason or other.

Classes

BaseCache	Helper class that provides a standard way to create an ABC using
Cache	Helper class that provides a standard way to create an ABC using
ReadOnlyCache	A cache that can only be read from.
FilteredCache	A read-only view of a cache that only exposes calls matching a predicate.
RefreshingCache	A cache that forces re-execution by always missing on load.
CacheStack	Represents a combination of caches.

Module Contents

fleche.caches.logger

exception fleche.caches.Rejected

Bases: Exception

Cache refused to cache the call for some reason or other.

fleche.caches.DigestedIterable

fleche.caches.DigestedDict

class fleche.caches.BaseCache

Bases: abc.ABC

Helper class that provides a standard way to create an ABC using inheritance.

abstractmethod save(call: fleche.call.Call) → str

load(key: str, lazy: bool = False) → fleche.call.Call

load(key: str, lazy: bool = True) → fleche.call.LazyCall

abstractmethod load_value(key: str) → Any

abstractmethod evict(key: str | fleche.digest.Digest) → None

contains(key: str) → bool

transfer(other: BaseCache, pop: bool = False) → None

Transfer all calls from this cache to another cache.

Existing calls in the target cache may be overwritten by the transferred calls.

Parameters:

• other – The destination cache.

• pop – If True, evict transferred keys from the source cache after moving.

push(cache: BaseCache) → CacheStack

abstractmethod shrink(key: fleche.digest.Digest | str) → fleche.digest.Digest

Find the shortest substring that is still an unambigious reference to the same call.

Warning

This is a property of how many values there are in your storage! A key returned from this function may become ambigious in the future when more values are added. Do not rely on this function in your programs, it is provided as a convenience for users only!

Parameters:

key (str or Digest) – the key to shorten

Returns:

shortest key possible

Return type:

Digest

Raises:

AmbiguousDigestError – if no shorter key is possible

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

table() → pandas.DataFrame

Return a pandas DataFrame summarizing cached calls via query().

This implementation uses a fully-wildcard Call template to retrieve all calls through self.query and then flattens metadata keys into top-level columns for convenience.

Arguments and results are elided.

The DataFrame index will be the lookup key (digest) of each call.

Returns:

table of all calls on cache

Return type:

pandas.DataFrame

filter(predicate: Callable[[fleche.call.Call | fleche.call.LazyCall], bool] | fleche.call.Call) → FilteredCache

Create a read-only view of this cache that only exposes calls matching the predicate.

Parameters:

predicate – A function that takes a Call or LazyCall and returns True if it should be included in the new cache, or a Call object to use as a template.

Returns:

A read-only view of the cache.

Return type:

FilteredCache

class fleche.caches.Cache

Bases: BaseCache

Helper class that provides a standard way to create an ABC using inheritance.

values: fleche.storage.Storage

calls: fleche.storage.CallStorage

_calls: dataclasses.InitVar[fleche.storage.CallStorage | fleche.storage.Storage]

__post_init__(_calls)

load_value(key)

_handle_args_save(value)

_handle_args_load(key)

save(call: fleche.call.Call) → str

_decode_call(call: fleche.call.Call, lazy: bool = False) → fleche.call.Call

_decode_call(call: fleche.call.Call, lazy: bool = True) → fleche.call.LazyCall

load(key: str, lazy: bool = False) → fleche.call.Call

load(key: str, lazy: bool = True) → fleche.call.LazyCall

contains(key: str) → bool

shrink(key: fleche.digest.Digest | str) → fleche.digest.Digest

Find the shortest substring that is still an unambigious reference to the same call.

Warning

This is a property of how many values there are in your storage! A key returned from this function may become ambigious in the future when more values are added. Do not rely on this function in your programs, it is provided as a convenience for users only!

Parameters:

key (str or Digest) – the key to shorten

Returns:

shortest key possible

Return type:

Digest

Raises:

AmbiguousDigestError – if no shorter key is possible

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

Query for cached calls that match a template and return decoded results.

This delegates to the underlying CallStorage.query() using the provided template call. Any digested argument values and the result are decoded via this cache’s value storage before yielding.

Parameters:

• call – A Call instance used as a template; fields set to None act as wildcards. For arguments and result, comparisons follow digest semantics (i.e., values are matched by their digest).

• lazy – If True, return LazyCall instances instead of Call instances.

Yields:

Call | LazyCall – Matching calls with arguments and result decoded from digests where possible.

evict(key: str | fleche.digest.Digest) → None

redigest() → None

Ensures consistent cache keys in case digest function changed.

This may take time depending on cache size.

class fleche.caches.ReadOnlyCache

Bases: BaseCache

A cache that can only be read from.

cache: BaseCache

save(call: fleche.call.Call)

load(key, lazy: bool = True)

shrink(key: fleche.digest.Digest | str) → fleche.digest.Digest

Find the shortest substring that is still an unambigious reference to the same call.

Warning

This is a property of how many values there are in your storage! A key returned from this function may become ambigious in the future when more values are added. Do not rely on this function in your programs, it is provided as a convenience for users only!

Parameters:

key (str or Digest) – the key to shorten

Returns:

shortest key possible

Return type:

Digest

Raises:

AmbiguousDigestError – if no shorter key is possible

evict(key: str | fleche.digest.Digest) → None

load_value(key)

contains(key: str) → bool

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

Forward queries to the wrapped cache.

Parameters:

• call – A template Call where None fields act as wildcards.

• lazy – If True, return LazyCall instances.

Yields:

Call | LazyCall – Results yielded by the wrapped cache’s query method.

class fleche.caches.FilteredCache

Bases: ReadOnlyCache

A read-only view of a cache that only exposes calls matching a predicate.

predicate: Callable[[fleche.call.Call | fleche.call.LazyCall], bool]

load(key, lazy: bool = True)

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

Forward queries to the wrapped cache.

Parameters:

• call – A template Call where None fields act as wildcards.

• lazy – If True, return LazyCall instances.

Yields:

Call | LazyCall – Results yielded by the wrapped cache’s query method.

class fleche.caches.RefreshingCache

Bases: BaseCache

A cache that forces re-execution by always missing on load.

It forwards saves and value loads to an underlying cache, allowing new results to be stored while ensuring that existing ones are ignored for the duration of its use.

This is necessary to handle nested fleche calls during a rerun, otherwise forcing them to re-execute would be awkward.

cache: BaseCache

save(call: fleche.call.Call) → str

load(key: str, lazy: bool = False) → fleche.call.Call

load(key: str, lazy: bool = True) → fleche.call.LazyCall

load_value(key: str) → Any

contains(key: str) → bool

evict(key: str | fleche.digest.Digest) → None

shrink(key: fleche.digest.Digest | str) → fleche.digest.Digest

Find the shortest substring that is still an unambigious reference to the same call.

Warning

This is a property of how many values there are in your storage! A key returned from this function may become ambigious in the future when more values are added. Do not rely on this function in your programs, it is provided as a convenience for users only!

Parameters:

key (str or Digest) – the key to shorten

Returns:

shortest key possible

Return type:

Digest

Raises:

AmbiguousDigestError – if no shorter key is possible

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

class fleche.caches.CacheStack

Bases: BaseCache

Represents a combination of caches.

Saving will always hit the lowest level, while loading will traverse up.

stack: tuple[BaseCache, Ellipsis]

save(call: fleche.call.Call)

load(key, lazy: bool = True)

load_value(key)

contains(key: str) → bool

push(cache: BaseCache) → CacheStack

evict(key: str | fleche.digest.Digest) → None

shrink(key: fleche.digest.Digest | str) → fleche.digest.Digest

Find the shortest substring that is still an unambigious reference to the same call.

Warning

This is a property of how many values there are in your storage! A key returned from this function may become ambigious in the future when more values are added. Do not rely on this function in your programs, it is provided as a convenience for users only!

Parameters:

key (str or Digest) – the key to shorten

Returns:

shortest key possible

Return type:

Digest

Raises:

AmbiguousDigestError – if no shorter key is possible

query(call: fleche.call.Call, lazy: bool = False) → Iterable[fleche.call.Call]

query(call: fleche.call.Call, lazy: bool = True) → Iterable[fleche.call.LazyCall]

Aggregate query results across the stack, avoiding duplicates.

The caches are queried from bottom to top. Results are deduplicated by their lookup key (via Call.to_lookup_key()) and yielded in the order they are first seen.

Parameters:

• call – A template Call where None fields act as wildcards.

• lazy – If True, return LazyCall instances.

Yields:

Call | LazyCall – Matching calls from any cache in the stack, without duplicates.