Mercurial > hg > orthanc
annotate Core/DicomFormat/DicomMap.h @ 996:cf52f3bcb2b3 lua-scripting
clarification of Lua classes wrt multithreading
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Thu, 03 Jul 2014 16:27:16 +0200 |
parents | 2d0a347e8cfc |
children | 67e6400fca03 f5b0207967bc |
rev | line source |
---|---|
0 | 1 /** |
59 | 2 * Orthanc - A Lightweight, RESTful DICOM Store |
689 | 3 * Copyright (C) 2012-2014 Medical Physics Department, CHU of Liege, |
0 | 4 * 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. | |
136 | 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. | |
0 | 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 "DicomTag.h" | |
36 #include "DicomValue.h" | |
37 #include "DicomString.h" | |
562
f64e3838d6e1
refactoring enumerations
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
38 #include "../Enumerations.h" |
0 | 39 |
567 | 40 #include <set> |
0 | 41 #include <map> |
42 #include <json/json.h> | |
43 | |
59 | 44 namespace Orthanc |
0 | 45 { |
46 class DicomMap : public boost::noncopyable | |
47 { | |
48 private: | |
49 friend class DicomArray; | |
50 friend class FromDcmtkBridge; | |
51 friend class ToDcmtkBridge; | |
52 | |
53 typedef std::map<DicomTag, DicomValue*> Map; | |
54 | |
55 Map map_; | |
56 | |
57 // Warning: This takes the ownership of "value" | |
58 void SetValue(uint16_t group, | |
59 uint16_t element, | |
60 DicomValue* value); | |
61 | |
62 void SetValue(DicomTag tag, | |
63 DicomValue* value); | |
64 | |
65 void ExtractTags(DicomMap& source, | |
66 const DicomTag* tags, | |
67 size_t count) const; | |
567 | 68 |
69 static void GetMainDicomTagsInternal(std::set<DicomTag>& result, ResourceType level); | |
0 | 70 |
71 public: | |
72 DicomMap() | |
73 { | |
74 } | |
75 | |
76 ~DicomMap() | |
77 { | |
78 Clear(); | |
79 } | |
80 | |
81 DicomMap* Clone() const; | |
82 | |
83 void Clear(); | |
84 | |
85 void SetValue(uint16_t group, | |
86 uint16_t element, | |
87 const DicomValue& value) | |
88 { | |
89 SetValue(group, element, value.Clone()); | |
90 } | |
91 | |
92 void SetValue(const DicomTag& tag, | |
93 const DicomValue& value) | |
94 { | |
95 SetValue(tag, value.Clone()); | |
96 } | |
97 | |
98 void SetValue(const DicomTag& tag, | |
99 const std::string& str) | |
100 { | |
101 SetValue(tag, new DicomString(str)); | |
102 } | |
103 | |
104 void SetValue(uint16_t group, | |
105 uint16_t element, | |
106 const std::string& str) | |
107 { | |
108 SetValue(group, element, new DicomString(str)); | |
109 } | |
110 | |
111 bool HasTag(uint16_t group, uint16_t element) const | |
112 { | |
113 return HasTag(DicomTag(group, element)); | |
114 } | |
115 | |
116 bool HasTag(const DicomTag& tag) const | |
117 { | |
118 return map_.find(tag) != map_.end(); | |
119 } | |
120 | |
121 const DicomValue& GetValue(uint16_t group, uint16_t element) const | |
122 { | |
123 return GetValue(DicomTag(group, element)); | |
124 } | |
125 | |
126 const DicomValue& GetValue(const DicomTag& tag) const; | |
127 | |
80 | 128 const DicomValue* TestAndGetValue(uint16_t group, uint16_t element) const |
129 { | |
130 return TestAndGetValue(DicomTag(group, element)); | |
131 } | |
132 | |
133 const DicomValue* TestAndGetValue(const DicomTag& tag) const; | |
134 | |
0 | 135 void Remove(const DicomTag& tag); |
136 | |
137 void ExtractPatientInformation(DicomMap& result) const; | |
138 | |
139 void ExtractStudyInformation(DicomMap& result) const; | |
140 | |
141 void ExtractSeriesInformation(DicomMap& result) const; | |
142 | |
143 void ExtractInstanceInformation(DicomMap& result) const; | |
144 | |
145 static void SetupFindPatientTemplate(DicomMap& result); | |
146 | |
147 static void SetupFindStudyTemplate(DicomMap& result); | |
148 | |
149 static void SetupFindSeriesTemplate(DicomMap& result); | |
150 | |
151 static void SetupFindInstanceTemplate(DicomMap& result); | |
152 | |
153 void CopyTagIfExists(const DicomMap& source, | |
154 const DicomTag& tag); | |
562
f64e3838d6e1
refactoring enumerations
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
155 |
f64e3838d6e1
refactoring enumerations
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
156 static bool IsMainDicomTag(const DicomTag& tag, ResourceType level); |
f64e3838d6e1
refactoring enumerations
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
157 |
f64e3838d6e1
refactoring enumerations
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
398
diff
changeset
|
158 static bool IsMainDicomTag(const DicomTag& tag); |
567 | 159 |
160 static void GetMainDicomTags(std::set<DicomTag>& result, ResourceType level); | |
161 | |
162 static void GetMainDicomTags(std::set<DicomTag>& result); | |
0 | 163 }; |
164 } |