1 files changed, 88 insertions, 20 deletions

diff --git a/src/data/list.c b/src/data/list.c
index f751fa0..e641133 100644
--- a/src/data/list.c
+++ b/src/data/list.c
@@ -1,14 +1,13 @@
 /*:*
  *: File: ./src/data/list.c
- *: A simple interpreter
- *: 
- *: WWW	: http://fype.buetow.org
- *: AUTHOR	: http://paul.buetow.org
- *: E-Mail	: fype at dev.buetow.org
- *: 
- *: Copyright (c) 2005 - 2009, Dipl.-Inform. (FH) Paul C. Buetow 
- *: All rights reserved.
- *: 
+ *: A simple Fype interpreter
+ *:
+ *: WWW: http://fype.buetow.org
+ *: AUTHOR: http://paul.buetow.org
+ *: E-Mail: fype at dev.buetow.org
+ *:
+ *: The Fype Language; (c) 2005 - 2010 - Dipl.-Inform. (FH) Paul C. Buetow
+ *:
  *: Redistribution and use in source and binary forms, with or without modi-
  *: fication, are permitted provided that the following conditions are met:
  *:  * Redistributions of source code must retain the above copyright
@@ -16,20 +15,20 @@
  *:  * Redistributions in binary form must reproduce the above copyright
  *:    notice, this list of conditions and the following disclaimer in the
  *:    documentation and/or other materials provided with the distribution.
- *:  * Neither the name of buetow.org nor the names of its contributors may 
- *:    be used to endorse or promote products derived from this software 
+ *:  * Neither the name of buetow.org nor the names of its contributors may
+ *:    be used to endorse or promote products derived from this software
  *:    without specific prior written permission.
- *: 
- *: THIS SOFTWARE IS PROVIDED BY PAUL C. BUETOW AS IS'' AND ANY EXPRESS OR 
- *: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 
+ *:
+ *: THIS SOFTWARE IS PROVIDED BY PAUL C. BUETOW AS IS'' AND ANY EXPRESS OR
+ *: IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  *: WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- *: DISCLAIMED. IN NO EVENT SHALL PAUL C. BUETOW BE LIABLE FOR ANY DIRECT, 
- *: INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 
- *: (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
- *:  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 
+ *: DISCLAIMED. IN NO EVENT SHALL PAUL C. BUETOW BE LIABLE FOR ANY DIRECT,
+ *: INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ *: (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ *:  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  *: HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
- *: STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 
- *: IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
+ *: STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
+ *: IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  *: POSSIBILITY OF SUCH DAMAGE.
  *:*/
 
@@ -343,6 +342,32 @@ listiterator_new(List *p_list) {
 }
 
 ListIterator*
+listiterator_new_from_elem(ListElem *p_listelem) {
+   if (!p_listelem)
+      return (NULL);
+
+   ListIterator *p_iter = malloc(sizeof(ListIterator));
+
+   p_iter->p_cur = p_listelem;
+   p_iter->b_reverse = false;
+   p_iter->func = NULL;
+
+   return (p_iter);
+}
+
+ListIterator*
+listiterator_new_from_elem_reverse(ListElem *p_listelem) {
+   ListIterator *p_iter = listiterator_new_from_elem(p_listelem);
+
+   if (!p_iter)
+      return (NULL);
+
+   p_iter->b_reverse = true;
+
+   return (p_iter);
+}
+
+ListIterator*
 listiterator_new_reverse(List *p_list) {
    if (!p_list)
       return (NULL);
@@ -411,6 +436,27 @@ listiterator_current(ListIterator *p_iter) {
    return (NULL);
 }
 
+ListElem*
+listiterator_current_elem(ListIterator *p_iter) {
+   if (p_iter->p_cur)
+      return (p_iter->p_cur);
+
+   return (NULL);
+}
+
+ListElem*
+listiterator_prev_elem(ListIterator *p_iter) {
+   if (p_iter->p_cur) {
+      if (!p_iter->b_reverse)
+         return (p_iter->p_cur->p_prev);
+
+      else
+         return (p_iter->p_cur->p_next);
+   }
+
+   return (NULL);
+}
+
 void*
 listiterator_end(ListIterator *p_iter) {
    void *p_ret = NULL;
@@ -421,6 +467,28 @@ listiterator_end(ListIterator *p_iter) {
    return (p_ret);
 }
 
+_Bool
+listiterator_current_elem_equals(ListIterator *p_iter, ListElem *p_listelem) {
+   if (!p_iter || !p_listelem)
+      return (false);
+
+   ListElem *p_listelem_current = listiterator_current_elem(p_iter);
+
+   if (!p_listelem_current)
+      return (false);
+
+   else if (p_listelem_current->p_next != p_listelem->p_next)
+      return (false);
+
+   else if (p_listelem_current->p_prev != p_listelem->p_prev)
+      return (false);
+
+   else if (p_listelem_current->p_val != p_listelem->p_val)
+      return (false);
+
+   return (true);
+}
+
 ListElem*
 listiterator_next_elem(ListIterator *p_iter) {
    if (p_iter->p_cur) {