Safe Haskell	Trustworthy
Language	Haskell2010

Data.Orphans

Contents

Orphan instances

Description

Exports orphan instances that mimic instances available in later versions of base. To use them, simply import Data.Orphans ().

Orphan instances

TestEquality f => TestEquality (Compose f g :: k1 -> Type) Source #
Instance details Methods testEquality :: Compose f g a -> Compose f g b -> Maybe (a :~: b)
IsList (ZipList a) Source #
Instance details Associated Types type Item (ZipList a) :: Type Methods fromList :: [Item (ZipList a)] -> ZipList a fromListN :: Int -> [Item (ZipList a)] -> ZipList a toList :: ZipList a -> [Item (ZipList a)]
Bounded a => Bounded (Down a) Source #
Instance details Methods minBound :: Down a maxBound :: Down a
Enum a => Enum (Down a) Source #
Instance details Methods succ :: Down a -> Down a pred :: Down a -> Down a toEnum :: Int -> Down a fromEnum :: Down a -> Int enumFrom :: Down a -> [Down a] enumFromThen :: Down a -> Down a -> [Down a] enumFromTo :: Down a -> Down a -> [Down a] enumFromThenTo :: Down a -> Down a -> Down a -> [Down a]
Floating a => Floating (Down a) Source #
Instance details Methods pi :: Down a exp :: Down a -> Down a log :: Down a -> Down a sqrt :: Down a -> Down a (**) :: Down a -> Down a -> Down a logBase :: Down a -> Down a -> Down a sin :: Down a -> Down a cos :: Down a -> Down a tan :: Down a -> Down a asin :: Down a -> Down a acos :: Down a -> Down a atan :: Down a -> Down a sinh :: Down a -> Down a cosh :: Down a -> Down a tanh :: Down a -> Down a asinh :: Down a -> Down a acosh :: Down a -> Down a atanh :: Down a -> Down a log1p :: Down a -> Down a expm1 :: Down a -> Down a log1pexp :: Down a -> Down a log1mexp :: Down a -> Down a
Fractional a => Fractional (Down a) Source #
Instance details Methods (/) :: Down a -> Down a -> Down a recip :: Down a -> Down a fromRational :: Rational -> Down a
Integral a => Integral (Down a) Source #
Instance details Methods quot :: Down a -> Down a -> Down a rem :: Down a -> Down a -> Down a div :: Down a -> Down a -> Down a mod :: Down a -> Down a -> Down a quotRem :: Down a -> Down a -> (Down a, Down a) divMod :: Down a -> Down a -> (Down a, Down a) toInteger :: Down a -> Integer
Data a => Data (ZipList a) Source #
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ZipList a -> c (ZipList a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ZipList a) toConstr :: ZipList a -> Constr dataTypeOf :: ZipList a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ZipList a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ZipList a)) gmapT :: (forall b. Data b => b -> b) -> ZipList a -> ZipList a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ZipList a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ZipList a -> r gmapQ :: (forall d. Data d => d -> u) -> ZipList a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ZipList a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ZipList a -> m (ZipList a)
Real a => Real (Down a) Source #
Instance details Methods toRational :: Down a -> Rational
RealFloat a => RealFloat (Down a) Source #
Instance details Methods floatRadix :: Down a -> Integer floatDigits :: Down a -> Int floatRange :: Down a -> (Int, Int) decodeFloat :: Down a -> (Integer, Int) encodeFloat :: Integer -> Int -> Down a exponent :: Down a -> Int significand :: Down a -> Down a scaleFloat :: Int -> Down a -> Down a isNaN :: Down a -> Bool isInfinite :: Down a -> Bool isDenormalized :: Down a -> Bool isNegativeZero :: Down a -> Bool isIEEE :: Down a -> Bool atan2 :: Down a -> Down a -> Down a
RealFrac a => RealFrac (Down a) Source #
Instance details Methods properFraction :: Integral b => Down a -> (b, Down a) truncate :: Integral b => Down a -> b round :: Integral b => Down a -> b ceiling :: Integral b => Down a -> b floor :: Integral b => Down a -> b
Ix a => Ix (Down a) Source #
Instance details Methods range :: (Down a, Down a) -> [Down a] index :: (Down a, Down a) -> Down a -> Int unsafeIndex :: (Down a, Down a) -> Down a -> Int inRange :: (Down a, Down a) -> Down a -> Bool rangeSize :: (Down a, Down a) -> Int unsafeRangeSize :: (Down a, Down a) -> Int
Bits a => Bits (Down a) Source #
Instance details Methods (.&.) :: Down a -> Down a -> Down a (.\|.) :: Down a -> Down a -> Down a xor :: Down a -> Down a -> Down a complement :: Down a -> Down a shift :: Down a -> Int -> Down a rotate :: Down a -> Int -> Down a zeroBits :: Down a bit :: Int -> Down a setBit :: Down a -> Int -> Down a clearBit :: Down a -> Int -> Down a complementBit :: Down a -> Int -> Down a testBit :: Down a -> Int -> Bool bitSizeMaybe :: Down a -> Maybe Int bitSize :: Down a -> Int isSigned :: Down a -> Bool shiftL :: Down a -> Int -> Down a unsafeShiftL :: Down a -> Int -> Down a shiftR :: Down a -> Int -> Down a unsafeShiftR :: Down a -> Int -> Down a rotateL :: Down a -> Int -> Down a rotateR :: Down a -> Int -> Down a popCount :: Down a -> Int
FiniteBits a => FiniteBits (Down a) Source #
Instance details Methods finiteBitSize :: Down a -> Int countLeadingZeros :: Down a -> Int countTrailingZeros :: Down a -> Int
Storable a => Storable (Down a) Source #
Instance details Methods sizeOf :: Down a -> Int alignment :: Down a -> Int peekElemOff :: Ptr (Down a) -> Int -> IO (Down a) pokeElemOff :: Ptr (Down a) -> Int -> Down a -> IO () peekByteOff :: Ptr b -> Int -> IO (Down a) pokeByteOff :: Ptr b -> Int -> Down a -> IO () peek :: Ptr (Down a) -> IO (Down a) poke :: Ptr (Down a) -> Down a -> IO ()
(Monoid a, Monoid b) => Monad ((,,) a b) Source #
Instance details Methods (>>=) :: (a, b, a0) -> (a0 -> (a, b, b0)) -> (a, b, b0) (>>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) return :: a0 -> (a, b, a0) fail :: String -> (a, b, a0)
Monad m => Monad (Kleisli m a) Source #
Instance details Methods (>>=) :: Kleisli m a a0 -> (a0 -> Kleisli m a b) -> Kleisli m a b (>>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b return :: a0 -> Kleisli m a a0 fail :: String -> Kleisli m a a0
(Typeable1 m, Typeable a, Data (m a)) => Data (WrappedMonad m a) Source #
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WrappedMonad m a -> c (WrappedMonad m a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WrappedMonad m a) toConstr :: WrappedMonad m a -> Constr dataTypeOf :: WrappedMonad m a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WrappedMonad m a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WrappedMonad m a)) gmapT :: (forall b. Data b => b -> b) -> WrappedMonad m a -> WrappedMonad m a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonad m a -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonad m a -> r gmapQ :: (forall d. Data d => d -> u) -> WrappedMonad m a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedMonad m a -> u gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a) gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a) gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonad m a -> m0 (WrappedMonad m a)
Functor ((,,) a b) Source #
Instance details Methods fmap :: (a0 -> b0) -> (a, b, a0) -> (a, b, b0) (<$) :: a0 -> (a, b, b0) -> (a, b, a0)
Functor m => Functor (Kleisli m a) Source #
Instance details Methods fmap :: (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b (<$) :: a0 -> Kleisli m a b -> Kleisli m a a0
(Monoid a, Monoid b) => Applicative ((,,) a b) Source #
Instance details Methods pure :: a0 -> (a, b, a0) (<>) :: (a, b, a0 -> b0) -> (a, b, a0) -> (a, b, b0) liftA2 :: (a0 -> b0 -> c) -> (a, b, a0) -> (a, b, b0) -> (a, b, c) (>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) (<*) :: (a, b, a0) -> (a, b, b0) -> (a, b, a0)
Applicative m => Applicative (Kleisli m a) Source #
Instance details Methods pure :: a0 -> Kleisli m a a0 (<>) :: Kleisli m a (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b liftA2 :: (a0 -> b -> c) -> Kleisli m a a0 -> Kleisli m a b -> Kleisli m a c (>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b (<*) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a a0
Alternative m => Alternative (Kleisli m a) Source #
Instance details Methods empty :: Kleisli m a a0 (<\|>) :: Kleisli m a a0 -> Kleisli m a a0 -> Kleisli m a a0 some :: Kleisli m a a0 -> Kleisli m a [a0] many :: Kleisli m a a0 -> Kleisli m a [a0]
MonadPlus m => MonadPlus (Kleisli m a) Source #
Instance details Methods mzero :: Kleisli m a a0 mplus :: Kleisli m a a0 -> Kleisli m a a0 -> Kleisli m a a0
(Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) Source #
Instance details Methods (>>=) :: (a, b, c, a0) -> (a0 -> (a, b, c, b0)) -> (a, b, c, b0) (>>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) return :: a0 -> (a, b, c, a0) fail :: String -> (a, b, c, a0)
(Typeable2 a, Typeable b, Typeable c, Data (a b c)) => Data (WrappedArrow a b c) Source #
Instance details Methods gfoldl :: (forall d b0. Data d => c0 (d -> b0) -> d -> c0 b0) -> (forall g. g -> c0 g) -> WrappedArrow a b c -> c0 (WrappedArrow a b c) gunfold :: (forall b0 r. Data b0 => c0 (b0 -> r) -> c0 r) -> (forall r. r -> c0 r) -> Constr -> c0 (WrappedArrow a b c) toConstr :: WrappedArrow a b c -> Constr dataTypeOf :: WrappedArrow a b c -> DataType dataCast1 :: Typeable t => (forall d. Data d => c0 (t d)) -> Maybe (c0 (WrappedArrow a b c)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c0 (t d e)) -> Maybe (c0 (WrappedArrow a b c)) gmapT :: (forall b0. Data b0 => b0 -> b0) -> WrappedArrow a b c -> WrappedArrow a b c gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedArrow a b c -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedArrow a b c -> r gmapQ :: (forall d. Data d => d -> u) -> WrappedArrow a b c -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedArrow a b c -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> WrappedArrow a b c -> m (WrappedArrow a b c)
Functor ((,,,) a b c) Source #
Instance details Methods fmap :: (a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) (<$) :: a0 -> (a, b, c, b0) -> (a, b, c, a0)
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) Source #
Instance details Methods pure :: a0 -> (a, b, c, a0) (<>) :: (a, b, c, a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) liftA2 :: (a0 -> b0 -> c0) -> (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, c0) (>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) (<*) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, a0)