Safe Haskell	None
Language	Haskell2010

FCI.Base

Contents

Dictionary types
Default dictionaries

Description

Dictionaries for base classes.

Synopsis

data DictEq a = Eq {
- (|==) :: a -> a -> Bool
- (|/=) :: a -> a -> Bool
}
data DictOrd a = Ord {
- _Eq :: Dict (Eq a)
- _compare :: a -> a -> Ordering
- (|<) :: a -> a -> Bool
- (|<=) :: a -> a -> Bool
- (|>) :: a -> a -> Bool
- (|>=) :: a -> a -> Bool
- _max :: a -> a -> a
- _min :: a -> a -> a
}
data DictSemigroup a = Semigroup {
- (|<>) :: a -> a -> a
- _sconcat :: NonEmpty a -> a
- _stimes :: forall b. Integral b => b -> a -> a
}
data DictMonoid a = Monoid {
- _Semigroup :: Dict (Semigroup a)
- _mempty :: a
- _mappend :: a -> a -> a
- _mconcat :: [a] -> a
}
data DictShow a = Show {
- _showsPrec :: Int -> a -> ShowS
- _show :: a -> String
- _showList :: [a] -> ShowS
}
data DictRead a = Read {
- _readsPrec :: Int -> ReadS a
- _readList :: ReadS [a]
- _readPrec :: ReadPrec a
- _readListPrec :: ReadPrec [a]
}
data DictEnum a = Enum {
- _succ :: a -> a
- _pred :: a -> a
- _toEnum :: Int -> a
- _fromEnum :: a -> Int
- _enumFrom :: a -> [a]
- _enumFromThen :: a -> a -> [a]
- _enumFromTo :: a -> a -> [a]
- _enumFromThenTo :: a -> a -> a -> [a]
}
data DictBounded a = Bounded {
- _minBound :: a
- _maxBound :: a
}
data DictNum a = Num {
- (|+) :: a -> a -> a
- (|-) :: a -> a -> a
- (|*) :: a -> a -> a
- _negate :: a -> a
- _abs :: a -> a
- _signum :: a -> a
- _fromInteger :: Integer -> a
}
data DictReal a = Real {
- _Num :: Dict (Num a)
- _Ord :: Dict (Ord a)
- _toRational :: a -> Rational
}
data DictIntegral a = Integral {
- _Real :: Dict (Real a)
- _Enum :: Dict (Enum a)
- _quot :: a -> a -> a
- _rem :: a -> a -> a
- _div :: a -> a -> a
- _mod :: a -> a -> a
- _quotRem :: a -> a -> (a, a)
- _divMod :: a -> a -> (a, a)
- _toInteger :: a -> Integer
}
data DictFractional a = Fractional {
- _Num :: Dict (Num a)
- (|/) :: a -> a -> a
- _recip :: a -> a
- _fromRational :: Rational -> a
}
data DictFloating a = Floating {
- _Fractional :: Dict (Fractional a)
- _pi :: a
- _exp :: a -> a
- _log :: a -> a
- _sqrt :: a -> a
- (|**) :: a -> a -> a
- _logBase :: a -> a -> a
- _sin :: a -> a
- _cos :: a -> a
- _tan :: a -> a
- _asin :: a -> a
- _acos :: a -> a
- _atan :: a -> a
- _sinh :: a -> a
- _cosh :: a -> a
- _tanh :: a -> a
- _asinh :: a -> a
- _acosh :: a -> a
- _atanh :: a -> a
- _log1p :: a -> a
- _expm1 :: a -> a
- _log1pexp :: a -> a
- _log1mexp :: a -> a
}
data DictRealFrac a = RealFrac {
- _Real :: Dict (Real a)
- _Fractional :: Dict (Fractional a)
- _properFraction :: forall b. Integral b => a -> (b, a)
- _truncate :: forall b. Integral b => a -> b
- _round :: forall b. Integral b => a -> b
- _ceiling :: forall b. Integral b => a -> b
- _floor :: forall b. Integral b => a -> b
}
data DictRealFloat a = RealFloat {
- _RealFrac :: Dict (RealFrac a)
- _Floating :: Dict (Floating a)
- _floatRadix :: a -> Integer
- _floatDigits :: a -> Int
- _floatRange :: a -> (Int, Int)
- _decodeFloat :: a -> (Integer, Int)
- _encodeFloat :: Integer -> Int -> a
- _exponent :: a -> Int
- _significand :: a -> a
- _scaleFloat :: Int -> a -> a
- _isNaN :: a -> Bool
- _isInfinite :: a -> Bool
- _isDenormalized :: a -> Bool
- _isNegativeZero :: a -> Bool
- _isIEEE :: a -> Bool
- _atan2 :: a -> a -> a
}
data DictBits a = Bits {
- _Eq :: Dict (Eq a)
- (|.&.) :: a -> a -> a
- (|.|.) :: a -> a -> a
- _xor :: a -> a -> a
- _complement :: a -> a
- _shift :: a -> Int -> a
- _rotate :: a -> Int -> a
- _zeroBits :: a
- _bit :: Int -> a
- _setBit :: a -> Int -> a
- _clearBit :: a -> Int -> a
- _complementBit :: a -> Int -> a
- _testBit :: a -> Int -> Bool
- _bitSizeMaybe :: a -> Maybe Int
- _bitSize :: a -> Int
- _isSigned :: a -> Bool
- _shiftL :: a -> Int -> a
- _unsafeShiftL :: a -> Int -> a
- _shiftR :: a -> Int -> a
- _unsafeShiftR :: a -> Int -> a
- _rotateL :: a -> Int -> a
- _rotateR :: a -> Int -> a
- _popCount :: a -> Int
}
data DictFiniteBits b = FiniteBits {
- _Bits :: Dict (Bits b)
- _finiteBitSize :: b -> Int
- _countLeadingZeros :: b -> Int
- _countTrailingZeros :: b -> Int
}
data DictIx a = Ix {
- _Ord :: Dict (Ord a)
- _range :: (a, a) -> [a]
- _index :: (a, a) -> a -> Int
- _unsafeIndex :: (a, a) -> a -> Int
- _inRange :: (a, a) -> a -> Bool
- _rangeSize :: (a, a) -> Int
- _unsafeRangeSize :: (a, a) -> Int
}
data DictFunctor (f :: Type -> Type) = Functor {
- _fmap :: forall a b. (a -> b) -> f a -> f b
- (|<$) :: forall a b. a -> f b -> f a
}
data DictContravariant (f :: Type -> Type) = Contravariant {
- _contramap :: forall a' a. (a' -> a) -> f a -> f a'
- (|>$) :: forall b a. b -> f b -> f a
}
data DictApplicative (f :: Type -> Type) = Applicative {
- _Functor :: Dict (Functor f)
- _pure :: forall a. a -> f a
- (|<*>) :: forall a b. f (a -> b) -> f a -> f b
- _liftA2 :: forall a b c. (a -> b -> c) -> f a -> f b -> f c
- (|*>) :: forall a b. f a -> f b -> f b
- (|<*) :: forall a b. f a -> f b -> f a
}
data DictAlternative (f :: Type -> Type) = Alternative {
- _Applicative :: Dict (Applicative f)
- _empty :: forall a. f a
- (|<|>) :: forall a. f a -> f a -> f a
- _some :: forall a. f a -> f [a]
- _many :: forall a. f a -> f [a]
}
data DictMonad (m :: Type -> Type) = Monad {
- _Applicative :: Dict (Applicative m)
- (|>>=) :: forall a b. m a -> (a -> m b) -> m b
- (|>>) :: forall a b. m a -> m b -> m b
- _return :: forall a. a -> m a
}
data DictMonadFail (m :: Type -> Type) = MonadFail {
- _Monad :: Dict (Monad m)
- _fail :: forall a. String -> m a
}
data DictMonadPlus (m :: Type -> Type) = MonadPlus {
- _Alternative :: Dict (Alternative m)
- _Monad :: Dict (Monad m)
- _mzero :: forall a. m a
- _mplus :: forall a. m a -> m a -> m a
}
data DictMonadFix (m :: Type -> Type) = MonadFix {
- _Monad :: Dict (Monad m)
- _mfix :: forall a. (a -> m a) -> m a
}
data DictFoldable (t :: Type -> Type) = Foldable {
- _fold :: forall m. Monoid m => t m -> m
- _foldMap :: forall m a. Monoid m => (a -> m) -> t a -> m
- _foldMap' :: forall m a. Monoid m => (a -> m) -> t a -> m
- _foldr :: forall a b. (a -> b -> b) -> b -> t a -> b
- _foldr' :: forall a b. (a -> b -> b) -> b -> t a -> b
- _foldl :: forall b a. (b -> a -> b) -> b -> t a -> b
- _foldl' :: forall b a. (b -> a -> b) -> b -> t a -> b
- _foldr1 :: forall a. (a -> a -> a) -> t a -> a
- _foldl1 :: forall a. (a -> a -> a) -> t a -> a
- _toList :: forall a. t a -> [a]
- _null :: forall a. t a -> Bool
- _length :: forall a. t a -> Int
- _elem :: forall a. Eq a => a -> t a -> Bool
- _maximum :: forall a. Ord a => t a -> a
- _minimum :: forall a. Ord a => t a -> a
- _sum :: forall a. Num a => t a -> a
- _product :: forall a. Num a => t a -> a
}
data DictTraversable (t :: Type -> Type) = Traversable {
- _Functor :: Dict (Functor t)
- _Foldable :: Dict (Foldable t)
- _traverse :: forall (f :: Type -> Type) a b. Applicative f => (a -> f b) -> t a -> f (t b)
- _sequenceA :: forall (f :: Type -> Type) a. Applicative f => t (f a) -> f (t a)
- _mapM :: forall (m :: Type -> Type) a b. Monad m => (a -> m b) -> t a -> m (t b)
- _sequence :: forall (m :: Type -> Type) a. Monad m => t (m a) -> m (t a)
}
data DictBifunctor (p :: Type -> Type -> Type) = Bifunctor {
- _Functor :: Dict (forall a. Functor (p a))
- _bimap :: forall a b c d. (a -> b) -> (c -> d) -> p a c -> p b d
- _first :: forall a b c. (a -> b) -> p a c -> p b c
- _second :: forall b c a. (b -> c) -> p a b -> p a c
}
data DictBifoldable (p :: Type -> Type -> Type) = Bifoldable {
- _bifold :: forall m. Monoid m => p m m -> m
- _bifoldMap :: forall m a b. Monoid m => (a -> m) -> (b -> m) -> p a b -> m
- _bifoldr :: forall a c b. (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c
- _bifoldl :: forall c a b. (c -> a -> c) -> (c -> b -> c) -> c -> p a b -> c
}
data DictBitraversable (t :: Type -> Type -> Type) = Bitraversable {
- _Bifunctor :: Dict (Bifunctor t)
- _Bifoldable :: Dict (Bifoldable t)
- _bitraverse :: forall (f :: Type -> Type) a c b d. Applicative f => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)
}
data DictException e = Exception {
- _Typeable :: Dict (Typeable e)
- _Show :: Dict (Show e)
- _toException :: e -> SomeException
- _fromException :: SomeException -> Maybe e
- _displayException :: e -> String
}
data DictCategory (cat :: k -> k -> Type) = Category {
- _id :: forall (a :: k). cat a a
- (|.) :: forall (b :: k) (c :: k) (a :: k). cat b c -> cat a b -> cat a c
}
data DictArrow (a :: Type -> Type -> Type) = Arrow {
- _Category :: Dict (Category a)
- _arr :: forall b c. (b -> c) -> a b c
- _first :: forall b c d. a b c -> a (b, d) (c, d)
- _second :: forall b c d. a b c -> a (d, b) (d, c)
- (|***) :: forall b c b' c'. a b c -> a b' c' -> a (b, b') (c, c')
- (|&&&) :: forall b c c'. a b c -> a b c' -> a b (c, c')
}
data DictArrowZero (a :: Type -> Type -> Type) = ArrowZero {
- _Arrow :: Dict (Arrow a)
- _zeroArrow :: forall b c. a b c
}
data DictArrowPlus (a :: Type -> Type -> Type) = ArrowPlus {
- _ArrowZero :: Dict (ArrowZero a)
- (|<+>) :: forall b c. a b c -> a b c -> a b c
}
data DictArrowChoice (a :: Type -> Type -> Type) = ArrowChoice {
- _Arrow :: Dict (Arrow a)
- _left :: forall b c d. a b c -> a (Either b d) (Either c d)
- _right :: forall b c d. a b c -> a (Either d b) (Either d c)
- (|+++) :: forall b c b' c'. a b c -> a b' c' -> a (Either b b') (Either c c')
- (||||) :: forall b d c. a b d -> a c d -> a (Either b c) d
}
data DictArrowApply (a :: Type -> Type -> Type) = ArrowApply {
- _Arrow :: Dict (Arrow a)
- _app :: forall b c. a (a b c, b) c
}
data DictArrowLoop (a :: Type -> Type -> Type) = ArrowLoop {
- _Arrow :: Dict (Arrow a)
- _loop :: forall b d c. a (b, d) (c, d) -> a b c
}
data DictStorable a = Storable {
- _sizeOf :: a -> Int
- _alignment :: a -> Int
- _peekElemOff :: Ptr a -> Int -> IO a
- _pokeElemOff :: Ptr a -> Int -> a -> IO ()
- _peekByteOff :: forall b. Ptr b -> Int -> IO a
- _pokeByteOff :: forall b. Ptr b -> Int -> a -> IO ()
- _peek :: Ptr a -> IO a
- _poke :: Ptr a -> a -> IO ()
}
fmapFunctor :: (forall a b. (a -> b) -> f a -> f b) -> Dict (Functor f)
viaFunctor :: forall (f :: Type -> Type) (g :: Type -> Type). (Coercible f g, Functor f) => Dict (Functor g)
applyApplicative :: (forall a. a -> f a) -> (forall a b. f (a -> b) -> f a -> f b) -> Dict (Applicative f)
liftA2Applicative :: (forall a. a -> f a) -> (forall a b c. (a -> b -> c) -> f a -> f b -> f c) -> Dict (Applicative f)
bindMonad :: (forall a. a -> m a) -> (forall a b. m a -> (a -> m b) -> m b) -> Dict (Monad m)
joinMonad :: (forall a b. (a -> b) -> m a -> m b) -> (forall a. a -> m a) -> (forall a. m (m a) -> m a) -> Dict (Monad m)

Dictionary types

data DictEq a Source #

Dictionary type for Eq

Constructors

Eq
Fields (\|==) :: a -> a -> Bool (\|/=) :: a -> a -> Bool

data DictOrd a Source #

Dictionary type for Ord

Constructors

Ord
Fields _Eq :: Dict (Eq a) _compare :: a -> a -> Ordering (\|<) :: a -> a -> Bool (\|<=) :: a -> a -> Bool (\|>) :: a -> a -> Bool (\|>=) :: a -> a -> Bool _max :: a -> a -> a _min :: a -> a -> a

data DictSemigroup a Source #

Dictionary type for Semigroup

Constructors

Semigroup
Fields (\|<>) :: a -> a -> a _sconcat :: NonEmpty a -> a _stimes :: forall b. Integral b => b -> a -> a

data DictMonoid a Source #

Dictionary type for Monoid

Constructors

Monoid
Fields _Semigroup :: Dict (Semigroup a) _mempty :: a _mappend :: a -> a -> a _mconcat :: [a] -> a

data DictShow a Source #

Dictionary type for Show

Constructors

Show
Fields _showsPrec :: Int -> a -> ShowS _show :: a -> String _showList :: [a] -> ShowS

data DictRead a Source #

Dictionary type for Read

Constructors

Read
Fields _readsPrec :: Int -> ReadS a _readList :: ReadS [a] _readPrec :: ReadPrec a _readListPrec :: ReadPrec [a]

data DictEnum a Source #

Dictionary type for Enum

Constructors

Enum
Fields _succ :: a -> a _pred :: a -> a _toEnum :: Int -> a _fromEnum :: a -> Int _enumFrom :: a -> [a] _enumFromThen :: a -> a -> [a] _enumFromTo :: a -> a -> [a] _enumFromThenTo :: a -> a -> a -> [a]

data DictBounded a Source #

Dictionary type for Bounded

Constructors

Bounded
Fields _minBound :: a _maxBound :: a

data DictNum a Source #

Dictionary type for Num

Constructors

Num
Fields (\|+) :: a -> a -> a (\|-) :: a -> a -> a (\|*) :: a -> a -> a _negate :: a -> a _abs :: a -> a _signum :: a -> a _fromInteger :: Integer -> a

data DictReal a Source #

Dictionary type for Real

Constructors

Real
Fields _Num :: Dict (Num a) _Ord :: Dict (Ord a) _toRational :: a -> Rational

data DictIntegral a Source #

Dictionary type for Integral

Constructors

Integral
Fields _Real :: Dict (Real a) _Enum :: Dict (Enum a) _quot :: a -> a -> a _rem :: a -> a -> a _div :: a -> a -> a _mod :: a -> a -> a _quotRem :: a -> a -> (a, a) _divMod :: a -> a -> (a, a) _toInteger :: a -> Integer

data DictFractional a Source #

Dictionary type for Fractional

Constructors

Fractional
Fields _Num :: Dict (Num a) (\|/) :: a -> a -> a _recip :: a -> a _fromRational :: Rational -> a

data DictFloating a Source #

Dictionary type for Floating

Constructors

Floating

Fields

_Fractional :: Dict (Fractional a)
_pi :: a
_exp :: a -> a
_log :: a -> a
_sqrt :: a -> a
(|**) :: a -> a -> a
_logBase :: a -> a -> a
_sin :: a -> a
_cos :: a -> a
_tan :: a -> a
_asin :: a -> a
_acos :: a -> a
_atan :: a -> a
_sinh :: a -> a
_cosh :: a -> a
_tanh :: a -> a
_asinh :: a -> a
_acosh :: a -> a
_atanh :: a -> a
_log1p :: a -> a
_expm1 :: a -> a
_log1pexp :: a -> a
_log1mexp :: a -> a

data DictRealFrac a Source #

Dictionary type for RealFrac

Constructors

RealFrac
Fields _Real :: Dict (Real a) _Fractional :: Dict (Fractional a) _properFraction :: forall b. Integral b => a -> (b, a) _truncate :: forall b. Integral b => a -> b _round :: forall b. Integral b => a -> b _ceiling :: forall b. Integral b => a -> b _floor :: forall b. Integral b => a -> b

data DictRealFloat a Source #

Dictionary type for RealFloat

Constructors

RealFloat

Fields

_RealFrac :: Dict (RealFrac a)
_Floating :: Dict (Floating a)
_floatRadix :: a -> Integer
_floatDigits :: a -> Int
_floatRange :: a -> (Int, Int)
_decodeFloat :: a -> (Integer, Int)
_encodeFloat :: Integer -> Int -> a
_exponent :: a -> Int
_significand :: a -> a
_scaleFloat :: Int -> a -> a
_isNaN :: a -> Bool
_isInfinite :: a -> Bool
_isDenormalized :: a -> Bool
_isNegativeZero :: a -> Bool
_isIEEE :: a -> Bool
_atan2 :: a -> a -> a

data DictBits a Source #

Dictionary type for Bits

Constructors

Bits

Fields

_Eq :: Dict (Eq a)
(|.&.) :: a -> a -> a
(|.|.) :: a -> a -> a
_xor :: a -> a -> a
_complement :: a -> a
_shift :: a -> Int -> a
_rotate :: a -> Int -> a
_zeroBits :: a
_bit :: Int -> a
_setBit :: a -> Int -> a
_clearBit :: a -> Int -> a
_complementBit :: a -> Int -> a
_testBit :: a -> Int -> Bool
_bitSizeMaybe :: a -> Maybe Int
_bitSize :: a -> Int
_isSigned :: a -> Bool
_shiftL :: a -> Int -> a
_unsafeShiftL :: a -> Int -> a
_shiftR :: a -> Int -> a
_unsafeShiftR :: a -> Int -> a
_rotateL :: a -> Int -> a
_rotateR :: a -> Int -> a
_popCount :: a -> Int

data DictFiniteBits b Source #

Dictionary type for FiniteBits

Constructors

FiniteBits
Fields _Bits :: Dict (Bits b) _finiteBitSize :: b -> Int _countLeadingZeros :: b -> Int _countTrailingZeros :: b -> Int

data DictIx a Source #

Dictionary type for Ix

Constructors

Ix
Fields _Ord :: Dict (Ord a) _range :: (a, a) -> [a] _index :: (a, a) -> a -> Int _unsafeIndex :: (a, a) -> a -> Int _inRange :: (a, a) -> a -> Bool _rangeSize :: (a, a) -> Int _unsafeRangeSize :: (a, a) -> Int

data DictFunctor (f :: Type -> Type) Source #

Dictionary type for Functor

Constructors

Functor
Fields _fmap :: forall a b. (a -> b) -> f a -> f b (\|<$) :: forall a b. a -> f b -> f a

data DictContravariant (f :: Type -> Type) Source #

Dictionary type for Contravariant

Constructors

Contravariant
Fields _contramap :: forall a' a. (a' -> a) -> f a -> f a' (\|>$) :: forall b a. b -> f b -> f a

