+/**
+ * \brief Destructor
+ */
+Dict::~Dict()
+{
+ // 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();
+}
+
+//-----------------------------------------------------------------------------
+// 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);
+}
+
+/**
+ * \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 const & newEntry)
+{
+ const TagKey & key = newEntry.GetKey();
+
+ if(KeyHt.count(key) == 1)
+ {
+ dbg.Verbose(1, "Dict::AddNewEntry already present", key.c_str());
+ return false;
+ }
+ else
+ {
+ KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry));
+ NameHt.insert( TagNameHT::value_type(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 const & newEntry)
+{
+ if ( RemoveEntry(newEntry.GetKey()) )
+ {
+ KeyHt.insert( TagKeyHT::value_type(newEntry.GetKey(), newEntry));
+ NameHt.insert( TagNameHT::value_type(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 const & key)
+{
+ TagKeyHT::const_iterator it = KeyHt.find(key);
+ if(it != KeyHt.end())
+ {
+ const DictEntry& entryToDelete = it->second;
+ NameHt.erase(entryToDelete.GetName());
+ 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 Dictionary
+ * the name MAY CHANGE between two versions !
+ * @return the corresponding dictionnary entry when existing, NULL otherwise
+ */
+DictEntry* Dict::GetDictEntryByName(TagName const & name)
+{
+ TagNameHT::iterator it = NameHt.find(name);
+ if ( it == NameHt.end() )
+ {
+ return 0;
+ }
+ return &(it->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);
+ TagKeyHT::iterator it = KeyHt.find(key);
+ if ( it == KeyHt.end() )
+ {
+ return 0;
+ }
+ return &(it->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.
+ */
+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;