178
|
1 /**
|
|
2 * Orthanc - A Lightweight, RESTful DICOM Store
|
689
|
3 * Copyright (C) 2012-2014 Medical Physics Department, CHU of Liege,
|
178
|
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.
|
|
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 #pragma once
|
|
34
|
|
35 #include "DicomMap.h"
|
|
36
|
|
37 namespace Orthanc
|
|
38 {
|
|
39 /**
|
|
40 * This class implements the hashing mechanism that is used to
|
|
41 * convert DICOM unique identifiers to Orthanc identifiers. Any
|
|
42 * Orthanc identifier for a DICOM resource corresponds to the SHA-1
|
|
43 * hash of the DICOM identifiers.
|
|
44
|
|
45 * \note SHA-1 hash is used because it is less sensitive to
|
|
46 * collision attacks than MD5. <a
|
|
47 * href="http://en.wikipedia.org/wiki/SHA-256#Comparison_of_SHA_functions">[Reference]</a>
|
|
48 **/
|
|
49 class DicomInstanceHasher
|
|
50 {
|
|
51 private:
|
|
52 std::string patientId_;
|
179
|
53 std::string studyUid_;
|
178
|
54 std::string seriesUid_;
|
179
|
55 std::string instanceUid_;
|
|
56
|
|
57 std::string patientHash_;
|
|
58 std::string studyHash_;
|
|
59 std::string seriesHash_;
|
|
60 std::string instanceHash_;
|
178
|
61
|
315
|
62 void Setup(const std::string& patientId,
|
|
63 const std::string& studyUid,
|
|
64 const std::string& seriesUid,
|
|
65 const std::string& instanceUid);
|
|
66
|
178
|
67 public:
|
|
68 DicomInstanceHasher(const DicomMap& instance);
|
|
69
|
315
|
70 DicomInstanceHasher(const std::string& patientId,
|
|
71 const std::string& studyUid,
|
|
72 const std::string& seriesUid,
|
|
73 const std::string& instanceUid)
|
|
74 {
|
|
75 Setup(patientId, studyUid, seriesUid, instanceUid);
|
|
76 }
|
|
77
|
178
|
78 const std::string& GetPatientId() const
|
|
79 {
|
|
80 return patientId_;
|
|
81 }
|
|
82
|
179
|
83 const std::string& GetStudyUid() const
|
178
|
84 {
|
179
|
85 return studyUid_;
|
178
|
86 }
|
|
87
|
|
88 const std::string& GetSeriesUid() const
|
|
89 {
|
|
90 return seriesUid_;
|
|
91 }
|
|
92
|
179
|
93 const std::string& GetInstanceUid() const
|
178
|
94 {
|
179
|
95 return instanceUid_;
|
178
|
96 }
|
|
97
|
179
|
98 const std::string& HashPatient();
|
178
|
99
|
179
|
100 const std::string& HashStudy();
|
178
|
101
|
179
|
102 const std::string& HashSeries();
|
178
|
103
|
179
|
104 const std::string& HashInstance();
|
178
|
105 };
|
|
106 }
|