Mercurial > hg > orthanc
annotate OrthancServer/Search/LookupIdentifierQuery.cpp @ 1749:99f4a05f39fa db-changes
various types of constraints
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Tue, 27 Oct 2015 10:54:51 +0100 |
parents | 92203f713205 |
children | 55d52567bebb |
rev | line source |
---|---|
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 | |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
73 |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
74 void LookupIdentifierQuery::LoadIdentifiers(const DicomTag*& tags, |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
75 size_t& size, |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
76 ResourceType level) |
1745 | 77 { |
78 switch (level) | |
79 { | |
80 case ResourceType_Patient: | |
81 tags = patientIdentifiers; | |
82 size = sizeof(patientIdentifiers) / sizeof(DicomTag); | |
83 break; | |
84 | |
85 case ResourceType_Study: | |
86 tags = studyIdentifiers; | |
87 size = sizeof(studyIdentifiers) / sizeof(DicomTag); | |
88 break; | |
89 | |
90 case ResourceType_Series: | |
91 tags = seriesIdentifiers; | |
92 size = sizeof(seriesIdentifiers) / sizeof(DicomTag); | |
93 break; | |
94 | |
95 case ResourceType_Instance: | |
96 tags = instanceIdentifiers; | |
97 size = sizeof(instanceIdentifiers) / sizeof(DicomTag); | |
98 break; | |
99 | |
100 default: | |
101 throw OrthancException(ErrorCode_ParameterOutOfRange); | |
102 } | |
103 } | |
104 | |
105 | |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
106 LookupIdentifierQuery::Disjunction::~Disjunction() |
1748 | 107 { |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
108 for (size_t i = 0; i < disjunction_.size(); i++) |
1748 | 109 { |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
110 delete disjunction_[i]; |
1748 | 111 } |
112 } | |
113 | |
114 | |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
115 void LookupIdentifierQuery::Disjunction::Add(const DicomTag& tag, |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
116 IdentifierConstraintType type, |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
117 const std::string& value) |
1748 | 118 { |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
119 disjunction_.push_back(new Constraint(tag, type, value)); |
1748 | 120 } |
121 | |
1746 | 122 |
123 LookupIdentifierQuery::~LookupIdentifierQuery() | |
124 { | |
125 for (Constraints::iterator it = constraints_.begin(); | |
126 it != constraints_.end(); ++it) | |
127 { | |
128 delete *it; | |
129 } | |
130 } | |
131 | |
132 | |
133 | |
1748 | 134 bool LookupIdentifierQuery::IsIdentifier(const DicomTag& tag, |
135 ResourceType level) | |
1745 | 136 { |
137 const DicomTag* tags; | |
138 size_t size; | |
139 | |
1748 | 140 LoadIdentifiers(tags, size, level); |
1745 | 141 |
142 for (size_t i = 0; i < size; i++) | |
143 { | |
144 if (tag == tags[i]) | |
145 { | |
146 return true; | |
147 } | |
148 } | |
149 | |
150 return false; | |
151 } | |
152 | |
153 | |
154 void LookupIdentifierQuery::AddConstraint(DicomTag tag, | |
155 IdentifierConstraintType type, | |
156 const std::string& value) | |
157 { | |
158 assert(IsIdentifier(tag)); | |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
159 constraints_.back()->Add(tag, type, value); |
1745 | 160 } |
161 | |
162 | |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
163 LookupIdentifierQuery::Disjunction& LookupIdentifierQuery::AddDisjunction() |
1745 | 164 { |
1749
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
165 constraints_.push_back(new Disjunction); |
99f4a05f39fa
various types of constraints
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
1748
diff
changeset
|
166 return *constraints_.back(); |
1745 | 167 } |
168 | |
169 | |
170 std::string LookupIdentifierQuery::NormalizeIdentifier(const std::string& value) | |
171 { | |
172 std::string s = Toolbox::ConvertToAscii(Toolbox::StripSpaces(value)); | |
173 Toolbox::ToUpperCase(s); | |
174 return s; | |
175 } | |
176 | |
177 | |
178 void LookupIdentifierQuery::StoreIdentifiers(IDatabaseWrapper& database, | |
179 int64_t resource, | |
180 ResourceType level, | |
181 const DicomMap& map) | |
182 { | |
183 const DicomTag* tags; | |
184 size_t size; | |
185 | |
186 LoadIdentifiers(tags, size, level); | |
187 | |
188 for (size_t i = 0; i < size; i++) | |
189 { | |
190 const DicomValue* value = map.TestAndGetValue(tags[i]); | |
191 if (value != NULL && | |
192 !value->IsNull() && | |
193 !value->IsBinary()) | |
194 { | |
195 std::string s = NormalizeIdentifier(value->GetContent()); | |
196 database.SetIdentifierTag(resource, tags[i], s); | |
197 } | |
198 } | |
199 } | |
1746 | 200 |
201 | |
202 void LookupIdentifierQuery::Apply(std::list<std::string>& result, | |
203 IDatabaseWrapper& database) | |
204 { | |
205 SetOfResources resources(database, level_); | |
206 | |
207 for (size_t i = 0; i < GetSize(); i++) | |
208 { | |
1748 | 209 std::list<int64_t> a; |
210 | |
211 for (size_t j = 0; j < constraints_[i]->GetSize(); j++) | |
212 { | |
213 const Constraint& constraint = constraints_[i]->GetConstraint(j); | |
214 std::list<int64_t> b; | |
215 database.LookupIdentifier(b, level_, constraint.GetTag(), constraint.GetType(), constraint.GetValue()); | |
216 | |
217 a.splice(a.end(), b); | |
218 } | |
219 | |
220 resources.Intersect(a); | |
1746 | 221 } |
222 | |
223 resources.Flatten(result); | |
224 } | |
1745 | 225 } |