Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
//-----------------------------------------------------------------------------
// Constructor / Destructor
/**
* \brief Construtor
//-----------------------------------------------------------------------------
// Constructor / Destructor
/**
* \brief Construtor
* Entries will be sorted by tag i.e. the couple (group, element).
* @param os The output stream to be written to.
*/
* Entries will be sorted by tag i.e. the couple (group, element).
* @param os The output stream to be written to.
*/
* Entries will be sorted by tag i.e. the couple (group, element).
* @param os The output stream to be written to.
*/
* Entries will be sorted by tag i.e. the couple (group, element).
* @param os The output stream to be written to.
*/
* \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
*/
* \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
*/
* @param element Dicom element number of the Dicom Element
* @return false if Dicom Dictionary Entry doesn't exist
*/
* @param element Dicom element number of the Dicom Element
* @return false if Dicom Dictionary Entry doesn't exist
*/
* the name MAY CHANGE between two versions !
* @return the corresponding dictionnary entry when existing, NULL otherwise
*/
* the name MAY CHANGE between two versions !
* @return the corresponding dictionnary entry when existing, NULL otherwise
*/
* @param element element of the entry to be found
* @return the corresponding dictionnary entry when existing, NULL otherwise
*/
* @param element element of the entry to be found
* @return the corresponding dictionnary entry when existing, NULL otherwise
*/
/**
* \brief Consider all the entries of the public dicom dictionnary.
* Build all list of all the tag names of all those entries.
/**
* \brief Consider all the entries of the public dicom dictionnary.
* Build all list of all the tag names of all those entries.
{
std::list<std::string> *result = new std::list<std::string>;
for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag)
{
std::list<std::string> *result = new std::list<std::string>;
for (TagKeyHT::iterator tag = KeyHt.begin(); tag != KeyHt.end(); ++tag)
* \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
* \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
{
std::map<std::string, std::list<std::string> > *result = new std::map<std::string, std::list<std::string> >;
{
std::map<std::string, std::list<std::string> > *result = new std::map<std::string, std::list<std::string> >;