Program: gdcm
Module: $RCSfile: gdcmSQItem.cxx,v $
Language: C++
- Date: $Date: 2005/01/19 08:55:09 $
- Version: $Revision: 1.54 $
+ Date: $Date: 2005/01/30 17:30:57 $
+ Version: $Revision: 1.62 $
Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
: DocEntrySet( )
{
SQDepthLevel = depthLevel;
+ SQItemNumber = 0;
}
/**
*/
SQItem::~SQItem()
{
- for(ListDocEntry::iterator cc = DocEntries.begin();
- cc != DocEntries.end();
- ++cc)
- {
- delete *cc;
- }
- DocEntries.clear();
+ ClearEntry();
}
//-----------------------------------------------------------------------------
/*
* \brief canonical Writer
+ * @param fp file pointer to an already open file.
+ * @param filetype type of the file (ACR, ImplicitVR, ExplicitVR, ...)
*/
void SQItem::WriteContent(std::ofstream *fp, FileType filetype)
{
//-----------------------------------------------------------------------------
// Public
+/**
+ * \brief Remove all entry in the Sequence Item
+ */
+void SQItem::ClearEntry()
+{
+ for(ListDocEntry::iterator cc = DocEntries.begin();
+ cc != DocEntries.end();
+ ++cc)
+ {
+ delete *cc;
+ }
+ DocEntries.clear();
+}
+
/**
* \brief adds any Entry (Dicom Element) to the Sequence Item
+ * @param entry Entry to add
*/
bool SQItem::AddEntry(DocEntry *entry)
{
DocEntries.push_back(entry);
- //TODO : check if it worked
return true;
}
/**
- * \brief Sets Entry (Dicom Element) value of an element,
- * specified by it's tag (Group, Number)
- * and the length, too ... inside a SQ Item
- * If the Element is not found, it's just created !
- * \warning we suppose, right now, the element belongs to a Public Group
- * (NOT a shadow one)
- * @param val string value to set
- * @param group Group number of the searched tag.
- * @param elem Element number of the searched tag.
- * @return true if element was found or created successfully
- */
-
-bool SQItem::SetEntry(std::string const &val, uint16_t group,
- uint16_t elem)
-{
- for(ListDocEntry::iterator i = DocEntries.begin();
- i != DocEntries.end();
- ++i)
- {
- if ( (*i)->GetGroup() == 0xfffe && (*i)->GetElement() == 0xe000 )
- {
- continue;
- }
-
- if ( ( group < (*i)->GetGroup() )
- ||( group == (*i)->GetGroup() && elem < (*i)->GetElement()) )
- {
- // instead of ReplaceOrCreate
- // that is a method of Document :-(
- ValEntry* entry = 0;
- TagKey key = DictEntry::TranslateToKey(group, elem);
-
- // we assume a Public Dictionary *is* loaded
- Dict *pubDict = Global::GetDicts()->GetDefaultPubDict();
- // if the invoked (group,elem) doesn't exist inside the Dictionary
- // we create a VirtualDictEntry
- DictEntry *dictEntry = pubDict->GetDictEntry(group, elem);
- if (dictEntry == NULL)
- {
- dictEntry =
- Global::GetDicts()->NewVirtualDictEntry(group, elem,
- "UN", GDCM_UNKNOWN,
- GDCM_UNKNOWN);
- }
- // we assume the constructor didn't fail
- entry = new ValEntry(dictEntry);
- if (entry)
- {
- entry->SetValue(val);
- }
- DocEntries.insert(i,entry);
-
- return true;
- }
- if (group == (*i)->GetGroup() && elem == (*i)->GetElement() )
- {
- if ( ValEntry *entry = dynamic_cast<ValEntry*>(*i) )
- {
- entry->SetValue(val);
- }
- return true;
- }
- }
- return false;
-}
-
-/**
- * \brief Clear the hash table from given entry AND delete the entry.
+ * \brief Clear the std::list from given entry AND delete the entry.
* @param entryToRemove Entry to remove AND delete.
- * \warning Some problems when using under Windows... prefer the use of
- * Initialize / GetNext methods
* @return true if the entry was found and removed; false otherwise
*/
-bool SQItem::RemoveEntry( DocEntry* entryToRemove)
+bool SQItem::RemoveEntry( DocEntry *entryToRemove)
{
for(ListDocEntry::iterator it = DocEntries.begin();
it != DocEntries.end();
if( *it == entryToRemove)
{
DocEntries.erase(it);
- gdcmVerboseMacro( "One element erased.");
+ gdcmVerboseMacro( "One element erased: " << entryToRemove->GetKey() );
delete entryToRemove;
return true;
}
}
- gdcmVerboseMacro( "Value not present.");
+ gdcmVerboseMacro( "Entry not found: " << entryToRemove->GetKey() );
return false ;
}
/**
- * \brief Clear the hash table from given entry BUT keep the entry.
+ * \brief Clear the std::list from given entry BUT keep the entry.
* @param entryToRemove Entry to remove.
* @return true if the entry was found and removed; false otherwise
*/
-bool SQItem::RemoveEntryNoDestroy(DocEntry* entryToRemove)
+bool SQItem::RemoveEntryNoDestroy(DocEntry *entryToRemove)
{
for(ListDocEntry::iterator it = DocEntries.begin();
it != DocEntries.end();
if( *it == entryToRemove)
{
DocEntries.erase(it);
- gdcmVerboseMacro( "One element erased.");
+ gdcmVerboseMacro( "One element erased, no destroyed: "
+ << entryToRemove->GetKey() );
return true;
}
}
- gdcmVerboseMacro( "Value not present.");
+ gdcmVerboseMacro( "Entry not found:" << entryToRemove->GetKey() );
return false ;
}
/**
- * \brief Get the first entry while visiting the SQItem
+ * \brief Get the first Dicom entry while visiting the SQItem
* \return The first DocEntry if found, otherwhise 0
*/
-DocEntry * SQItem::GetFirstEntry()
+DocEntry *SQItem::GetFirstEntry()
{
ItDocEntries = DocEntries.begin();
if (ItDocEntries != DocEntries.end())
}
/**
- * \brief Get the next entry while visiting the chained list
+ * \brief Get the next Dicom entry while visiting the chained list
* \return The next DocEntry if found, otherwhise NULL
*/
DocEntry *SQItem::GetNextEntry()
{
- gdcmAssertMacro (ItDocEntries != DocEntries.end());
- {
- ++ItDocEntries;
- if (ItDocEntries != DocEntries.end())
- return *ItDocEntries;
- return NULL;
- }
+ ++ItDocEntries;
+ if (ItDocEntries != DocEntries.end())
+ return *ItDocEntries;
+ return NULL;
}
-//-----------------------------------------------------------------------------
-// Protected
/**
* \brief Gets a Dicom Element inside a SQ Item Entry
- * @param group Group number of the Entry
+ * @param group Group number of the Entry
* @param elem Element number of the Entry
* @return Entry whose (group,elem) was passed. 0 if not found
*/
i != DocEntries.end(); ++i)
{
if ( (*i)->GetGroup() == group && (*i)->GetElement() == elem )
- {
return *i;
- }
}
- return 0;
-}
-
-/**
- * \brief Gets a Dicom Element inside a SQ Item Entry
- * @param group Group number of the Entry
- * @param elem Element number of the Entry
- * @return Entry whose (group,elem) was passed. 0 if not found
- */
-ValEntry* SQItem::GetValEntry(uint16_t group, uint16_t elem)
-{
- DocEntry *d = GetDocEntry(group, elem);
- if ( ValEntry *e = dynamic_cast<ValEntry*>(d) )
- return e;
- return 0;
-}
-
-/**
- * \brief Gets a Dicom Element inside a SQ Item Entry
- * @param group Group number of the Entry
- * @param elem Element number of the Entry
- * @return Entry whose (group,elem) was passed. 0 if not found
- */
-BinEntry* SQItem::GetBinEntry(uint16_t group, uint16_t elem)
-{
- DocEntry *d = GetDocEntry(group, elem);
- if ( BinEntry *e = dynamic_cast<BinEntry*>(d) )
- return e;
- return 0;
+ return NULL;
}
-/**
- * \brief Gets a Dicom Element inside a SQ Item Entry
- * @param group Group number of the Entry
- * @param elem Element number of the Entry
- * @return Entry whose (group,elem) was passed. 0 if not found
- */
-SeqEntry* SQItem::GetSeqEntry(uint16_t group, uint16_t elem)
-{
- DocEntry *d = GetDocEntry(group, elem);
- if ( SeqEntry *e = dynamic_cast<SeqEntry*>(d) )
- return e;
- return 0;
-}
-
-
-/**
- * \brief Get the value of a Dicom Element inside a SQ Item Entry
- * \note : meaningfull only if the required entry is NEITHER a SeqEntry
- * NOR a BinEntry
- * @param group Group number of the Entry
- * @param elem Element number of the Entry
- * @return 'string value' of the entry whose (group,elem) was passed.
- * GDCM_UNFOUND if not found
- */
+//-----------------------------------------------------------------------------
+// Protected
-std::string SQItem::GetEntry(uint16_t group, uint16_t elem)
-{
- for(ListDocEntry::iterator i = DocEntries.begin();
- i != DocEntries.end(); ++i)
- {
- if ( (*i)->GetGroup() == group && (*i)->GetElement() == elem)
- {
- if (ValEntry *e = dynamic_cast<ValEntry*>(*i))
- return e->GetValue();
- }
- }
- return GDCM_UNFOUND;
-}
//-----------------------------------------------------------------------------
// Private