# Example of caching in Python using functools.lru_cache
from functools import lru_cache
import time
@lru_cache(maxsize=None)
def expensive_function(x):
time.sleep(2) # Simulating a time-consuming computation
return x * x
start_time = time.time()
print(expensive_function(4)) # Returns 16 after 2 seconds
print("First call took:", time.time() - start_time)
start_time = time.time()
print(expensive_function(4)) # Returns cached result 16 instantly
print("Second call took:", time.time() - start_time)
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?