Redis 2.5.12 (2.6 RC6).

[redis.git] / src / adlist.c

diff --git a/src/adlist.c b/src/adlist.c
index 015012f5ce392f57b340808d32e69989967148ea..e48957e3af93fb440c61d285c1cb9f156f650d06 100644 (file)
--- a/src/adlist.c
+++ b/src/adlist.c
@@ -57,7 +57,7 @@ list *listCreate(void)
  * This function can't fail. */
 void listRelease(list *list)
 {
  * This function can't fail. */
 void listRelease(list *list)
 {

-    unsigned int len;
+    unsigned long len;

     listNode *current, *next;
 
     current = list->head;
     listNode *current, *next;
 
     current = list->head;


@@ -310,7 +310,7 @@ listNode *listSearchKey(list *list, void *key)
  * and so on. Negative integers are used in order to count
  * from the tail, -1 is the last element, -2 the penultimante
  * and so on. If the index is out of range NULL is returned. */
  * and so on. Negative integers are used in order to count
  * from the tail, -1 is the last element, -2 the penultimante
  * and so on. If the index is out of range NULL is returned. */

-listNode *listIndex(list *list, int index) {
+listNode *listIndex(list *list, long index) {

     listNode *n;
 
     if (index < 0) {
     listNode *n;
 
     if (index < 0) {


@@ -323,3 +323,19 @@ listNode *listIndex(list *list, int index) {
     }
     return n;
 }
     }
     return n;
 }

+
+/* Rotate the list removing the tail node and inserting it to the head. */
+void listRotate(list *list) {
+    listNode *tail = list->tail;
+
+    if (listLength(list) <= 1) return;
+
+    /* Detatch current tail */
+    list->tail = tail->prev;
+    list->tail->next = NULL;
+    /* Move it as head */
+    list->head->prev = tail;
+    tail->prev = NULL;
+    tail->next = list->head;
+    list->head = tail;
+}