|
1745
|
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
|
|
1747
|
33 #include "../PrecompiledHeadersServer.h"
|
|
1745
|
34 #include "LookupIdentifierQuery.h"
|
|
|
35
|
|
1747
|
36 #include "../../Core/OrthancException.h"
|
|
1746
|
37 #include "SetOfResources.h"
|
|
1745
|
38
|
|
|
39 #include <cassert>
|
|
|
40
|
|
|
41
|
|
|
42
|
|
|
43 namespace Orthanc
|
|
|
44 {
|
|
|
45 static const DicomTag patientIdentifiers[] =
|
|
|
46 {
|
|
|
47 DICOM_TAG_PATIENT_ID,
|
|
|
48 DICOM_TAG_PATIENT_NAME,
|
|
|
49 DICOM_TAG_PATIENT_BIRTH_DATE
|
|
|
50 };
|
|
|
51
|
|
|
52 static const DicomTag studyIdentifiers[] =
|
|
|
53 {
|
|
|
54 DICOM_TAG_PATIENT_ID,
|
|
|
55 DICOM_TAG_PATIENT_NAME,
|
|
|
56 DICOM_TAG_PATIENT_BIRTH_DATE,
|
|
|
57 DICOM_TAG_STUDY_INSTANCE_UID,
|
|
|
58 DICOM_TAG_ACCESSION_NUMBER,
|
|
|
59 DICOM_TAG_STUDY_DESCRIPTION,
|
|
|
60 DICOM_TAG_STUDY_DATE
|
|
|
61 };
|
|
|
62
|
|
|
63 static const DicomTag seriesIdentifiers[] =
|
|
|
64 {
|
|
|
65 DICOM_TAG_SERIES_INSTANCE_UID
|
|
|
66 };
|
|
|
67
|
|
|
68 static const DicomTag instanceIdentifiers[] =
|
|
|
69 {
|
|
|
70 DICOM_TAG_SOP_INSTANCE_UID
|
|
|
71 };
|
|
|
72
|
|
|
73 static void LoadIdentifiers(const DicomTag*& tags,
|
|
|
74 size_t& size,
|
|
|
75 ResourceType level)
|
|
|
76 {
|
|
|
77 switch (level)
|
|
|
78 {
|
|
|
79 case ResourceType_Patient:
|
|
|
80 tags = patientIdentifiers;
|
|
|
81 size = sizeof(patientIdentifiers) / sizeof(DicomTag);
|
|
|
82 break;
|
|
|
83
|
|
|
84 case ResourceType_Study:
|
|
|
85 tags = studyIdentifiers;
|
|
|
86 size = sizeof(studyIdentifiers) / sizeof(DicomTag);
|
|
|
87 break;
|
|
|
88
|
|
|
89 case ResourceType_Series:
|
|
|
90 tags = seriesIdentifiers;
|
|
|
91 size = sizeof(seriesIdentifiers) / sizeof(DicomTag);
|
|
|
92 break;
|
|
|
93
|
|
|
94 case ResourceType_Instance:
|
|
|
95 tags = instanceIdentifiers;
|
|
|
96 size = sizeof(instanceIdentifiers) / sizeof(DicomTag);
|
|
|
97 break;
|
|
|
98
|
|
|
99 default:
|
|
|
100 throw OrthancException(ErrorCode_ParameterOutOfRange);
|
|
|
101 }
|
|
|
102 }
|
|
|
103
|
|
|
104
|
|
1748
|
105 LookupIdentifierQuery::Union::~Union()
|
|
|
106 {
|
|
|
107 for (size_t i = 0; i < union_.size(); i++)
|
|
|
108 {
|
|
|
109 delete union_[i];
|
|
|
110 }
|
|
|
111 }
|
|
|
112
|
|
|
113
|
|
|
114 void LookupIdentifierQuery::Union::Add(const Constraint& constraint)
|
|
|
115 {
|
|
|
116 union_.push_back(new Constraint(constraint));
|
|
|
117 }
|
|
|
118
|
|
1746
|
119
|
|
|
120 LookupIdentifierQuery::~LookupIdentifierQuery()
|
|
|
121 {
|
|
|
122 for (Constraints::iterator it = constraints_.begin();
|
|
|
123 it != constraints_.end(); ++it)
|
|
|
124 {
|
|
|
125 delete *it;
|
|
|
126 }
|
|
|
127 }
|
|
|
128
|
|
|
129
|
|
|
130
|
|
1748
|
131 bool LookupIdentifierQuery::IsIdentifier(const DicomTag& tag,
|
|
|
132 ResourceType level)
|
|
1745
|
133 {
|
|
|
134 const DicomTag* tags;
|
|
|
135 size_t size;
|
|
|
136
|
|
1748
|
137 LoadIdentifiers(tags, size, level);
|
|
1745
|
138
|
|
|
139 for (size_t i = 0; i < size; i++)
|
|
|
140 {
|
|
|
141 if (tag == tags[i])
|
|
|
142 {
|
|
|
143 return true;
|
|
|
144 }
|
|
|
145 }
|
|
|
146
|
|
|
147 return false;
|
|
|
148 }
|
|
|
149
|
|
|
150
|
|
|
151 void LookupIdentifierQuery::AddConstraint(DicomTag tag,
|
|
|
152 IdentifierConstraintType type,
|
|
|
153 const std::string& value)
|
|
|
154 {
|
|
|
155 assert(IsIdentifier(tag));
|
|
|
156
|
|
1748
|
157 Constraint constraint(tag, type, NormalizeIdentifier(value));
|
|
|
158 constraints_.push_back(new Union);
|
|
|
159 constraints_.back()->Add(constraint);
|
|
1745
|
160 }
|
|
|
161
|
|
|
162
|
|
1748
|
163 void LookupIdentifierQuery::AddDisjunction(const std::list<Constraint>& constraints)
|
|
1745
|
164 {
|
|
1748
|
165 constraints_.push_back(new Union);
|
|
1745
|
166
|
|
1748
|
167 for (std::list<Constraint>::const_iterator
|
|
|
168 it = constraints.begin(); it != constraints.end(); ++it)
|
|
|
169 {
|
|
|
170 assert(IsIdentifier(it->GetTag()));
|
|
|
171 constraints_.back()->Add(*it);
|
|
|
172 }
|
|
1745
|
173 }
|
|
|
174
|
|
|
175
|
|
|
176 std::string LookupIdentifierQuery::NormalizeIdentifier(const std::string& value)
|
|
|
177 {
|
|
|
178 std::string s = Toolbox::ConvertToAscii(Toolbox::StripSpaces(value));
|
|
|
179 Toolbox::ToUpperCase(s);
|
|
|
180 return s;
|
|
|
181 }
|
|
|
182
|
|
|
183
|
|
|
184 void LookupIdentifierQuery::StoreIdentifiers(IDatabaseWrapper& database,
|
|
|
185 int64_t resource,
|
|
|
186 ResourceType level,
|
|
|
187 const DicomMap& map)
|
|
|
188 {
|
|
|
189 const DicomTag* tags;
|
|
|
190 size_t size;
|
|
|
191
|
|
|
192 LoadIdentifiers(tags, size, level);
|
|
|
193
|
|
|
194 for (size_t i = 0; i < size; i++)
|
|
|
195 {
|
|
|
196 const DicomValue* value = map.TestAndGetValue(tags[i]);
|
|
|
197 if (value != NULL &&
|
|
|
198 !value->IsNull() &&
|
|
|
199 !value->IsBinary())
|
|
|
200 {
|
|
|
201 std::string s = NormalizeIdentifier(value->GetContent());
|
|
|
202 database.SetIdentifierTag(resource, tags[i], s);
|
|
|
203 }
|
|
|
204 }
|
|
|
205 }
|
|
1746
|
206
|
|
|
207
|
|
|
208 void LookupIdentifierQuery::Apply(std::list<std::string>& result,
|
|
|
209 IDatabaseWrapper& database)
|
|
|
210 {
|
|
|
211 SetOfResources resources(database, level_);
|
|
|
212
|
|
|
213 for (size_t i = 0; i < GetSize(); i++)
|
|
|
214 {
|
|
1748
|
215 std::list<int64_t> a;
|
|
|
216
|
|
|
217 for (size_t j = 0; j < constraints_[i]->GetSize(); j++)
|
|
|
218 {
|
|
|
219 const Constraint& constraint = constraints_[i]->GetConstraint(j);
|
|
|
220 std::list<int64_t> b;
|
|
|
221 database.LookupIdentifier(b, level_, constraint.GetTag(), constraint.GetType(), constraint.GetValue());
|
|
|
222
|
|
|
223 a.splice(a.end(), b);
|
|
|
224 }
|
|
|
225
|
|
|
226 resources.Intersect(a);
|
|
1746
|
227 }
|
|
|
228
|
|
|
229 resources.Flatten(result);
|
|
|
230 }
|
|
1745
|
231 }
|
