BitPalindrom2.hs

module BitPalindrome2 where

-- import Control.Arrow (second)
import CLaSH.Prelude

-- This function will be in `clash-prelude-0.10.1`
bv2v :: KnownNat n => BitVector n -> Vec n Bit
bv2v = unpack

evenPalindrome :: (Eq a,KnownNat m)
               => Vec (2*m) a
               -> Bool
evenPalindrome v = l == reverse r
  where
    (l,r) = splitAtI v

topEntity :: BitVector 8 -> Bool
topEntity = evenPalindrome . bv2v

-- pointFreePalindrome :: (Eq a,KnownNat m)
--                     => Vec (2*m) a
--                     -> Bool
-- pointFreePalindrome = uncurry (==) . second reverse . splitAtI

-- topEntity :: BitVector 8 -> Bool
-- topEntity = pointFreePalindrome . bv2v