|
| 1 | +#!/usr/bin/python3 |
| 2 | +""" 4. MRU Caching |
| 3 | +""" |
| 4 | +from datetime import datetime |
| 5 | +from collections import defaultdict |
| 6 | +BaseCaching = __import__('base_caching').BaseCaching |
| 7 | + |
| 8 | + |
| 9 | +class LFUCache(BaseCaching): |
| 10 | + """ BaseCache defines: |
| 11 | + - overwrite functions 'put' and 'get' for implement |
| 12 | + MRU caching system |
| 13 | + """ |
| 14 | + def __init__(self): |
| 15 | + """ Initiliaze |
| 16 | + """ |
| 17 | + super().__init__() |
| 18 | + self.cache_by_time = {} |
| 19 | + self.cache_by_frequency_use = defaultdict(int) # >>> Default value: 0 |
| 20 | + |
| 21 | + def put(self, key, item): |
| 22 | + """ |
| 23 | + Assign to the dictionary self.cache_data the item |
| 24 | + value for the key key |
| 25 | + If the number of items in self.cache_data is higher |
| 26 | + that BaseCaching.MAX_ITEMS: |
| 27 | + - must discard the most recently used item (MRU algorithm) |
| 28 | + - must print DISCARD: with the key discarded and following by |
| 29 | + a new line |
| 30 | + """ |
| 31 | + if key and item: |
| 32 | + self.cache_by_time[key] = datetime.now() |
| 33 | + self.cache_data[key] = item |
| 34 | + self.cache_by_frequency_use[key] += 1 |
| 35 | + |
| 36 | + if len(self.cache_data) > BaseCaching.MAX_ITEMS: |
| 37 | + # Sorted elements by frequency_used |
| 38 | + frequency_use_filtered = {} |
| 39 | + for k, v in self.cache_by_frequency_use.items(): |
| 40 | + if k != key: |
| 41 | + frequency_use_filtered[k] = v |
| 42 | + keys_by_frequency_used = sorted(frequency_use_filtered, |
| 43 | + key=frequency_use_filtered.get) |
| 44 | + key_to_delete = keys_by_frequency_used[0] |
| 45 | + |
| 46 | + # There are more elements with same frequency used count? |
| 47 | + count = frequency_use_filtered[key_to_delete] |
| 48 | + posibles_elements_to_discard_dict = {} |
| 49 | + for k, v in frequency_use_filtered.items(): |
| 50 | + if v == count: |
| 51 | + posibles_elements_to_discard_dict[k] = v |
| 52 | + if len(posibles_elements_to_discard_dict) > 1: |
| 53 | + elements_to_discard_by_time = {} |
| 54 | + for k, v in self.cache_by_time.items(): |
| 55 | + if k in posibles_elements_to_discard_dict.keys(): |
| 56 | + elements_to_discard_by_time[k] = v |
| 57 | + |
| 58 | + elements_by_time = sorted( |
| 59 | + elements_to_discard_by_time, |
| 60 | + key=elements_to_discard_by_time.get) |
| 61 | + key_to_delete = elements_by_time[0] |
| 62 | + |
| 63 | + # Delete element with least_frequency_used |
| 64 | + del self.cache_by_time[key_to_delete] |
| 65 | + del self.cache_data[key_to_delete] |
| 66 | + del self.cache_by_frequency_use[key_to_delete] |
| 67 | + print('DISCARD: {}'.format(key_to_delete)) |
| 68 | + |
| 69 | + def get(self, key): |
| 70 | + """ |
| 71 | + Return the value in self.cache_data linked to key |
| 72 | + """ |
| 73 | + element = self.cache_data.get(key) |
| 74 | + if element: |
| 75 | + self.cache_by_time[key] = datetime.now() |
| 76 | + self.cache_by_frequency_use[key] += 1 |
| 77 | + return element |
0 commit comments