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
add new function : xbt_dict_is_empty
[simgrid.git]
/
src
/
xbt
/
heap_private.h
diff --git
a/src/xbt/heap_private.h
b/src/xbt/heap_private.h
index
bcd3ce9
..
521b17d
100644
(file)
--- a/
src/xbt/heap_private.h
+++ b/
src/xbt/heap_private.h
@@
-1,6
+1,5
@@
-/* $Id$ */
-
-/* Copyright (c) 2004 Arnaud Legrand. All rights reserved. */
+/* Copyright (c) 2004, 2005, 2007, 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. */
/* 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. */
@@
-21,6
+20,7
@@
typedef struct xbt_heap {
int count;
xbt_heapItem_t items;
void_f_pvoid_t free;
int count;
xbt_heapItem_t items;
void_f_pvoid_t free;
+ void (*update_callback) (void *, int);
} s_xbt_heap_t;
#define PARENT(i) i/2
} s_xbt_heap_t;
#define PARENT(i) i/2
@@
-30,6
+30,8
@@
typedef struct xbt_heap {
#define KEY(H,i) ((H->items)[i]).key
#define CONTENT(H,i) ((H->items)[i]).content
#define KEY(H,i) ((H->items)[i]).key
#define CONTENT(H,i) ((H->items)[i]).content
+#define MIN_KEY_VALUE -10000
+
static void xbt_heap_maxHeapify(xbt_heap_t H);
static void xbt_heap_increaseKey(xbt_heap_t H, int i);
static void xbt_heap_maxHeapify(xbt_heap_t H);
static void xbt_heap_increaseKey(xbt_heap_t H, int i);