non-empty-0.3: List-like structures with static restrictions on the number of elements
Data.Append
data T f g a Source #
Constructors
Fields
Instances
Methods
fmap :: (a -> b) -> T f g a -> T f g b #
(<$) :: a -> T f g b -> T f g a #
fold :: Monoid m => T f g m -> 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 #
traverse :: Applicative f => (a -> f b) -> T f g a -> f (T f g b) #
sequenceA :: Applicative f => T f g (f a) -> f (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) #
rnf :: NFData a => T f g a -> () Source #
rnf :: T f g a -> () #