+
+/**
+ * \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 element Element number of the searched tag.
+ * @return true if element was found or created successfully
+ */
+
+bool SQItem::SetEntryByNumber(std::string const & val, uint16_t group,
+ uint16_t element)
+{
+ 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() && element < (*i)->GetElement()) )
+ {
+ // instead of ReplaceOrCreateByNumber
+ // that is a method of Document :-(
+ ValEntry* entry = 0;
+ TagKey key = DictEntry::TranslateToKey(group, element);
+
+ // we assume a Public Dictionnary *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->GetDictEntryByNumber(group, element);
+ if (dictEntry == NULL)
+ {
+ dictEntry =
+ Global::GetDicts()->NewVirtualDictEntry(group, element,
+ "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() && element == (*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.
+ * @param entryToRemove Entry to remove AND delete.
+ * \warning Some problems when using under Windows... prefer the use of
+ * Initialize / GetNext methods
+ */
+bool SQItem::RemoveEntry( DocEntry* entryToRemove)
+{
+ for(ListDocEntry::iterator it = DocEntries.begin();
+ it != DocEntries.end();
+ ++it)
+ {
+ if( *it == entryToRemove)
+ {
+ DocEntries.erase(it);
+ dbg.Verbose(0, "SQItem::RemoveEntry: one element erased.");
+ delete entryToRemove;
+ return true;
+ }
+ }
+
+ dbg.Verbose(0, "SQItem::RemoveEntry: value not present ");
+ return false ;
+}
+
+/**
+ * \brief Clear the hash table from given entry BUT keep the entry.
+ * @param entryToRemove Entry to remove.
+ */
+bool SQItem::RemoveEntryNoDestroy(DocEntry* entryToRemove)
+{
+ for(ListDocEntry::iterator it = DocEntries.begin();
+ it != DocEntries.end();
+ ++it)
+ {
+ if( *it == entryToRemove)
+ {
+ DocEntries.erase(it);
+ dbg.Verbose(0, "SQItem::RemoveEntry: one element erased.");
+ return true;
+ }
+ }
+
+ dbg.Verbose(0, "SQItem::RemoveEntry: value not present ");
+ return false ;
+}
+
+/**
+ * \brief Initialise the visit of the chained list
+ */
+void SQItem::Initialize()
+{
+ ItDocEntries = DocEntries.begin();
+}
+
+/**
+ * \brief Get the next entry whil visiting the chained list
+ * \return The next DocEntry if found, otherwhise NULL
+ */
+DocEntry *SQItem::GetNextEntry()
+{
+ if (ItDocEntries != DocEntries.end())
+ {
+ DocEntry *tmp = *ItDocEntries;
+ ++ItDocEntries;
+
+ return(tmp);
+ }
+ else
+ {
+ return(NULL);
+ }
+}
+