Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.BinP

Contents

Conversions
Showing
Extras
Aliases

Description

Positive binary natural numbers, BinP .

This module is designed to be imported qualified.

Synopsis

data BinP
- = BE
- | B0 BinP
- | B1 BinP
cata :: a -> (a -> a) -> (a -> a) -> BinP -> a
toNatural :: BinP -> Natural
fromNatural :: Natural -> BinP
toNat :: BinP -> Nat
explicitShow :: BinP -> String
explicitShowsPrec :: Int -> BinP -> ShowS
predMaybe :: BinP -> Maybe BinP
binP1 :: BinP
binP2 :: BinP
binP3 :: BinP
binP4 :: BinP
binP5 :: BinP
binP6 :: BinP
binP7 :: BinP
binP8 :: BinP
binP9 :: BinP

Documentation

data BinP Source #

Non-zero binary natural numbers.

We could have called this type Bin1 , but that's used as type alias for promoted BP BE in Data.Type.Bin .

Constructors

BE	one
B0 BinP	mult2
B1 BinP	mult2 plus 1

Instances

Instances details

Enum BinP Source #
Instance details Defined in Data.BinP Methods succ :: BinP -> BinP Source # pred :: BinP -> BinP Source # toEnum :: Int -> BinP Source # fromEnum :: BinP -> Int Source # enumFrom :: BinP -> [ BinP ] Source # enumFromThen :: BinP -> BinP -> [ BinP ] Source # enumFromTo :: BinP -> BinP -> [ BinP ] Source # enumFromThenTo :: BinP -> BinP -> BinP -> [ BinP ] Source #
Eq BinP Source #
Instance details Defined in Data.BinP Methods (==) :: BinP -> BinP -> Bool Source # (/=) :: BinP -> BinP -> Bool Source #
Integral BinP Source #
Instance details Defined in Data.BinP Methods quot :: BinP -> BinP -> BinP Source # rem :: BinP -> BinP -> BinP Source # div :: BinP -> BinP -> BinP Source # mod :: BinP -> BinP -> BinP Source # quotRem :: BinP -> BinP -> ( BinP , BinP ) Source # divMod :: BinP -> BinP -> ( BinP , BinP ) Source # toInteger :: BinP -> Integer Source #
Data BinP Source #
Instance details Defined in Data.BinP Methods gfoldl :: ( forall d b. Data d => c (d -> b) -> d -> c b) -> ( forall g. g -> c g) -> BinP -> c BinP Source # gunfold :: ( forall b r. Data b => c (b -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c BinP Source # toConstr :: BinP -> Constr Source # dataTypeOf :: BinP -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c BinP ) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c BinP ) Source # gmapT :: ( forall b. Data b => b -> b) -> BinP -> BinP Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> BinP -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> BinP -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> BinP -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> BinP -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> BinP -> m BinP Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> BinP -> m BinP Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> BinP -> m BinP Source #
Num BinP Source #
Instance details Defined in Data.BinP Methods (+) :: BinP -> BinP -> BinP Source # (-) :: BinP -> BinP -> BinP Source # (*) :: BinP -> BinP -> BinP Source # negate :: BinP -> BinP Source # abs :: BinP -> BinP Source # signum :: BinP -> BinP Source # fromInteger :: Integer -> BinP Source #
Ord BinP Source #	`>>>` `sort [1 .. 9 :: BinP]`[1,2,3,4,5,6,7,8,9]
Instance details Defined in Data.BinP Methods compare :: BinP -> BinP -> Ordering Source # (<) :: BinP -> BinP -> Bool Source # (<=) :: BinP -> BinP -> Bool Source # (>) :: BinP -> BinP -> Bool Source # (>=) :: BinP -> BinP -> Bool Source # max :: BinP -> BinP -> BinP Source # min :: BinP -> BinP -> BinP Source #
Real BinP Source #
Instance details Defined in Data.BinP Methods toRational :: BinP -> Rational Source #
Show BinP Source #
Instance details Defined in Data.BinP Methods showsPrec :: Int -> BinP -> ShowS Source # show :: BinP -> String Source # showList :: [ BinP ] -> ShowS Source #
Function BinP Source #
Instance details Defined in Data.BinP Methods function :: ( BinP -> b) -> BinP :-> b Source #
Arbitrary BinP Source #
Instance details Defined in Data.BinP Methods arbitrary :: Gen BinP Source # shrink :: BinP -> [ BinP ] Source #
CoArbitrary BinP Source #
Instance details Defined in Data.BinP Methods coarbitrary :: BinP -> Gen b -> Gen b Source #
Bits BinP Source #	NOTE : `.&.` , `xor` , `shiftR` and `rotateR` are __NOT_ implemented. They may make number zero.
Instance details Defined in Data.BinP Methods (.&.) :: BinP -> BinP -> BinP Source # (.\|.) :: BinP -> BinP -> BinP Source # xor :: BinP -> BinP -> BinP Source # complement :: BinP -> BinP Source # shift :: BinP -> Int -> BinP Source # rotate :: BinP -> Int -> BinP Source # zeroBits :: BinP Source # bit :: Int -> BinP Source # setBit :: BinP -> Int -> BinP Source # clearBit :: BinP -> Int -> BinP Source # complementBit :: BinP -> Int -> BinP Source # testBit :: BinP -> Int -> Bool Source # bitSizeMaybe :: BinP -> Maybe Int Source # bitSize :: BinP -> Int Source # isSigned :: BinP -> Bool Source # shiftL :: BinP -> Int -> BinP Source # unsafeShiftL :: BinP -> Int -> BinP Source # shiftR :: BinP -> Int -> BinP Source # unsafeShiftR :: BinP -> Int -> BinP Source # rotateL :: BinP -> Int -> BinP Source # rotateR :: BinP -> Int -> BinP Source # popCount :: BinP -> Int Source #
NFData BinP Source #
Instance details Defined in Data.BinP Methods rnf :: BinP -> () Source #
Hashable BinP Source #
Instance details Defined in Data.BinP Methods hashWithSalt :: Int -> BinP -> Int Source # hash :: BinP -> Int Source #
TestEquality SBinP Source #
Instance details Defined in Data.Type.BinP Methods testEquality :: forall (a :: k) (b :: k). SBinP a -> SBinP b -> Maybe (a :~: b) Source #