Safe Haskell | Trustworthy |
---|---|
Language | Haskell2010 |
Exports orphan instances that mimic instances available in later versions of base
.
To use them, simply import Data.Orphans ()
.
Orphan instances
MonadFix Down Source # | |
Foldable Down Source # | |
fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
Traversable Down Source # | |
Eq1 Down Source # | |
Ord1 Down Source # | |
Read1 Down Source # | |
Show1 Down Source # | |
MonadZip Down Source # | |
Data a => Data (Down a) Source # | |
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Down a -> c (Down a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Down a) # toConstr :: Down a -> Constr # dataTypeOf :: Down a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Down a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a)) # gmapT :: (forall b. Data b => b -> b) -> Down a -> Down a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r # gmapQ :: (forall d. Data d => d -> u) -> Down a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Down a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # | |
Semigroup p => Semigroup (Par1 p) Source # | |
Monoid p => Monoid (Par1 p) Source # | |
Foldable f => Foldable (Alt f) Source # | |
fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
Traversable f => Traversable (Alt f) Source # | |
Semigroup (V1 p) Source # | |
Semigroup (U1 p) Source # | |
Monoid (U1 p) Source # | |
Monoid c => Applicative (K1 i c :: * -> *) Source # | |
Semigroup (f p) => Semigroup (Rec1 f p) Source # | |
Monoid (f p) => Monoid (Rec1 f p) Source # | |
Semigroup c => Semigroup (K1 i c p) Source # | |
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) Source # | |
Monoid c => Monoid (K1 i c p) Source # | |
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) Source # | |
Semigroup (f p) => Semigroup (M1 i c f p) Source # | |
Semigroup (f (g p)) => Semigroup ((f :.: g) p) Source # | |
Monoid (f p) => Monoid (M1 i c f p) Source # | |
Monoid (f (g p)) => Monoid ((f :.: g) p) Source # | |