X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_anyrbtree_list1.h;h=5cbbf4e4922a1662161e819ee3047ee2c6e0c6ae;hb=533101a268dc5015a140ff4695d8eeb04fbe57b6;hp=fcd1474ea221e6a6bb67f1edc2e23975a0780155;hpb=57fdfd3f8ec62b105c53bcdf6f127c35c7fe7391;p=gnulib.git

diff --git a/lib/gl_anyrbtree_list1.h b/lib/gl_anyrbtree_list1.h
index fcd1474ea..5cbbf4e49 100644
--- a/lib/gl_anyrbtree_list1.h
+++ b/lib/gl_anyrbtree_list1.h
@@ -1,5 +1,5 @@
 /* Sequential list data type implemented by a binary tree.
-   Copyright (C) 2006 Free Software Foundation, Inc.
+   Copyright (C) 2006, 2009-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
@@ -27,7 +27,7 @@
    Let's call this the "black-height" bh of the tree.  It follows that every
    such path contains exactly bh black and between 0 and bh red nodes.  (The
    extreme cases are a path containing only black nodes, and a path colored
-   alternatingly black-red-black-red-...-black-red.)  The height of the tree
+   alternately black-red-black-red-...-black-red.)  The height of the tree
    therefore is >= bh, <= 2*bh.
  */
 
@@ -51,7 +51,7 @@ struct gl_list_node_impl
   struct gl_list_node_impl *parent;
   color_t color;                    /* node's color */
   size_t branch_size;               /* number of nodes in this branch,
-				       = branchsize(left)+branchsize(right)+1 */
+                                       = branchsize(left)+branchsize(right)+1 */
   const void *value;
 };