data DictApplicative (f :: Type -> Type) Source #

Dictionary type for Applicative

Constructors

Applicative
Fields _Functor :: Dict (Functor f) _pure :: forall a. a -> f a (\|<>) :: forall a b. f (a -> b) -> f a -> f b _liftA2 :: forall a b c. (a -> b -> c) -> f a -> f b -> f c (\|>) :: forall a b. f a -> f b -> f b (\|<*) :: forall a b. f a -> f b -> f a

data DictAlternative (f :: Type -> Type) Source #

Dictionary type for Alternative

Constructors

Alternative
Fields _Applicative :: Dict (Applicative f) _empty :: forall a. f a (\|<\|>) :: forall a. f a -> f a -> f a _some :: forall a. f a -> f [a] _many :: forall a. f a -> f [a]

data DictMonad (m :: Type -> Type) Source #

Dictionary type for Monad

Constructors

Monad
Fields _Applicative :: Dict (Applicative m) (\|>>=) :: forall a b. m a -> (a -> m b) -> m b (\|>>) :: forall a b. m a -> m b -> m b _return :: forall a. a -> m a

data DictMonadFail (m :: Type -> Type) Source #

Dictionary type for MonadFail

Constructors

MonadFail
Fields _Monad :: Dict (Monad m) _fail :: forall a. String -> m a

