pylru_lru_cache_creation_with_eviction_demo.py

1import pylru
2
3# Create a cache that can hold up to 2 items
4size = 2
5cache = pylru.lrucache(size)
6
7# Add items to the cache
8cache['a'] = 'apple'
9cache['b'] = 'banana'
10
11# Accessing an item makes it the most recently used
12print(cache['a'])
13
14# Adding a third item will evict the least recently used item ('b')
15cache['c'] = 'cherry'
16
17# Check if keys are still in the cache
18print('a' in cache) # True
19print('b' in cache) # False
20print('c' in cache) # True