Program: gdcm
Module: $RCSfile: gdcmDict.cxx,v $
Language: C++
- Date: $Date: 2005/01/08 15:03:59 $
- Version: $Revision: 1.61 $
+ Date: $Date: 2005/01/17 11:13:21 $
+ Version: $Revision: 1.65 $
Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
void FillDefaultDataDict(Dict *d);
//-----------------------------------------------------------------------------
// Constructor / Destructor
+/**
+ * \brief Constructor
+ */
+Dict::Dict( )
+{
+ Filename="";
+}
+
/**
* \brief Constructor
* @param filename from which to build the dictionary.
}
Filename = filename;
+ from.close();
}
- from.close();
}
/**
*/
Dict::~Dict()
{
- // we assume all the pointed DictEntries are already cleaned-up
- // when we clean KeyHt.
- KeyHt.clear();
+ ClearEntry();
}
//-----------------------------------------------------------------------------
* 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)
+void Dict::Print(std::ostream &os, std::string const & )
{
os << "Dict file name : " << Filename << std::endl;
std::ostringstream s;
//-----------------------------------------------------------------------------
// Public
+/**
+ * \ingroup Dict
+ * \brief Remove all Dicom Dictionary Entries
+ */
+void Dict::ClearEntry()
+{
+ // we assume all the pointed DictEntries are already cleaned-up
+ // when we clean KeyHt.
+ KeyHt.clear();
+}
+
/**
* \ingroup Dict
* \brief adds a new Dicom Dictionary Entry
}
/**
- * \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 elem element of the entry to be found
- * @return the corresponding dictionnary entry when existing, NULL otherwise
+ * @return the corresponding dictionary entry when existing, NULL otherwise
*/
DictEntry *Dict::GetDictEntry(uint16_t group, uint16_t elem)
{
}
/**
- * \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 DictSet::GetPubDictTagNamesByCategory
- * @return A list of all entries of the public dicom dictionnary.
+ * @return A list of all entries of the public dicom dictionary.
*/
/**
* \ingroup Dict
- * \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.
*/
// return result;
//}
+/**
+ * \brief Initialise the visit of the Hash table (KeyHt)
+ */
+void Dict::InitTraversal()
+{
+ ItKeyHt = KeyHt.begin();
+}
+
+/**
+ * \brief Get the next entry while visiting the Hash table (KeyHt)
+ * \return The next DictEntry if found, otherwhise NULL
+ */
+DictEntry *Dict::GetNextEntry()
+{
+ if (ItKeyHt != KeyHt.end())
+ {
+ DictEntry *tmp = &(ItKeyHt->second);
+ ++ItKeyHt;
+
+ return tmp;
+ }
+ else
+ {
+ return NULL;
+ }
+}
+
//-----------------------------------------------------------------------------
// Protected