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