Mercurial > hg > orthanc

comparison Core/DicomFormat/DicomArray.cpp @ 0:3959d33612cc

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
initial commit
author Sebastien Jodogne <s.jodogne@gmail.com>
date Thu, 19 Jul 2012 14:32:22 +0200
parents
children a15e90e5d6fc
comparison
equal deleted inserted replaced
-1:000000000000 0:3959d33612cc
1 /**
2 * Palantir - A Lightweight, RESTful DICOM Store
3 * Copyright (C) 2012 Medical Physics Department, CHU of Liege,
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 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 **/
19
20
21 #include "DicomArray.h"
22
23 #include <stdio.h>
24
25 namespace Palantir
26 {
27 DicomArray::DicomArray(const DicomMap& map)
28 {
29 elements_.reserve(map.map_.size());
30
31 for (DicomMap::Map::const_iterator it =
32 map.map_.begin(); it != map.map_.end(); it++)
33 {
34 elements_.push_back(new DicomElement(it->first, *it->second));
35 }
36 }
37
38
39 DicomArray::~DicomArray()
40 {
41 for (size_t i = 0; i < elements_.size(); i++)
42 {
43 delete elements_[i];
44 }
45 }
46
47
48 void DicomArray::Print(FILE* fp) const
49 {
50 for (size_t i = 0; i < elements_.size(); i++)
51 {
52 DicomTag t = elements_[i]->GetTag();
53 std::string s = elements_[i]->GetValue().AsString();
54 printf("0x%04x 0x%04x [%s]\n", t.GetGroup(), t.GetElement(), s.c_str());
55 }
56 }
57 }