data DictMonadPlus (m :: Type -> Type) Source #

Dictionary type for MonadPlus

Constructors

MonadPlus
Fields _Alternative :: Dict (Alternative m) _Monad :: Dict (Monad m) _mzero :: forall a. m a _mplus :: forall a. m a -> m a -> m a

data DictMonadFix (m :: Type -> Type) Source #

Dictionary type for MonadFix

Constructors

MonadFix
Fields _Monad :: Dict (Monad m) _mfix :: forall a. (a -> m a) -> m a

data DictFoldable (t :: Type -> Type) Source #

Dictionary type for Foldable

Constructors

Foldable

Fields

_fold :: forall m. Monoid m => t m -> m
_foldMap :: forall m a. Monoid m => (a -> m) -> t a -> m
_foldMap' :: forall m a. Monoid m => (a -> m) -> t a -> m
_foldr :: forall a b. (a -> b -> b) -> b -> t a -> b
_foldr' :: forall a b. (a -> b -> b) -> b -> t a -> b
_foldl :: forall b a. (b -> a -> b) -> b -> t a -> b
_foldl' :: forall b a. (b -> a -> b) -> b -> t a -> b
_foldr1 :: forall a. (a -> a -> a) -> t a -> a
_foldl1 :: forall a. (a -> a -> a) -> t a -> a
_toList :: forall a. t a -> [a]
_null :: forall a. t a -> Bool
_length :: forall a. t a -> Int
_elem :: forall a. Eq a => a -> t a -> Bool
_maximum :: forall a. Ord a => t a -> a
_minimum :: forall a. Ord a => t a -> a
_sum :: forall a. Num a => t a -> a
_product :: forall a. Num a => t a -> a

