alg-0.2.5.0: Algebraic structures

Safe HaskellNone
LanguageHaskell2010

Data.BitSet

Documentation

newtype BitSet a #

Constructors

BitSet 

Fields

Instances
Eq a => Eq (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

(==) :: BitSet a -> BitSet a -> Bool #

(/=) :: BitSet a -> BitSet a -> Bool #

Read a => Read (BitSet a) # 
Instance details

Defined in Data.BitSet

Show a => Show (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

showsPrec :: Int -> BitSet a -> ShowS #

show :: BitSet a -> String #

showList :: [BitSet a] -> ShowS #

Bits a => Semigroup (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

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

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

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

Bits a => Monoid (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

mempty :: BitSet a #

mappend :: BitSet a -> BitSet a -> BitSet a #

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

Bits a => Bits (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

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

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

xor :: BitSet a -> BitSet a -> BitSet a #

complement :: BitSet a -> BitSet a #

shift :: BitSet a -> Int -> BitSet a #

rotate :: BitSet a -> Int -> BitSet a #

zeroBits :: BitSet a #

bit :: Int -> BitSet a #

setBit :: BitSet a -> Int -> BitSet a #

clearBit :: BitSet a -> Int -> BitSet a #

complementBit :: BitSet a -> Int -> BitSet a #

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

bitSizeMaybe :: BitSet a -> Maybe Int #

bitSize :: BitSet a -> Int #

isSigned :: BitSet a -> Bool #

shiftL :: BitSet a -> Int -> BitSet a #

unsafeShiftL :: BitSet a -> Int -> BitSet a #

shiftR :: BitSet a -> Int -> BitSet a #

unsafeShiftR :: BitSet a -> Int -> BitSet a #

rotateL :: BitSet a -> Int -> BitSet a #

rotateR :: BitSet a -> Int -> BitSet a #

popCount :: BitSet a -> Int #

FiniteBits a => FiniteBits (BitSet a) # 
Instance details

Defined in Data.BitSet

Bits a => Group (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

invert :: BitSet a -> BitSet a #

Bits a => Abelian (BitSet a) # 
Instance details

Defined in Data.BitSet

Bits a => PartialOrd (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

tryCompare :: BitSet a -> BitSet a -> Maybe Ordering #

Bits a => Eq (BitSet a) # 
Instance details

Defined in Data.BitSet

Bits a => PartialEq (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

(≡) :: BitSet a -> BitSet a -> Bool #

(≢) :: BitSet a -> BitSet a -> Bool #

Bits a => Preord (BitSet a) # 
Instance details

Defined in Data.BitSet

Methods

(≤) :: BitSet a -> BitSet a -> Bool #

(≥) :: BitSet a -> BitSet a -> Bool #

(<) :: BitSet a -> BitSet a -> Bool #

(>) :: BitSet a -> BitSet a -> Bool #

rangeInclusive :: (PartialOrd a, Bits a, Alternative f) => a -> a -> f a #

(.&?¬) :: (PartialOrd a, Bits a) => a -> a -> Maybe a #