Copyright	(c) Justin Le 2019
License	BSD3
Maintainer	justin@jle.im
Stability	experimental
Portability	non-portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Control.Applicative.ListF

Contents

ListF
NonEmptyF
MaybeF
MapF

Description

This module provides functor combinators that are wrappers over lists or maybes of f as, especially for their Interpret instances.

Each one transforms a functor into some product of itself. For example, NonEmptyF f represents f :*: f, or f :*: f :*: f, or f :*: f :*: f :*: f, etc.

Synopsis

newtype ListF f a = ListF {
- runListF :: [f a]
}
mapListF :: ([f a] -> [g b]) -> ListF f a -> ListF g b
newtype NonEmptyF f a where
- NonEmptyF {
  - runNonEmptyF :: NonEmpty (f a)
  }
- pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a
mapNonEmptyF :: (NonEmpty (f a) -> NonEmpty (g b)) -> NonEmptyF f a -> NonEmptyF g b
toListF :: NonEmptyF f ~> ListF f
fromListF :: ListF f ~> (Proxy :+: NonEmptyF f)
newtype MaybeF f a = MaybeF {
- runMaybeF :: Maybe (f a)
}
mapMaybeF :: (Maybe (f a) -> Maybe (g b)) -> MaybeF f a -> MaybeF g b
listToMaybeF :: ListF f ~> MaybeF f
maybeToListF :: MaybeF f ~> ListF f
newtype MapF k f a = MapF {
- runMapF :: Map k (f a)
}
newtype NEMapF k f a = NEMapF {
- runNEMapF :: NEMap k (f a)
}

`ListF`

newtype ListF f a Source #

A list of f as. Can be used to describe a product of many different values of type f a.

This is the Free Plus.

Incidentally, if used with a Contravariant f, this is instead the free Divisible.

Constructors

ListF
Fields runListF :: [f a]

Instances

Instances details

