X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=tests%2Ftest-avltreehash_list.c;h=33afdf2072d80ee8e1bf42ece9b16ea5c7ceca21;hb=977389d936eb39475d8540651074ab48fcfd85a1;hp=12a716ade648e0e01d1d3f270f2c4b2122859de0;hpb=766d4f1de6c26bb084382524eaed00b45ab3112c;p=gnulib.git diff --git a/tests/test-avltreehash_list.c b/tests/test-avltreehash_list.c index 12a716ade..33afdf207 100644 --- a/tests/test-avltreehash_list.c +++ b/tests/test-avltreehash_list.c @@ -1,5 +1,5 @@ /* Test of sequential list data type implementation. - Copyright (C) 2006-2009 Free Software Foundation, Inc. + Copyright (C) 2006-2011 Free Software Foundation, Inc. Written by Bruno Haible , 2006. This program is free software: you can redistribute it and/or modify @@ -20,12 +20,12 @@ #include "gl_avltreehash_list.h" #include -#include #include #include #include "gl_array_list.h" #include "progname.h" +#include "macros.h" extern void gl_avltreehash_list_check_invariants (gl_list_t list); @@ -59,18 +59,6 @@ string_hash (const void *x) return h; } -#define SIZEOF(array) (sizeof (array) / sizeof (array[0])) -#define ASSERT(expr) \ - do \ - { \ - if (!(expr)) \ - { \ - fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \ - fflush (stderr); \ - abort (); \ - } \ - } \ - while (0) #define RANDOM(n) (rand () % (n)) #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]