Mercurial > hg > orthanc
comparison Core/Cache/SharedArchive.cpp @ 1367:fe6e5a9f1ea2 query-retrieve
SharedArchive
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Fri, 22 May 2015 17:40:10 +0200 |
parents | |
children | b22ba8c5edbe |
comparison
equal
deleted
inserted
replaced
1366:a3559b66fba7 | 1367:fe6e5a9f1ea2 |
---|---|
1 /** | |
2 * Orthanc - A Lightweight, RESTful DICOM Store | |
3 * Copyright (C) 2012-2015 Sebastien Jodogne, Medical Physics | |
4 * Department, University Hospital of Liege, Belgium | |
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 #include "../PrecompiledHeaders.h" | |
34 #include "SharedArchive.h" | |
35 | |
36 | |
37 #include "../Uuid.h" | |
38 | |
39 | |
40 namespace Orthanc | |
41 { | |
42 void SharedArchive::RemoveInternal(const std::string& id) | |
43 { | |
44 Archive::iterator it = archive_.find(id); | |
45 | |
46 if (it != archive_.end()) | |
47 { | |
48 delete it->second; | |
49 archive_.erase(it); | |
50 } | |
51 } | |
52 | |
53 | |
54 SharedArchive::Accessor::Accessor(SharedArchive& that, | |
55 const std::string& id) : | |
56 lock_(that.mutex_) | |
57 { | |
58 Archive::iterator it = that.archive_.find(id); | |
59 | |
60 if (it == that.archive_.end()) | |
61 { | |
62 throw OrthancException(ErrorCode_InexistentItem); | |
63 } | |
64 else | |
65 { | |
66 that.lru_.MakeMostRecent(id); | |
67 item_ = it->second; | |
68 } | |
69 } | |
70 | |
71 | |
72 SharedArchive::~SharedArchive() | |
73 { | |
74 for (Archive::iterator it = archive_.begin(); | |
75 it != archive_.end(); it++) | |
76 { | |
77 delete it->second; | |
78 } | |
79 } | |
80 | |
81 | |
82 std::string SharedArchive::Add(IDynamicObject* obj) | |
83 { | |
84 boost::mutex::scoped_lock lock(mutex_); | |
85 | |
86 if (archive_.size() == maxSize_) | |
87 { | |
88 // The quota has been reached, remove the oldest element | |
89 std::string oldest = lru_.RemoveOldest(); | |
90 RemoveInternal(oldest); | |
91 } | |
92 | |
93 std::string id = Toolbox::GenerateUuid(); | |
94 RemoveInternal(id); // Should never be useful because of UUID | |
95 archive_[id] = obj; | |
96 lru_.Add(id); | |
97 | |
98 return id; | |
99 } | |
100 | |
101 | |
102 void SharedArchive::Remove(const std::string& id) | |
103 { | |
104 boost::mutex::scoped_lock lock(mutex_); | |
105 RemoveInternal(id); | |
106 lru_.Invalidate(id); | |
107 } | |
108 | |
109 | |
110 void SharedArchive::List(std::list<std::string>& items) | |
111 { | |
112 items.clear(); | |
113 | |
114 boost::mutex::scoped_lock lock(mutex_); | |
115 | |
116 for (Archive::const_iterator it = archive_.begin(); | |
117 it != archive_.end(); it++) | |
118 { | |
119 items.push_back(it->first); | |
120 } | |
121 } | |
122 } | |
123 | |
124 |