aboutsummaryrefslogtreecommitdiff
path: root/src/main/java/io/github/moulberry/notenoughupdates/util/LRUCache.java
blob: 6adbc30dea33c3f59209709c61419efbc5693f6f (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
/*
 * Copyright (C) 2022 NotEnoughUpdates contributors
 *
 * This file is part of NotEnoughUpdates.
 *
 * NotEnoughUpdates is free software: you can redistribute it
 * and/or modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation, either
 * version 3 of the License, or (at your option) any later version.
 *
 * NotEnoughUpdates 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with NotEnoughUpdates. If not, see <https://www.gnu.org/licenses/>.
 */

package io.github.moulberry.notenoughupdates.util;

import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.function.Function;
import java.util.function.IntSupplier;

public interface LRUCache<K, V> extends Function<K, V> {

	static <K, V> LRUCache<K, V> memoize(Function<K, V> mapper, int maxCacheSize) {
		return memoize(mapper, () -> maxCacheSize);
	}

	static <K, V> LRUCache<K, V> memoize(Function<K, V> mapper, IntSupplier maxCacheSize) {
		Map<K, Object> cache = new LinkedHashMap<K, Object>(10, 0.75F, true) {
			@Override
			protected boolean removeEldestEntry(Map.Entry<K, Object> eldest) {
				return this.size() > maxCacheSize.getAsInt();
			}
		};
		Object SENTINEL_CACHE_RESULT_NULL = new Object();
		Function<K, Object> sentinelAwareMapper = mapper.andThen(it -> it == null ? SENTINEL_CACHE_RESULT_NULL : it);
		Map<K, Object> synchronizedCache = Collections.synchronizedMap(cache);
		return new LRUCache<K, V>() {
			@Override
			public void clearCache() {
				synchronizedCache.clear();
			}

			@Override
			public int size() {
				return synchronizedCache.size();
			}

			@Override
			public V apply(K k) {
				Object value = synchronizedCache.computeIfAbsent(k, sentinelAwareMapper);
				return value == SENTINEL_CACHE_RESULT_NULL ? null : (V) value;
			}
		};
	}

	int size();

	void clearCache();
}