HTraversable (ListF :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse :: forall h f g (a :: k10). Applicative h => (forall (x :: k). f x -> h (g x)) -> ListF f a -> h (ListF g a) Source #
HFunctor (ListF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Internal Methods hmap :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> g) -> ListF f ~> ListF g Source #
HBind (ListF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods hbind :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> ListF g) -> ListF f ~> ListF g Source # hjoin :: forall (f :: k0 -> Type). ListF (ListF f) ~> ListF f Source #
Inject (ListF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods inject :: forall (f :: k0 -> Type). f ~> ListF f Source #
FreeOf Plus (ListF :: (Type -> Type) -> Type -> TYPE LiftedRep) Source #	This could also be `FreeOf Divisible` if `FreeFunctorBy ListF ~ Contravariant`. However, there isn't really a way to express this at the moment.
Instance details Defined in Data.HFunctor.Final Associated Types type FreeFunctorBy ListF :: (Type -> Type) -> Constraint Source # Methods fromFree :: forall (f :: Type -> Type). ListF f ~> Final Plus f Source # toFree :: forall (f :: Type -> Type). FreeFunctorBy ListF f => Final Plus f ~> ListF f Source #
Plus f => Interpret (ListF :: (Type -> Type) -> Type -> TYPE LiftedRep) (f :: Type -> Type) Source #	A free `Plus`
Instance details Defined in Data.HFunctor.Interpret Methods retract :: ListF f ~> f Source # interpret :: forall (g :: k -> Type). (g ~> f) -> ListF g ~> f Source #
Foldable f => Foldable (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold :: Monoid m => ListF f m -> m # foldMap :: Monoid m => (a -> m) -> ListF f a -> m # foldMap' :: Monoid m => (a -> m) -> ListF f a -> m # foldr :: (a -> b -> b) -> b -> ListF f a -> b # foldr' :: (a -> b -> b) -> b -> ListF f a -> b # foldl :: (b -> a -> b) -> b -> ListF f a -> b # foldl' :: (b -> a -> b) -> b -> ListF f a -> b # foldr1 :: (a -> a -> a) -> ListF f a -> a # foldl1 :: (a -> a -> a) -> ListF f a -> a # toList :: ListF f a -> [a] # null :: ListF f a -> Bool # length :: ListF f a -> Int # elem :: Eq a => a -> ListF f a -> Bool # maximum :: Ord a => ListF f a -> a # minimum :: Ord a => ListF f a -> a # sum :: Num a => ListF f a -> a # product :: Num a => ListF f a -> a #
Eq1 f => Eq1 (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftEq :: (a -> b -> Bool) -> ListF f a -> ListF f b -> Bool #
Ord1 f => Ord1 (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftCompare :: (a -> b -> Ordering) -> ListF f a -> ListF f b -> Ordering #
Read1 f => Read1 (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (ListF f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [ListF f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (ListF f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [ListF f a] #
Show1 f => Show1 (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ListF f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ListF f a] -> ShowS #
Contravariant f => Contravariant (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods contramap :: (a' -> a) -> ListF f a -> ListF f a' # (>$) :: b -> ListF f b -> ListF f a #
Traversable f => Traversable (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse :: Applicative f0 => (a -> f0 b) -> ListF f a -> f0 (ListF f b) # sequenceA :: Applicative f0 => ListF f (f0 a) -> f0 (ListF f a) # mapM :: Monad m => (a -> m b) -> ListF f a -> m (ListF f b) # sequence :: Monad m => ListF f (m a) -> m (ListF f a) #
Applicative f => Alternative (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods empty :: ListF f a # (<\|>) :: ListF f a -> ListF f a -> ListF f a # some :: ListF f a -> ListF f [a] # many :: ListF f a -> ListF f [a] #
Applicative f => Applicative (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods pure :: a -> ListF f a # (<>) :: ListF f (a -> b) -> ListF f a -> ListF f b # liftA2 :: (a -> b -> c) -> ListF f a -> ListF f b -> ListF f c # (>) :: ListF f a -> ListF f b -> ListF f b # (<*) :: ListF f a -> ListF f b -> ListF f a #
Functor f => Functor (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fmap :: (a -> b) -> ListF f a -> ListF f b # (<$) :: a -> ListF f b -> ListF f a #
Decidable f => Decidable (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods lose :: (a -> Void) -> ListF f a # choose :: (a -> Either b c) -> ListF f b -> ListF f c -> ListF f a #
Contravariant f => Divisible (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods divide :: (a -> (b, c)) -> ListF f b -> ListF f c -> ListF f a # conquer :: ListF f a #
Conclude f => Conclude (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods conclude :: (a -> Void) -> ListF f a Source #
Decide f => Decide (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods decide :: (a -> Either b c) -> ListF f b -> ListF f c -> ListF f a Source #
Contravariant f => Divise (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods divise :: (a -> (b, c)) -> ListF f b -> ListF f c -> ListF f a Source # divised :: ListF f a -> ListF f b -> ListF f (a, b) Source #
Invariant f => Invariant (ListF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods invmap :: (a -> b) -> (b -> a) -> ListF f a -> ListF f b #
Pointed f => Pointed (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods point :: a -> ListF f a #
Functor f => Alt (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods (<!>) :: ListF f a -> ListF f a -> ListF f a # some :: Applicative (ListF f) => ListF f a -> ListF f [a] # many :: Applicative (ListF f) => ListF f a -> ListF f [a] #
Apply f => Apply (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods (<.>) :: ListF f (a -> b) -> ListF f a -> ListF f b # (.>) :: ListF f a -> ListF f b -> ListF f b # (<.) :: ListF f a -> ListF f b -> ListF f a # liftF2 :: (a -> b -> c) -> ListF f a -> ListF f b -> ListF f c #
Functor f => Plus (ListF f) Source #
Instance details Defined in Control.Applicative.ListF Methods zero :: ListF f a #
(Typeable a, Typeable f, Typeable k, Data (f a)) => Data (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ListF f a -> c (ListF f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ListF f a) # toConstr :: ListF f a -> Constr # dataTypeOf :: ListF f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ListF f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ListF f a)) # gmapT :: (forall b. Data b => b -> b) -> ListF f a -> ListF f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ListF f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ListF f a -> r # gmapQ :: (forall d. Data d => d -> u) -> ListF f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ListF f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ListF f a -> m (ListF f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ListF f a -> m (ListF f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ListF f a -> m (ListF f a) #
Monoid (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods mempty :: ListF f a # mappend :: ListF f a -> ListF f a -> ListF f a # mconcat :: [ListF f a] -> ListF f a #
Semigroup (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (<>) :: ListF f a -> ListF f a -> ListF f a # sconcat :: NonEmpty (ListF f a) -> ListF f a # stimes :: Integral b => b -> ListF f a -> ListF f a #
Generic (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Associated Types type Rep (ListF f a) :: Type -> Type # Methods from :: ListF f a -> Rep (ListF f a) x # to :: Rep (ListF f a) x -> ListF f a #
Read (f a) => Read (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods readsPrec :: Int -> ReadS (ListF f a) # readList :: ReadS [ListF f a] # readPrec :: ReadPrec (ListF f a) # readListPrec :: ReadPrec [ListF f a] #
Show (f a) => Show (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods showsPrec :: Int -> ListF f a -> ShowS # show :: ListF f a -> String # showList :: [ListF f a] -> ShowS #
Eq (f a) => Eq (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (==) :: ListF f a -> ListF f a -> Bool # (/=) :: ListF f a -> ListF f a -> Bool #
Ord (f a) => Ord (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods compare :: ListF f a -> ListF f a -> Ordering # (<) :: ListF f a -> ListF f a -> Bool # (<=) :: ListF f a -> ListF f a -> Bool # (>) :: ListF f a -> ListF f a -> Bool # (>=) :: ListF f a -> ListF f a -> Bool # max :: ListF f a -> ListF f a -> ListF f a # min :: ListF f a -> ListF f a -> ListF f a #
type FreeFunctorBy (ListF :: (Type -> Type) -> Type -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Final type FreeFunctorBy (ListF :: (Type -> Type) -> Type -> TYPE LiftedRep) = Functor
type Rep (ListF f a) Source #
Instance details Defined in Control.Applicative.ListF type Rep (ListF f a) = D1 ('MetaData "ListF" "Control.Applicative.ListF" "functor-combinators-0.4.1.2-6f83RuY9ReR1ECoC76WHzJ" 'True) (C1 ('MetaCons "ListF" 'PrefixI 'True) (S1 ('MetaSel ('Just "runListF") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [f a])))

mapListF :: ([f a] -> [g b]) -> ListF f a -> ListF g b Source #

Map a function over the inside of a ListF.

`NonEmptyF`

newtype NonEmptyF f a Source #

A non-empty list of f as. Can be used to describe a product between many different possible values of type f a.

Essentially:

NonEmptyF f
    ~ f                          -- one f
  :+: (f :*: f)              -- two f's
  :+: (f :*: f :*: f)            -- three f's
  :+: (f :*: f :*: f :*: f)      -- four f's
  :+: ...                        -- etc.

This is the Free Plus on any Functor f.

Incidentally, if used with a Contravariant f, this is instead the free Divise.

Constructors

NonEmptyF
Fields runNonEmptyF :: NonEmpty (f a)

Bundled Patterns

pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a

Treat a NonEmptyF f as a product between an f and a ListF f.

nonEmptyProd is the record accessor.

Instances

Instances details

HTraversable (NonEmptyF :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse :: forall h f g (a :: k10). Applicative h => (forall (x :: k). f x -> h (g x)) -> NonEmptyF f a -> h (NonEmptyF g a) Source #
HTraversable1 (NonEmptyF :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse1 :: forall h f g (a :: k10). Apply h => (forall (x :: k). f x -> h (g x)) -> NonEmptyF f a -> h (NonEmptyF g a) Source #
HFunctor (NonEmptyF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Internal Methods hmap :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> g) -> NonEmptyF f ~> NonEmptyF g Source #
HBind (NonEmptyF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods hbind :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> NonEmptyF g) -> NonEmptyF f ~> NonEmptyF g Source # hjoin :: forall (f :: k0 -> Type). NonEmptyF (NonEmptyF f) ~> NonEmptyF f Source #
Inject (NonEmptyF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods inject :: forall (f :: k0 -> Type). f ~> NonEmptyF f Source #
FreeOf Alt (NonEmptyF :: (Type -> Type) -> Type -> TYPE LiftedRep) Source #	This could also be `FreeOf Divise` if `FreeFunctorBy NonEmptyF ~ Contravariant`. However, there isn't really a way to express this at the moment.
Instance details Defined in Data.HFunctor.Final Associated Types type FreeFunctorBy NonEmptyF :: (Type -> Type) -> Constraint Source # Methods fromFree :: forall (f :: Type -> Type). NonEmptyF f ~> Final Alt f Source # toFree :: forall (f :: Type -> Type). FreeFunctorBy NonEmptyF f => Final Alt f ~> NonEmptyF f Source #
Alt f => Interpret (NonEmptyF :: (Type -> Type) -> Type -> TYPE LiftedRep) (f :: Type -> Type) Source #	A free `Alt`
Instance details Defined in Data.HFunctor.Interpret Methods retract :: NonEmptyF f ~> f Source # interpret :: forall (g :: k -> Type). (g ~> f) -> NonEmptyF g ~> f Source #
Foldable f => Foldable (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold :: Monoid m => NonEmptyF f m -> m # foldMap :: Monoid m => (a -> m) -> NonEmptyF f a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmptyF f a -> m # foldr :: (a -> b -> b) -> b -> NonEmptyF f a -> b # foldr' :: (a -> b -> b) -> b -> NonEmptyF f a -> b # foldl :: (b -> a -> b) -> b -> NonEmptyF f a -> b # foldl' :: (b -> a -> b) -> b -> NonEmptyF f a -> b # foldr1 :: (a -> a -> a) -> NonEmptyF f a -> a # foldl1 :: (a -> a -> a) -> NonEmptyF f a -> a # toList :: NonEmptyF f a -> [a] # null :: NonEmptyF f a -> Bool # length :: NonEmptyF f a -> Int # elem :: Eq a => a -> NonEmptyF f a -> Bool # maximum :: Ord a => NonEmptyF f a -> a # minimum :: Ord a => NonEmptyF f a -> a # sum :: Num a => NonEmptyF f a -> a # product :: Num a => NonEmptyF f a -> a #
Eq1 f => Eq1 (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftEq :: (a -> b -> Bool) -> NonEmptyF f a -> NonEmptyF f b -> Bool #
Ord1 f => Ord1 (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftCompare :: (a -> b -> Ordering) -> NonEmptyF f a -> NonEmptyF f b -> Ordering #
Read1 f => Read1 (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (NonEmptyF f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [NonEmptyF f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (NonEmptyF f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [NonEmptyF f a] #
Show1 f => Show1 (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NonEmptyF f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NonEmptyF f a] -> ShowS #
Contravariant f => Contravariant (NonEmptyF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods contramap :: (a' -> a) -> NonEmptyF f a -> NonEmptyF f a' # (>$) :: b -> NonEmptyF f b -> NonEmptyF f a #
Traversable f => Traversable (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse :: Applicative f0 => (a -> f0 b) -> NonEmptyF f a -> f0 (NonEmptyF f b) # sequenceA :: Applicative f0 => NonEmptyF f (f0 a) -> f0 (NonEmptyF f a) # mapM :: Monad m => (a -> m b) -> NonEmptyF f a -> m (NonEmptyF f b) # sequence :: Monad m => NonEmptyF f (m a) -> m (NonEmptyF f a) #
Applicative f => Applicative (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods pure :: a -> NonEmptyF f a # (<>) :: NonEmptyF f (a -> b) -> NonEmptyF f a -> NonEmptyF f b # liftA2 :: (a -> b -> c) -> NonEmptyF f a -> NonEmptyF f b -> NonEmptyF f c # (>) :: NonEmptyF f a -> NonEmptyF f b -> NonEmptyF f b # (<*) :: NonEmptyF f a -> NonEmptyF f b -> NonEmptyF f a #
Functor f => Functor (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fmap :: (a -> b) -> NonEmptyF f a -> NonEmptyF f b # (<$) :: a -> NonEmptyF f b -> NonEmptyF f a #
Decide f => Decide (NonEmptyF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods decide :: (a -> Either b c) -> NonEmptyF f b -> NonEmptyF f c -> NonEmptyF f a Source #
Contravariant f => Divise (NonEmptyF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods divise :: (a -> (b, c)) -> NonEmptyF f b -> NonEmptyF f c -> NonEmptyF f a Source # divised :: NonEmptyF f a -> NonEmptyF f b -> NonEmptyF f (a, b) Source #
Invariant f => Invariant (NonEmptyF f) Source #	Since: 0.3.0.0
Instance details Defined in Control.Applicative.ListF Methods invmap :: (a -> b) -> (b -> a) -> NonEmptyF f a -> NonEmptyF f b #
Pointed f => Pointed (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods point :: a -> NonEmptyF f a #
Functor f => Alt (NonEmptyF f) Source #
Instance details Defined in Control.Applicative.ListF Methods (<!>) :: NonEmptyF f a -> NonEmptyF f a -> NonEmptyF f a # some :: Applicative (NonEmptyF f) => NonEmptyF f a -> NonEmptyF f [a] # many :: Applicative (NonEmptyF f) => NonEmptyF f a -> NonEmptyF f [a] #
(Typeable a, Typeable f, Typeable k, Data (f a)) => Data (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonEmptyF f a -> c (NonEmptyF f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonEmptyF f a) # toConstr :: NonEmptyF f a -> Constr # dataTypeOf :: NonEmptyF f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonEmptyF f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonEmptyF f a)) # gmapT :: (forall b. Data b => b -> b) -> NonEmptyF f a -> NonEmptyF f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonEmptyF f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonEmptyF f a -> r # gmapQ :: (forall d. Data d => d -> u) -> NonEmptyF f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NonEmptyF f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonEmptyF f a -> m (NonEmptyF f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmptyF f a -> m (NonEmptyF f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmptyF f a -> m (NonEmptyF f a) #
Semigroup (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (<>) :: NonEmptyF f a -> NonEmptyF f a -> NonEmptyF f a # sconcat :: NonEmpty (NonEmptyF f a) -> NonEmptyF f a # stimes :: Integral b => b -> NonEmptyF f a -> NonEmptyF f a #
Generic (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Associated Types type Rep (NonEmptyF f a) :: Type -> Type # Methods from :: NonEmptyF f a -> Rep (NonEmptyF f a) x # to :: Rep (NonEmptyF f a) x -> NonEmptyF f a #
Read (f a) => Read (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods readsPrec :: Int -> ReadS (NonEmptyF f a) # readList :: ReadS [NonEmptyF f a] # readPrec :: ReadPrec (NonEmptyF f a) # readListPrec :: ReadPrec [NonEmptyF f a] #
Show (f a) => Show (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods showsPrec :: Int -> NonEmptyF f a -> ShowS # show :: NonEmptyF f a -> String # showList :: [NonEmptyF f a] -> ShowS #
Eq (f a) => Eq (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (==) :: NonEmptyF f a -> NonEmptyF f a -> Bool # (/=) :: NonEmptyF f a -> NonEmptyF f a -> Bool #
Ord (f a) => Ord (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods compare :: NonEmptyF f a -> NonEmptyF f a -> Ordering # (<) :: NonEmptyF f a -> NonEmptyF f a -> Bool # (<=) :: NonEmptyF f a -> NonEmptyF f a -> Bool # (>) :: NonEmptyF f a -> NonEmptyF f a -> Bool # (>=) :: NonEmptyF f a -> NonEmptyF f a -> Bool # max :: NonEmptyF f a -> NonEmptyF f a -> NonEmptyF f a # min :: NonEmptyF f a -> NonEmptyF f a -> NonEmptyF f a #
type FreeFunctorBy (NonEmptyF :: (Type -> Type) -> Type -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Final type FreeFunctorBy (NonEmptyF :: (Type -> Type) -> Type -> TYPE LiftedRep) = Functor
type Rep (NonEmptyF f a) Source #
Instance details Defined in Control.Applicative.ListF type Rep (NonEmptyF f a) = D1 ('MetaData "NonEmptyF" "Control.Applicative.ListF" "functor-combinators-0.4.1.2-6f83RuY9ReR1ECoC76WHzJ" 'True) (C1 ('MetaCons "NonEmptyF" 'PrefixI 'True) (S1 ('MetaSel ('Just "runNonEmptyF") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty (f a)))))

mapNonEmptyF :: (NonEmpty (f a) -> NonEmpty (g b)) -> NonEmptyF f a -> NonEmptyF g b Source #

Map a function over the inside of a NonEmptyF.

toListF :: NonEmptyF f ~> ListF f Source #

Convert a NonEmptyF into a ListF with at least one item.

fromListF :: ListF f ~> (Proxy :+: NonEmptyF f) Source #

Convert a ListF either a NonEmptyF, or a Proxy in the case that the list was empty.

`MaybeF`

newtype MaybeF f a Source #

A maybe f a.

Can be useful for describing a "an f a that may or may not be there".

This is the free structure for a "fail"-like typeclass that would only have zero :: f a.

Constructors

MaybeF
Fields runMaybeF :: Maybe (f a)

Instances

Instances details

HTraversable (MaybeF :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse :: forall h f g (a :: k10). Applicative h => (forall (x :: k). f x -> h (g x)) -> MaybeF f a -> h (MaybeF g a) Source #
HFunctor (MaybeF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Internal Methods hmap :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> g) -> MaybeF f ~> MaybeF g Source #
HBind (MaybeF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods hbind :: forall (f :: k0 -> Type) (g :: k0 -> Type). (f ~> MaybeF g) -> MaybeF f ~> MaybeF g Source # hjoin :: forall (f :: k0 -> Type). MaybeF (MaybeF f) ~> MaybeF f Source #
Inject (MaybeF :: (k -> Type) -> k -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor Methods inject :: forall (f :: k0 -> Type). f ~> MaybeF f Source #
Plus f => Interpret (MaybeF :: (Type -> Type) -> Type -> TYPE LiftedRep) (f :: Type -> Type) Source #	Technically, `f` is over-constrained: we only need `zero :: f a`, but we don't really have that typeclass in any standard hierarchies. We use `Plus` here instead, but we never use `<!>`. This would only go wrong in situations where your type supports `zero` but not `<!>`, like instances of `MonadFail` without `MonadPlus`.
Instance details Defined in Data.HFunctor.Interpret Methods retract :: MaybeF f ~> f Source # interpret :: forall (g :: k -> Type). (g ~> f) -> MaybeF g ~> f Source #
Foldable f => Foldable (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold :: Monoid m => MaybeF f m -> m # foldMap :: Monoid m => (a -> m) -> MaybeF f a -> m # foldMap' :: Monoid m => (a -> m) -> MaybeF f a -> m # foldr :: (a -> b -> b) -> b -> MaybeF f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeF f a -> b # foldl :: (b -> a -> b) -> b -> MaybeF f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeF f a -> b # foldr1 :: (a -> a -> a) -> MaybeF f a -> a # foldl1 :: (a -> a -> a) -> MaybeF f a -> a # toList :: MaybeF f a -> [a] # null :: MaybeF f a -> Bool # length :: MaybeF f a -> Int # elem :: Eq a => a -> MaybeF f a -> Bool # maximum :: Ord a => MaybeF f a -> a # minimum :: Ord a => MaybeF f a -> a # sum :: Num a => MaybeF f a -> a # product :: Num a => MaybeF f a -> a #
Eq1 f => Eq1 (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftEq :: (a -> b -> Bool) -> MaybeF f a -> MaybeF f b -> Bool #
Ord1 f => Ord1 (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftCompare :: (a -> b -> Ordering) -> MaybeF f a -> MaybeF f b -> Ordering #
Read1 f => Read1 (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (MaybeF f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [MaybeF f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (MaybeF f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [MaybeF f a] #
Show1 f => Show1 (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> MaybeF f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [MaybeF f a] -> ShowS #
Contravariant f => Contravariant (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods contramap :: (a' -> a) -> MaybeF f a -> MaybeF f a' # (>$) :: b -> MaybeF f b -> MaybeF f a #
Traversable f => Traversable (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse :: Applicative f0 => (a -> f0 b) -> MaybeF f a -> f0 (MaybeF f b) # sequenceA :: Applicative f0 => MaybeF f (f0 a) -> f0 (MaybeF f a) # mapM :: Monad m => (a -> m b) -> MaybeF f a -> m (MaybeF f b) # sequence :: Monad m => MaybeF f (m a) -> m (MaybeF f a) #
Applicative f => Alternative (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods empty :: MaybeF f a # (<\|>) :: MaybeF f a -> MaybeF f a -> MaybeF f a # some :: MaybeF f a -> MaybeF f [a] # many :: MaybeF f a -> MaybeF f [a] #
Applicative f => Applicative (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods pure :: a -> MaybeF f a # (<>) :: MaybeF f (a -> b) -> MaybeF f a -> MaybeF f b # liftA2 :: (a -> b -> c) -> MaybeF f a -> MaybeF f b -> MaybeF f c # (>) :: MaybeF f a -> MaybeF f b -> MaybeF f b # (<*) :: MaybeF f a -> MaybeF f b -> MaybeF f a #
Functor f => Functor (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods fmap :: (a -> b) -> MaybeF f a -> MaybeF f b # (<$) :: a -> MaybeF f b -> MaybeF f a #
Decidable f => Decidable (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods lose :: (a -> Void) -> MaybeF f a # choose :: (a -> Either b c) -> MaybeF f b -> MaybeF f c -> MaybeF f a #
Contravariant f => Divisible (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods divide :: (a -> (b, c)) -> MaybeF f b -> MaybeF f c -> MaybeF f a # conquer :: MaybeF f a #
Conclude f => Conclude (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods conclude :: (a -> Void) -> MaybeF f a Source #
Decide f => Decide (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods decide :: (a -> Either b c) -> MaybeF f b -> MaybeF f c -> MaybeF f a Source #
Contravariant f => Divise (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods divise :: (a -> (b, c)) -> MaybeF f b -> MaybeF f c -> MaybeF f a Source # divised :: MaybeF f a -> MaybeF f b -> MaybeF f (a, b) Source #
Invariant f => Invariant (MaybeF f) Source #	Since: 0.3.3.0
Instance details Defined in Control.Applicative.ListF Methods invmap :: (a -> b) -> (b -> a) -> MaybeF f a -> MaybeF f b #
Pointed f => Pointed (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods point :: a -> MaybeF f a #
Functor f => Alt (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods (<!>) :: MaybeF f a -> MaybeF f a -> MaybeF f a # some :: Applicative (MaybeF f) => MaybeF f a -> MaybeF f [a] # many :: Applicative (MaybeF f) => MaybeF f a -> MaybeF f [a] #
Functor f => Plus (MaybeF f) Source #
Instance details Defined in Control.Applicative.ListF Methods zero :: MaybeF f a #
(Typeable a, Typeable f, Typeable k, Data (f a)) => Data (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MaybeF f a -> c (MaybeF f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MaybeF f a) # toConstr :: MaybeF f a -> Constr # dataTypeOf :: MaybeF f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (MaybeF f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MaybeF f a)) # gmapT :: (forall b. Data b => b -> b) -> MaybeF f a -> MaybeF f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MaybeF f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MaybeF f a -> r # gmapQ :: (forall d. Data d => d -> u) -> MaybeF f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MaybeF f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MaybeF f a -> m (MaybeF f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybeF f a -> m (MaybeF f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybeF f a -> m (MaybeF f a) #
Monoid (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods mempty :: MaybeF f a # mappend :: MaybeF f a -> MaybeF f a -> MaybeF f a # mconcat :: [MaybeF f a] -> MaybeF f a #
Semigroup (MaybeF f a) Source #	Picks the first `Just`.
Instance details Defined in Control.Applicative.ListF Methods (<>) :: MaybeF f a -> MaybeF f a -> MaybeF f a # sconcat :: NonEmpty (MaybeF f a) -> MaybeF f a # stimes :: Integral b => b -> MaybeF f a -> MaybeF f a #
Generic (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Associated Types type Rep (MaybeF f a) :: Type -> Type # Methods from :: MaybeF f a -> Rep (MaybeF f a) x # to :: Rep (MaybeF f a) x -> MaybeF f a #
Read (f a) => Read (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods readsPrec :: Int -> ReadS (MaybeF f a) # readList :: ReadS [MaybeF f a] # readPrec :: ReadPrec (MaybeF f a) # readListPrec :: ReadPrec [MaybeF f a] #
Show (f a) => Show (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods showsPrec :: Int -> MaybeF f a -> ShowS # show :: MaybeF f a -> String # showList :: [MaybeF f a] -> ShowS #
Eq (f a) => Eq (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (==) :: MaybeF f a -> MaybeF f a -> Bool # (/=) :: MaybeF f a -> MaybeF f a -> Bool #
Ord (f a) => Ord (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF Methods compare :: MaybeF f a -> MaybeF f a -> Ordering # (<) :: MaybeF f a -> MaybeF f a -> Bool # (<=) :: MaybeF f a -> MaybeF f a -> Bool # (>) :: MaybeF f a -> MaybeF f a -> Bool # (>=) :: MaybeF f a -> MaybeF f a -> Bool # max :: MaybeF f a -> MaybeF f a -> MaybeF f a # min :: MaybeF f a -> MaybeF f a -> MaybeF f a #
type Rep (MaybeF f a) Source #
Instance details Defined in Control.Applicative.ListF type Rep (MaybeF f a) = D1 ('MetaData "MaybeF" "Control.Applicative.ListF" "functor-combinators-0.4.1.2-6f83RuY9ReR1ECoC76WHzJ" 'True) (C1 ('MetaCons "MaybeF" 'PrefixI 'True) (S1 ('MetaSel ('Just "runMaybeF") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (f a)))))

mapMaybeF :: (Maybe (f a) -> Maybe (g b)) -> MaybeF f a -> MaybeF g b Source #

Map a function over the inside of a MaybeF.

listToMaybeF :: ListF f ~> MaybeF f Source #

Convert a ListF into a MaybeF containing the first f a in the list, if it exists.

maybeToListF :: MaybeF f ~> ListF f Source #

Convert a MaybeF into a ListF with zero or one items.

`MapF`

newtype MapF k f a Source #

A map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location.

Can be considered a combination of EnvT and ListF, in a way --- a MapF k f a is like a ListF (EnvT k f) a with unique (and ordered) keys.

One use case might be to extend a schema with many "options", indexed by some string.

For example, if you had a command line argument parser for a single command

data Command a

Then you can represent a command line argument parser for multiple named commands with

type Commands = MapF String Command

See NEMapF for a non-empty variant, if you want to enforce that your bag has at least one f a.

Constructors

MapF
Fields runMapF :: Map k (f a)

Instances

Instances details

HTraversable (MapF k :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse :: forall h f g (a :: k10). Applicative h => (forall (x :: k0). f x -> h (g x)) -> MapF k f a -> h (MapF k g a) Source #
HFunctor (MapF k2 :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Internal Methods hmap :: forall (f :: k -> Type) (g :: k -> Type). (f ~> g) -> MapF k2 f ~> MapF k2 g Source #
Monoid k2 => Inject (MapF k2 :: (k1 -> Type) -> k1 -> TYPE LiftedRep) Source #	Injects into a singleton map at `mempty`.
Instance details Defined in Data.HFunctor Methods inject :: forall (f :: k -> Type). f ~> MapF k2 f Source #
(Monoid k, Plus f) => Interpret (MapF k :: (Type -> Type) -> Type -> TYPE LiftedRep) (f :: Type -> Type) Source #
Instance details Defined in Data.HFunctor.Interpret Methods retract :: MapF k f ~> f Source # interpret :: forall (g :: k0 -> Type). (g ~> f) -> MapF k g ~> f Source #
Foldable f => Foldable (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold :: Monoid m => MapF k f m -> m # foldMap :: Monoid m => (a -> m) -> MapF k f a -> m # foldMap' :: Monoid m => (a -> m) -> MapF k f a -> m # foldr :: (a -> b -> b) -> b -> MapF k f a -> b # foldr' :: (a -> b -> b) -> b -> MapF k f a -> b # foldl :: (b -> a -> b) -> b -> MapF k f a -> b # foldl' :: (b -> a -> b) -> b -> MapF k f a -> b # foldr1 :: (a -> a -> a) -> MapF k f a -> a # foldl1 :: (a -> a -> a) -> MapF k f a -> a # toList :: MapF k f a -> [a] # null :: MapF k f a -> Bool # length :: MapF k f a -> Int # elem :: Eq a => a -> MapF k f a -> Bool # maximum :: Ord a => MapF k f a -> a # minimum :: Ord a => MapF k f a -> a # sum :: Num a => MapF k f a -> a # product :: Num a => MapF k f a -> a #
(Eq k, Eq1 f) => Eq1 (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftEq :: (a -> b -> Bool) -> MapF k f a -> MapF k f b -> Bool #
(Ord k, Ord1 f) => Ord1 (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftCompare :: (a -> b -> Ordering) -> MapF k f a -> MapF k f b -> Ordering #
(Ord k, Read k, Read1 f) => Read1 (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (MapF k f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [MapF k f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (MapF k f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [MapF k f a] #
(Show k, Show1 f) => Show1 (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> MapF k f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [MapF k f a] -> ShowS #
Traversable f => Traversable (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse :: Applicative f0 => (a -> f0 b) -> MapF k f a -> f0 (MapF k f b) # sequenceA :: Applicative f0 => MapF k f (f0 a) -> f0 (MapF k f a) # mapM :: Monad m => (a -> m b) -> MapF k f a -> m (MapF k f b) # sequence :: Monad m => MapF k f (m a) -> m (MapF k f a) #
Functor f => Functor (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods fmap :: (a -> b) -> MapF k f a -> MapF k f b # (<$) :: a -> MapF k f b -> MapF k f a #
(Monoid k, Pointed f) => Pointed (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods point :: a -> MapF k f a #
(Functor f, Ord k) => Alt (MapF k f) Source #	Left-biased union
Instance details Defined in Control.Applicative.ListF Methods (<!>) :: MapF k f a -> MapF k f a -> MapF k f a # some :: Applicative (MapF k f) => MapF k f a -> MapF k f [a] # many :: Applicative (MapF k f) => MapF k f a -> MapF k f [a] #
(Functor f, Ord k) => Plus (MapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods zero :: MapF k f a #
(Typeable a, Typeable f, Typeable k2, Data k1, Data (f a), Ord k1) => Data (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MapF k1 f a -> c (MapF k1 f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MapF k1 f a) # toConstr :: MapF k1 f a -> Constr # dataTypeOf :: MapF k1 f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (MapF k1 f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MapF k1 f a)) # gmapT :: (forall b. Data b => b -> b) -> MapF k1 f a -> MapF k1 f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MapF k1 f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MapF k1 f a -> r # gmapQ :: (forall d. Data d => d -> u) -> MapF k1 f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MapF k1 f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MapF k1 f a -> m (MapF k1 f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MapF k1 f a -> m (MapF k1 f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MapF k1 f a -> m (MapF k1 f a) #
(Ord k, Alt f) => Monoid (MapF k f a) Source #
Instance details Defined in Control.Applicative.ListF Methods mempty :: MapF k f a # mappend :: MapF k f a -> MapF k f a -> MapF k f a # mconcat :: [MapF k f a] -> MapF k f a #
(Ord k, Alt f) => Semigroup (MapF k f a) Source #	A union, combining matching keys with `<!>`.
Instance details Defined in Control.Applicative.ListF Methods (<>) :: MapF k f a -> MapF k f a -> MapF k f a # sconcat :: NonEmpty (MapF k f a) -> MapF k f a # stimes :: Integral b => b -> MapF k f a -> MapF k f a #
Generic (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Associated Types type Rep (MapF k1 f a) :: Type -> Type # Methods from :: MapF k1 f a -> Rep (MapF k1 f a) x # to :: Rep (MapF k1 f a) x -> MapF k1 f a #
(Ord k1, Read k1, Read (f a)) => Read (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods readsPrec :: Int -> ReadS (MapF k1 f a) # readList :: ReadS [MapF k1 f a] # readPrec :: ReadPrec (MapF k1 f a) # readListPrec :: ReadPrec [MapF k1 f a] #
(Show k1, Show (f a)) => Show (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods showsPrec :: Int -> MapF k1 f a -> ShowS # show :: MapF k1 f a -> String # showList :: [MapF k1 f a] -> ShowS #
(Eq k1, Eq (f a)) => Eq (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (==) :: MapF k1 f a -> MapF k1 f a -> Bool # (/=) :: MapF k1 f a -> MapF k1 f a -> Bool #
(Ord k1, Ord (f a)) => Ord (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods compare :: MapF k1 f a -> MapF k1 f a -> Ordering # (<) :: MapF k1 f a -> MapF k1 f a -> Bool # (<=) :: MapF k1 f a -> MapF k1 f a -> Bool # (>) :: MapF k1 f a -> MapF k1 f a -> Bool # (>=) :: MapF k1 f a -> MapF k1 f a -> Bool # max :: MapF k1 f a -> MapF k1 f a -> MapF k1 f a # min :: MapF k1 f a -> MapF k1 f a -> MapF k1 f a #
type Rep (MapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF type Rep (MapF k1 f a) = D1 ('MetaData "MapF" "Control.Applicative.ListF" "functor-combinators-0.4.1.2-6f83RuY9ReR1ECoC76WHzJ" 'True) (C1 ('MetaCons "MapF" 'PrefixI 'True) (S1 ('MetaSel ('Just "runMapF") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Map k1 (f a)))))

newtype NEMapF k f a Source #

A non-empty map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location, where you need to have at least one f a at all times.

Can be considered a combination of EnvT and NonEmptyF, in a way --- an NEMapF k f a is like a NonEmptyF (EnvT k f) a with unique (and ordered) keys.

See MapF for some use cases.

Constructors

NEMapF
Fields runNEMapF :: NEMap k (f a)

Instances

Instances details

HTraversable (NEMapF k :: (k1 -> TYPE LiftedRep) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse :: forall h f g (a :: k10). Applicative h => (forall (x :: k0). f x -> h (g x)) -> NEMapF k f a -> h (NEMapF k g a) Source #
HTraversable1 (NEMapF k :: (k1 -> TYPE LiftedRep) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.HTraversable Methods htraverse1 :: forall h f g (a :: k10). Apply h => (forall (x :: k0). f x -> h (g x)) -> NEMapF k f a -> h (NEMapF k g a) Source #
HFunctor (NEMapF k2 :: (k1 -> TYPE LiftedRep) -> k1 -> TYPE LiftedRep) Source #
Instance details Defined in Data.HFunctor.Internal Methods hmap :: forall (f :: k -> Type) (g :: k -> Type). (f ~> g) -> NEMapF k2 f ~> NEMapF k2 g Source #
Monoid k2 => Inject (NEMapF k2 :: (k1 -> TYPE LiftedRep) -> k1 -> TYPE LiftedRep) Source #	Injects into a singleton map at `mempty`.
Instance details Defined in Data.HFunctor Methods inject :: forall (f :: k -> Type). f ~> NEMapF k2 f Source #
(Monoid k, Alt f) => Interpret (NEMapF k :: (Type -> TYPE LiftedRep) -> Type -> TYPE LiftedRep) (f :: Type -> Type) Source #
Instance details Defined in Data.HFunctor.Interpret Methods retract :: NEMapF k f ~> f Source # interpret :: forall (g :: k0 -> Type). (g ~> f) -> NEMapF k g ~> f Source #
Foldable f => Foldable (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold :: Monoid m => NEMapF k f m -> m # foldMap :: Monoid m => (a -> m) -> NEMapF k f a -> m # foldMap' :: Monoid m => (a -> m) -> NEMapF k f a -> m # foldr :: (a -> b -> b) -> b -> NEMapF k f a -> b # foldr' :: (a -> b -> b) -> b -> NEMapF k f a -> b # foldl :: (b -> a -> b) -> b -> NEMapF k f a -> b # foldl' :: (b -> a -> b) -> b -> NEMapF k f a -> b # foldr1 :: (a -> a -> a) -> NEMapF k f a -> a # foldl1 :: (a -> a -> a) -> NEMapF k f a -> a # toList :: NEMapF k f a -> [a] # null :: NEMapF k f a -> Bool # length :: NEMapF k f a -> Int # elem :: Eq a => a -> NEMapF k f a -> Bool # maximum :: Ord a => NEMapF k f a -> a # minimum :: Ord a => NEMapF k f a -> a # sum :: Num a => NEMapF k f a -> a # product :: Num a => NEMapF k f a -> a #
(Eq k, Eq1 f) => Eq1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftEq :: (a -> b -> Bool) -> NEMapF k f a -> NEMapF k f b -> Bool #
(Ord k, Ord1 f) => Ord1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftCompare :: (a -> b -> Ordering) -> NEMapF k f a -> NEMapF k f b -> Ordering #
(Ord k, Read k, Read1 f) => Read1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (NEMapF k f a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [NEMapF k f a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (NEMapF k f a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [NEMapF k f a] #
(Show k, Show1 f) => Show1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NEMapF k f a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NEMapF k f a] -> ShowS #
Traversable f => Traversable (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse :: Applicative f0 => (a -> f0 b) -> NEMapF k f a -> f0 (NEMapF k f b) # sequenceA :: Applicative f0 => NEMapF k f (f0 a) -> f0 (NEMapF k f a) # mapM :: Monad m => (a -> m b) -> NEMapF k f a -> m (NEMapF k f b) # sequence :: Monad m => NEMapF k f (m a) -> m (NEMapF k f a) #
Functor f => Functor (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods fmap :: (a -> b) -> NEMapF k f a -> NEMapF k f b # (<$) :: a -> NEMapF k f b -> NEMapF k f a #
(Monoid k, Pointed f) => Pointed (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods point :: a -> NEMapF k f a #
(Functor f, Ord k) => Alt (NEMapF k f) Source #	Left-biased union
Instance details Defined in Control.Applicative.ListF Methods (<!>) :: NEMapF k f a -> NEMapF k f a -> NEMapF k f a # some :: Applicative (NEMapF k f) => NEMapF k f a -> NEMapF k f [a] # many :: Applicative (NEMapF k f) => NEMapF k f a -> NEMapF k f [a] #
Foldable1 f => Foldable1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods fold1 :: Semigroup m => NEMapF k f m -> m # foldMap1 :: Semigroup m => (a -> m) -> NEMapF k f a -> m # toNonEmpty :: NEMapF k f a -> NonEmpty a #
Traversable1 f => Traversable1 (NEMapF k f) Source #
Instance details Defined in Control.Applicative.ListF Methods traverse1 :: Apply f0 => (a -> f0 b) -> NEMapF k f a -> f0 (NEMapF k f b) # sequence1 :: Apply f0 => NEMapF k f (f0 b) -> f0 (NEMapF k f b) #
(Typeable a, Typeable f, Typeable k2, Data k1, Data (f a), Ord k1) => Data (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NEMapF k1 f a -> c (NEMapF k1 f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NEMapF k1 f a) # toConstr :: NEMapF k1 f a -> Constr # dataTypeOf :: NEMapF k1 f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NEMapF k1 f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NEMapF k1 f a)) # gmapT :: (forall b. Data b => b -> b) -> NEMapF k1 f a -> NEMapF k1 f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NEMapF k1 f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NEMapF k1 f a -> r # gmapQ :: (forall d. Data d => d -> u) -> NEMapF k1 f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NEMapF k1 f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NEMapF k1 f a -> m (NEMapF k1 f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NEMapF k1 f a -> m (NEMapF k1 f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NEMapF k1 f a -> m (NEMapF k1 f a) #
(Ord k, Alt f) => Semigroup (NEMapF k f a) Source #	A union, combining matching keys with `<!>`.
Instance details Defined in Control.Applicative.ListF Methods (<>) :: NEMapF k f a -> NEMapF k f a -> NEMapF k f a # sconcat :: NonEmpty (NEMapF k f a) -> NEMapF k f a # stimes :: Integral b => b -> NEMapF k f a -> NEMapF k f a #
Generic (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Associated Types type Rep (NEMapF k1 f a) :: Type -> Type # Methods from :: NEMapF k1 f a -> Rep (NEMapF k1 f a) x # to :: Rep (NEMapF k1 f a) x -> NEMapF k1 f a #
(Ord k1, Read k1, Read (f a)) => Read (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods readsPrec :: Int -> ReadS (NEMapF k1 f a) # readList :: ReadS [NEMapF k1 f a] # readPrec :: ReadPrec (NEMapF k1 f a) # readListPrec :: ReadPrec [NEMapF k1 f a] #
(Show k1, Show (f a)) => Show (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods showsPrec :: Int -> NEMapF k1 f a -> ShowS # show :: NEMapF k1 f a -> String # showList :: [NEMapF k1 f a] -> ShowS #
(Eq k1, Eq (f a)) => Eq (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods (==) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool # (/=) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool #
(Ord k1, Ord (f a)) => Ord (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF Methods compare :: NEMapF k1 f a -> NEMapF k1 f a -> Ordering # (<) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool # (<=) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool # (>) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool # (>=) :: NEMapF k1 f a -> NEMapF k1 f a -> Bool # max :: NEMapF k1 f a -> NEMapF k1 f a -> NEMapF k1 f a # min :: NEMapF k1 f a -> NEMapF k1 f a -> NEMapF k1 f a #
type Rep (NEMapF k1 f a) Source #
Instance details Defined in Control.Applicative.ListF type Rep (NEMapF k1 f a) = D1 ('MetaData "NEMapF" "Control.Applicative.ListF" "functor-combinators-0.4.1.2-6f83RuY9ReR1ECoC76WHzJ" 'True) (C1 ('MetaCons "NEMapF" 'PrefixI 'True) (S1 ('MetaSel ('Just "runNEMapF") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NEMap k1 (f a)))))