X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmDict.cxx;h=bb6bd72eb67de471d3eee997c81c126abf696737;hb=933fb20f37f5f900c53c59b2a739e18303bd60d8;hp=32cc12467410975dd91ebb1ae9c0f8dd8fa22977;hpb=e06d61ba347d7f5f692a682434e089d939f85653;p=gdcm.git diff --git a/src/gdcmDict.cxx b/src/gdcmDict.cxx index 32cc1246..bb6bd72e 100644 --- a/src/gdcmDict.cxx +++ b/src/gdcmDict.cxx @@ -1,52 +1,321 @@ -// gdcmDict.cxx +/*========================================================================= + + Program: gdcm + Module: $RCSfile: gdcmDict.cxx,v $ + Language: C++ + Date: $Date: 2004/10/12 04:35:45 $ + Version: $Revision: 1.45 $ + + 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 "gdcm.h" +#include "gdcmDict.h" #include "gdcmUtil.h" +#include "gdcmDebug.h" + +#include +#include +#include +namespace gdcm +{ + +//----------------------------------------------------------------------------- +// Constructor / Destructor +/** + * \brief Construtor + * @param filename from which to build the dictionary. + */ +Dict::Dict(std::string const & filename) +{ + uint16_t group; + uint16_t element; + TagName vr; + TagName fourth; + TagName name; + + std::ifstream from( filename.c_str() ); + dbg.Error(!from, "Dict::Dict: can't open dictionary", + filename.c_str()); -gdcmDict::gdcmDict(const char* FileName) { - std::ifstream from(FileName); - dbg.Error(!from, "gdcmDict::gdcmDict: can't open dictionary", FileName); - guint16 group, element; - // CLEANME : use defines for all those constants - char buff[1024]; - TagKey key, vr, fourth, name; - while (!from.eof()) { - from >> 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); - entries[gdcmDictEntry::TranslateToKey(group, element)] = newEntry; - } + while (!from.eof()) + { + from >> std::hex; + from >> group; /// MEMORY LEAK in std::istream::operator>> + from >> element; + from >> vr; + from >> fourth; + from >> std::ws; // used to be eatwhite(from); + std::getline(from, name); /// MEMORY LEAK in std::getline<> + + DictEntry * newEntry = new DictEntry(group, element, + vr, fourth, name); + AddNewEntry(newEntry); + } from.close(); + + Filename = filename; } -void gdcmDict::Print(ostream& os) { - for (TagHT::iterator tag = entries.begin(); tag != entries.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() << "." << endl; - } +/** + * \brief Destructor + */ +Dict::~Dict() +{ + for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) + { + DictEntry* entryToDelete = tag->second; + if ( entryToDelete ) + { + delete entryToDelete; + } + } + // Since AddNewEntry adds symetrical in both KeyHt and NameHT we can + // assume all the pointed DictEntries are already cleaned-up when + // we cleaned KeyHt. + KeyHt.clear(); + NameHt.clear(); } -// renvoie une ligne de Dictionnaire Dicom à partir de (numGroup, numElement) +//----------------------------------------------------------------------------- +// Print +/** + * \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 Dict::Print(std::ostream &os) +{ + os << "Dict file name : " << Filename << std::endl; + PrintByKey(os); +} -gdcmDictEntry * gdcmDict::GetTag(guint32 group, guint32 element) { - TagKey key = gdcmDictEntry::TranslateToKey(group, element); - if ( ! entries.count(key)) - return (gdcmDictEntry*)0; - if (entries.count(key) > 1) - dbg.Verbose(0, "gdcmDict::GetTag", - "multiple entries for this key (FIXME) !"); - return entries.find(key)->second; +/** + * \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 Dict::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() << ") = " + << std::dec; + s << tag->second->GetVR() << ", "; + s << tag->second->GetFourth() << ", "; + s << tag->second->GetName() << "." << std::endl; + } + os << s.str(); } + +/** + * \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. + */ +void Dict::PrintByName(std::ostream& os) +{ + 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(); +} + +//----------------------------------------------------------------------------- +// Public +/** + * \ingroup Dict + * \brief adds a new Dicom Dictionary Entry + * @param newEntry entry to add + * @return false if Dicom Element already exists + */ +bool Dict::AddNewEntry(DictEntry *newEntry) +{ + TagKey key = newEntry->GetKey(); + + if(KeyHt.count(key) == 1) + { + dbg.Verbose(1, "Dict::AddNewEntry already present", key.c_str()); + return false; + } + else + { + KeyHt[newEntry->GetKey()] = newEntry; + NameHt[newEntry->GetName()] = newEntry; + return true; + } +} + +/** + * \ingroup Dict + * \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 Dict::ReplaceEntry(DictEntry *newEntry) +{ + if ( RemoveEntry(newEntry->DictEntry::GetKey()) ) + { + KeyHt[newEntry->GetKey()] = newEntry; + NameHt[newEntry->GetName()] = newEntry; + return true; + } + return false; +} + +/** + * \ingroup Dict + * \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 Dict::RemoveEntry(TagKey key) +{ + if(KeyHt.count(key) == 1) + { + DictEntry* entryToDelete = KeyHt.find(key)->second; + + if ( entryToDelete ) + { + NameHt.erase(entryToDelete->GetName()); + delete entryToDelete; + } + + KeyHt.erase(key); + return true; + } + else + { + dbg.Verbose(1, "Dict::RemoveEntry unfound entry", key.c_str()); + return false; + } +} + +/** + * \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 + * @return false if Dicom Dictionary Entry doesn't exist + */ +bool Dict::RemoveEntry (uint16_t group, uint16_t element) +{ + return RemoveEntry(DictEntry::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 + */ +DictEntry* Dict::GetDictEntryByName(TagName name) +{ + if ( !NameHt.count(name)) + { + return 0; + } + return NameHt.find(name)->second; +} + +/** + * \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 + */ +DictEntry* Dict::GetDictEntryByNumber(uint16_t group, uint16_t element) +{ + TagKey key = DictEntry::TranslateToKey(group, element); + if ( !KeyHt.count(key) ) + { + return 0; + } + return KeyHt.find(key)->second; +} + +/** + * \brief Consider all the entries of the public dicom dictionnary. + * 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 dictionnary. + */ +std::list* Dict::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; +} + +/** + * \ingroup Dict + * \brief Consider all the entries of the public dicom dictionnary. + * 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 + * 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 + * - 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 + * 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 + * among that group. + */ +std::map > *Dict::GetDictEntryNamesByCategory(void) +{ + std::map > *result = new std::map >; + + for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag) + { + (*result)[tag->second->GetFourth()].push_back(tag->second->GetName()); + } + + return result; +} + +//----------------------------------------------------------------------------- +// Protected + +//----------------------------------------------------------------------------- +// Private + +//----------------------------------------------------------------------------- + +} // end namespace gdcm