combinators: faster hashcode for byte-arrays.

diff --git a/core/combinators/combinators.factor b/core/combinators/combinators.factor
index c1fef4287a13346af065d4bcb881c6643a0d6959..4e44dfe5ae121b40755453858c8ebdaab31d9ec8 100644 (file)
--- a/core/combinators/combinators.factor
+++ b/core/combinators/combinators.factor
@@ -1,8 +1,8 @@
 ! Copyright (C) 2006, 2010 Slava Pestov, Daniel Ehrenberg.
 ! See http://factorcode.org/license.txt for BSD license.
-USING: accessors arrays assocs hashtables kernel kernel.private
-make math math.order math.private quotations sequences
-sequences.private sets sorting words ;
+USING: accessors arrays assocs byte-arrays hashtables kernel
+kernel.private make math math.order math.private quotations
+sequences sequences.private sets sorting words ;
 IN: combinators
 
 ! Most of these combinators have compile-time expansions in
@@ -198,6 +198,8 @@ M: sequence hashcode* [ sequence-hashcode ] recursive-hashcode ;
 
 M: array hashcode* [ sequence-hashcode ] recursive-hashcode ;
 
+M: byte-array hashcode* [ sequence-hashcode ] recursive-hashcode ;
+
 M: reversed hashcode* [ sequence-hashcode ] recursive-hashcode ;
 
 M: slice hashcode* [ sequence-hashcode ] recursive-hashcode ;