|
1
|
1 /**
|
|
|
2 * Orthanc - A Lightweight, RESTful DICOM Store
|
|
|
3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
|
|
|
4 * Department, University Hospital of Liege, Belgium
|
|
116
|
5 * Copyright (C) 2017-2018 Osimis S.A., Belgium
|
|
1
|
6 *
|
|
|
7 * This program is free software: you can redistribute it and/or
|
|
|
8 * modify it under the terms of the GNU General Public License as
|
|
|
9 * published by the Free Software Foundation, either version 3 of the
|
|
|
10 * License, or (at your option) any later version.
|
|
|
11 *
|
|
|
12 * In addition, as a special exception, the copyright holders of this
|
|
|
13 * program give permission to link the code of its release with the
|
|
|
14 * OpenSSL project's "OpenSSL" library (or with modified versions of it
|
|
|
15 * that use the same license as the "OpenSSL" library), and distribute
|
|
|
16 * the linked executables. You must obey the GNU General Public License
|
|
|
17 * in all respects for all of the code used other than "OpenSSL". If you
|
|
|
18 * modify file(s) with this exception, you may extend this exception to
|
|
|
19 * your version of the file(s), but you are not obligated to do so. If
|
|
|
20 * you do not wish to do so, delete this exception statement from your
|
|
|
21 * version. If you delete this exception statement from all source files
|
|
|
22 * in the program, then also delete it here.
|
|
|
23 *
|
|
|
24 * This program is distributed in the hope that it will be useful, but
|
|
|
25 * WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
27 * General Public License for more details.
|
|
|
28 *
|
|
|
29 * You should have received a copy of the GNU General Public License
|
|
|
30 * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
31 **/
|
|
|
32
|
|
|
33
|
|
|
34 #include "../PrecompiledHeaders.h"
|
|
|
35 #include "DicomArray.h"
|
|
|
36
|
|
|
37 #include <stdio.h>
|
|
|
38
|
|
|
39 namespace Orthanc
|
|
|
40 {
|
|
|
41 DicomArray::DicomArray(const DicomMap& map)
|
|
|
42 {
|
|
|
43 elements_.reserve(map.map_.size());
|
|
|
44
|
|
|
45 for (DicomMap::Map::const_iterator it =
|
|
|
46 map.map_.begin(); it != map.map_.end(); ++it)
|
|
|
47 {
|
|
|
48 elements_.push_back(new DicomElement(it->first, *it->second));
|
|
|
49 }
|
|
|
50 }
|
|
|
51
|
|
|
52
|
|
|
53 DicomArray::~DicomArray()
|
|
|
54 {
|
|
|
55 for (size_t i = 0; i < elements_.size(); i++)
|
|
|
56 {
|
|
|
57 delete elements_[i];
|
|
|
58 }
|
|
|
59 }
|
|
|
60
|
|
|
61
|
|
|
62 void DicomArray::Print(FILE* fp) const
|
|
|
63 {
|
|
|
64 for (size_t i = 0; i < elements_.size(); i++)
|
|
|
65 {
|
|
|
66 DicomTag t = elements_[i]->GetTag();
|
|
|
67 const DicomValue& v = elements_[i]->GetValue();
|
|
|
68 std::string s = v.IsNull() ? "(null)" : v.GetContent();
|
|
|
69 printf("0x%04x 0x%04x [%s]\n", t.GetGroup(), t.GetElement(), s.c_str());
|
|
|
70 }
|
|
|
71 }
|
|
|
72 }
|
