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