{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}
module HaskellWorks.Data.Bits.Broadword.Word32
( h
, l
, kBitDiff
, kBitDiffPos
, kBitDiffUnsafe
) where
import Data.Word
import HaskellWorks.Data.Bits.BitWise
l :: Int -> Word32
l :: Int -> Word32
l Int
2 = Word32
0x55555555
l Int
4 = Word32
0x11111111
l Int
8 = Word32
0x01010101
l Int
16 = Word32
0x00010001
l Int
32 = Word32
0x00000001
l Int
k = [Char] -> Word32
forall a. HasCallStack => [Char] -> a
error ([Char]
"Invalid h k where k = " [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
k)
{-# INLINE l #-}
h :: Int -> Word32
h :: Int -> Word32
h Int
2 = Word32
0xaaaaaaaa
h Int
4 = Word32
0x88888888
h Int
8 = Word32
0x80808080
h Int
16 = Word32
0x80008000
h Int
32 = Word32
0x80000000
h Int
k = [Char] -> Word32
forall a. HasCallStack => [Char] -> a
error ([Char]
"Invalid h k where k = " [Char] -> [Char] -> [Char]
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
k)
{-# INLINE h #-}
kBitDiff :: Int -> Word32 -> Word32 -> Word32
kBitDiff :: Int -> Word32 -> Word32 -> Word32
kBitDiff Int
k Word32
x Word32
y = ((Word32
x Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.|. Int -> Word32
h Int
k) Word32 -> Word32 -> Word32
forall a. Num a => a -> a -> a
- (Word32
y Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.&. Word32 -> Word32
forall a. BitWise a => a -> a
comp (Int -> Word32
h Int
k))) Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.^. ((Word32
x Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.^. Word32 -> Word32
forall a. BitWise a => a -> a
comp Word32
y) Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.&. Int -> Word32
h Int
k)
{-# INLINE kBitDiff #-}
kBitDiffPos :: Int -> Word32 -> Word32 -> Word32
kBitDiffPos :: Int -> Word32 -> Word32 -> Word32
kBitDiffPos Int
k Word32
x Word32
y =
let d :: Word32
d = Int -> Word32 -> Word32 -> Word32
kBitDiff Int
k Word32
x Word32
y in
let s :: Word32
s = Int -> Word32 -> Word32 -> Word32
kBitDiff Int
k Word32
0 ((Word32 -> Word32
forall a. BitWise a => a -> a
comp Word32
d Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.&. Int -> Word32
h Int
k) Word32 -> Count -> Word32
forall a. Shift a => a -> Count -> a
.>. Int -> Count
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Int
k Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
1)) in
let r :: Word32
r = Word32
d Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.&. Word32
s in
Word32
r
{-# INLINE kBitDiffPos #-}
kBitDiffUnsafe :: Int -> Word32 -> Word32 -> Word32
kBitDiffUnsafe :: Int -> Word32 -> Word32 -> Word32
kBitDiffUnsafe Int
k Word32
x Word32
y = ((Word32
x Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.|. Int -> Word32
h Int
k) Word32 -> Word32 -> Word32
forall a. Num a => a -> a -> a
- Word32
y) Word32 -> Word32 -> Word32
forall a. BitWise a => a -> a -> a
.^. Int -> Word32
h Int
k
{-# INLINE kBitDiffUnsafe #-}