Changeset 4694 in orxonox.OLD for orxonox/trunk/src/lib/util/list.h

Timestamp:

Jun 24, 2005, 6:10:13 PM (19 years ago)

Author:

patrick

Message:

orxonox/trunk: now ready to implement the collision detection algorithm

File:

• orxonox/trunk/src/lib/util/list.h (modified) (4 diffs)

orxonox/trunk/src/lib/util/list.h

@@ -34 +34 @@
 
   T* nextElement();
+  T* seekElement(T* element);
 
  private:
   listElement<T>*    currentEl;                      //!< pointer to the current list element in the iterator
   listElement<T>*    tmpEl;                          //!< temp listElemnt pointer
+  listElement<T>*    startElement;                   //!< pointer to the start of the list
 };
 
@@ -61 +63 @@
   this->currentEl = startElement;
   this->tmpEl = NULL;
+  this->startElement = startElement;
 }
 
@@ -87 +90 @@
   this->currentEl = this->currentEl->next;
   return this->tmpEl->curr;
+}
+
+/**
+   \brief gets the element after the selected one, sets the iterator to this point in the list
+   \param element the element to seek
+   \returns next list element
+
+  Attention: if you seek an element, the iterator pointer will point to the NEXT listelement after the argument!
+ */
+template<class T>
+inline T* tIterator<T>::seekElement (T* element)
+{
+  for(this->tmpEl = this->startElement; this->tmpEl != NULL; this->tmpEl = this->tmpEl->next)
+  {
+    if( unlikely(this->tmpEl->curr == element))
+    {
+      if( this->tmpEl->next != NULL)
+      {
+        this->currentEl = this->tmpEl->next->next;
+        return this->tmpEl->next->curr;
+      }
+      return NULL;
+    }
+  }
+  return NULL;
 }
 
@@ -109 +137 @@
   bool isEmpty();
   int getSize();
-  //T* enumerate();
   bool inList(T* entity);
   tIterator<T>* getIterator();