| 28 | } |
| 29 | |
| 30 | public void put(int key, int value) { |
| 31 | if (capacity == 0) return; |
| 32 | if (entries.containsKey(key)) { |
| 33 | Entry e = entries.get(key); |
| 34 | e.value = value; |
| 35 | updateFrequency(e); |
| 36 | } else { |
| 37 | if (entries.size() == capacity) { |
| 38 | evictLeastFrequent(); |
| 39 | } |
| 40 | Entry e = new Entry(key, value, 1); |
| 41 | entries.put(key, e); |
| 42 | freqMap.computeIfAbsent(1, k -> new LinkedHashSet<>()).add(e); |
| 43 | minFreq = 1; // Reset min frequency to 1 for new entry |
| 44 | } |
| 45 | } |
| 46 | |
| 47 | private void updateFrequency(Entry e) { |
| 48 | int oldFreq = e.freq; |