data DictTraversable (t :: Type -> Type) Source #

Dictionary type for Traversable

Constructors

Traversable
Fields _Functor :: Dict (Functor t) _Foldable :: Dict (Foldable t) _traverse :: forall (f :: Type -> Type) a b. Applicative f => (a -> f b) -> t a -> f (t b) _sequenceA :: forall (f :: Type -> Type) a. Applicative f => t (f a) -> f (t a) _mapM :: forall (m :: Type -> Type) a b. Monad m => (a -> m b) -> t a -> m (t b) _sequence :: forall (m :: Type -> Type) a. Monad m => t (m a) -> m (t a)

data DictBifunctor (p :: Type -> Type -> Type) Source #

Dictionary type for Bifunctor

Constructors

Bifunctor
Fields _Functor :: Dict (forall a. Functor (p a)) _bimap :: forall a b c d. (a -> b) -> (c -> d) -> p a c -> p b d _first :: forall a b c. (a -> b) -> p a c -> p b c _second :: forall b c a. (b -> c) -> p a b -> p a c

data DictBifoldable (p :: Type -> Type -> Type) Source #

Dictionary type for Bifoldable

Constructors

Bifoldable
Fields _bifold :: forall m. Monoid m => p m m -> m _bifoldMap :: forall m a b. Monoid m => (a -> m) -> (b -> m) -> p a b -> m _bifoldr :: forall a c b. (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c _bifoldl :: forall c a b. (c -> a -> c) -> (c -> b -> c) -> c -> p a b -> c

data DictBitraversable (t :: Type -> Type -> Type) Source #

Dictionary type for Bitraversable

Constructors

Bitraversable
Fields _Bifunctor :: Dict (Bifunctor t) _Bifoldable :: Dict (Bifoldable t) _bitraverse :: forall (f :: Type -> Type) a c b d. Applicative f => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)

