X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmValidator.cxx;h=aa195fc9df961fdfe70231b3b9360c78290b9a66;hb=c64b728232bfd4b8455a578f9efb50bd61f88c87;hp=c287469fd2fc94563b9fbb88e1af69438b2538e9;hpb=7eb1927568e2d3ffcf41f9c04700865a6092b047;p=gdcm.git diff --git a/src/gdcmValidator.cxx b/src/gdcmValidator.cxx index c287469f..aa195fc9 100644 --- a/src/gdcmValidator.cxx +++ b/src/gdcmValidator.cxx @@ -3,8 +3,8 @@ Program: gdcm Module: $RCSfile: gdcmValidator.cxx,v $ Language: C++ - Date: $Date: 2005/11/04 16:08:08 $ - Version: $Revision: 1.8 $ + Date: $Date: 2005/11/07 13:58:00 $ + Version: $Revision: 1.11 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or @@ -20,11 +20,15 @@ #include "gdcmElementSet.h" #include "gdcmDataEntry.h" #include "gdcmUtil.h" +#include #include namespace gdcm { +//----------------------------------------------------------------------------- +typedef std::map GroupHT; // Hash Table +//----------------------------------------------------------------------------- Validator::Validator() { @@ -46,13 +50,6 @@ bool CheckVM(DataEntry *entry) const std::string &s = entry->GetString(); -/* std::string::size_type n = s.find("\\"); - if ( n == s.npos ) // none found - { - n = 0; - } -*/ - unsigned int n = Util::CountSubstring( s , "\\"); n++; // number of '\' + 1 == Value Multiplicity @@ -71,8 +68,25 @@ bool CheckVM(DataEntry *entry) void Validator::SetInput(ElementSet *input) { + +DocEntry *d; +/* +// First stage to check group length + GroupHT grHT; + d=input->GetFirstEntry(); + while(d) + { + grHT[d->GetGroup()] = 0; + d=input->GetNextEntry(); + } + for (GroupHT::iterator it = grHT.begin(); it != grHT.end(); ++it) + { + std::cout << std::hex << it->first << std::endl; + } +*/ + // berk for now SetInput do two things at the same time - DocEntry *d=input->GetFirstEntry(); + d=input->GetFirstEntry(); if (!d) { std::cout << "No Entry found" << std::endl; @@ -105,7 +119,7 @@ void Validator::SetInput(ElementSet *input) { // We skip pb of SQ recursive exploration } - d=input->GetNextEntry(); + d=input->GetNextEntry(); } }