X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmDict.cxx;h=d56ff7c2ce5167b8f6caa507829c3a9300bb4837;hb=d00078b5e19310b379c8339fa8fe38362e8ca392;hp=7e4f586b8c7ad32a8de67a00f4dd97db96e9f58f;hpb=b950a88db3b779f409f548361bbc62882094b9fb;p=gdcm.git diff --git a/src/gdcmDict.cxx b/src/gdcmDict.cxx index 7e4f586b..d56ff7c2 100644 --- a/src/gdcmDict.cxx +++ b/src/gdcmDict.cxx @@ -1,200 +1,310 @@ -// gdcmDict.cxx - -//This is needed when compiling in debug mode -#ifdef _MSC_VER -// 'identifier' : class 'type' needs to have dll-interface to be used by -// clients of class 'type2' -#pragma warning ( disable : 4251 ) -// 'identifier' : identifier was truncated to 'number' characters in the -// debug information -#pragma warning ( disable : 4786 ) -#endif //_MSC_VER +/*========================================================================= + + Program: gdcm + Module: $RCSfile: gdcmDict.cxx,v $ + Language: C++ + 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 + 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 + PURPOSE. See the above copyright notices for more information. + +=========================================================================*/ -#include #include "gdcmDict.h" #include "gdcmUtil.h" +#include "gdcmDebug.h" + +#include +#include +#include +namespace gdcm +{ +void FillDefaultDataDict(Dict *d); +//----------------------------------------------------------------------------- +// Constructor / Destructor /** - * \ingroup gdcmDict - * \brief Construtor - * @param FileName from which to build the dictionary. + * \brief Constructor */ -gdcmDict::gdcmDict(std::string & FileName) { - std::ifstream from(FileName.c_str()); - dbg.Error(!from, "gdcmDict::gdcmDict: can't open dictionary", - FileName.c_str()); - guint16 group, element; - // CLEANME : use defines for all those constants - char buff[1024]; - TagKey key; - TagName vr; - TagName fourth; - TagName name; - while (!from.eof()) { - from >> std::hex >> group >> element; - eatwhite(from); - from.getline(buff, 256, ' '); - vr = buff; - eatwhite(from); - from.getline(buff, 256, ' '); - fourth = buff; - from.getline(buff, 256, '\n'); - name = buff; - gdcmDictEntry * newEntry = new gdcmDictEntry(group, element, - vr, fourth, name); - // FIXME: use AddNewEntry - NameHt[name] = newEntry; - KeyHt[gdcmDictEntry::TranslateToKey(group, element)] = newEntry; - } - from.close(); +Dict::Dict( ) +{ + Filename=""; } /** - * \ingroup gdcmDict - * \brief + * \brief Constructor + * @param filename from which to build the dictionary. */ -gdcmDict::~gdcmDict() { - for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) { - gdcmDictEntry* EntryToDelete = tag->second; - if ( EntryToDelete ) - delete EntryToDelete; +Dict::Dict(std::string const &filename) +{ + uint16_t group; + uint16_t element; + TagName vr; + TagName vm; + TagName name; + + std::ifstream from( filename.c_str() ); + if( !from ) + { + gdcmVerboseMacro( "Can't open dictionary" << filename.c_str()); + // Using default embeded one: + FillDefaultDataDict( this ); + } + 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; + from.close(); } - KeyHt.clear(); - // Since AddNewEntry adds symetrical in both KeyHt and NameHT we can - // assume all the pointed gdcmDictEntries are already cleaned-up when - // we cleaned KeyHt. - NameHt.clear(); } /** - * \ingroup gdcmDict - * \brief - * @param os + * \brief Destructor */ -void gdcmDict::Print(std::ostream& os) { - PrintByKey(os); +Dict::~Dict() +{ + ClearEntry(); } +//----------------------------------------------------------------------------- +// Print /** - * \ingroup 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::PrintByKey(std::ostream& os) { - for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag){ - os << "Tag : "; - os << "(" << hex << tag->second->GetGroup() << ','; - os << hex << tag->second->GetElement() << ") = " << dec; - os << tag->second->GetVR() << ", "; - os << tag->second->GetFourth() << ", "; - os << tag->second->GetName() << "." << std::endl; +void Dict::Print(std::ostream &os, std::string const & ) +{ + os << "Dict file name : " << Filename << std::endl; + 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() << ") = " + << std::dec; + s << tag->second.GetVR() << ", "; + s << tag->second.GetVM() << ", "; + s << tag->second.GetName() << "." << std::endl; } + os << s.str(); } + +//----------------------------------------------------------------------------- +// Public /** - * \ingroup gdcmDict - * \brief Print all the dictionary entries contained in this dictionary. - * Entries will be sorted by the name of the dictionary entries. - * @param os The output stream to be written to. + * \brief Remove all Dicom Dictionary Entries */ -void gdcmDict::PrintByName(std::ostream& os) { - for (TagNameHT::iterator tag = NameHt.begin(); tag != NameHt.end(); ++tag){ - os << "Tag : "; - os << tag->second->GetName() << ","; - os << tag->second->GetVR() << ", "; - os << tag->second->GetFourth() << ", "; - os << "(" << std::hex << tag->second->GetGroup() << ','; - os << std::hex << tag->second->GetElement() << ") = " << dec << std::endl; - } +void Dict::ClearEntry() +{ + // we assume all the pointed DictEntries are already cleaned-up + // when we clean KeyHt. + KeyHt.clear(); } /** - * \ingroup gdcmDict - * \brief Get the dictionnary 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 + * \brief adds a new Dicom Dictionary Entry + * @param newEntry entry to add + * @return false if Dicom Element already exists */ -gdcmDictEntry * gdcmDict::GetTagByNumber(guint16 group, guint16 element) { - TagKey key = gdcmDictEntry::TranslateToKey(group, element); - if ( ! KeyHt.count(key)) - return (gdcmDictEntry*)0; - return KeyHt.find(key)->second; +bool Dict::AddNewEntry(DictEntry const &newEntry) +{ + const TagKey &key = newEntry.GetKey(); + + if(KeyHt.count(key) == 1) + { + gdcmVerboseMacro( "Already present" << key.c_str()); + return false; + } + else + { + KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry)); + return true; + } } /** - * \ingroup gdcmDict - * \brief Get the dictionnary entry identified by it's name. - * @param name element of the ElVal to modify - * @return the corresponding dictionnary entry when existing, NULL otherwise + * \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 */ -gdcmDictEntry * gdcmDict::GetTagByName(TagName name) { - if ( ! NameHt.count(name)) - return (gdcmDictEntry*)0; - return NameHt.find(name)->second; +bool Dict::ReplaceEntry(DictEntry const &newEntry) +{ + if ( RemoveEntry(newEntry.GetKey()) ) + { + KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry)); + return true; + } + return false; } /** - * \ingroup gdcmDict - * \brief - * @param NewEntry - * @return + * \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 */ -int gdcmDict::ReplaceEntry(gdcmDictEntry* NewEntry) { - if ( RemoveEntry(NewEntry->gdcmDictEntry::GetKey()) ) { - KeyHt[ NewEntry->GetKey()] = NewEntry; - return (1); +bool Dict::RemoveEntry (TagKey const &key) +{ + TagKeyHT::const_iterator it = KeyHt.find(key); + if(it != KeyHt.end()) + { + KeyHt.erase(key); + + return true; } - return (0); + else + { + gdcmVerboseMacro( "Unfound entry" << key.c_str()); + return false; + } } /** - * \ingroup gdcmDict - * \brief - * @param NewEntry - * @return + * \brief removes an already existing Dicom Dictionary Entry, + * identified by its group,element number + * @param group Dicom group number of the Dicom Element + * @param elem Dicom element number of the Dicom Element + * @return false if Dicom Dictionary Entry doesn't exist */ - int gdcmDict::AddNewEntry(gdcmDictEntry* NewEntry) { - TagKey key; - key = NewEntry->GetKey(); - - if(KeyHt.count(key) == 1) { - dbg.Verbose(1, "gdcmDict::AddNewEntry already present", key.c_str()); - return(0); - } else { - KeyHt[NewEntry->GetKey()] = NewEntry; - return(1); +bool Dict::RemoveEntry (uint16_t group, uint16_t elem) +{ + return RemoveEntry(DictEntry::TranslateToKey(group, elem)); +} + +/** + * \brief Get the dictionary entry identified by a given tag (group,element) + * @param group group of the entry to be found + * @param elem element of the entry to be found + * @return the corresponding dictionary entry when existing, NULL otherwise + */ +DictEntry *Dict::GetDictEntry(uint16_t group, uint16_t elem) +{ + TagKey key = DictEntry::TranslateToKey(group, elem); + TagKeyHT::iterator it = KeyHt.find(key); + if ( it == KeyHt.end() ) + { + return 0; } + return &(it->second); } +/** + * \brief Consider all the entries of the public dicom dictionary. + * Build all list of all the tag names of all those entries. + * \sa DictSet::GetPubDictTagNamesByCategory + * @return A list of all entries of the public dicom dictionary. + */ + + + // 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; +//} + +/** + * \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 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 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' 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 dictionary entries + * among that group. + */ + + // 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; +//} + /** - * \ingroup gdcmDict - * \brief - * @param key - * @return + * \brief Get the first entry while visiting the Dict entries + * \return The first DicEntry if found, otherwhise NULL */ -int gdcmDict::RemoveEntry(TagKey key) { - if(KeyHt.count(key) == 1) { - gdcmDictEntry* EntryToDelete = KeyHt.find(key)->second; - if ( EntryToDelete ) - delete EntryToDelete; - KeyHt.erase(key); - return (1); - } else { - dbg.Verbose(1, "gdcmDict::RemoveEntry unfound entry", key.c_str()); - return (0); - } +DictEntry *Dict::GetFirstEntry() +{ + ItKeyHt = KeyHt.begin(); + if( ItKeyHt != KeyHt.end() ) + return &(ItKeyHt->second); + return NULL; } /** - * \ingroup gdcmDict - * \brief - * @param group - * @param element - * @return + * \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 */ -int gdcmDict::RemoveEntry (guint16 group, guint16 element) { - return( RemoveEntry(gdcmDictEntry::TranslateToKey(group, element)) ); +DictEntry *Dict::GetNextEntry() +{ + gdcmAssertMacro (ItKeyHt != KeyHt.end()); + + { + ++ItKeyHt; + if (ItKeyHt != KeyHt.end()) + return &(ItKeyHt->second); + } + return NULL; } +//----------------------------------------------------------------------------- +// Protected + +//----------------------------------------------------------------------------- +// Private + +//----------------------------------------------------------------------------- + +} // end namespace gdcm