blob: 423b355827bb99f9627ad1baddfd3c9150039b83 (
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
|
#include <mbgl/tile/tile_cache.hpp>
#include <mbgl/tile/tile_data.hpp>
#include <cassert>
namespace mbgl {
void TileCache::setSize(size_t size_) {
size = size_;
while (orderedKeys.size() > size) {
auto key = orderedKeys.front();
orderedKeys.pop_front();
tiles.erase(key);
}
assert(orderedKeys.size() <= size);
tiles.reserve(size);
}
void TileCache::add(uint64_t key, std::shared_ptr<TileData> data) {
// insert new or query existing data
if (tiles.emplace(key, data).second) {
// remove existing data key
orderedKeys.remove(key);
}
// (re-)insert data key as newest
orderedKeys.push_back(key);
// purge oldest key/data if necessary
if (orderedKeys.size() > size) {
get(orderedKeys.front());
}
assert(orderedKeys.size() <= size);
};
std::shared_ptr<TileData> TileCache::get(uint64_t key) {
std::shared_ptr<TileData> data;
auto it = tiles.find(key);
if (it != tiles.end()) {
data = it->second;
tiles.erase(it);
orderedKeys.remove(key);
assert(data->isReady());
}
return data;
};
bool TileCache::has(uint64_t key) {
return tiles.find(key) != tiles.end();
}
void TileCache::clear() {
orderedKeys.clear();
tiles.clear();
}
} // namespace mbgl
|
