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 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
/*
contains: a baseclass which will produce a dataset for c-find and c-move with
patient root
This class contains the functionality used in patient c-find and c-move
queries. StudyRootQuery derives from this class.
Namely:
1) list all tags associated with a particular query type
2) produce a query dataset via tag association
Eventually, it can be used to validate a particular dataset type.
The dataset held by this object (or, really, one of its derivates) should be
passed to a c-find or c-move query.
*/
#include "gdcmBaseQuery.h"
#include "gdcmQueryBase.h"
#include "gdcmDataElement.h"
#include "gdcmTag.h"
#include "gdcmDict.h"
#include "gdcmDictEntry.h"
#include "gdcmDicts.h"
#include "gdcmGlobal.h"
#include "gdcmAttribute.h"
#include "gdcmWriter.h"
#include "gdcmPrinter.h"
#include <limits>
namespace gdcm
{
BaseQuery::BaseQuery()
{
//nothing to do, really
}
BaseQuery::~BaseQuery()
{
//nothing to do, really
}
void BaseQuery::SetSearchParameter(const Tag& inTag, const DictEntry& inDictEntry, const std::string& inValue)
{
//borrowed this code from anonymization; not sure if it's correct, though.
DataElement de;
de.SetTag( inTag );
const VR &vr = inDictEntry.GetVR();
if( vr.IsDual() )
{
if( vr == VR::US_SS )
{
de.SetVR( VR::US );
}
else if( vr == VR::US_OW )
{
de.SetVR( VR::OW );
}
else if( vr == VR::US_SS_OW )
{
de.SetVR( VR::OW );
}
else if( vr == VR::OB_OW )
{
de.SetVR( VR::OB );
}
}
else
{
de.SetVR( vr );
}
std::string thePaddedValue = inValue;
if (thePaddedValue.length() % 2 ){
thePaddedValue.push_back(' ');
}
assert(thePaddedValue.length() < std::numeric_limits<uint32_t>::max());
de.SetByteValue(thePaddedValue.c_str(), (uint32_t)thePaddedValue.length());
//Replace any existing values
mDataSet.Replace(de);
}
void BaseQuery::SetSearchParameter(const Tag& inTag, const std::string& inValue){
//IF WE WANTED, we could validate the incoming tag as belonging to our set of tags.
//but we will not.
static const Global &g = Global::GetInstance();
static const Dicts &dicts = g.GetDicts();
static const Dict &pubdict = dicts.GetPublicDict();
const DictEntry &dictentry = pubdict.GetDictEntry(inTag);
SetSearchParameter(inTag, dictentry, inValue);
}
void BaseQuery::SetSearchParameter(const std::string& inKeyword, const std::string& inValue){
static const Global &g = Global::GetInstance();
static const Dicts &dicts = g.GetDicts();
static const Dict &pubdict = dicts.GetPublicDict();
Tag theTag;
const DictEntry &dictentry = pubdict.GetDictEntryByName(inKeyword.c_str(), theTag);
SetSearchParameter(theTag, dictentry, inValue);
}
const std::ostream &BaseQuery::WriteHelpFile(std::ostream &os)
{
// TODO
//mash all the query types into a vector for ease-of-use
//std::vector<QueryBase*> theQueries;
//std::vector<QueryBase*>::const_iterator qtor;
//std::vector<Tag> theTags;
//std::vector<Tag>::iterator ttor;
//static const Global &g = Global::GetInstance();
//static const Dicts &dicts = g.GetDicts();
//static const Dict &pubdict = dicts.GetPublicDict();
//os << "The following tags must be supported by a C-FIND/C-MOVE " << mHelpDescription << ": " << std::endl;
//for (qtor = theQueries.begin(); qtor < theQueries.end(); qtor++){
// os << "Level: " << (*qtor)->GetName() << std::endl;
// theTags = (*qtor)->GetRequiredTags(mRootType);
// for (ttor = theTags.begin(); ttor < theTags.end(); ttor++){
// const DictEntry &dictentry = pubdict.GetDictEntry(*ttor);
// os << "Keyword: " << dictentry.GetKeyword() << " Tag: " << *ttor << std::endl;
// }
// os << std::endl;
//}
//os << std::endl;
//os << "The following tags are unique at each level of a " << mHelpDescription << ": " << std::endl;
//for (qtor = theQueries.begin(); qtor < theQueries.end(); qtor++){
// os << "Level: " << (*qtor)->GetName() << std::endl;
// theTags = (*qtor)->GetUniqueTags(mRootType);
// for (ttor = theTags.begin(); ttor < theTags.end(); ttor++){
// const DictEntry &dictentry = pubdict.GetDictEntry(*ttor);
// os << "Keyword: " << dictentry.GetKeyword() << " Tag: " << *ttor << std::endl;
// }
// os << std::endl;
//}
//os << std::endl;
//os << "The following tags are optional at each level of a " << mHelpDescription << ": " << std::endl;
//for (qtor = theQueries.begin(); qtor < theQueries.end(); qtor++){
// os << "Level: " << (*qtor)->GetName() << std::endl;
// theTags = (*qtor)->GetOptionalTags(mRootType);
// for (ttor = theTags.begin(); ttor < theTags.end(); ttor++){
// const DictEntry &dictentry = pubdict.GetDictEntry(*ttor);
// os << "Keyword: " << dictentry.GetKeyword() << " Tag: " << *ttor << std::endl;
// }
// os << std::endl;
//}
os << std::endl;
return os;
}
bool BaseQuery::WriteQuery(const std::string& inFileName)
{
Writer writer;
writer.SetCheckFileMetaInformation( false );
writer.GetFile().GetHeader().SetDataSetTransferSyntax(
TransferSyntax::ImplicitVRLittleEndian );
writer.GetFile().SetDataSet( GetQueryDataSet() );
writer.SetFileName( inFileName.c_str() );
if( !writer.Write() )
{
gdcmWarningMacro( "Could not write: " << inFileName );
return false;
}
return true;
}
DataSet const & BaseQuery::GetQueryDataSet() const
{
return mDataSet;
}
DataSet & BaseQuery::GetQueryDataSet()
{
return mDataSet;
}
void BaseQuery::AddQueryDataSet(const DataSet & ds)
{
// Cannot use std::set::insert in case a unique key was added (eg. 10,20 with an empty
// value). The user defined value for 10,20 in ds would not be taken into account
DataSet::ConstIterator it = ds.Begin();
for( ; it != ds.End(); ++it )
{
mDataSet.Replace( *it );
}
}
void
BaseQuery::Print(std::ostream &os) const
{
UIDs::TSName asuid = GetAbstractSyntaxUID();
const char *asname = UIDs::GetUIDName( asuid );
os << "===================== OUTGOING DIMSE MESSAGE ====================" << std::endl;
os << "Affected SOP Class UID :" << asname << std::endl;
os << "======================= END DIMSE MESSAGE =======================" << std::endl;
os << "Find SCU Request Identifiers:" << std::endl;
os << "# Dicom-Data-Set" << std::endl;
os << "# Used TransferSyntax: Unknown Transfer Syntax" << std::endl;
Printer p;
p.PrintDataSet( mDataSet, os );
}
bool
BaseQuery::ValidDataSet( const DataSet & dataSetToValid, const DataSet & dataSetReference ) const
{
bool theReturn = true ;
DataSet::ConstIterator itor;
for (itor = dataSetReference.Begin(); itor != dataSetReference.End(); itor++)
{
if ( dataSetToValid.FindDataElement( itor->GetTag() ) )
{
SmartPointer<SequenceOfItems> pSqi = dataSetToValid.GetDataElement( itor->GetTag() ).GetValueAsSQ();
SmartPointer<SequenceOfItems> pSqiRef = pSqi ? itor->GetValueAsSQ() : nullptr ;
if ( pSqi && pSqiRef )
{
if( pSqi->GetNumberOfItems() < pSqiRef->GetNumberOfItems() )
{
gdcmErrorMacro( "DataSet to valid has less Items " << pSqi->GetNumberOfItems() << " for sequence : " << itor->GetTag() << " than valid one " << pSqiRef->GetNumberOfItems() );
theReturn = false ;
break ;
}
SequenceOfItems::SizeType indexOfItem ;
for ( indexOfItem = 1 ; indexOfItem <= pSqiRef->GetNumberOfItems(); indexOfItem++ )
{
const Item & currentReferenceItem = pSqiRef->GetItem( indexOfItem );
const Item & currentItemToValid = pSqi->GetItem( indexOfItem );
// now valid subDataSet
theReturn &= ValidDataSet( currentItemToValid.GetNestedDataSet(), currentReferenceItem.GetNestedDataSet() );
if ( !theReturn )
break ;
}
}
else // tag is found its not a sequence so it's ok
theReturn &= true ;
}
else
{
gdcmErrorMacro( "You must have this tag : " << itor->GetTag() << " in your query dataset. ");
theReturn = false ;
break ;
}
}
return theReturn ;
}
} // end namespace gdcm
|