X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;ds=sidebyside;f=lib%2Fsorter%2Fs-radix.h;h=289f255d69b96996d21612b050bb9f0cb621b617;hb=5f2e7e93768113f1e80ac2502e670632762fb696;hp=c83d6049996df7ead4ea2f59002f2c33115a86a3;hpb=e65a1a48088af1a5731f64b50ba933f4c29d5040;p=libucw.git

diff --git a/lib/sorter/s-radix.h b/lib/sorter/s-radix.h
index c83d6049..289f255d 100644
--- a/lib/sorter/s-radix.h
+++ b/lib/sorter/s-radix.h
@@ -7,8 +7,6 @@
  *	of the GNU Lesser General Public License.
  */
 
-/* FIXME: This is a very trivial implementation so far. Use fbdirect and such things to speed up. */
-
 #include <string.h>
 
 static void P(radix_split)(struct sort_context *ctx UNUSED, struct sort_bucket *bin, struct sort_bucket **bouts, uns bitpos, uns numbits)
@@ -23,7 +21,7 @@ static void P(radix_split)(struct sort_context *ctx UNUSED, struct sort_bucket *
 
   while (P(read_key)(in, &k))
     {
-      uns h = P(hash)(&k);
+      P(hash_t) h = P(hash)(&k);
       uns i = (h >> bitpos) & mask;
       if (unlikely(!outs[i]))
 	outs[i] = sbuck_write(bouts[i]);