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
when using doubles, %lg should be used for scanf and %g for printf (which is
[simgrid.git]
/
testsuite
/
xbt
/
heap_bench.c
diff --git
a/testsuite/xbt/heap_bench.c
b/testsuite/xbt/heap_bench.c
index
d65ede6
..
ea737a9
100644
(file)
--- a/
testsuite/xbt/heap_bench.c
+++ b/
testsuite/xbt/heap_bench.c
@@
-11,20
+11,20
@@
#include <stdio.h>
#include "xbt/heap.h"
#include <stdio.h>
#include "xbt/heap.h"
-#include "gras/virtu.h" /* time manipulation in bench */
+#include "gras/virtu.h"
/* time manipulation in bench */
#define MAX_TEST 1000000
#define MAX_TEST 1000000
-int compare_
xbt_heap_float_t
(const void *a, const void *b);
+int compare_
double
(const void *a, const void *b);
void test_heap_validity(int size);
void test_heap_mean_operation(int size);
void test_heap_validity(int size);
void test_heap_mean_operation(int size);
-int compare_
xbt_heap_float_t
(const void *a, const void *b)
+int compare_
double
(const void *a, const void *b)
{
{
-
xbt_heap_float_t
pa, pb;
+
double
pa, pb;
- pa = *((
xbt_heap_float_t
*) a);
- pb = *((
xbt_heap_float_t
*) b);
+ pa = *((
double
*) a);
+ pb = *((
double
*) b);
if (pa > pb)
return 1;
if (pa > pb)
return 1;
@@
-36,7
+36,7
@@
int compare_xbt_heap_float_t(const void *a, const void *b)
void test_heap_validity(int size)
{
xbt_heap_t heap = xbt_heap_new(size, NULL);
void test_heap_validity(int size)
{
xbt_heap_t heap = xbt_heap_new(size, NULL);
-
xbt_heap_float_t *tab = calloc(size, sizeof(xbt_heap_float_t
));
+
double *tab = calloc(size, sizeof(double
));
int i;
for (i = 0; i < size; i++) {
int i;
for (i = 0; i < size; i++) {
@@
-44,10
+44,10
@@
void test_heap_validity(int size)
xbt_heap_push(heap, NULL, tab[i]);
}
xbt_heap_push(heap, NULL, tab[i]);
}
- qsort(tab, size, sizeof(
xbt_heap_float_t), compare_xbt_heap_float_t
);
+ qsort(tab, size, sizeof(
double), compare_double
);
for (i = 0; i < size; i++) {
for (i = 0; i < size; i++) {
- /* printf(
XBT_HEAP_FLOAT_T
" ", xbt_heap_maxkey(heap)); */
+ /* printf(
"%lg"
" ", xbt_heap_maxkey(heap)); */
if (xbt_heap_maxkey(heap) != tab[i]) {
fprintf(stderr, "Problem !\n");
exit(1);
if (xbt_heap_maxkey(heap) != tab[i]) {
fprintf(stderr, "Problem !\n");
exit(1);
@@
-62,24
+62,24
@@
void test_heap_validity(int size)
void test_heap_mean_operation(int size)
{
xbt_heap_t heap = xbt_heap_new(size, NULL);
void test_heap_mean_operation(int size)
{
xbt_heap_t heap = xbt_heap_new(size, NULL);
-
xbt_heap_float_t
val;
+
double
val;
double date = 0;
int i, j;
double date = 0;
int i, j;
- date = gras_os_time();
+ date = gras_os_time()
* 1000000
;
for (i = 0; i < size; i++)
xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
for (i = 0; i < size; i++)
xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
- date = gras_os_time() - date;
- printf("Creation time %d size heap : %
f\n", size, 0.0 +
date);
+ date = gras_os_time()
* 1000000
- date;
+ printf("Creation time %d size heap : %
lg\n", size,
date);
- date = gras_os_time();
+ date = gras_os_time()
* 1000000
;
for (j = 0; j < MAX_TEST; j++) {
val = xbt_heap_maxkey(heap);
xbt_heap_pop(heap);
xbt_heap_push(heap, NULL, 3.0 * val);
}
for (j = 0; j < MAX_TEST; j++) {
val = xbt_heap_maxkey(heap);
xbt_heap_pop(heap);
xbt_heap_push(heap, NULL, 3.0 * val);
}
- date = gras_os_time() - date;
- printf("Mean access time for a %d size heap : %
f
\n", size,
+ date = gras_os_time()
* 1000000
- date;
+ printf("Mean access time for a %d size heap : %
lg
\n", size,
date * 1.0 / (MAX_TEST + 0.0));
xbt_heap_free(heap);
date * 1.0 / (MAX_TEST + 0.0));
xbt_heap_free(heap);