X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/8b90a25e740ad0f8014d77fafbe1ebe824e53f09..488566dad1ae2b42f26a8e291824ff9b16a976f7:/src/xbt/heap.c

diff --git a/src/xbt/heap.c b/src/xbt/heap.c
index 05c0a7af44..2eced61e99 100644
--- a/src/xbt/heap.c
+++ b/src/xbt/heap.c
@@ -1,8 +1,7 @@
-/* 	$Id$	 */
-
 /* a generic and efficient heap                                             */
 
-/* Copyright (c) 2004 Arnaud Legrand. All rights reserved.                  */
+/* Copyright (c) 2004, 2005, 2007, 2008, 2009, 2010. The SimGrid Team.
+ * All rights reserved.                                                     */
 
 /* This program is free software; you can redistribute it and/or modify it
  * under the terms of the license (GNU LGPL) which comes with this package. */
@@ -11,13 +10,13 @@
 #include "xbt/log.h"
 #include "heap_private.h"
 
+#include <stdio.h>
+
 
-/** @addtogroup XBT_heap 
+/** @addtogroup XBT_heap
  *  \brief This section describes the API to generic heap with O(log(n)) access.
  */
 
-XBT_LOG_NEW_DEFAULT_SUBCATEGORY(heap, xbt, "Heap");
-
 /**
  * @brief Creates a new heap.
  * \param init_size initial size of the heap
@@ -26,7 +25,8 @@ XBT_LOG_NEW_DEFAULT_SUBCATEGORY(heap, xbt, "Heap");
  *
  * Creates a new heap.
  */
-xbt_heap_t xbt_heap_new(int init_size, void_f_pvoid_t * const free_func)
+XBT_INLINE xbt_heap_t xbt_heap_new(int init_size,
+                                   void_f_pvoid_t const free_func)
 {
   xbt_heap_t H = xbt_new0(struct xbt_heap, 1);
   H->size = init_size;
@@ -36,6 +36,20 @@ xbt_heap_t xbt_heap_new(int init_size, void_f_pvoid_t * const free_func)
   return H;
 }
 
+/**
+ * @brief Set the update callback function.
+ * @param H the heap we're working on
+ * \param update_callback function to call on each element to update its index when needed.
+ */
+XBT_INLINE void xbt_heap_set_update_callback(xbt_heap_t H,
+                                             void (*update_callback) (void
+                                                                      *,
+                                                                      int))
+{
+  H->update_callback = update_callback;
+}
+
+
 /**
  * @brief kilkil a heap and its content
  * @param H poor victim
@@ -45,7 +59,7 @@ void xbt_heap_free(xbt_heap_t H)
   int i;
   if (H->free)
     for (i = 0; i < H->count; i++)
-      H->free(H->items[i].content);
+      (*(H->free)) (H->items[i].content);
   free(H->items);
   free(H);
   return;
@@ -56,7 +70,7 @@ void xbt_heap_free(xbt_heap_t H)
  * @param H the heap we're working on
  * @return the number of elements in the heap
  */
-int xbt_heap_size(xbt_heap_t H)
+XBT_INLINE int xbt_heap_size(xbt_heap_t H)
 {
   return (H->count);
 }
@@ -72,14 +86,17 @@ int xbt_heap_size(xbt_heap_t H)
 void xbt_heap_push(xbt_heap_t H, void *content, double key)
 {
   int count = ++(H->count);
+
   int size = H->size;
   xbt_heapItem_t item;
+
   if (count > size) {
     H->size = 2 * size + 1;
     H->items =
-	(void *) realloc(H->items,
-			 (H->size) * sizeof(struct xbt_heapItem));
+        (void *) realloc(H->items,
+                         (H->size) * sizeof(struct xbt_heapItem));
   }
+
   item = &(H->items[count - 1]);
   item->key = key;
   item->content = content;
@@ -111,21 +128,45 @@ void *xbt_heap_pop(xbt_heap_t H)
   if (H->count < H->size / 4 && H->size > 16) {
     H->size = H->size / 2 + 1;
     H->items =
-	(void *) realloc(H->items,
-			 (H->size) * sizeof(struct xbt_heapItem));
+        (void *) realloc(H->items,
+                         (H->size) * sizeof(struct xbt_heapItem));
   }
+
+  if (H->update_callback)
+    H->update_callback(max, -1);
   return max;
 }
 
+/**
+ * @brief Extracts from the heap and returns the element at position i.
+ * \param H the heap we're working on
+ * \param i	element position
+ * \return the element at position i if ok, NULL otherwise
+ *
+ * Extracts from the heap and returns the element at position i. The head is automatically reorded.
+ */
+void *xbt_heap_remove(xbt_heap_t H, int i)
+{
+  if ((i < 0) || (i > H->count - 1))
+    return NULL;
+  /* put element i at head */
+  if (i > 0) {
+    KEY(H, i) = MIN_KEY_VALUE;
+    xbt_heap_increaseKey(H, i);
+  }
+
+  return xbt_heap_pop(H);
+}
+
 /**
  * @brief returns the smallest key in the heap (heap unchanged)
  * \param H the heap we're working on
  *
  * \return the smallest key in the heap without modifying the heap.
  */
-double xbt_heap_maxkey(xbt_heap_t H)
+XBT_INLINE double xbt_heap_maxkey(xbt_heap_t H)
 {
-  xbt_assert0(H->count != 0,"Empty heap");
+  xbt_assert0(H->count != 0, "Empty heap");
   return KEY(H, 0);
 }
 
@@ -138,13 +179,13 @@ double xbt_heap_maxkey(xbt_heap_t H)
  */
 void *xbt_heap_maxcontent(xbt_heap_t H)
 {
-  xbt_assert0(H->count != 0,"Empty heap");
+  xbt_assert0(H->count != 0, "Empty heap");
   return CONTENT(H, 0);
 }
 
 /* <<<< private >>>>
  * \param H the heap we're working on
- * 
+ *
  * Restores the heap property once an element has been deleted.
  */
 static void xbt_heap_maxHeapify(xbt_heap_t H)
@@ -163,16 +204,21 @@ static void xbt_heap_maxHeapify(xbt_heap_t H)
       struct xbt_heapItem tmp = H->items[i];
       H->items[i] = H->items[greatest];
       H->items[greatest] = tmp;
+      if (H->update_callback)
+        H->update_callback(CONTENT(H, i), i);
       i = greatest;
-    } else
+    } else {
+      if (H->update_callback)
+        H->update_callback(CONTENT(H, i), i);
       return;
+    }
   }
 }
 
 /* <<<< private >>>>
  * \param H the heap we're working on
  * \param i an item position in the heap
- * 
+ *
  * Moves up an item at position i to its correct position. Works only
  * when called from xbt_heap_push. Do not use otherwise.
  */
@@ -182,7 +228,11 @@ static void xbt_heap_increaseKey(xbt_heap_t H, int i)
     struct xbt_heapItem tmp = H->items[i];
     H->items[i] = H->items[PARENT(i)];
     H->items[PARENT(i)] = tmp;
+    if (H->update_callback)
+      H->update_callback(CONTENT(H, i), i);
     i = PARENT(i);
   }
+  if (H->update_callback)
+    H->update_callback(CONTENT(H, i), i);
   return;
 }