1368
|
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 "PrecompiledHeadersServer.h"
|
|
34 #include "QueryRetrieveHandler.h"
|
|
35
|
|
36 #include "OrthancInitialization.h"
|
|
37
|
|
38
|
|
39 namespace Orthanc
|
|
40 {
|
|
41 void QueryRetrieveHandler::Invalidate()
|
|
42 {
|
|
43 done_ = false;
|
|
44 answers_.Clear();
|
|
45 }
|
|
46
|
|
47
|
|
48 void QueryRetrieveHandler::Run()
|
|
49 {
|
|
50 if (!done_)
|
|
51 {
|
|
52 ReusableDicomUserConnection::Locker locker(context_.GetReusableDicomUserConnection(), modality_);
|
|
53 locker.GetConnection().Find(answers_, level_, query_);
|
|
54 done_ = true;
|
|
55 }
|
|
56 }
|
|
57
|
|
58
|
|
59 QueryRetrieveHandler::QueryRetrieveHandler(ServerContext& context) :
|
|
60 context_(context),
|
|
61 done_(false),
|
|
62 level_(ResourceType_Study)
|
|
63 {
|
|
64 }
|
|
65
|
|
66
|
|
67 void QueryRetrieveHandler::SetModality(const std::string& symbolicName)
|
|
68 {
|
|
69 Invalidate();
|
|
70 modalityName_ = symbolicName;
|
|
71 Configuration::GetDicomModalityUsingSymbolicName(modality_, symbolicName);
|
|
72 }
|
|
73
|
|
74
|
|
75 void QueryRetrieveHandler::SetLevel(ResourceType level)
|
|
76 {
|
|
77 Invalidate();
|
|
78 level_ = level;
|
|
79 }
|
|
80
|
|
81
|
|
82 void QueryRetrieveHandler::SetQuery(const DicomTag& tag,
|
|
83 const std::string& value)
|
|
84 {
|
|
85 Invalidate();
|
|
86 query_.SetValue(tag, value);
|
|
87 }
|
|
88
|
|
89
|
|
90 size_t QueryRetrieveHandler::GetAnswerCount()
|
|
91 {
|
|
92 Run();
|
|
93 return answers_.GetSize();
|
|
94 }
|
|
95
|
|
96
|
|
97 const DicomMap& QueryRetrieveHandler::GetAnswer(size_t i)
|
|
98 {
|
|
99 Run();
|
|
100
|
|
101 if (i >= answers_.GetSize())
|
|
102 {
|
|
103 throw OrthancException(ErrorCode_ParameterOutOfRange);
|
|
104 }
|
|
105
|
|
106 return answers_.GetAnswer(i);
|
|
107 }
|
|
108
|
|
109
|
|
110 void QueryRetrieveHandler::Retrieve(const std::string& target,
|
|
111 size_t i)
|
|
112 {
|
|
113 Run();
|
|
114
|
|
115 if (i >= answers_.GetSize())
|
|
116 {
|
|
117 throw OrthancException(ErrorCode_ParameterOutOfRange);
|
|
118 }
|
|
119
|
|
120 ReusableDicomUserConnection::Locker locker(context_.GetReusableDicomUserConnection(), modality_);
|
|
121 locker.GetConnection().Move(target, answers_.GetAnswer(i));
|
|
122 }
|
|
123
|
|
124
|
|
125 void QueryRetrieveHandler::Retrieve(const std::string& target)
|
|
126 {
|
|
127 for (size_t i = 0; i < GetAnswerCount(); i++)
|
|
128 {
|
|
129 Retrieve(target, i);
|
|
130 }
|
|
131 }
|
|
132 }
|