(original) (raw)

{-# LANGUAGE NoImplicitPrelude #-} {-# OPTIONS_HADDOCK not-home #-}

module GHC.Maybe ( Maybe (..) ) where

import GHC.Num.Integer () import GHC.Classes

default ()

data Maybe a = Nothing | Just a deriving ( Maybe a -> Maybe a -> Bool (Maybe a -> Maybe a -> Bool) -> (Maybe a -> Maybe a -> Bool) -> Eq (Maybe a) forall a. Eq a => Maybe a -> Maybe a -> Bool forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a $c== :: forall a. Eq a => Maybe a -> Maybe a -> Bool == :: Maybe a -> Maybe a -> Bool $c/= :: forall a. Eq a => Maybe a -> Maybe a -> Bool /= :: Maybe a -> Maybe a -> Bool Eq
, Eq (Maybe a) Eq (Maybe a) -> (Maybe a -> Maybe a -> Ordering) -> (Maybe a -> Maybe a -> Bool) -> (Maybe a -> Maybe a -> Bool) -> (Maybe a -> Maybe a -> Bool) -> (Maybe a -> Maybe a -> Bool) -> (Maybe a -> Maybe a -> Maybe a) -> (Maybe a -> Maybe a -> Maybe a) -> Ord (Maybe a) Maybe a -> Maybe a -> Bool Maybe a -> Maybe a -> Maybe a Maybe a -> Maybe a -> Ordering forall a. Eq a -> (a -> a -> Ordering) -> (a -> a -> Bool) -> (a -> a -> Bool) -> (a -> a -> Bool) -> (a -> a -> Bool) -> (a -> a -> a) -> (a -> a -> a) -> Ord a forall {a}. Ord a => Eq (Maybe a) forall a. Ord a => Maybe a -> Maybe a -> Bool forall a. Ord a => Maybe a -> Maybe a -> Maybe a forall a. Ord a => Maybe a -> Maybe a -> Ordering $ccompare :: forall a. Ord a => Maybe a -> Maybe a -> Ordering compare :: Maybe a -> Maybe a -> Ordering $c< :: forall a. Ord a => Maybe a -> Maybe a -> Bool < :: Maybe a -> Maybe a -> Bool $c<= :: forall a. Ord a => Maybe a -> Maybe a -> Bool <= :: Maybe a -> Maybe a -> Bool $c> :: forall a. Ord a => Maybe a -> Maybe a -> Bool

:: Maybe a -> Maybe a -> Bool $c>= :: forall a. Ord a => Maybe a -> Maybe a -> Bool = :: Maybe a -> Maybe a -> Bool $cmax :: forall a. Ord a => Maybe a -> Maybe a -> Maybe a max :: Maybe a -> Maybe a -> Maybe a $cmin :: forall a. Ord a => Maybe a -> Maybe a -> Maybe a min :: Maybe a -> Maybe a -> Maybe a Ord )