Mercurial > hg > orthanc
annotate OrthancFramework/Sources/Cache/LeastRecentlyUsedIndex.h @ 4984:c8cdf5163cd2
cppcheck
| author | Alain Mazy <am@osimis.io> |
|---|---|
| date | Mon, 25 Apr 2022 18:54:45 +0200 |
| parents | 43e613a7756b |
| children | 0ea402b4d901 |
| rev | line source |
|---|---|
| 282 | 1 /** |
| 2 * Orthanc - A Lightweight, RESTful DICOM Store | |
| 1900 | 3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics |
|
1288
6e7e5ed91c2d
upgrade to year 2015
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
689
diff
changeset
|
4 * Department, University Hospital of Liege, Belgium |
|
4870
43e613a7756b
upgrade to year 2022
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4831
diff
changeset
|
5 * Copyright (C) 2017-2022 Osimis S.A., Belgium |
|
43e613a7756b
upgrade to year 2022
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4831
diff
changeset
|
6 * Copyright (C) 2021-2022 Sebastien Jodogne, ICTEAM UCLouvain, Belgium |
| 282 | 7 * |
| 8 * This program is free software: you can redistribute it and/or | |
|
4119
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
9 * modify it under the terms of the GNU Lesser General Public License |
|
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
10 * as published by the Free Software Foundation, either version 3 of |
|
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
11 * the License, or (at your option) any later version. |
| 282 | 12 * |
| 13 * This program is distributed in the hope that it will be useful, but | |
| 14 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
|
4119
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
16 * Lesser General Public License for more details. |
| 282 | 17 * |
|
4119
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
18 * You should have received a copy of the GNU Lesser General Public |
|
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
19 * License along with this program. If not, see |
|
bf7b9edf6b81
re-licensing the OrthancFramework to LGPL, in order to license Stone of Orthanc under LGPL
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4044
diff
changeset
|
20 * <http://www.gnu.org/licenses/>. |
| 282 | 21 **/ |
| 22 | |
| 23 | |
| 24 #pragma once | |
| 25 | |
| 26 #include <list> | |
| 27 #include <map> | |
|
3453
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
28 #include <vector> |
| 282 | 29 #include <boost/noncopyable.hpp> |
| 283 | 30 #include <cassert> |
| 31 | |
| 32 #include "../OrthancException.h" | |
|
284
06aa7b7b6723
implementation of a single-threaded cache mechanism
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
283
diff
changeset
|
33 #include "../Toolbox.h" |
| 282 | 34 |
| 35 namespace Orthanc | |
| 36 { | |
| 37 /** | |
| 38 * This class implements the index of a cache with least recently | |
| 39 * used (LRU) recycling policy. All the items of the cache index | |
| 40 * can be associated with a payload. | |
| 41 * Reference: http://stackoverflow.com/a/2504317 | |
| 42 **/ | |
| 43 template <typename T, typename Payload = NullType> | |
|
505
f59e4518fd57
rename CacheIndex as LeastRecentlyUsedIndex
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
44 class LeastRecentlyUsedIndex : public boost::noncopyable |
| 282 | 45 { |
| 46 private: | |
| 47 typedef std::list< std::pair<T, Payload> > Queue; | |
| 48 typedef std::map<T, typename Queue::iterator> Index; | |
| 49 | |
| 50 Index index_; | |
| 51 Queue queue_; | |
| 52 | |
| 53 /** | |
| 54 * Internal method for debug builds to check whether the internal | |
| 55 * data structures are not corrupted. | |
| 56 **/ | |
| 57 void CheckInvariants() const; | |
| 58 | |
| 59 public: | |
| 60 /** | |
| 61 * Add a new element to the cache index, and make it the most | |
| 62 * recent element. | |
| 63 * \param id The ID of the element. | |
| 64 * \param payload The payload of the element. | |
| 65 **/ | |
| 66 void Add(T id, Payload payload = Payload()); | |
| 67 | |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
68 void AddOrMakeMostRecent(T id, Payload payload = Payload()); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
69 |
| 282 | 70 /** |
| 71 * When accessing an element of the cache, this method tags the | |
| 72 * element as the most recently used. | |
| 73 * \param id The most recently accessed item. | |
| 74 **/ | |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
75 void MakeMostRecent(T id); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
76 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
77 void MakeMostRecent(T id, Payload updatedPayload); |
| 282 | 78 |
| 79 /** | |
| 80 * Remove an element from the cache index. | |
| 81 * \param id The item to remove. | |
| 82 **/ | |
| 83 Payload Invalidate(T id); | |
| 84 | |
| 85 /** | |
| 86 * Get the oldest element in the cache and remove it. | |
| 87 * \return The oldest item. | |
| 88 **/ | |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
89 T RemoveOldest(); |
| 282 | 90 |
| 91 /** | |
| 92 * Get the oldest element in the cache, remove it and return the | |
| 93 * associated payload. | |
| 94 * \param payload Where to store the associated payload. | |
| 95 * \return The oldest item. | |
| 96 **/ | |
| 97 T RemoveOldest(Payload& payload); | |
| 98 | |
| 99 /** | |
| 100 * Check whether an element is contained in the cache. | |
| 101 * \param id The item. | |
| 102 * \return \c true iff the item is indexed by the cache. | |
| 103 **/ | |
| 104 bool Contains(T id) const | |
| 105 { | |
| 106 return index_.find(id) != index_.end(); | |
| 107 } | |
| 108 | |
| 283 | 109 bool Contains(T id, Payload& payload) const |
| 110 { | |
| 111 typename Index::const_iterator it = index_.find(id); | |
| 112 if (it == index_.end()) | |
| 113 { | |
| 114 return false; | |
| 115 } | |
| 116 else | |
| 117 { | |
| 118 payload = it->second->second; | |
| 119 return true; | |
| 120 } | |
| 121 } | |
| 122 | |
| 123 /** | |
| 124 * Return the number of elements in the cache. | |
| 125 * \return The number of elements. | |
| 126 **/ | |
| 127 size_t GetSize() const | |
| 128 { | |
| 129 assert(index_.size() == queue_.size()); | |
| 130 return queue_.size(); | |
| 131 } | |
| 132 | |
| 282 | 133 /** |
| 134 * Check whether the cache index is empty. | |
| 135 * \return \c true iff the cache is empty. | |
| 136 **/ | |
| 137 bool IsEmpty() const | |
| 138 { | |
| 139 return index_.empty(); | |
| 140 } | |
|
507
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
141 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
142 const T& GetOldest() const; |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
143 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
144 const Payload& GetOldestPayload() const; |
|
3453
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
145 |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
146 void GetAllKeys(std::vector<T>& keys) const |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
147 { |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
148 keys.clear(); |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
149 keys.reserve(GetSize()); |
| 4199 | 150 for (typename Index::const_iterator it = index_.begin(); it != index_.end(); ++it) |
|
3453
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
151 { |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
152 keys.push_back(it->first); |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
153 } |
|
8c663bbe5363
LeastRecentlyUsedIndex::GetAllKeys
Alain Mazy <alain@mazy.be>
parents:
3060
diff
changeset
|
154 } |
| 282 | 155 }; |
| 283 | 156 |
| 157 | |
| 158 | |
| 159 | |
| 160 /****************************************************************** | |
| 161 ** Implementation of the template | |
| 162 ******************************************************************/ | |
| 163 | |
| 164 template <typename T, typename Payload> | |
|
505
f59e4518fd57
rename CacheIndex as LeastRecentlyUsedIndex
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
165 void LeastRecentlyUsedIndex<T, Payload>::CheckInvariants() const |
| 283 | 166 { |
| 167 #ifndef NDEBUG | |
| 168 assert(index_.size() == queue_.size()); | |
| 169 | |
| 170 for (typename Index::const_iterator | |
| 4199 | 171 it = index_.begin(); it != index_.end(); ++it) |
| 283 | 172 { |
| 173 assert(it->second != queue_.end()); | |
| 174 assert(it->second->first == it->first); | |
| 175 } | |
| 176 #endif | |
| 177 } | |
| 178 | |
| 179 | |
| 180 template <typename T, typename Payload> | |
|
505
f59e4518fd57
rename CacheIndex as LeastRecentlyUsedIndex
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
181 void LeastRecentlyUsedIndex<T, Payload>::Add(T id, Payload payload) |
| 283 | 182 { |
| 183 if (Contains(id)) | |
| 184 { | |
| 185 throw OrthancException(ErrorCode_BadSequenceOfCalls); | |
| 186 } | |
| 187 | |
| 188 queue_.push_front(std::make_pair(id, payload)); | |
| 189 index_[id] = queue_.begin(); | |
| 190 | |
| 191 CheckInvariants(); | |
| 192 } | |
| 193 | |
| 194 | |
| 195 template <typename T, typename Payload> | |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
196 void LeastRecentlyUsedIndex<T, Payload>::MakeMostRecent(T id) |
| 283 | 197 { |
| 198 if (!Contains(id)) | |
| 199 { | |
| 200 throw OrthancException(ErrorCode_InexistentItem); | |
| 201 } | |
| 202 | |
| 203 typename Index::iterator it = index_.find(id); | |
| 204 assert(it != index_.end()); | |
| 205 | |
| 206 std::pair<T, Payload> item = *(it->second); | |
| 207 | |
| 208 queue_.erase(it->second); | |
| 209 queue_.push_front(item); | |
| 210 index_[id] = queue_.begin(); | |
| 211 | |
| 212 CheckInvariants(); | |
| 213 } | |
| 214 | |
| 215 | |
| 216 template <typename T, typename Payload> | |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
217 void LeastRecentlyUsedIndex<T, Payload>::AddOrMakeMostRecent(T id, Payload payload) |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
218 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
219 typename Index::iterator it = index_.find(id); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
220 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
221 if (it != index_.end()) |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
222 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
223 // Already existing. Make it most recent. |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
224 std::pair<T, Payload> item = *(it->second); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
225 item.second = payload; |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
226 queue_.erase(it->second); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
227 queue_.push_front(item); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
228 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
229 else |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
230 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
231 // New item |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
232 queue_.push_front(std::make_pair(id, payload)); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
233 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
234 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
235 index_[id] = queue_.begin(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
236 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
237 CheckInvariants(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
238 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
239 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
240 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
241 template <typename T, typename Payload> |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
242 void LeastRecentlyUsedIndex<T, Payload>::MakeMostRecent(T id, Payload updatedPayload) |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
243 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
244 if (!Contains(id)) |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
245 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
246 throw OrthancException(ErrorCode_InexistentItem); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
247 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
248 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
249 typename Index::iterator it = index_.find(id); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
250 assert(it != index_.end()); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
251 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
252 std::pair<T, Payload> item = *(it->second); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
253 item.second = updatedPayload; |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
254 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
255 queue_.erase(it->second); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
256 queue_.push_front(item); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
257 index_[id] = queue_.begin(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
258 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
259 CheckInvariants(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
260 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
261 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
262 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
263 template <typename T, typename Payload> |
|
505
f59e4518fd57
rename CacheIndex as LeastRecentlyUsedIndex
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
264 Payload LeastRecentlyUsedIndex<T, Payload>::Invalidate(T id) |
| 283 | 265 { |
| 266 if (!Contains(id)) | |
| 267 { | |
| 268 throw OrthancException(ErrorCode_InexistentItem); | |
| 269 } | |
| 270 | |
| 271 typename Index::iterator it = index_.find(id); | |
| 272 assert(it != index_.end()); | |
| 273 | |
| 274 Payload payload = it->second->second; | |
| 275 queue_.erase(it->second); | |
| 276 index_.erase(it); | |
| 277 | |
| 278 CheckInvariants(); | |
| 279 return payload; | |
| 280 } | |
| 281 | |
| 282 | |
| 283 template <typename T, typename Payload> | |
|
505
f59e4518fd57
rename CacheIndex as LeastRecentlyUsedIndex
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
284 T LeastRecentlyUsedIndex<T, Payload>::RemoveOldest(Payload& payload) |
| 283 | 285 { |
| 286 if (IsEmpty()) | |
| 287 { | |
| 288 throw OrthancException(ErrorCode_BadSequenceOfCalls); | |
| 289 } | |
| 290 | |
| 291 std::pair<T, Payload> item = queue_.back(); | |
| 292 T oldest = item.first; | |
| 293 payload = item.second; | |
| 294 | |
| 295 queue_.pop_back(); | |
| 296 assert(index_.find(oldest) != index_.end()); | |
| 297 index_.erase(oldest); | |
| 298 | |
| 299 CheckInvariants(); | |
| 300 | |
| 301 return oldest; | |
| 302 } | |
|
507
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
303 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
304 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
305 template <typename T, typename Payload> |
|
509
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
306 T LeastRecentlyUsedIndex<T, Payload>::RemoveOldest() |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
307 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
308 if (IsEmpty()) |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
309 { |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
310 throw OrthancException(ErrorCode_BadSequenceOfCalls); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
311 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
312 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
313 std::pair<T, Payload> item = queue_.back(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
314 T oldest = item.first; |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
315 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
316 queue_.pop_back(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
317 assert(index_.find(oldest) != index_.end()); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
318 index_.erase(oldest); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
319 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
320 CheckInvariants(); |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
321 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
322 return oldest; |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
323 } |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
324 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
325 |
|
e7841864c97c
StableResourcesMonitor
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
507
diff
changeset
|
326 template <typename T, typename Payload> |
|
507
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
327 const T& LeastRecentlyUsedIndex<T, Payload>::GetOldest() const |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
328 { |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
329 if (IsEmpty()) |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
330 { |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
331 throw OrthancException(ErrorCode_BadSequenceOfCalls); |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
332 } |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
333 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
334 return queue_.back().first; |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
335 } |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
336 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
337 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
338 template <typename T, typename Payload> |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
339 const Payload& LeastRecentlyUsedIndex<T, Payload>::GetOldestPayload() const |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
340 { |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
341 if (IsEmpty()) |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
342 { |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
343 throw OrthancException(ErrorCode_BadSequenceOfCalls); |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
344 } |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
345 |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
346 return queue_.back().second; |
|
c4122c3a47c1
access to oldest item in LRUCache
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
505
diff
changeset
|
347 } |
| 282 | 348 } |