Copyright | (c) 2016 Stephen Diehl (c) 2016-2018 Serokell (c) 2018-2023 Kowainik |
---|---|
License | MIT |
Maintainer | Kowainik <xrom.xkov@gmail.com> |
Stability | Stable |
Portability | Portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Relude.Functor.Reexport
Documentation
class (forall a. Functor (p a)) => Bifunctor (p :: Type -> Type -> Type) where #
class Functor (f :: Type -> Type) where #
Minimal complete definition
Instances
newtype Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) #
Constructors
Compose | |
Fields
|
Instances
TestEquality f => TestEquality (Compose f g :: k2 -> Type) | |
Defined in Data.Functor.Compose Methods testEquality :: forall (a :: k) (b :: k). Compose f g a -> Compose f g b -> Maybe (a :~: b) | |
Functor f => Generic1 (Compose f g :: k -> Type) | |
(Foldable f, Foldable g) => Foldable (Compose f g) | |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b foldl :: (b -> a -> b) -> b -> Compose f g a -> b foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a foldl1 :: (a -> a -> a) -> Compose f g a -> a toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool maximum :: Ord a => Compose f g a -> a minimum :: Ord a => Compose f g a -> a | |
(Eq1 f, Eq1 g) => Eq1 (Compose f g) | |
(Ord1 f, Ord1 g) => Ord1 (Compose f g) | |
Defined in Data.Functor.Compose Methods liftCompare :: (a -> b -> Ordering) -> Compose f g a -> Compose f g b -> Ordering | |
(Read1 f, Read1 g) => Read1 (Compose f g) | |
Defined in Data.Functor.Compose Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Compose f g a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Compose f g a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Compose f g a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Compose f g a] | |
(Show1 f, Show1 g) => Show1 (Compose f g) | |
Defined in Data.Functor.Compose Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Compose f g a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Compose f g a] -> ShowS | |
(Functor f, Contravariant g) => Contravariant (Compose f g) | |
(Traversable f, Traversable g) => Traversable (Compose f g) | |
Defined in Data.Functor.Compose | |
(Alternative f, Applicative g) => Alternative (Compose f g) | |
(Applicative f, Applicative g) => Applicative (Compose f g) | |
Defined in Data.Functor.Compose | |
(Functor f, Functor g) => Functor (Compose f g) | |
(NFData1 f, NFData1 g) => NFData1 (Compose f g) | |
Defined in Control.DeepSeq | |
(Hashable1 f, Hashable1 g) => Hashable1 (Compose f g) | |
Defined in Data.Hashable.Class | |
(Foldable1 f, Foldable1 g) => Foldable1 (Compose f g) Source # | Since: 0.3.0 |
Defined in Relude.Extra.Foldable1 Methods foldMap1 :: Semigroup m => (a -> m) -> Compose f g a -> m Source # fold1 :: Semigroup m => Compose f g m -> m Source # foldr1 :: (a -> b -> b) -> b -> Compose f g a -> b Source # toNonEmpty :: Compose f g a -> NonEmpty a Source # head1 :: Compose f g a -> a Source # last1 :: Compose f g a -> a Source # maximum1 :: Ord a => Compose f g a -> a Source # minimum1 :: Ord a => Compose f g a -> a Source # maximumOn1 :: Ord b => (a -> b) -> Compose f g a -> a Source # minimumOn1 :: Ord b => (a -> b) -> Compose f g a -> a Source # | |
(Typeable a, Typeable f, Typeable g, Typeable k1, Typeable k2, Data (f (g a))) => Data (Compose f g a) | |
Defined in Data.Functor.Compose Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> Compose f g a -> c (Compose f g a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Compose f g a) toConstr :: Compose f g a -> Constr dataTypeOf :: Compose f g a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Compose f g a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Compose f g a)) gmapT :: (forall b. Data b => b -> b) -> Compose f g a -> Compose f g a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r gmapQ :: (forall d. Data d => d -> u) -> Compose f g a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Compose f g a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) | |
Monoid (f (g a)) => Monoid (Compose f g a) | |
Semigroup (f (g a)) => Semigroup (Compose f g a) | |
Generic (Compose f g a) | |
Read (f (g a)) => Read (Compose f g a) | |
Defined in Data.Functor.Compose | |
Show (f (g a)) => Show (Compose f g a) | |
(NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a) | |
Defined in Control.DeepSeq | |
Eq (f (g a)) => Eq (Compose f g a) | |
Ord (f (g a)) => Ord (Compose f g a) | |
Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |
(Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a) | |
Defined in Data.Hashable.Class | |
type Rep1 (Compose f g :: k -> Type) | |
type Rep (Compose f g a) | |
Defined in Data.Functor.Compose |
Constructors
Identity | |
Fields
|
Instances
class Contravariant (f :: Type -> Type) where #
Minimal complete definition
Instances
newtype Comparison a #
Constructors
Comparison | |
Fields
|
Instances
Contravariant Comparison | |
Defined in Data.Functor.Contravariant Methods contramap :: (a' -> a) -> Comparison a -> Comparison a' # (>$) :: b -> Comparison b -> Comparison a # | |
Monoid (Comparison a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
Semigroup (Comparison a) | |
Defined in Data.Functor.Contravariant Methods (<>) :: Comparison a -> Comparison a -> Comparison a # sconcat :: NonEmpty (Comparison a) -> Comparison a # stimes :: Integral b => b -> Comparison a -> Comparison a # |
newtype Equivalence a #
Constructors
Equivalence | |
Fields
|
Instances
Contravariant Equivalence | |
Defined in Data.Functor.Contravariant Methods contramap :: (a' -> a) -> Equivalence a -> Equivalence a' # (>$) :: b -> Equivalence b -> Equivalence a # | |
Monoid (Equivalence a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
Semigroup (Equivalence a) | |
Defined in Data.Functor.Contravariant Methods (<>) :: Equivalence a -> Equivalence a -> Equivalence a # sconcat :: NonEmpty (Equivalence a) -> Equivalence a # stimes :: Integral b => b -> Equivalence a -> Equivalence a # |
Instances
Category Op | |
Contravariant (Op a) | |
Monoid a => Monoid (Op a b) | |
Semigroup a => Semigroup (Op a b) | |
Floating a => Floating (Op a b) | |
Num a => Num (Op a b) | |
Fractional a => Fractional (Op a b) | |
Constructors
Predicate | |
Fields
|
comparisonEquivalence :: Comparison a -> Equivalence a #
defaultComparison :: Ord a => Comparison a #
defaultEquivalence :: Eq a => Equivalence a #
phantom :: (Functor f, Contravariant f) => f a -> f b #
($<) :: Contravariant f => f b -> b -> f a #
(>$$<) :: Contravariant f => f b -> (a -> b) -> f a #
(>$<) :: Contravariant f => (a -> b) -> f b -> f a #