X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_rbtreehash_list.c;h=aef3def7fa7a7f6394d8ba271f5853711945498a;hb=5191b3546cfb6c163228c23f214e325ddf60d46f;hp=66ad332d692e5e1da42755a3d1cafff3b88a79d4;hpb=99099106c3c1cb16ed1e91be970332fe225e278b;p=gnulib.git

diff --git a/lib/gl_rbtreehash_list.c b/lib/gl_rbtreehash_list.c
index 66ad332d6..aef3def7f 100644
--- a/lib/gl_rbtreehash_list.c
+++ b/lib/gl_rbtreehash_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-2013 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,18 @@
    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_rbtreehash_list.h"
 
+#include <stdint.h> /* for SIZE_MAX */
 #include <stdlib.h>
 
 #include "gl_rbtree_oset.h"
-#include "xalloc.h"
 #include "xsize.h"
-#include "size_max.h"
 
 #ifndef uintptr_t
 # define uintptr_t unsigned long
@@ -75,8 +73,8 @@ check_invariants (gl_list_node_t node, gl_list_node_t parent)
   if (!(node->parent == parent))
     abort ();
   if (!(node->branch_size
-	== (node->left != NULL ? node->left->branch_size : 0)
-	   + 1 + (node->right != NULL ? node->right->branch_size : 0)))
+        == (node->left != NULL ? node->left->branch_size : 0)
+           + 1 + (node->right != NULL ? node->right->branch_size : 0)))
     abort ();
   if (!(node->color == BLACK || node->color == RED))
     abort ();
@@ -95,23 +93,24 @@ gl_rbtreehash_list_check_invariants (gl_list_t list)
 }
 
 
-const struct gl_list_implementation gl_avltreehash_list_implementation =
+const struct gl_list_implementation gl_rbtreehash_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_nx_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_add_first,
-    gl_tree_add_last,
-    gl_tree_add_before,
-    gl_tree_add_after,
-    gl_tree_add_at,
+    gl_tree_nx_set_at,
+    gl_tree_search_from_to,
+    gl_tree_indexof_from_to,
+    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,
@@ -121,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_add,
+    gl_tree_sortedlist_indexof_from_to,
+    gl_tree_sortedlist_nx_add,
     gl_tree_sortedlist_remove
   };