{ 455139366 } [ "asdf" 0 <murmur3-32> checksum-bytes ] unit-test
{ 417250299 } [ "asdf" 156 <murmur3-32> checksum-bytes ] unit-test
-{ -392455434 } [ "abcde" 0 <murmur3-32> checksum-bytes ] unit-test
-{ -1850534962 } [ "12345678" 0 <murmur3-32> checksum-bytes ] unit-test
-{ -1710454456 } [ "12345678" 156 <murmur3-32> checksum-bytes ] unit-test
-{ -734568571 } [ "hello, world!!!" 156 <murmur3-32> checksum-bytes ] unit-test
+{ 3902511862 } [ "abcde" 0 <murmur3-32> checksum-bytes ] unit-test
+{ 2517562459 } [ "abcde" 156 <murmur3-32> checksum-bytes ] unit-test
+{ 2444432334 } [ "12345678" 0 <murmur3-32> checksum-bytes ] unit-test
+{ 2584512840 } [ "12345678" 156 <murmur3-32> checksum-bytes ] unit-test
+{ 3560398725 } [ "hello, world!!!" 156 <murmur3-32> checksum-bytes ] unit-test
! Copyright (C) 2013 John Benediktsson.
! See http://factorcode.org/license.txt for BSD license.
+
USING: accessors checksums fry grouping io.binary kernel math
math.bitwise sequences ;
+
IN: checksums.murmur
TUPLE: murmur3-32 seed ;
[ be> (hash-chunk) bitxor bitxor 32-bit ] bi*
[ -16 shift ] [ bitxor 0x85ebca6b * 32-bit ] bi
[ -13 shift ] [ bitxor 0xc2b2ae35 * 32-bit ] bi
- [ -16 shift ] [ bitxor 32 >signed ] bi ;
+ [ -16 shift ] [ bitxor ] bi ;
INSTANCE: murmur3-32 checksum