X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmElementSet.cxx;h=769c7814034f358ddfe93f54b0c6950b44179b9d;hb=038a3b7f67769dc20b4c46f3c9dcad7cc63d1161;hp=dd2c6d1976c5d0383d5846379ad972c0c3d473a8;hpb=233c8b3ebb1aee6b1be6723d842eb2241b9ffb91;p=gdcm.git diff --git a/src/gdcmElementSet.cxx b/src/gdcmElementSet.cxx index dd2c6d19..769c7814 100644 --- a/src/gdcmElementSet.cxx +++ b/src/gdcmElementSet.cxx @@ -3,8 +3,8 @@ Program: gdcm Module: $RCSfile: gdcmElementSet.cxx,v $ Language: C++ - Date: $Date: 2004/12/03 17:13:18 $ - Version: $Revision: 1.33 $ + Date: $Date: 2005/01/18 08:01:41 $ + Version: $Revision: 1.43 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or @@ -28,7 +28,6 @@ namespace gdcm //----------------------------------------------------------------------------- // Constructor / Destructor /** - * \ingroup ElementSet * \brief Constructor from a given ElementSet */ //BOZ depthLevel is not usefull anymore @@ -39,7 +38,6 @@ ElementSet::ElementSet(int depthLevel) } /** - * \ingroup ElementSet * \brief Canonical destructor. */ ElementSet::~ElementSet() @@ -54,27 +52,26 @@ ElementSet::~ElementSet() TagHT.clear(); } - -//----------------------------------------------------------------------------- -// Public - - //----------------------------------------------------------------------------- // Print /** * \brief Prints the Header Entries (Dicom Elements) * from the H Table + * @param os ostream to write to * @return */ -void ElementSet::Print(std::ostream& os) +void ElementSet::Print(std::ostream &os, std::string const & ) { for( TagDocEntryHT::const_iterator i = TagHT.begin(); i != TagHT.end(); ++i) { DocEntry* entry = i->second; + + entry->SetPrintLevel(PrintLevel); entry->Print(os); - if ( SeqEntry* seqEntry = dynamic_cast(entry) ) + + if ( /*SeqEntry *seqEntry = */dynamic_cast(entry) ) { - (void)seqEntry; + //(void)seqEntry; // Avoid the newline for a sequence: continue; } @@ -82,12 +79,15 @@ void ElementSet::Print(std::ostream& os) } } +//----------------------------------------------------------------------------- +// Public /** * \brief Writes the Header Entries (Dicom Elements) * from the H Table + * @param os ostream to write to * @return */ -void ElementSet::WriteContent(std::ofstream* fp, FileType filetype) +void ElementSet::WriteContent(std::ofstream *fp, FileType filetype) { for (TagDocEntryHT::const_iterator i = TagHT.begin(); i != TagHT.end(); @@ -96,10 +96,9 @@ void ElementSet::WriteContent(std::ofstream* fp, FileType filetype) i->second->WriteContent(fp, filetype); } } -//----------------------------------------------------------------------------- -// Protected //----------------------------------------------------------------------------- +// Protected //----------------------------------------------------------------------------- // Private @@ -108,14 +107,13 @@ void ElementSet::WriteContent(std::ofstream* fp, FileType filetype) * \brief add a new Dicom Element pointer to the H Table * @param newEntry entry to add */ -bool ElementSet::AddEntry(DocEntry* newEntry) +bool ElementSet::AddEntry(DocEntry *newEntry) { - const TagKey& key = newEntry->GetKey(); + const TagKey &key = newEntry->GetKey(); if( TagHT.count(key) == 1 ) { - dbg.Verbose(1, "ElementSet::AddEntry key already present: ", - key.c_str()); + gdcmVerboseMacro( "Key already present: " << key.c_str()); return false; } else @@ -128,21 +126,19 @@ bool ElementSet::AddEntry(DocEntry* newEntry) /** * \brief Clear the hash table from given entry AND delete the entry. * @param entryToRemove Entry to remove AND delete. - * \warning Some problems when using under Windows... prefer the use of - * Initialize / GetNext methods */ -bool ElementSet::RemoveEntry( DocEntry* entryToRemove) +bool ElementSet::RemoveEntry( DocEntry *entryToRemove) { - const TagKey& key = entryToRemove->GetKey(); + const TagKey &key = entryToRemove->GetKey(); if( TagHT.count(key) == 1 ) { TagHT.erase(key); - dbg.Verbose(0, "ElementSet::RemoveEntry: one element erased."); + //gdcmVerboseMacro( "One element erased."); delete entryToRemove; return true; } - dbg.Verbose(0, "ElementSet::RemoveEntry: key not present"); + gdcmVerboseMacro( "Key not present"); return false ; } @@ -150,30 +146,33 @@ bool ElementSet::RemoveEntry( DocEntry* entryToRemove) * \brief Clear the hash table from given entry BUT keep the entry. * @param entryToRemove Entry to remove. */ -bool ElementSet::RemoveEntryNoDestroy(DocEntry* entryToRemove) +bool ElementSet::RemoveEntryNoDestroy(DocEntry *entryToRemove) { - const TagKey& key = entryToRemove->GetKey(); + const TagKey &key = entryToRemove->GetKey(); if( TagHT.count(key) == 1 ) { TagHT.erase(key); - dbg.Verbose(0, "ElementSet::RemoveEntry: one element erased."); + //gdcmVerboseMacro( "One element erased."); return true; } - dbg.Verbose(0, "ElementSet::RemoveEntry: key not present"); + gdcmVerboseMacro( "Key not present"); return false ; } /** - * \brief Initialise the visit of the Hash table (TagHT) + * \brief Get the first entry while visiting the DocEntrySet + * \return The first DocEntry if found, otherwhise NULL */ -void ElementSet::Initialize() +DocEntry *ElementSet::GetFirstEntry() { ItTagHT = TagHT.begin(); + return ItTagHT->second; } /** - * \brief Get the next entry whil visiting the Hash table (TagHT) + * \brief Get the next entry while visiting the Hash table (TagHT) + * \note : meaningfull only if GetFirstEntry already called * \return The next DocEntry if found, otherwhise NULL */ DocEntry *ElementSet::GetNextEntry() @@ -183,11 +182,11 @@ DocEntry *ElementSet::GetNextEntry() DocEntry *tmp = ItTagHT->second; ++ItTagHT; - return(tmp); + return tmp; } else { - return(NULL); + return NULL; } }