Copyright	(c) 2019 Yann Herklotz Grave
License	GPL-3
Maintainer	yann [at] yannherklotz [dot] com
Stability	experimental
Portability	POSIX
Safe Haskell	Safe-Inferred
Language	Haskell2010

Verismith.Verilog.BitVec

Description

Unsigned BitVec implementation.

Synopsis

data BitVecF a = BitVec {
- width :: !Int
- value :: !a
}
type BitVec = BitVecF Integer
bitVec :: (Num a, Bits a) => Int -> a -> BitVecF a
select :: (Integral a, Bits a, Integral b, Bits b) => BitVecF a -> (BitVecF b, BitVecF b) -> BitVecF a

Documentation

data BitVecF a Source #

Bit Vector that stores the bits in an arbitrary container together with the size.

Constructors

BitVec
Fields width :: !Int value :: !a

Instances

Instances details

Foldable BitVecF Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

fold :: Monoid m => BitVecF m -> m #

foldMap :: Monoid m => (a -> m) -> BitVecF a -> m #

foldMap' :: Monoid m => (a -> m) -> BitVecF a -> m #

foldr :: (a -> b -> b) -> b -> BitVecF a -> b #

foldr' :: (a -> b -> b) -> b -> BitVecF a -> b #

foldl :: (b -> a -> b) -> b -> BitVecF a -> b #

foldl' :: (b -> a -> b) -> b -> BitVecF a -> b #

foldr1 :: (a -> a -> a) -> BitVecF a -> a #

foldl1 :: (a -> a -> a) -> BitVecF a -> a #

toList :: BitVecF a -> [a] #

null :: BitVecF a -> Bool #

length :: BitVecF a -> Int #

elem :: Eq a => a -> BitVecF a -> Bool #

maximum :: Ord a => BitVecF a -> a #

minimum :: Ord a => BitVecF a -> a #

sum :: Num a => BitVecF a -> a #

product :: Num a => BitVecF a -> a #

Traversable BitVecF Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

traverse :: Applicative f => (a -> f b) -> BitVecF a -> f (BitVecF b) #

sequenceA :: Applicative f => BitVecF (f a) -> f (BitVecF a) #

mapM :: Monad m => (a -> m b) -> BitVecF a -> m (BitVecF b) #

sequence :: Monad m => BitVecF (m a) -> m (BitVecF a) #

Functor BitVecF Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

fmap :: (a -> b) -> BitVecF a -> BitVecF b #

(<$) :: a -> BitVecF b -> BitVecF a #

Data a => Data (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BitVecF a -> c (BitVecF a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BitVecF a) #

toConstr :: BitVecF a -> Constr #

dataTypeOf :: BitVecF a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BitVecF a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BitVecF a)) #

gmapT :: (forall b. Data b => b -> b) -> BitVecF a -> BitVecF a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BitVecF a -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BitVecF a -> r #

gmapQ :: (forall d. Data d => d -> u) -> BitVecF a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> BitVecF a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BitVecF a -> m (BitVecF a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BitVecF a -> m (BitVecF a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BitVecF a -> m (BitVecF a) #

Bits a => Monoid (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

mempty :: BitVecF a #

mappend :: BitVecF a -> BitVecF a -> BitVecF a #

mconcat :: [BitVecF a] -> BitVecF a #

Bits a => Semigroup (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

(<>) :: BitVecF a -> BitVecF a -> BitVecF a #

sconcat :: NonEmpty (BitVecF a) -> BitVecF a #

stimes :: Integral b => b -> BitVecF a -> BitVecF a #

(Num a, Bits a) => Bits (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

(.&.) :: BitVecF a -> BitVecF a -> BitVecF a #

(.|.) :: BitVecF a -> BitVecF a -> BitVecF a #

xor :: BitVecF a -> BitVecF a -> BitVecF a #

complement :: BitVecF a -> BitVecF a #

shift :: BitVecF a -> Int -> BitVecF a #

rotate :: BitVecF a -> Int -> BitVecF a #

zeroBits :: BitVecF a #

bit :: Int -> BitVecF a #

setBit :: BitVecF a -> Int -> BitVecF a #

clearBit :: BitVecF a -> Int -> BitVecF a #

complementBit :: BitVecF a -> Int -> BitVecF a #

testBit :: BitVecF a -> Int -> Bool #

bitSizeMaybe :: BitVecF a -> Maybe Int #

bitSize :: BitVecF a -> Int #

isSigned :: BitVecF a -> Bool #

shiftL :: BitVecF a -> Int -> BitVecF a #

unsafeShiftL :: BitVecF a -> Int -> BitVecF a #

shiftR :: BitVecF a -> Int -> BitVecF a #

unsafeShiftR :: BitVecF a -> Int -> BitVecF a #

rotateL :: BitVecF a -> Int -> BitVecF a #

rotateR :: BitVecF a -> Int -> BitVecF a #

popCount :: BitVecF a -> Int #

(Num a, Bits a) => FiniteBits (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

finiteBitSize :: BitVecF a -> Int #

countLeadingZeros :: BitVecF a -> Int #

countTrailingZeros :: BitVecF a -> Int #

Enum a => Enum (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Methods

succ :: BitVecF a -> BitVecF a #

pred :: BitVecF a -> BitVecF a #

toEnum :: Int -> BitVecF a #

fromEnum :: BitVecF a -> Int #

enumFrom :: BitVecF a -> [BitVecF a] #

enumFromThen :: BitVecF a -> BitVecF a -> [BitVecF a] #

enumFromTo :: BitVecF a -> BitVecF a -> [BitVecF a] #

enumFromThenTo :: BitVecF a -> BitVecF a -> BitVecF a -> [BitVecF a] #

Generic (BitVecF a) Source #

Instance details

Defined in Verismith.Verilog.BitVec

Associated Types

type Rep (BitVecF a)
Instance details Defined in Verismith.Verilog.BitVec type Rep (BitVecF a) = D1 ('MetaData "BitVecF" "Verismith.Verilog.BitVec" "verismith-1.1.0-FUTsgQc3KWmLTdTSx0Se1T" 'False) (C1 ('MetaCons "BitVec" 'PrefixI 'True) (S1 ('MetaSel ('Just "width") 'SourceUnpack 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Just "value") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))