X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmElementSet.cxx;h=b485261b2e1bce54a28c26b0cd531734f9d2eac3;hb=f2dc5ed79f619aa34aa6e800a53b24283452b170;hp=5d46a76f3a9cc806686067e80b2ba3cbfa2782f6;hpb=e62d57cbd05c8e864fd2ba197a271cdcac9a2128;p=gdcm.git diff --git a/src/gdcmElementSet.cxx b/src/gdcmElementSet.cxx index 5d46a76f..b485261b 100644 --- a/src/gdcmElementSet.cxx +++ b/src/gdcmElementSet.cxx @@ -3,12 +3,12 @@ Program: gdcm Module: $RCSfile: gdcmElementSet.cxx,v $ Language: C++ - Date: $Date: 2004/09/24 11:39:21 $ - Version: $Revision: 1.22 $ + Date: $Date: 2004/11/16 16:20:23 $ + Version: $Revision: 1.30 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or - http://www.creatis.insa-lyon.fr/Public/Gdcm/License.htm for details. + http://www.creatis.insa-lyon.fr/Public/Gdcm/License.html for details. This software is distributed WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR @@ -22,31 +22,33 @@ #include "gdcmBinEntry.h" #include "gdcmSeqEntry.h" +namespace gdcm +{ + //----------------------------------------------------------------------------- // Constructor / Destructor /** - * \ingroup gdcmElementSet - * \brief Constructor from a given gdcmElementSet + * \ingroup ElementSet + * \brief Constructor from a given ElementSet */ //BOZ depthLevel is not usefull anymore -gdcmElementSet::gdcmElementSet(int depthLevel) - : gdcmDocEntrySet() +ElementSet::ElementSet(int depthLevel) + : DocEntrySet() { (void)depthLevel; } /** - * \ingroup gdcmElementSet + * \ingroup ElementSet * \brief Canonical destructor. */ -gdcmElementSet::~gdcmElementSet() +ElementSet::~ElementSet() { - for(TagDocEntryHT::iterator cc = TagHT.begin();cc != TagHT.end(); ++cc) + for(TagDocEntryHT::iterator cc = TagHT.begin();cc != TagHT.end(); ++cc) { - gdcmDocEntry* entryToDelete = cc->second; - if ( entryToDelete ) + if ( cc->second ) { - delete entryToDelete; + delete cc->second; } } TagHT.clear(); @@ -64,13 +66,13 @@ gdcmElementSet::~gdcmElementSet() * from the H Table * @return */ -void gdcmElementSet::Print(std::ostream& os) +void ElementSet::Print(std::ostream& os) { for( TagDocEntryHT::const_iterator i = TagHT.begin(); i != TagHT.end(); ++i) { - gdcmDocEntry* entry = i->second; + DocEntry* entry = i->second; entry->Print(os); - if ( gdcmSeqEntry* seqEntry = dynamic_cast(entry) ) + if ( SeqEntry* seqEntry = dynamic_cast(entry) ) { (void)seqEntry; // Avoid the newline for a sequence: @@ -85,9 +87,11 @@ void gdcmElementSet::Print(std::ostream& os) * from the H Table * @return */ -void gdcmElementSet::Write(FILE* fp, FileType filetype) +void ElementSet::Write(std::ofstream* fp, FileType filetype) { - for (TagDocEntryHT::const_iterator i = TagHT.begin(); i != TagHT.end(); ++i) + for (TagDocEntryHT::const_iterator i = TagHT.begin(); + i != TagHT.end(); + ++i) { i->second->Write(fp, filetype); } @@ -104,38 +108,38 @@ void gdcmElementSet::Write(FILE* fp, FileType filetype) * \brief add a new Dicom Element pointer to the H Table * @param newEntry entry to add */ -bool gdcmElementSet::AddEntry( gdcmDocEntry* newEntry) +bool ElementSet::AddEntry(DocEntry* newEntry) { - gdcmTagKey key = newEntry->GetKey(); + const TagKey& key = newEntry->GetKey(); if( TagHT.count(key) == 1 ) { - dbg.Verbose(1, "gdcmElementSet::AddEntry key already present: ", + dbg.Verbose(1, "ElementSet::AddEntry key already present: ", key.c_str()); - return(false); - } - else + return false; + } + else { - TagHT[newEntry->GetKey()] = newEntry; + TagHT.insert(TagDocEntryHT::value_type(newEntry->GetKey(), newEntry)); return true; - } + } } /** * \brief Clear the hash table from given entry BUT keep the entry. * @param entryToRemove Entry to remove. */ -bool gdcmElementSet::RemoveEntryNoDestroy( gdcmDocEntry* entryToRemove) +bool ElementSet::RemoveEntryNoDestroy(DocEntry* entryToRemove) { - gdcmTagKey key = entryToRemove->GetKey(); + const TagKey& key = entryToRemove->GetKey(); if( TagHT.count(key) == 1 ) { TagHT.erase(key); - dbg.Verbose(0, "gdcmElementSet::RemoveEntry: one element erased."); + dbg.Verbose(0, "ElementSet::RemoveEntry: one element erased."); return true; } - dbg.Verbose(0, "gdcmElementSet::RemoveEntry: key not present: "); + dbg.Verbose(0, "ElementSet::RemoveEntry: key not present: "); return false ; } @@ -143,17 +147,18 @@ bool gdcmElementSet::RemoveEntryNoDestroy( gdcmDocEntry* entryToRemove) * \brief Clear the hash table from given entry AND delete the entry. * @param entryToRemove Entry to remove AND delete. */ -bool gdcmElementSet::RemoveEntry( gdcmDocEntry* entryToRemove) +bool ElementSet::RemoveEntry( DocEntry* entryToRemove) { - gdcmTagKey key = entryToRemove->GetKey(); + const TagKey& key = entryToRemove->GetKey(); if( TagHT.count(key) == 1 ) { TagHT.erase(key); - dbg.Verbose(0, "gdcmElementSet::RemoveEntry: one element erased."); + dbg.Verbose(0, "ElementSet::RemoveEntry: one element erased."); delete entryToRemove; return true; } - dbg.Verbose(0, "gdcmElementSet::RemoveEntry: key not present: "); + dbg.Verbose(0, "ElementSet::RemoveEntry: key not present: "); return false ; } +} // end namespace gdcm