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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
|
/*=========================================================================
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 "gdcmFindStudyRootQuery.h"
#include "gdcmAttribute.h"
#include "gdcmDataSet.h"
#include <iterator>
#include <algorithm>
namespace gdcm
{
FindStudyRootQuery::FindStudyRootQuery()
{
mRootType = eStudyRootType;
mHelpDescription = "Study-level root query";
}
void FindStudyRootQuery::InitializeDataSet(const EQueryLevel& inQueryLevel)
{
switch (inQueryLevel)
{
case eStudy:
{
Attribute<0x8,0x52> at1 = { "STUDY " };
mDataSet.Insert( at1.GetAsDataElement() );
}
break;
case eSeries:
{
Attribute<0x8,0x52> at1 = { "SERIES" };
mDataSet.Insert( at1.GetAsDataElement() );
Attribute<0x20, 0xd> Studylevel = { "" };
mDataSet.Insert( Studylevel.GetAsDataElement() );
}
default: // ePatient
break;
case eImage:
{
Attribute<0x8,0x52> at1 = { "IMAGE " };
mDataSet.Insert( at1.GetAsDataElement() );
Attribute<0x20, 0xd> Studylevel = { "" };
mDataSet.Insert( Studylevel.GetAsDataElement() );
Attribute<0x20, 0xe> SeriesLevel = { "" };
mDataSet.Insert( SeriesLevel.GetAsDataElement() );
}
break;
}
}
std::vector<Tag> FindStudyRootQuery::GetTagListByLevel(const EQueryLevel& inQueryLevel)
{
switch (inQueryLevel)
{
case ePatient:
return mPatient.GetAllTags(eStudyRootType);
case eStudy:
return mStudy.GetAllTags(eStudyRootType);
case eSeries:
// default:
return mSeries.GetAllTags(eStudyRootType);
case eImage:
return mImage.GetAllTags(eStudyRootType);
default: //have to return _something_ if a query level isn't given
assert(0);
{
std::vector<Tag> empty;
return empty;
}
}
}
/*
PS 3.4- 2011
C.4.1.2.1 Baseline Behavior of SCU
The Identifier contained in a C-FIND request shall contain a single value in
the Unique Key Attribute for each level above the Query/Retrieve level. No
Required or Optional Keys shall be specified which are associated with
levels above the Query/Retrieve level.
*/
bool FindStudyRootQuery::ValidateQuery(bool inStrict) const
{
//if it's empty, it's not useful
const DataSet & ds = GetQueryDataSet();
if (ds.Size() == 0)
{
if (inStrict)
gdcmWarningMacro( "Empty DataSet in ValidateQuery" );
return false;
}
//search for 0x8,0x52
Attribute<0x0008, 0x0052> level;
level.SetFromDataSet( ds );
const std::string & theVal = level.GetValue();
const int ilevel = BaseRootQuery::GetQueryLevelFromString( theVal.c_str() );
if( ilevel == -1 )
{
gdcmWarningMacro( "Invalid Level" );
return false;
}
bool theReturn = true;
// requirement is that tag should belong to { opttags U requiredtags } && at
// least one tag from { requiredtags }
std::vector<Tag> tags; // Optional+Required (at same level)
std::vector<Tag> hiertags; // Unique + Unique level above (Hierarchical Search)
if (inStrict)
{
QueryBase* qb = BaseRootQuery::Construct( eStudyRootType, (EQueryLevel)ilevel );
if (qb == NULL)
{
gdcmWarningMacro( "Invalid Query" );
return false;
}
std::vector<Tag> opttags = qb->GetOptionalTags(eStudyRootType);
tags.insert( tags.begin(), opttags.begin(), opttags.end() );
std::vector<Tag> reqtags = qb->GetRequiredTags(eStudyRootType);
tags.insert( tags.begin(), reqtags.begin(), reqtags.end() );
hiertags = qb->GetHierachicalSearchTags(eStudyRootType);
tags.insert( tags.begin(), hiertags.begin(), hiertags.end() );
delete qb;
}
else //include all previous levels (ie, series gets study, image gets series and study)
{
QueryBase* qb = NULL;
if (strcmp(theVal.c_str(), "STUDY ") == 0)
{
//make sure remaining tags are somewhere in the list of required, unique, or optional tags
std::vector<Tag> tagGroup;
qb = new QueryStudy();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
}
if (strcmp(theVal.c_str(), "SERIES") == 0)
{
//make sure remaining tags are somewhere in the list of required, unique, or optional tags
std::vector<Tag> tagGroup;
qb = new QueryStudy();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
qb = new QuerySeries();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
}
if (strcmp(theVal.c_str(), "IMAGE ") == 0 )
{
//make sure remaining tags are somewhere in the list of required, unique, or optional tags
std::vector<Tag> tagGroup;
qb = new QueryStudy();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
qb = new QuerySeries();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
qb = new QueryImage();
tagGroup = qb->GetAllTags(eStudyRootType);
tags.insert(tags.end(), tagGroup.begin(), tagGroup.end());
delete qb;
}
if (tags.empty())
{
gdcmWarningMacro( "Invalid Level" );
return false;
}
}
//all the tags in the dataset should be in that tag list
//otherwise, it's not valid
//also, while the level tag must be present, and the language tag can be
//present (but does not have to be), some other tag must show up as well
//so, have two counts: 1 for tags that are found, 1 for tags that are not
//if there are no found tags, then the query is invalid
//if there is one improper tag found, then the query is invalid
DataSet::ConstIterator itor;
Attribute<0x0008, 0x0005> language;
if( inStrict )
{
unsigned int thePresentTagCount = 0;
for (itor = ds.Begin(); itor != ds.End(); itor++)
{
const Tag & t = itor->GetTag();
if (t == level.GetTag()) continue;
if (t == language.GetTag()) continue;
if (std::find(tags.begin(), tags.end(), t) == tags.end())
{
//check to see if it's a language tag, 8,5, and if it is, ignore if it's one
//of the possible language tag values
//well, for now, just allow it if it's present.
gdcmWarningMacro( "You have an extra tag: " << t );
theReturn = false;
break;
}
else
{
// Ok this tags is in Unique/Required or Optional, need to check
// if it is in Required/Unique now:
//std::copy( hiertags.begin(), hiertags.end(),
// std::ostream_iterator<gdcm::Tag>( std::cout, "," ) );
if (std::find(hiertags.begin(), hiertags.end(), t) !=
hiertags.end())
{
gdcmDebugMacro( "Found at least one key: " << t );
thePresentTagCount++;
}
}
}
if( thePresentTagCount != hiertags.size() )
{
assert( !hiertags.empty() );
gdcmWarningMacro( "Missing Key found (within the hierachical search ones): " << hiertags[0] );
gdcmDebugMacro( "Current DataSet is: " << ds );
theReturn = false;
}
}
return theReturn;
}
UIDs::TSName FindStudyRootQuery::GetAbstractSyntaxUID() const
{
return UIDs::StudyRootQueryRetrieveInformationModelFIND;
}
} // end namespace gdcm
|
