X-Git-Url: http://erislabs.net/gitweb/?a=blobdiff_plain;f=lib%2Fgl_rbtree_oset.c;h=a94c14d17655025fcc49ce50aba7fb644eee0751;hb=96f023c5e537dd4afbdb294de7065f65effe3eb2;hp=11fdec35e694cf9ca199432c0862b73553cab6f7;hpb=8fe59d16da6be1fbd1a3a9e507d620bd381b00da;p=gnulib.git

diff --git a/lib/gl_rbtree_oset.c b/lib/gl_rbtree_oset.c
index 11fdec35e..a94c14d17 100644
--- a/lib/gl_rbtree_oset.c
+++ b/lib/gl_rbtree_oset.c
@@ -1,5 +1,5 @@
 /* Ordered set data type implemented by a binary tree.
-   Copyright (C) 2006-2007, 2009 Free Software Foundation, Inc.
+   Copyright (C) 2006-2007, 2009-2012 Free Software Foundation, Inc.
    Written by Bruno Haible <bruno@clisp.org>, 2006.
 
    This program is free software: you can redistribute it and/or modify
@@ -32,7 +32,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.
  */