aboutsummaryrefslogtreecommitdiff
path: root/subsonic-android/src/net/sourceforge/subsonic/androidapp/util/LRUCache.java
blob: f6145fb7a945666568b9816851d7433bf02930f6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*
 This file is part of Subsonic.

 Subsonic is free software: you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 the Free Software Foundation, either version 3 of the License, or
 (at your option) any later version.

 Subsonic is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU General Public License for more details.

 You should have received a copy of the GNU General Public License
 along with Subsonic.  If not, see <http://www.gnu.org/licenses/>.

 Copyright 2009 (C) Sindre Mehus
 */
package net.sourceforge.subsonic.androidapp.util;

import java.lang.ref.SoftReference;
import java.util.HashMap;
import java.util.Map;

/**
 * @author Sindre Mehus
 */
public class LRUCache<K,V>{

    private final int capacity;
    private final Map<K, TimestampedValue> map;

    public LRUCache(int capacity) {
        map = new HashMap<K, TimestampedValue>(capacity);
        this.capacity = capacity;
    }

    public synchronized V get(K key) {
        TimestampedValue value = map.get(key);

        V result = null;
        if (value != null) {
            value.updateTimestamp();
            result = value.getValue();
        }

        return result;
    }

    public synchronized void put(K key, V value) {
        if (map.size() >= capacity) {
            removeOldest();
        }
        map.put(key, new TimestampedValue(value));
    }

    public void clear() {
        map.clear();
    }

    private void removeOldest() {
        K oldestKey = null;
        long oldestTimestamp = Long.MAX_VALUE;

        for (Map.Entry<K, TimestampedValue> entry : map.entrySet()) {
            K key = entry.getKey();
            TimestampedValue value = entry.getValue();
            if (value.getTimestamp() < oldestTimestamp) {
                oldestTimestamp = value.getTimestamp();
                oldestKey = key;
            }
        }

        if (oldestKey != null) {
            map.remove(oldestKey);
        }
    }

    private final class TimestampedValue {

        private final SoftReference<V> value;
        private long timestamp;

        public TimestampedValue(V value) {
            this.value = new SoftReference<V>(value);
            updateTimestamp();
        }

        public V getValue() {
            return value.get();
        }

        public long getTimestamp() {
            return timestamp;
        }

        public void updateTimestamp() {
            timestamp = System.currentTimeMillis();
        }
    }

}