break iconv.m4 sync

[gnulib.git] / tests / test-rbtreehash_list.c

diff --git a/tests/test-rbtreehash_list.c b/tests/test-rbtreehash_list.c
index c8a572c..7a0cf96 100644 (file)
--- a/tests/test-rbtreehash_list.c
+++ b/tests/test-rbtreehash_list.c
@@ -1,5 +1,5 @@
 /* Test of sequential list data type implementation.
-   Copyright (C) 2006 Free Software Foundation, Inc.
+   Copyright (C) 2006-2007 Free Software Foundation, Inc.
    Written by Bruno Haible <bruno@clisp.org>, 2006.
 
    This program is free software; you can redistribute it and/or modify
@@ -20,12 +20,14 @@
 # include <config.h>
 #endif
 
+#include "gl_rbtreehash_list.h"
+
 #include <limits.h>
 #include <stdlib.h>
 #include <string.h>
 
 #include "gl_array_list.h"
-#include "gl_rbtreehash_list.h"
+#include "progname.h"
 
 extern void gl_rbtreehash_list_check_invariants (gl_list_t list);
 
@@ -91,6 +93,8 @@ main (int argc, char *argv[])
 {
   gl_list_t list1, list2, list3;
 
+  set_program_name (argv[0]);
+
   /* Allow the user to provide a non-default random seed on the command line.  */
   if (argc > 1)
     srand (atoi (argv[1]));
@@ -107,17 +111,17 @@ main (int argc, char *argv[])
 
     /* Create list1.  */
     list1 = gl_list_create (GL_ARRAY_LIST,
-                            string_equals, string_hash, true,
+                            string_equals, string_hash, NULL, true,
                             initial_size, contents);
     /* Create list2.  */
     list2 = gl_list_create_empty (GL_RBTREEHASH_LIST,
-                                  string_equals, string_hash, true);
+                                  string_equals, string_hash, NULL, true);
     for (i = 0; i < initial_size; i++)
       gl_list_add_last (list2, contents[i]);
 
     /* Create list3.  */
     list3 = gl_list_create (GL_RBTREEHASH_LIST,
-                            string_equals, string_hash, true,
+                            string_equals, string_hash, NULL, true,
                             initial_size, contents);
 
     check_all (list1, list2, list3);