Safe Haskell | Safe-Inferred |
---|---|

Language | Haskell2010 |

# Documentation

#### Instances

Foldable Maybe Source # | |

Defined in GHC.Data.Strict fold :: Monoid m => Maybe m -> m Source # foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source # foldr :: (a -> b -> b) -> b -> Maybe a -> b Source # foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source # foldl :: (b -> a -> b) -> b -> Maybe a -> b Source # foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source # foldr1 :: (a -> a -> a) -> Maybe a -> a Source # foldl1 :: (a -> a -> a) -> Maybe a -> a Source # toList :: Maybe a -> [a] Source # null :: Maybe a -> Bool Source # length :: Maybe a -> Int Source # elem :: Eq a => a -> Maybe a -> Bool Source # maximum :: Ord a => Maybe a -> a Source # minimum :: Ord a => Maybe a -> a Source # | |

Traversable Maybe Source # | |

Alternative Maybe Source # | |

Applicative Maybe Source # | |

Functor Maybe Source # | |

Data a => Data (Maybe a) Source # | |

Defined in GHC.Data.Strict gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) Source # toConstr :: Maybe a -> Constr Source # dataTypeOf :: Maybe a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe0 (c (Maybe a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe0 (c (Maybe a)) Source # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # | |

Semigroup a => Monoid (Maybe a) Source # | |

Semigroup a => Semigroup (Maybe a) Source # | |

Show a => Show (Maybe a) Source # | |

Binary a => Binary (Maybe a) Source # | |

Eq a => Eq (Maybe a) Source # | |

Ord a => Ord (Maybe a) Source # | |

!a `And` !b |

#### Instances

Foldable (Pair a) Source # | |

Defined in GHC.Data.Strict fold :: Monoid m => Pair a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Pair a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Pair a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Pair a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Pair a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Pair a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Pair a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Pair a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Pair a a0 -> a0 Source # toList :: Pair a a0 -> [a0] Source # null :: Pair a a0 -> Bool Source # length :: Pair a a0 -> Int Source # elem :: Eq a0 => a0 -> Pair a a0 -> Bool Source # maximum :: Ord a0 => Pair a a0 -> a0 Source # minimum :: Ord a0 => Pair a a0 -> a0 Source # | |

Traversable (Pair a) Source # | |

Defined in GHC.Data.Strict | |

Functor (Pair a) Source # | |

(Data a, Data b) => Data (Pair a b) Source # | |

Defined in GHC.Data.Strict gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Pair a b -> c (Pair a b) Source # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pair a b) Source # toConstr :: Pair a b -> Constr Source # dataTypeOf :: Pair a b -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Pair a b)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pair a b)) Source # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Pair a b -> Pair a b Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pair a b -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pair a b -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Pair a b -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Pair a b -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pair a b -> m (Pair a b) Source # | |

(Show a, Show b) => Show (Pair a b) Source # | |

(Eq a, Eq b) => Eq (Pair a b) Source # | |

(Ord a, Ord b) => Ord (Pair a b) Source # | |

Defined in GHC.Data.Strict |