X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_avltreehash_list.c;h=ef739fca215bc4a964058b4069e2c3a509466b0c;hb=cb9819cbb9261bd50c3466cf0a4cd873f0d7ebd7;hp=d076e947f16620505699e0dfe43ee96df9771f3a;hpb=99099106c3c1cb16ed1e91be970332fe225e278b;p=gnulib.git

diff --git a/lib/gl_avltreehash_list.c b/lib/gl_avltreehash_list.c
index d076e947f..ef739fca2 100644
--- a/lib/gl_avltreehash_list.c
+++ b/lib/gl_avltreehash_list.c
@@ -1,11 +1,11 @@
 /* Sequential list data type implemented by a hash table with a binary tree.
-   Copyright (C) 2006 Free Software Foundation, Inc.
+   Copyright (C) 2006, 2008 Free Software Foundation, Inc.
    Written by Bruno Haible <bruno@clisp.org>, 2006.
 
-   This program is free software; you can redistribute it and/or modify
+   This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
-   the Free Software Foundation; either version 2, or (at your option)
-   any later version.
+   the Free Software Foundation; either version 3 of the License, or
+   (at your option) any later version.
 
    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -13,20 +13,19 @@
    GNU General Public License for more details.
 
    You should have received a copy of the GNU General Public License
-   along with this program; if not, write to the Free Software Foundation,
-   Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.  */
+   along with this program.  If not, see <http://www.gnu.org/licenses/>.  */
 
 #include <config.h>
 
 /* Specification.  */
 #include "gl_avltreehash_list.h"
 
+#include <stdint.h> /* for SIZE_MAX */
 #include <stdlib.h>
 
 #include "gl_avltree_oset.h"
 #include "xalloc.h"
 #include "xsize.h"
-#include "size_max.h"
 
 #ifndef uintptr_t
 # define uintptr_t unsigned long
@@ -100,12 +99,13 @@ const struct gl_list_implementation gl_avltreehash_list_implementation =
     gl_tree_create,
     gl_tree_size,
     gl_tree_node_value,
+    gl_tree_node_set_value,
     gl_tree_next_node,
     gl_tree_previous_node,
     gl_tree_get_at,
     gl_tree_set_at,
-    gl_tree_search,
-    gl_tree_indexof,
+    gl_tree_search_from_to,
+    gl_tree_indexof_from_to,
     gl_tree_add_first,
     gl_tree_add_last,
     gl_tree_add_before,
@@ -120,7 +120,9 @@ const struct gl_list_implementation gl_avltreehash_list_implementation =
     gl_tree_iterator_next,
     gl_tree_iterator_free,
     gl_tree_sortedlist_search,
+    gl_tree_sortedlist_search_from_to,
     gl_tree_sortedlist_indexof,
+    gl_tree_sortedlist_indexof_from_to,
     gl_tree_sortedlist_add,
     gl_tree_sortedlist_remove
   };