memocache 0.0.1

A decorator that optimizes function execution by caching results. With support for different eviction strategies (LFU, LRU, FIFO).

Module: memo

Description: This module provides a memo decorator that implements a caching mechanism for function results. The goal is to optimize performance by avoiding redundant calculations.

Features:

• Cache: Stores function call results in a local file.
• Eviction strategies: Supports various eviction strategies (LRU, LFU, FIFO) to manage cache size.
• Serialization: Uses serialization to store various data types in the cache.
• Synchronization: Implements synchronization mechanisms to ensure cache integrity in multi-threaded environments.

Usage:

from memo import memo

@memo(strategy='lru', max_size=500)
def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n-1) + fibonacci(n-2)```

**Decorator parameters**:

* strategy: Eviction strategy (lru, lfu, fifo).
* max_size: Maximum cache size.
* ttl: Time-to-live of items in the cache (in seconds).
* Internal structure:

* cache_class: Class representing the cache (LRUCache, LFUCache, FIFOCache).
* evictor: Object responsible for managing cache item eviction.
* serialize/deserialize: Functions for serializing and deserializing data.
* cache_lock: Synchronization mechanism for cache access.