    {-# LANGUAGE DeriveDataTypeable #-}
    --------------------------------------------------------------------------------
    -- |
    -- Module      : Network.OpenID.Types
    -- Copyright   : (c) Trevor Elliott, 2008
    -- License     : BSD3
    --
    -- Maintainer  : Trevor Elliott <trevor@geekgateway.com>
    -- Stability   :
    -- Portability :
    --

    module OpenId2.Types (
        Provider (..)
      , Identifier (..)
      , IdentType (..)
      , AuthenticateException (..)
      ) where

    -- Libraries
    import Data.Data (Data)
    import Data.Typeable (Typeable)
    import Web.Authenticate.Internal
    import Data.Text (Text)

    -- | An OpenID provider.
    newtype Provider = Provider { Provider -> Text
    providerURI :: Text } deriving (Provider -> Provider -> Bool
    (Provider -> Provider -> Bool)
    -> (Provider -> Provider -> Bool) -> Eq Provider
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: Provider -> Provider -> Bool
    == :: Provider -> Provider -> Bool
    $c/= :: Provider -> Provider -> Bool
    /= :: Provider -> Provider -> Bool
    Eq,Int -> Provider -> ShowS
    [Provider] -> ShowS
    Provider -> String
    (Int -> Provider -> ShowS)
    -> (Provider -> String) -> ([Provider] -> ShowS) -> Show Provider
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    $cshowsPrec :: Int -> Provider -> ShowS
    showsPrec :: Int -> Provider -> ShowS
    $cshow :: Provider -> String
    show :: Provider -> String
    $cshowList :: [Provider] -> ShowS
    showList :: [Provider] -> ShowS
    Show)

    -- | A valid OpenID identifier.
    newtype Identifier = Identifier { Identifier -> Text
    identifier :: Text }
        deriving (Identifier -> Identifier -> Bool
    (Identifier -> Identifier -> Bool)
    -> (Identifier -> Identifier -> Bool) -> Eq Identifier
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: Identifier -> Identifier -> Bool
    == :: Identifier -> Identifier -> Bool
    $c/= :: Identifier -> Identifier -> Bool
    /= :: Identifier -> Identifier -> Bool
    Eq, Eq Identifier
    Eq Identifier =>
    (Identifier -> Identifier -> Ordering)
    -> (Identifier -> Identifier -> Bool)
    -> (Identifier -> Identifier -> Bool)
    -> (Identifier -> Identifier -> Bool)
    -> (Identifier -> Identifier -> Bool)
    -> (Identifier -> Identifier -> Identifier)
    -> (Identifier -> Identifier -> Identifier)
    -> Ord Identifier
    Identifier -> Identifier -> Bool
    Identifier -> Identifier -> Ordering
    Identifier -> Identifier -> Identifier
    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
    $ccompare :: Identifier -> Identifier -> Ordering
    compare :: Identifier -> Identifier -> Ordering
    $c< :: Identifier -> Identifier -> Bool
    < :: Identifier -> Identifier -> Bool
    $c<= :: Identifier -> Identifier -> Bool
    <= :: Identifier -> Identifier -> Bool
    $c> :: Identifier -> Identifier -> Bool
    > :: Identifier -> Identifier -> Bool
    $c>= :: Identifier -> Identifier -> Bool
    >= :: Identifier -> Identifier -> Bool
    $cmax :: Identifier -> Identifier -> Identifier
    max :: Identifier -> Identifier -> Identifier
    $cmin :: Identifier -> Identifier -> Identifier
    min :: Identifier -> Identifier -> Identifier
    Ord, Int -> Identifier -> ShowS
    [Identifier] -> ShowS
    Identifier -> String
    (Int -> Identifier -> ShowS)
    -> (Identifier -> String)
    -> ([Identifier] -> ShowS)
    -> Show Identifier
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    $cshowsPrec :: Int -> Identifier -> ShowS
    showsPrec :: Int -> Identifier -> ShowS
    $cshow :: Identifier -> String
    show :: Identifier -> String
    $cshowList :: [Identifier] -> ShowS
    showList :: [Identifier] -> ShowS
    Show, ReadPrec [Identifier]
    ReadPrec Identifier
    Int -> ReadS Identifier
    ReadS [Identifier]
    (Int -> ReadS Identifier)
    -> ReadS [Identifier]
    -> ReadPrec Identifier
    -> ReadPrec [Identifier]
    -> Read Identifier
    forall a.
    (Int -> ReadS a)
    -> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
    $creadsPrec :: Int -> ReadS Identifier
    readsPrec :: Int -> ReadS Identifier
    $creadList :: ReadS [Identifier]
    readList :: ReadS [Identifier]
    $creadPrec :: ReadPrec Identifier
    readPrec :: ReadPrec Identifier
    $creadListPrec :: ReadPrec [Identifier]
    readListPrec :: ReadPrec [Identifier]
    Read, Typeable Identifier
    Typeable Identifier =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> Identifier -> c Identifier)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c Identifier)
    -> (Identifier -> Constr)
    -> (Identifier -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c Identifier))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e))
        -> Maybe (c Identifier))
    -> ((forall b. Data b => b -> b) -> Identifier -> Identifier)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> Identifier -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> Identifier -> r)
    -> (forall u. (forall d. Data d => d -> u) -> Identifier -> [u])
    -> (forall u.
        Int -> (forall d. Data d => d -> u) -> Identifier -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> Identifier -> m Identifier)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> Identifier -> m Identifier)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> Identifier -> m Identifier)
    -> Data Identifier
    Identifier -> Constr
    Identifier -> DataType
    (forall b. Data b => b -> b) -> Identifier -> Identifier
    forall a.
    Typeable a =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> a -> c a)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c a)
    -> (a -> Constr)
    -> (a -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c a))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
    -> ((forall b. Data b => b -> b) -> a -> a)
    -> (forall r r'.
        (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall r r'.
        (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall u. (forall d. Data d => d -> u) -> a -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> Data a
    forall u. Int -> (forall d. Data d => d -> u) -> Identifier -> u
    forall u. (forall d. Data d => d -> u) -> Identifier -> [u]
    forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Identifier
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Identifier -> c Identifier
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Identifier)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Identifier)
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Identifier -> c Identifier
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Identifier -> c Identifier
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Identifier
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Identifier
    $ctoConstr :: Identifier -> Constr
    toConstr :: Identifier -> Constr
    $cdataTypeOf :: Identifier -> DataType
    dataTypeOf :: Identifier -> DataType
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Identifier)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Identifier)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Identifier)
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Identifier)
    $cgmapT :: (forall b. Data b => b -> b) -> Identifier -> Identifier
    gmapT :: (forall b. Data b => b -> b) -> Identifier -> Identifier
    $cgmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    gmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    gmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Identifier -> r
    $cgmapQ :: forall u. (forall d. Data d => d -> u) -> Identifier -> [u]
    gmapQ :: forall u. (forall d. Data d => d -> u) -> Identifier -> [u]
    $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Identifier -> u
    gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Identifier -> u
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Identifier -> m Identifier
    Data, Typeable)

    data IdentType = OPIdent | ClaimedIdent
        deriving (IdentType -> IdentType -> Bool
    (IdentType -> IdentType -> Bool)
    -> (IdentType -> IdentType -> Bool) -> Eq IdentType
    forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
    $c== :: IdentType -> IdentType -> Bool
    == :: IdentType -> IdentType -> Bool
    $c/= :: IdentType -> IdentType -> Bool
    /= :: IdentType -> IdentType -> Bool
    Eq, Eq IdentType
    Eq IdentType =>
    (IdentType -> IdentType -> Ordering)
    -> (IdentType -> IdentType -> Bool)
    -> (IdentType -> IdentType -> Bool)
    -> (IdentType -> IdentType -> Bool)
    -> (IdentType -> IdentType -> Bool)
    -> (IdentType -> IdentType -> IdentType)
    -> (IdentType -> IdentType -> IdentType)
    -> Ord IdentType
    IdentType -> IdentType -> Bool
    IdentType -> IdentType -> Ordering
    IdentType -> IdentType -> IdentType
    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
    $ccompare :: IdentType -> IdentType -> Ordering
    compare :: IdentType -> IdentType -> Ordering
    $c< :: IdentType -> IdentType -> Bool
    < :: IdentType -> IdentType -> Bool
    $c<= :: IdentType -> IdentType -> Bool
    <= :: IdentType -> IdentType -> Bool
    $c> :: IdentType -> IdentType -> Bool
    > :: IdentType -> IdentType -> Bool
    $c>= :: IdentType -> IdentType -> Bool
    >= :: IdentType -> IdentType -> Bool
    $cmax :: IdentType -> IdentType -> IdentType
    max :: IdentType -> IdentType -> IdentType
    $cmin :: IdentType -> IdentType -> IdentType
    min :: IdentType -> IdentType -> IdentType
    Ord, Int -> IdentType -> ShowS
    [IdentType] -> ShowS
    IdentType -> String
    (Int -> IdentType -> ShowS)
    -> (IdentType -> String)
    -> ([IdentType] -> ShowS)
    -> Show IdentType
    forall a.
    (Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
    $cshowsPrec :: Int -> IdentType -> ShowS
    showsPrec :: Int -> IdentType -> ShowS
    $cshow :: IdentType -> String
    show :: IdentType -> String
    $cshowList :: [IdentType] -> ShowS
    showList :: [IdentType] -> ShowS
    Show, ReadPrec [IdentType]
    ReadPrec IdentType
    Int -> ReadS IdentType
    ReadS [IdentType]
    (Int -> ReadS IdentType)
    -> ReadS [IdentType]
    -> ReadPrec IdentType
    -> ReadPrec [IdentType]
    -> Read IdentType
    forall a.
    (Int -> ReadS a)
    -> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
    $creadsPrec :: Int -> ReadS IdentType
    readsPrec :: Int -> ReadS IdentType
    $creadList :: ReadS [IdentType]
    readList :: ReadS [IdentType]
    $creadPrec :: ReadPrec IdentType
    readPrec :: ReadPrec IdentType
    $creadListPrec :: ReadPrec [IdentType]
    readListPrec :: ReadPrec [IdentType]
    Read, Typeable IdentType
    Typeable IdentType =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> IdentType -> c IdentType)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c IdentType)
    -> (IdentType -> Constr)
    -> (IdentType -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c IdentType))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IdentType))
    -> ((forall b. Data b => b -> b) -> IdentType -> IdentType)
    -> (forall r r'.
        (r -> r' -> r)
        -> r -> (forall d. Data d => d -> r') -> IdentType -> r)
    -> (forall r r'.
        (r' -> r -> r)
        -> r -> (forall d. Data d => d -> r') -> IdentType -> r)
    -> (forall u. (forall d. Data d => d -> u) -> IdentType -> [u])
    -> (forall u.
        Int -> (forall d. Data d => d -> u) -> IdentType -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> IdentType -> m IdentType)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> IdentType -> m IdentType)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> IdentType -> m IdentType)
    -> Data IdentType
    IdentType -> Constr
    IdentType -> DataType
    (forall b. Data b => b -> b) -> IdentType -> IdentType
    forall a.
    Typeable a =>
    (forall (c :: * -> *).
     (forall d b. Data d => c (d -> b) -> d -> c b)
     -> (forall g. g -> c g) -> a -> c a)
    -> (forall (c :: * -> *).
        (forall b r. Data b => c (b -> r) -> c r)
        -> (forall r. r -> c r) -> Constr -> c a)
    -> (a -> Constr)
    -> (a -> DataType)
    -> (forall (t :: * -> *) (c :: * -> *).
        Typeable t =>
        (forall d. Data d => c (t d)) -> Maybe (c a))
    -> (forall (t :: * -> * -> *) (c :: * -> *).
        Typeable t =>
        (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
    -> ((forall b. Data b => b -> b) -> a -> a)
    -> (forall r r'.
        (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall r r'.
        (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
    -> (forall u. (forall d. Data d => d -> u) -> a -> [u])
    -> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
    -> (forall (m :: * -> *).
        Monad m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> (forall (m :: * -> *).
        MonadPlus m =>
        (forall d. Data d => d -> m d) -> a -> m a)
    -> Data a
    forall u. Int -> (forall d. Data d => d -> u) -> IdentType -> u
    forall u. (forall d. Data d => d -> u) -> IdentType -> [u]
    forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c IdentType
    forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> IdentType -> c IdentType
    forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c IdentType)
    forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IdentType)
    $cgfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> IdentType -> c IdentType
    gfoldl :: forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> IdentType -> c IdentType
    $cgunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c IdentType
    gunfold :: forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c IdentType
    $ctoConstr :: IdentType -> Constr
    toConstr :: IdentType -> Constr
    $cdataTypeOf :: IdentType -> DataType
    dataTypeOf :: IdentType -> DataType
    $cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c IdentType)
    dataCast1 :: forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c IdentType)
    $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IdentType)
    dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IdentType)
    $cgmapT :: (forall b. Data b => b -> b) -> IdentType -> IdentType
    gmapT :: (forall b. Data b => b -> b) -> IdentType -> IdentType
    $cgmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    gmapQl :: forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    $cgmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    gmapQr :: forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> IdentType -> r
    $cgmapQ :: forall u. (forall d. Data d => d -> u) -> IdentType -> [u]
    gmapQ :: forall u. (forall d. Data d => d -> u) -> IdentType -> [u]
    $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> IdentType -> u
    gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> IdentType -> u
    $cgmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    gmapM :: forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    $cgmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    gmapMp :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    $cgmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    gmapMo :: forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> IdentType -> m IdentType
    Data, Typeable)