data DictException e Source #

Dictionary type for Exception

Constructors

Exception
Fields _Typeable :: Dict (Typeable e) _Show :: Dict (Show e) _toException :: e -> SomeException _fromException :: SomeException -> Maybe e _displayException :: e -> String

data DictCategory (cat :: k -> k -> Type) Source #

Dictionary type for Category

Constructors

Category
Fields _id :: forall (a :: k). cat a a (\|.) :: forall (b :: k) (c :: k) (a :: k). cat b c -> cat a b -> cat a c

data DictArrow (a :: Type -> Type -> Type) Source #

Dictionary type for Arrow

Constructors

Arrow
Fields _Category :: Dict (Category a) _arr :: forall b c. (b -> c) -> a b c _first :: forall b c d. a b c -> a (b, d) (c, d) _second :: forall b c d. a b c -> a (d, b) (d, c) (\|***) :: forall b c b' c'. a b c -> a b' c' -> a (b, b') (c, c') (\|&&&) :: forall b c c'. a b c -> a b c' -> a b (c, c')

data DictArrowZero (a :: Type -> Type -> Type) Source #

Dictionary type for ArrowZero

Constructors

ArrowZero
Fields _Arrow :: Dict (Arrow a) _zeroArrow :: forall b c. a b c

data DictArrowPlus (a :: Type -> Type -> Type) Source #

Dictionary type for ArrowPlus

Constructors

ArrowPlus
Fields _ArrowZero :: Dict (ArrowZero a) (\|<+>) :: forall b c. a b c -> a b c -> a b c

data DictArrowChoice (a :: Type -> Type -> Type) Source #

Dictionary type for ArrowChoice

Constructors

ArrowChoice
Fields _Arrow :: Dict (Arrow a) _left :: forall b c d. a b c -> a (Either b d) (Either c d) _right :: forall b c d. a b c -> a (Either d b) (Either d c) (\|+++) :: forall b c b' c'. a b c -> a b' c' -> a (Either b b') (Either c c') (\|\|\|\|) :: forall b d c. a b d -> a c d -> a (Either b c) d

data DictArrowApply (a :: Type -> Type -> Type) Source #

Dictionary type for ArrowApply

Constructors

ArrowApply
Fields _Arrow :: Dict (Arrow a) _app :: forall b c. a (a b c, b) c

data DictArrowLoop (a :: Type -> Type -> Type) Source #

Dictionary type for ArrowLoop

Constructors

ArrowLoop
Fields _Arrow :: Dict (Arrow a) _loop :: forall b d c. a (b, d) (c, d) -> a b c

data DictStorable a Source #

Dictionary type for Storable

Constructors

Storable
Fields _sizeOf :: a -> Int _alignment :: a -> Int _peekElemOff :: Ptr a -> Int -> IO a _pokeElemOff :: Ptr a -> Int -> a -> IO () _peekByteOff :: forall b. Ptr b -> Int -> IO a _pokeByteOff :: forall b. Ptr b -> Int -> a -> IO () _peek :: Ptr a -> IO a _poke :: Ptr a -> a -> IO ()

Default dictionaries

fmapFunctor :: (forall a b. (a -> b) -> f a -> f b) -> Dict (Functor f) Source #

Default Functor dictionary requiring only fmap.

viaFunctor :: forall (f :: Type -> Type) (g :: Type -> Type). (Coercible f g, Functor f) => Dict (Functor g) Source #

Functor dictionary for a type coercible to another that has a Functor instance.

This definition is actually quite limited in applicability. A better definition would use the quantified constraint (forall a. Coercible (f a) (g a)).

applyApplicative Source #

Arguments

:: (forall a. a -> f a)	`pure`
-> (forall a b. f (a -> b) -> f a -> f b)	(`<*>`)
-> Dict (Applicative f)

Default Applicative dictionary requiring only pure and (<*>).

liftA2Applicative Source #

Arguments

:: (forall a. a -> f a)	`pure`
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)	`liftA2`
-> Dict (Applicative f)

Default Applicative dictionary requiring only pure and liftA2.

bindMonad Source #

Arguments

:: (forall a. a -> m a)	`return`
-> (forall a b. m a -> (a -> m b) -> m b)	(`>>=`)
-> Dict (Monad m)

Default Monad dictionary requiring only return and (>>=).

joinMonad Source #

Arguments

:: (forall a b. (a -> b) -> m a -> m b)	`fmap`
-> (forall a. a -> m a)	`return`
-> (forall a. m (m a) -> m a)	`join`
-> Dict (Monad m)

Default Monad dictionary requiring only fmap, return, and join.