X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_avltreehash_list.c;h=23152e35540c1dd997869a9a9670617324bb5908;hb=2dd0ce390ad930bc0ff5d10b766f8953308590aa;hp=33f56fe7411dc32988a410647d9a75df22a83c73;hpb=441aa3044f43e5572f58c354f01e6bc070acd5c7;p=gnulib.git diff --git a/lib/gl_avltreehash_list.c b/lib/gl_avltreehash_list.c index 33f56fe74..23152e355 100644 --- a/lib/gl_avltreehash_list.c +++ b/lib/gl_avltreehash_list.c @@ -1,5 +1,5 @@ /* Sequential list data type implemented by a hash table with a binary tree. - Copyright (C) 2006, 2008 Free Software Foundation, Inc. + Copyright (C) 2006, 2008-2011 Free Software Foundation, Inc. Written by Bruno Haible , 2006. This program is free software: you can redistribute it and/or modify @@ -24,7 +24,6 @@ #include #include "gl_avltree_oset.h" -#include "xalloc.h" #include "xsize.h" #ifndef uintptr_t @@ -95,22 +94,22 @@ gl_avltreehash_list_check_invariants (gl_list_t list) const struct gl_list_implementation gl_avltreehash_list_implementation = { - gl_tree_create_empty, - gl_tree_create, + gl_tree_nx_create_empty, + gl_tree_nx_create, gl_tree_size, gl_tree_node_value, - gl_tree_node_set_value, + gl_tree_node_nx_set_value, gl_tree_next_node, gl_tree_previous_node, gl_tree_get_at, - gl_tree_set_at, + gl_tree_nx_set_at, gl_tree_search_from_to, gl_tree_indexof_from_to, - gl_tree_add_first, - gl_tree_add_last, - gl_tree_add_before, - gl_tree_add_after, - gl_tree_add_at, + gl_tree_nx_add_first, + gl_tree_nx_add_last, + gl_tree_nx_add_before, + gl_tree_nx_add_after, + gl_tree_nx_add_at, gl_tree_remove_node, gl_tree_remove_at, gl_tree_remove, @@ -123,6 +122,6 @@ const struct gl_list_implementation gl_avltreehash_list_implementation = gl_tree_sortedlist_search_from_to, gl_tree_sortedlist_indexof, gl_tree_sortedlist_indexof_from_to, - gl_tree_sortedlist_add, + gl_tree_sortedlist_nx_add, gl_tree_sortedlist_remove };