fleche.storage.bagofholding_file

Attributes

logger
VersionValidator

Classes

BagOfHoldingH5FileBackend	File-based storage backend using pickle.
ValueBagOfHoldingH5File	Mixin that locks per-key so concurrent ops on different keys proceed in parallel.
CallBagOfHoldingH5File	Mixin that locks per-key so concurrent ops on different keys proceed in parallel.

Module Contents

fleche.storage.bagofholding_file.logger

fleche.storage.bagofholding_file.VersionValidator

class fleche.storage.bagofholding_file.BagOfHoldingH5FileBackend

Bases: fleche.storage.file.FileStorage

File-based storage backend using pickle.

Stores objects on the filesystem.

version_validator: VersionValidator | None = None

__post_init__()

_to_file(value: Any, path: pathlib.Path) → None

_from_file(path: pathlib.Path) → Any

rebag(version_validator: VersionValidator = 'none') → None

Re-open and re-save all bags using the given version validator.

Useful when bags were created with an older library version and would otherwise fail strict version checking on load.

class fleche.storage.bagofholding_file.ValueBagOfHoldingH5File

Bases: fleche.storage.thread_safe.PerKeyLockMixin, fleche.storage.destructuring.DestructuringMixin, fleche.storage.base.ValueMixin, BagOfHoldingH5FileBackend

Mixin that locks per-key so concurrent ops on different keys proceed in parallel.

A lightweight threading.Lock guards the lock-table itself; once the per-key RLock is obtained the table lock is released, so two threads operating on different keys never block each other. Operations on the same key are serialized by the per-key lock, which is reentrant to allow nested calls (e.g. expand inside load).

Instances must be hashable. Place before the concrete storage class in the MRO:

@dataclass(frozen=True)
class PerKeyValuePickle(PerKeyLockMixin, ValuePickleFile): ...

class fleche.storage.bagofholding_file.CallBagOfHoldingH5File

Bases: fleche.storage.thread_safe.PerKeyLockMixin, fleche.storage.base.CallMixin, BagOfHoldingH5FileBackend

Mixin that locks per-key so concurrent ops on different keys proceed in parallel.

A lightweight threading.Lock guards the lock-table itself; once the per-key RLock is obtained the table lock is released, so two threads operating on different keys never block each other. Operations on the same key are serialized by the per-key lock, which is reentrant to allow nested calls (e.g. expand inside load).

Instances must be hashable. Place before the concrete storage class in the MRO:

@dataclass(frozen=True)
class PerKeyValuePickle(PerKeyLockMixin, ValuePickleFile): ...