Data.Functor.Const
| Авторские права | Conor McBride и Ross Paterson 2005 |
|---|---|
| Лицензия | BSD-стиль (см. файл LICENSE в дистрибутиве) |
| Поддержка | libraries@haskell.org |
| Устойчивость | экспериментальная |
| Переносимость | переносимая |
| Safe Haskell | Надёжная |
| Язык | Haskell2010 |
Описание
newtype Const a b Исходный код
Functor Const.
Реализации
| Generic1 (Const a :: k -> Type) | С версии: base-4.9.0.0 |
| Show2 (Const :: Type -> Type -> Type) | С версии: base-4.9.0.0 |
Определено в Data.Functor.Classes | |
| Read2 (Const :: Type -> Type -> Type) | С версии: base-4.9.0.0 |
Определено в Data.Functor.Classes МетодыliftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Const a b) Источник liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Const a b] Источник liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Const a b) Источник liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Const a b] Источник | |
| Ord2 (Const :: Type -> Type -> Type) | С версии: base-4.9.0.0 |
Определено в Data.Functor.Classes | |
| Eq2 (Const :: Type -> Type -> Type) | С версии: base-4.9.0.0 |
| Bifunctor (Const :: Type -> Type -> Type) | С версии: base-4.8.0.0 |
Определено в Data.Bifunctor Методыbimap :: (a -> b) -> (c -> d) -> Const a c -> Const b d Исходный код first :: (a -> b) -> Const a c -> Const b c Исходный код second :: (b -> c) -> Const a b -> Const a c Исходный код | |
| Bifoldable (Const :: Type -> Type -> Type) | С момента: base-4.10.0.0 |
Определено в Data.Bifoldable Методыbifold :: Monoid m => Const m m -> m Исходный код bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Const a b -> m Исходный код bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Const a b -> c Исходный код bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Const a b -> c Исходный код | |
| Bitraversable (Const :: Type -> Type -> Type) | С момента: base-4.10.0.0 |
Определено в Data.Bitraversable Методыbitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Const a b -> f (Const c d) Исходный код | |
| Functor (Const m :: Type -> Type) | С момента: base-2.1 |
Определено в Data.Functor.Const Методыfmap :: (a -> b) -> Const m a -> Const m b Исходный код (<$) :: a -> Const m b -> Const m a Исходный код | |
| Monoid m => Applicative (Const m :: Type -> Type) | С момента: base-2.0.1 |
Определено в Data.Functor.Const Методыpure :: a -> Const m a Исходный код (<*>) :: Const m (a -> b) -> Const m a -> Const m b Исходный код liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c Исходный код (*>) :: Const m a -> Const m b -> Const m b Исходный код (<*) :: Const m a -> Const m b -> Const m a Исходный код | |
| Foldable (Const m :: Type -> Type) | С момента: base-4.7.0.0 |
Определено в Data.Functor.Const Методыfold :: Monoid m0 => Const m m0 -> m0 Исходный код foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 Исходный код foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 Исходный код foldr :: (a -> b -> b) -> b -> Const m a -> b Исходный код foldr' :: (a -> b -> b) -> b -> Const m a -> b Исходный код foldl :: (b -> a -> b) -> b -> Const m a -> b Исходный код foldl' :: (b -> a -> b) -> b -> Const m a -> b Исходный код foldr1 :: (a -> a -> a) -> Const m a -> a Исходный код foldl1 :: (a -> a -> a) -> Const m a -> a Исходный код toList :: Const m a -> [a] Исходный код null :: Const m a -> Bool Исходный код length :: Const m a -> Int Исходный код elem :: Eq a => a -> Const m a -> Bool Исходный код maximum :: Ord a => Const m a -> a Исходный код minimum :: Ord a => Const m a -> a Исходный код sum :: Num a => Const m a -> a Исходный код product :: Num a => Const m a -> a Исходный код | |
| Traversable (Const m :: Type -> Type) | С момента: base-4.7.0.0 |
Определено в Data.Traversable Методыtraverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) Исходный код sequenceA :: Applicative f => Const m (f a) -> f (Const m a) Исходный код mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) Исходный код sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) Исходный код | |
| Show a => Show1 (Const a :: Type -> Type) | С момента: base-4.9.0.0 |
Определено в Data.Functor.Classes МетодыliftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Const a a0 -> ShowS Исходный код liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Const a a0] -> ShowS Исходный код | |
| Read a => Read1 (Const a :: Type -> Type) | С момента: base-4.9.0.0 |
| Eq a => Eq (Const a b) | Since: base-4.9.0.0 |
| Floating a => Floating (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Методыexp :: Const a b -> Const a b Source log :: Const a b -> Const a b Source sqrt :: Const a b -> Const a b Source (**) :: Const a b -> Const a b -> Const a b Source logBase :: Const a b -> Const a b -> Const a b Source sin :: Const a b -> Const a b Source cos :: Const a b -> Const a b Source tan :: Const a b -> Const a b Source asin :: Const a b -> Const a b Source acos :: Const a b -> Const a b Source atan :: Const a b -> Const a b Source sinh :: Const a b -> Const a b Source cosh :: Const a b -> Const a b Source tanh :: Const a b -> Const a b Source asinh :: Const a b -> Const a b Source acosh :: Const a b -> Const a b Source atanh :: Const a b -> Const a b Source log1p :: Const a b -> Const a b Source expm1 :: Const a b -> Const a b Source | |
| Fractional a => Fractional (Const a b) | Since: base-4.9.0.0 |
| Integral a => Integral (Const a b) | Since: base-4.9.0.0 |
Определено в Data.Functor.Const Краткое описание методовquot :: Const a b -> Const a b -> Const a b Source rem :: Const a b -> Const a b -> Const a b Source div :: Const a b -> Const a b -> Const a b Source mod :: Const a b -> Const a b -> Const a b Source quotRem :: Const a b -> Const a b -> (Const a b, Const a b) Source divMod :: Const a b -> Const a b -> (Const a b, Const a b) Source | |
| (Typeable k, Data a, Typeable b) => Data (Const a b) | Since: base-4.10.0.0 |
Определено в Data.Data Краткое описание методовgfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Const a b -> c (Const a b) Source gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Const a b) Source toConstr :: Const a b -> Constr Source dataTypeOf :: Const a b -> DataType Source dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Const a b)) Source dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Const a b)) Source gmapT :: (forall b0. Data b0 => b0 -> b0) -> Const a b -> Const a b Source gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Const a b -> r Source gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Const a b -> r Source gmapQ :: (forall d. Data d => d -> u) -> Const a b -> [u] Source gmapQi :: Int -> (forall d. Data d => d -> u) -> Const a b -> u Source gmapM :: Monad m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) Source gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) Source gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) Source | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Определено в Data.Functor.Const МетодыsizeOf :: Const a b -> Int Исходный код alignment :: Const a b -> Int Исходный код peekElemOff :: Ptr (Const a b) -> Int -> IO (Const a b) Исходный код pokeElemOff :: Ptr (Const a b) -> Int -> Const a b -> IO () Исходный код peekByteOff :: Ptr b0 -> Int -> IO (Const a b) Исходный код pokeByteOff :: Ptr b0 -> Int -> Const a b -> IO () Исходный код | |
| type Rep1 (Const a :: k -> Type) | |
Определено в Data.Functor.Const | |
| type Rep (Const a b) | |
Определено в Data.Functor.Const | |
© The University of Glasgow and others
Licensed under a BSD-style license (see top of the page).
https://downloads.haskell.org/~ghc/8.10.2/docs/html/libraries/base-4.14.1.0/Data-Functor-Const.html