1.1 --- a/lemon/radix_sort.h	Tue Dec 02 23:15:43 2008 +0100
     1.2 +++ b/lemon/radix_sort.h	Thu Jan 08 17:10:42 2009 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2008
     1.8 + * Copyright (C) 2003-2009
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -348,7 +348,7 @@
    1.13                                       sizeof(Value) - 1, functor);
    1.14            std::copy(buffer + length, buffer + 2 * length, first);
    1.15          }        else {
    1.16 -          signedStableRadixIntroSort(buffer + length, buffer + 2 * length, 
    1.17 +          signedStableRadixIntroSort(buffer + length, buffer + 2 * length,
    1.18                                       buffer, sizeof(Value) - 1, functor);
    1.19            std::copy(buffer, buffer + length, first);
    1.20          }
    1.21 @@ -360,7 +360,7 @@
    1.22      }
    1.23  
    1.24      template <typename Value, typename Iterator, typename Functor>
    1.25 -    void stableRadixUnsignedSort(Iterator first, Iterator last, 
    1.26 +    void stableRadixUnsignedSort(Iterator first, Iterator last,
    1.27                                   Functor functor) {
    1.28        if (first == last) return;
    1.29        typedef typename std::iterator_traits<Iterator>::value_type Key;