non-empty-0.3.3: List-like structures with static restrictions on the number of elements
Safe HaskellSafe-Inferred
LanguageHaskell98

Data.Append

Documentation

data T f g a Source #

Constructors

Cons 

Fields

Instances

Instances details
(Functor f, Functor g) => Functor (T f g) Source # 
Instance details

Defined in Data.Append

Methods

fmap :: (a -> b) -> T f g a -> T f g b #

(<$) :: a -> T f g b -> T f g a #

(Foldable f, Foldable g) => Foldable (T f g) Source # 
Instance details

Defined in Data.Append

Methods

fold :: Monoid m => T f g m -> m #

foldMap :: Monoid m => (a -> m) -> T f g a -> m #

foldMap' :: Monoid m => (a -> m) -> T f g a -> m #

foldr :: (a -> b -> b) -> b -> T f g a -> b #

foldr' :: (a -> b -> b) -> b -> T f g a -> b #

foldl :: (b -> a -> b) -> b -> T f g a -> b #

foldl' :: (b -> a -> b) -> b -> T f g a -> b #

foldr1 :: (a -> a -> a) -> T f g a -> a #

foldl1 :: (a -> a -> a) -> T f g a -> a #

toList :: T f g a -> [a] #

null :: T f g a -> Bool #

length :: T f g a -> Int #

elem :: Eq a => a -> T f g a -> Bool #

maximum :: Ord a => T f g a -> a #

minimum :: Ord a => T f g a -> a #

sum :: Num a => T f g a -> a #

product :: Num a => T f g a -> a #

(Traversable f, Traversable g) => Traversable (T f g) Source # 
Instance details

Defined in Data.Append

Methods

traverse :: Applicative f0 => (a -> f0 b) -> T f g a -> f0 (T f g b) #

sequenceA :: Applicative f0 => T f g (f0 a) -> f0 (T f g a) #

mapM :: Monad m => (a -> m b) -> T f g a -> m (T f g b) #

sequence :: Monad m => T f g (m a) -> m (T f g a) #

(NFData f, NFData g) => NFData (T f g) Source # 
Instance details

Defined in Data.Append

Methods

rnf :: NFData a => T f g a -> () Source #

(NFData f, NFData g, NFData a) => NFData (T f g a) Source # 
Instance details

Defined in Data.Append

Methods

rnf :: T f g a -> () #