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
|
/*=========================================================================
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 "gdcmModule.h"
#include "gdcmDataSet.h"
#include "gdcmUsage.h"
//#include "gdcmDefs.h"
#include "gdcmMacros.h" // Macros
//#include "gdcmGlobal.h"
namespace gdcm
{
bool Module::FindModuleEntryInMacros(Macros const ¯os, const Tag &tag) const
{
(void)macros;
MapModuleEntry::const_iterator it = ModuleInternal.find(tag);
if( it != ModuleInternal.end() )
{
return true;
}
// Need to search within Nested-Included Macro:
// start with easy case:
if( ArrayIncludeMacros.empty() ) return false;
// we need to loop over all Included-Macro:
//static const Global &g = Global::GetInstance();
//static const Defs &defs = g.GetDefs();
//static const Macros ¯os = defs.GetMacros();
#if 0
for( ArrayIncludeMacrosType::const_iterator it = ArrayIncludeMacros.begin();
it != ArrayIncludeMacros.end(); ++it)
{
const std::string &name = *it;
const Macro ¯o = macros.GetMacro( name.c_str() );
if( macro.FindMacroEntry( tag ) )
{
return true;
}
}
#endif
// Not found anywhere :(
return false;
}
const ModuleEntry& Module::GetModuleEntryInMacros(Macros const ¯os, const Tag &tag) const
{
MapModuleEntry::const_iterator it = ModuleInternal.find(tag);
if( it != ModuleInternal.end() )
{
assert( it->first == tag );
return it->second;
}
// Need to search within Nested-Included Macro:
// start with easy case:
if( ArrayIncludeMacros.empty() )
{
throw "Could not find Module for Tag requested";
}
// we need to loop over all Included-Macro:
//static const Global &g = Global::GetInstance();
//static const Defs &defs = g.GetDefs();
//static const Macros ¯os = defs.GetMacros();
for( ArrayIncludeMacrosType::const_iterator it2 = ArrayIncludeMacros.begin();
it2 != ArrayIncludeMacros.end(); ++it2)
{
const std::string &name = *it2;
const Macro ¯o= macros.GetMacro( name.c_str() );
if( macro.FindMacroEntry( tag ) )
{
return macro.GetMacroEntry(tag);
}
}
// Not found anywhere :(
throw "Could not find Module for Tag requested";
}
bool Module::Verify(const DataSet& ds, Usage const & usage) const
{
bool success = true;
if( usage == Usage::UserOption ) return success;
Module::MapModuleEntry::const_iterator it = ModuleInternal.begin();
for(;it != ModuleInternal.end(); ++it)
{
const Tag &tag = it->first;
const ModuleEntry &me = it->second;
const gdcm::Type &type = me.GetType();
if( ds.FindDataElement( tag ) )
{
// element found
const DataElement &de = ds.GetDataElement( tag );
if ( de.IsEmpty() && (type == Type::T1 || type == Type::T1C ) )
{
gdcmWarningMacro( "T1 element cannot be empty: " << de );
success = false;
}
}
else
{
if( type == Type::T1 || type == Type::T1C )
{
gdcmWarningMacro( "DataSet is missing tag: " << tag );
gdcmWarningMacro( "ModuleEntry specify: " << me );
gdcmWarningMacro( "Usage is: " << usage );
success = false;
}
}
}
return success;
}
}
|
