| 9 | #include "../../RG.h" |
| 10 | |
| 11 | CacheEntry *CacheArray_FindMinLRU(CacheEntry *cache_arr, uint cap) { |
| 12 | ASSERT(cache_arr != NULL); |
| 13 | |
| 14 | CacheEntry *min_LRU_entry = cache_arr; |
| 15 | |
| 16 | for(size_t i = 1; i < cap; i++) { |
| 17 | CacheEntry *current_entry = cache_arr + i; |
| 18 | if(current_entry->LRU < min_LRU_entry->LRU) { |
| 19 | min_LRU_entry = current_entry; |
| 20 | } |
| 21 | } |
| 22 | |
| 23 | return min_LRU_entry; |
| 24 | } |
| 25 | |
| 26 | CacheEntry *CacheArray_PopulateEntry(long long counter, CacheEntry *entry, char *key, |
| 27 | void *value) { |