# Example of caching expensive computations using functools.lru_cache
from functools import lru_cache
import time
@lru_cache(maxsize=None) # Unlimited cache size
def expensive_computation(n):
time.sleep(2) # Simulate a time-consuming computation
return n * n
# First call will take time
print(expensive_computation(4)) # Output: 16
# Subsequent call will be fast as it is cached
print(expensive_computation(4)) # Output: 16
print(expensive_computation(5)) # Output: 25
print(expensive_computation(5)) # Output: 25
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?