{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}
module HaskellWorks.Data.Bits.Broadword.Word16
( h
, l
, kBitDiff
, kBitDiffPos
, kBitDiffUnsafe
) where
import Data.Word
import HaskellWorks.Data.Bits.BitWise
l :: Int -> Word16
l :: Int -> Word16
l Int
2 = Word16
0x5555
l Int
4 = Word16
0x1111
l Int
8 = Word16
0x0101
l Int
16 = Word16
0x0001
l Int
k = [Char] -> Word16
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 -> Word16
h :: Int -> Word16
h Int
2 = Word16
0xaaaa
h Int
4 = Word16
0x8888
h Int
8 = Word16
0x8080
h Int
16 = Word16
0x8000
h Int
k = [Char] -> Word16
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 -> Word16 -> Word16 -> Word16
kBitDiff :: Int -> Word16 -> Word16 -> Word16
kBitDiff Int
k Word16
x Word16
y = ((Word16
x Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.|. Int -> Word16
h Int
k) Word16 -> Word16 -> Word16
forall a. Num a => a -> a -> a
- (Word16
y Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.&. Word16 -> Word16
forall a. BitWise a => a -> a
comp (Int -> Word16
h Int
k))) Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.^. ((Word16
x Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.^. Word16 -> Word16
forall a. BitWise a => a -> a
comp Word16
y) Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.&. Int -> Word16
h Int
k)
{-# INLINE kBitDiff #-}
kBitDiffPos :: Int -> Word16 -> Word16 -> Word16
kBitDiffPos :: Int -> Word16 -> Word16 -> Word16
kBitDiffPos Int
k Word16
x Word16
y =
let d :: Word16
d = Int -> Word16 -> Word16 -> Word16
kBitDiff Int
k Word16
x Word16
y in
let s :: Word16
s = Int -> Word16 -> Word16 -> Word16
kBitDiff Int
k Word16
0 ((Word16 -> Word16
forall a. BitWise a => a -> a
comp Word16
d Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.&. Int -> Word16
h Int
k) Word16 -> Count -> Word16
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 :: Word16
r = Word16
d Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.&. Word16
s in
Word16
r
{-# INLINE kBitDiffPos #-}
kBitDiffUnsafe :: Int -> Word16 -> Word16 -> Word16
kBitDiffUnsafe :: Int -> Word16 -> Word16 -> Word16
kBitDiffUnsafe Int
k Word16
x Word16
y = ((Word16
x Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.|. Int -> Word16
h Int
k) Word16 -> Word16 -> Word16
forall a. Num a => a -> a -> a
- Word16
y) Word16 -> Word16 -> Word16
forall a. BitWise a => a -> a -> a
.^. Int -> Word16
h Int
k
{-# INLINE kBitDiffUnsafe #-}