|
Org.Org.Semantic.HBase.Basic.BitList |
|
|
|
|
|
Synopsis |
|
|
|
Documentation |
|
class Eq a => BitList a where |
A type that represents a list of bits. | | Methods | bitFalse :: a | All bits clear. | | bitTrue :: a | All bits set. | | bitNot :: a -> a | Invert all bits. | | bitAnd :: a -> a -> a | 'And' all bits. | | bitOr :: a -> a -> a | 'Or' all bits. | | bitXor :: a -> a -> a | 'Xor' all bits. | | bitSingleZero :: a | Only bit zero ("lowest") set. | | bitSingle :: Integer -> a | Only one bit set. | | bitSingleNot :: Integer -> a -> a | Invert a single bit. | | bitSingleSet :: Integer -> a -> Bool -> a | Set/clear a single bit. | | bitSingleGet :: Integer -> a -> Bool | Get a single bit. | | bitShift :: Integer -> a -> a | Shift bits up (positive) or down (negative), with new bits cleared. |
| | Instances | |
|
|
(.&.) :: BitList a => a -> a -> a |
Same as bitAnd. |
|
(.|.) :: BitList a => a -> a -> a |
Same as bitOr. |
|
bitShiftL :: BitList a => Integer -> a -> a |
Same as bitShift. |
|
bitShiftR :: BitList a => Integer -> a -> a |
Same as bitShift with negated argument. |
|
class BitList a => FiniteBitList a where |
A type that represents a fixed-length list of bits. | | Methods | bitSize :: Type a -> Integer | The number of bits. | | bitRotate :: Integer -> a -> a | Rotate bits up (positive) or down (negative). |
| | Instances | |
|
|
bitRotateL :: FiniteBitList a => Integer -> a -> a |
Same as bitRotate. |
|
bitRotateR :: FiniteBitList a => Integer -> a -> a |
Same as bitRotate with negated argument. |
|
Produced by Haddock version 0.6 |