X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmDict.cxx;h=d56ff7c2ce5167b8f6caa507829c3a9300bb4837;hb=d00078b5e19310b379c8339fa8fe38362e8ca392;hp=925451a32d4a68c392686f5c641f551b0541781b;hpb=fd37aa842b5d31ca266b6bda8a77f3201d02338d;p=gdcm.git diff --git a/src/gdcmDict.cxx b/src/gdcmDict.cxx index 925451a3..d56ff7c2 100644 --- a/src/gdcmDict.cxx +++ b/src/gdcmDict.cxx @@ -3,8 +3,8 @@ Program: gdcm Module: $RCSfile: gdcmDict.cxx,v $ Language: C++ - Date: $Date: 2004/09/27 08:39:06 $ - Version: $Revision: 1.43 $ + Date: $Date: 2005/01/18 14:28:32 $ + Version: $Revision: 1.68 $ Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de l'Image). All rights reserved. See Doc/License.txt or @@ -24,61 +24,65 @@ #include #include +namespace gdcm +{ +void FillDefaultDataDict(Dict *d); //----------------------------------------------------------------------------- // Constructor / Destructor /** - * \brief Construtor + * \brief Constructor + */ +Dict::Dict( ) +{ + Filename=""; +} + +/** + * \brief Constructor * @param filename from which to build the dictionary. */ -gdcmDict::gdcmDict(std::string const & filename) +Dict::Dict(std::string const &filename) { uint16_t group; uint16_t element; TagName vr; - TagName fourth; + TagName vm; TagName name; std::ifstream from( filename.c_str() ); - dbg.Error(!from, "gdcmDict::gdcmDict: can't open dictionary", - filename.c_str()); - - while (!from.eof()) + if( !from ) { - from >> std::hex; - from >> group; /// MEMORY LEAK in std::istream::operator>> - from >> element; - from >> vr; - from >> fourth; - eatwhite(from); - std::getline(from, name); /// MEMORY LEAK in std::getline<> - - gdcmDictEntry * newEntry = new gdcmDictEntry(group, element, - vr, fourth, name); - AddNewEntry(newEntry); + gdcmVerboseMacro( "Can't open dictionary" << filename.c_str()); + // Using default embeded one: + FillDefaultDataDict( this ); } - from.close(); + else + { + while (!from.eof()) + { + from >> std::hex; + from >> group; + from >> element; + from >> vr; + from >> vm; + from >> std::ws; //remove white space + std::getline(from, name); + + const DictEntry newEntry(group, element, vr, vm, name); + AddNewEntry(newEntry); + } - Filename = filename; + Filename = filename; + from.close(); + } } /** * \brief Destructor */ -gdcmDict::~gdcmDict() +Dict::~Dict() { - for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) - { - gdcmDictEntry* entryToDelete = tag->second; - if ( entryToDelete ) - { - delete entryToDelete; - } - } - // Since AddNewEntry adds symetrical in both KeyHt and NameHT we can - // assume all the pointed gdcmDictEntries are already cleaned-up when - // we cleaned KeyHt. - KeyHt.clear(); - NameHt.clear(); + ClearEntry(); } //----------------------------------------------------------------------------- @@ -87,126 +91,93 @@ gdcmDict::~gdcmDict() * \brief Print all the dictionary entries contained in this dictionary. * Entries will be sorted by tag i.e. the couple (group, element). * @param os The output stream to be written to. + * @param indent indent */ -void gdcmDict::Print(std::ostream &os) +void Dict::Print(std::ostream &os, std::string const & ) { os << "Dict file name : " << Filename << std::endl; - PrintByKey(os); -} - -/** - * \brief Print all the dictionary entries contained in this dictionary. - * Entries will be sorted by tag i.e. the couple (group, element). - * @param os The output stream to be written to. - */ -void gdcmDict::PrintByKey(std::ostream &os) -{ std::ostringstream s; for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) { s << "Entry : "; - s << "(" << std::hex << std::setw(4) << tag->second->GetGroup() << ','; - s << std::hex << std::setw(4) << tag->second->GetElement() << ") = " + s << "(" << std::hex << std::setw(4) << tag->second.GetGroup() << ','; + s << std::hex << std::setw(4) << tag->second.GetElement() << ") = " << std::dec; - s << tag->second->GetVR() << ", "; - s << tag->second->GetFourth() << ", "; - s << tag->second->GetName() << "." << std::endl; + s << tag->second.GetVR() << ", "; + s << tag->second.GetVM() << ", "; + s << tag->second.GetName() << "." << std::endl; } os << s.str(); } + +//----------------------------------------------------------------------------- +// Public /** - * \brief Print all the dictionary entries contained in this dictionary. - * Entries will be sorted by the name of the dictionary entries. - * \warning AVOID USING IT : the name IS NOT an identifier; - * unpredictable result - * @param os The output stream to be written to. + * \brief Remove all Dicom Dictionary Entries */ -void gdcmDict::PrintByName(std::ostream& os) +void Dict::ClearEntry() { - std::ostringstream s; - - for (TagNameHT::iterator tag = NameHt.begin(); tag != NameHt.end(); ++tag) - { - s << "Entry : "; - s << tag->second->GetName() << ","; - s << tag->second->GetVR() << ", "; - s << tag->second->GetFourth() << ", "; - s << "(" << std::hex << std::setw(4) << tag->second->GetGroup() << ','; - s << std::hex << std::setw(4) << tag->second->GetElement() << ") = "; - s << std::dec << std::endl; - } - os << s.str(); + // we assume all the pointed DictEntries are already cleaned-up + // when we clean KeyHt. + KeyHt.clear(); } -//----------------------------------------------------------------------------- -// Public /** - * \ingroup gdcmDict * \brief adds a new Dicom Dictionary Entry * @param newEntry entry to add * @return false if Dicom Element already exists */ -bool gdcmDict::AddNewEntry(gdcmDictEntry *newEntry) +bool Dict::AddNewEntry(DictEntry const &newEntry) { - gdcmTagKey key = newEntry->GetKey(); + const TagKey &key = newEntry.GetKey(); if(KeyHt.count(key) == 1) { - dbg.Verbose(1, "gdcmDict::AddNewEntry already present", key.c_str()); + gdcmVerboseMacro( "Already present" << key.c_str()); return false; } else { - KeyHt[newEntry->GetKey()] = newEntry; - NameHt[newEntry->GetName()] = newEntry; + KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry)); return true; } } /** - * \ingroup gdcmDict * \brief replaces an already existing Dicom Element by a new one * @param newEntry new entry (overwrites any previous one with same tag) * @return false if Dicom Element doesn't exist */ -bool gdcmDict::ReplaceEntry(gdcmDictEntry *newEntry) +bool Dict::ReplaceEntry(DictEntry const &newEntry) { - if ( RemoveEntry(newEntry->gdcmDictEntry::GetKey()) ) + if ( RemoveEntry(newEntry.GetKey()) ) { - KeyHt[newEntry->GetKey()] = newEntry; - NameHt[newEntry->GetName()] = newEntry; + KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry)); return true; } return false; } /** - * \ingroup gdcmDict * \brief removes an already existing Dicom Dictionary Entry, * identified by its Tag * @param key (group|element) * @return false if Dicom Dictionary Entry doesn't exist */ -bool gdcmDict::RemoveEntry(gdcmTagKey key) +bool Dict::RemoveEntry (TagKey const &key) { - if(KeyHt.count(key) == 1) + TagKeyHT::const_iterator it = KeyHt.find(key); + if(it != KeyHt.end()) { - gdcmDictEntry* entryToDelete = KeyHt.find(key)->second; - - if ( entryToDelete ) - { - NameHt.erase(entryToDelete->GetName()); - delete entryToDelete; - } - KeyHt.erase(key); + return true; } else { - dbg.Verbose(1, "gdcmDict::RemoveEntry unfound entry", key.c_str()); + gdcmVerboseMacro( "Unfound entry" << key.c_str()); return false; } } @@ -215,97 +186,117 @@ bool gdcmDict::RemoveEntry(gdcmTagKey key) * \brief removes an already existing Dicom Dictionary Entry, * identified by its group,element number * @param group Dicom group number of the Dicom Element - * @param element Dicom element number of the Dicom Element + * @param elem Dicom element number of the Dicom Element * @return false if Dicom Dictionary Entry doesn't exist */ -bool gdcmDict::RemoveEntry (uint16_t group, uint16_t element) +bool Dict::RemoveEntry (uint16_t group, uint16_t elem) { - return RemoveEntry(gdcmDictEntry::TranslateToKey(group, element)); -} - -/** - * \brief Get the dictionnary entry identified by it's name. - * @param name element of the ElVal to modify - * \warning : NEVER use it ! - * the 'name' IS NOT an identifier within the Dicom Dicom Dictionary - * the name MAY CHANGE between two versions ! - * @return the corresponding dictionnary entry when existing, NULL otherwise - */ -gdcmDictEntry* gdcmDict::GetDictEntryByName(TagName name) -{ - if ( !NameHt.count(name)) - { - return 0; - } - return NameHt.find(name)->second; + return RemoveEntry(DictEntry::TranslateToKey(group, elem)); } /** - * \brief Get the dictionnary entry identified by a given tag (group,element) + * \brief Get the dictionary entry identified by a given tag (group,element) * @param group group of the entry to be found - * @param element element of the entry to be found - * @return the corresponding dictionnary entry when existing, NULL otherwise + * @param elem element of the entry to be found + * @return the corresponding dictionary entry when existing, NULL otherwise */ -gdcmDictEntry* gdcmDict::GetDictEntryByNumber(uint16_t group, uint16_t element) +DictEntry *Dict::GetDictEntry(uint16_t group, uint16_t elem) { - gdcmTagKey key = gdcmDictEntry::TranslateToKey(group, element); - if ( !KeyHt.count(key) ) + TagKey key = DictEntry::TranslateToKey(group, elem); + TagKeyHT::iterator it = KeyHt.find(key); + if ( it == KeyHt.end() ) { return 0; } - return KeyHt.find(key)->second; + return &(it->second); } /** - * \brief Consider all the entries of the public dicom dictionnary. + * \brief Consider all the entries of the public dicom dictionary. * Build all list of all the tag names of all those entries. - * \sa gdcmDictSet::GetPubDictTagNamesByCategory - * @return A list of all entries of the public dicom dictionnary. + * \sa DictSet::GetPubDictTagNamesByCategory + * @return A list of all entries of the public dicom dictionary. */ -std::list* gdcmDict::GetDictEntryNames() -{ - std::list *result = new std::list; - for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) - { - result->push_back( tag->second->GetName() ); - } - return result; -} + + + // Probabely useless + + +//EntryNamesList *Dict::GetDictEntryNames() +//{ +// EntryNamesList *result = new EntryNamesList; +// for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) +// { +// result->push_back( tag->second.GetName() ); +// } +// return result; +//} /** - * \ingroup gdcmDict - * \brief Consider all the entries of the public dicom dictionnary. + * \brief Consider all the entries of the public dicom dictionary. * Build an hashtable whose keys are the names of the groups * (fourth field in each line of dictionary) and whose corresponding - * values are lists of all the dictionnary entries among that + * values are lists of all the dictionary entries among that * group. Note that apparently the Dicom standard doesn't explicitely * define a name (as a string) for each group. * A typical usage of this method would be to enable a dynamic * configuration of a Dicom file browser: the admin/user can * select in the interface which Dicom tags should be displayed. * \warning Dicom *doesn't* define any name for any 'categorie' - * (the dictionnary fourth field was formerly NIH defined + * (the dictionary fourth field was formerly NIH defined * - and no longer he is- * and will be removed when Dicom provides us a text file - * with the 'official' Dictionnary, that would be more friendly - * than asking us to perform a line by line check of the dictionnary + * with the 'official' Dictionary, that would be more friendly + * than asking us to perform a line by line check of the dictionary * at the beginning of each year to -try to- guess the changes) * Therefore : please NEVER use that fourth field :-( * * @return An hashtable: whose keys are the names of the groups and whose - * corresponding values are lists of all the dictionnary entries + * corresponding values are lists of all the dictionary entries * among that group. */ -std::map > *gdcmDict::GetDictEntryNamesByCategory(void) + + // Probabely useless + +//EntryNamesByCatMap *Dict::GetDictEntryNamesByCategory() +//{ +// EntryNamesByCatMap *result = new EntryNamesByCatMap; +// +// for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) +// { +// (*result)[tag->second.GetFourth()].push_back(tag->second.GetName()); +// } +// +// return result; +//} + +/** + * \brief Get the first entry while visiting the Dict entries + * \return The first DicEntry if found, otherwhise NULL + */ +DictEntry *Dict::GetFirstEntry() { - std::map > *result = new std::map >; + ItKeyHt = KeyHt.begin(); + if( ItKeyHt != KeyHt.end() ) + return &(ItKeyHt->second); + return NULL; +} + +/** + * \brief Get the next entry while visiting the Hash table (KeyHt) + * \note : meaningfull only if GetFirstEntry already called + * \return The next DictEntry if found, otherwhise NULL + */ +DictEntry *Dict::GetNextEntry() +{ + gdcmAssertMacro (ItKeyHt != KeyHt.end()); - for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) { - (*result)[tag->second->GetFourth()].push_back(tag->second->GetName()); + ++ItKeyHt; + if (ItKeyHt != KeyHt.end()) + return &(ItKeyHt->second); } - - return result; + return NULL; } //----------------------------------------------------------------------------- @@ -315,3 +306,5 @@ std::map > *gdcmDict::GetDictEntryNamesByCat // Private //----------------------------------------------------------------------------- + +} // end namespace gdcm