A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Sanitize swag documentation: group definition in module-xbt; group structure in ...
[simgrid.git]
/
src
/
xbt
/
heap.c
diff --git
a/src/xbt/heap.c
b/src/xbt/heap.c
index
8de439f
..
c6207b9
100644
(file)
--- a/
src/xbt/heap.c
+++ b/
src/xbt/heap.c
@@
-10,12
+10,18
@@
#include "xbt/sysdep.h"
#include "xbt/error.h"
#include "heap_private.h"
#include "xbt/sysdep.h"
#include "xbt/error.h"
#include "heap_private.h"
+
+
+/** \defgroup XBT_heap A generic heap data structure
+ * \brief This section describes the API to generic heap with O(log(n)) access.
+ */
+
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(heap, xbt, "Heap");
/** \name Functions
* \ingroup XBT_heap
*/
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(heap, xbt, "Heap");
/** \name Functions
* \ingroup XBT_heap
*/
-/*
@{
*/
+/*
@{
*/
/**
* \param init_size initial size of the heap
* \param free_func function to call on each element when you want to free
/**
* \param init_size initial size of the heap
* \param free_func function to call on each element when you want to free
@@
-44,8
+50,8
@@
void xbt_heap_free(xbt_heap_t H)
if (H->free)
for (i = 0; i < H->count; i++)
H->free(H->items[i].content);
if (H->free)
for (i = 0; i < H->count; i++)
H->free(H->items[i].content);
-
xbt_
free(H->items);
-
xbt_
free(H);
+ free(H->items);
+ free(H);
return;
}
return;
}
@@
-180,4
+186,4
@@
static void xbt_heap_increaseKey(xbt_heap_t H, int i)
}
return;
}
}
return;
}
-/*
@}
*/
+/*
@}
*/