1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
/*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "gdcmTagPath.h"
#include "gdcmTag.h"
#include <vector>
#include <string.h> // strlen
#include <stdlib.h> // abort
#include <stdio.h> // sscanf
namespace gdcm
{
/*
* Implementation detail: a tag path is simply a vector<Tag>.
* with the following convention:
* First tag is a valid tag,
* Second tag is an item number (or 0)
* Third tag is a valid tag
* ...
* and so on an so forth
*/
TagPath::TagPath():Path()
{
}
TagPath::~TagPath()
{
}
void TagPath::Print(std::ostream &os) const
{
unsigned int flip = 0;
std::vector<Tag>::const_iterator it = Path.begin();
for(; it != Path.end(); ++it)
{
if( flip % 2 == 0 )
{
os << *it << "/";
}
else // item number
{
// assert( it->GetElementTag() < 255 ); // how many item max can we have ?
os << it->GetElementTag() << "/";
}
++flip;
}
}
bool TagPath::IsValid(const char *path)
{
TagPath tp;
return tp.ConstructFromString(path);
}
bool TagPath::ConstructFromTagList(Tag const *l, unsigned int n)
{
//Path = std::vector<Tag>(l,l+n);
Path.clear();
for(unsigned int i = 0; i < n; ++i)
{
Path.push_back( l[i] );
if( i+1 < n )
{
Path.push_back( 0 );
}
}
return true;
}
bool TagPath::ConstructFromString(const char *path)
{
Path.clear();
if(!path) return false;
unsigned int flip = 0;
size_t pos = 0;
const size_t len = strlen(path);
if(!len) return false;
// Need to start with a /
if( path[pos] == '/' )
{
++pos;
}
else
{
return false;
}
while( pos != len )
{
Tag t;
if( flip % 2 == 0 )
{
if( t.ReadFromCommaSeparatedString( path+pos ) )
{
pos += 4 + 4 + 1;
Path.push_back( t );
}
else
{
return false;
}
}
else
{
unsigned int value = 0;
if( path[pos] == '*' )
{
t.SetElementTag( 0 );
pos++;
Path.push_back( t );
}
else if( sscanf(path+pos, "%d/", &value) == 1 )
{
}
}
++flip;
if( pos != len && path[pos] == '/' ) ++pos;
//else assert(0);
}
return true;
}
bool TagPath::Push(Tag const & t)
{
if( Path.size() % 2 == 0 )
{
Path.push_back( t );
return true;
}
return false;
}
bool TagPath::Push(unsigned int itemnum)
{
if( Path.size() % 2 == 1 )
{
Path.push_back( itemnum );
return true;
}
return false;
}
}
|
