s << "lg : ";
lgth = GetReadLength();
if (lgth == 0xffffffff) {
- sprintf(st,"x(ff)"); // I said : "x(ff)" !
+ sprintf(st,"x(ffff)"); // I said : "x(ffff)" !
s.setf(std::ios::left);
s << std::setw(10-strlen(st)) << " ";
s << st << " ";
}
s << " Off.: ";
sprintf(st,"x(%x)",o);
- s << std::setw(10-strlen(st)) << " ";
+ s << std::setw(10-strlen(st)) << " ";
s << st << " ";
s << std::setw(8) << o;
}
* (ACR-NEMA, ExplicitVR, ImplicitVR)
* @return always "True" ?!
*/
-bool gdcmParser::Write(FILE *fp, FileType type)
-{
+bool gdcmParser::Write(FILE *fp, FileType type) {
// ==============
// TODO The stuff has been rewritten using the chained list instead
// of the H table
content = content + '\0';
}
- //tagHT[key]->SetValue(content);
gdcmHeaderEntry * a;
IterHT p;
TagHeaderEntryHT::iterator p2;
a-> SetValue(content);
- //std::string vr = tagHT[key]->GetVR();
std::string vr = a->GetVR();
guint32 lgr;
else
lgr = l;
- //tagHT[key]->SetLength(lgr);
a->SetLength(lgr);
return true;
}
*/
bool gdcmParser::SetEntryLengthByNumber(guint32 length,
- guint16 group, guint16 element) {
+ guint16 group,
+ guint16 element) {
TagKey key = gdcmDictEntry::TranslateToKey(group, element);
if ( ! tagHT.count(key))
return false;
if (length%2) length++; // length must be even
- //tagHT[key]->SetLength(length);
( ((tagHT.equal_range(key)).first)->second )->SetLength(length);
return true ;
TagKey key = gdcmDictEntry::TranslateToKey(group, element);
if ( ! tagHT.count(key))
return false;
- //tagHT[key]->SetVoidArea(area);
( ((tagHT.equal_range(key)).first)->second )->SetVoidArea(area);
return true;
}
// Peer group => search the corresponding dict entry
if(RefShaDict)
- entry=RefShaDict->GetDictEntryByNumber((*it)->GetGroup(),(*it)->GetElement());
+ entry=RefShaDict->GetDictEntryByNumber((*it)->GetGroup(),
+ (*it)->GetElement());
else
entry=NULL;
if( group == 0xfffe )
SkipLoad = true;
- if ( SkipLoad )
- {
- Entry->SetLength(0);
+ if ( SkipLoad ) {
+ Entry->SetUsableLength(0);
Entry->SetValue("gdcm::Skipped");
return;
}
{
Entry->SetReadLength(FoundLength); // will be updated only if a bug is found
- if ( FoundLength == 0xffffffff)
- {
+ if ( FoundLength == 0xffffffff) {
FoundLength = 0;
}