non-empty-0.3.0.1: List-like structures with static restrictions on the number of elements

Safe HaskellSafe
LanguageHaskell98

Data.Empty

Documentation

data T a Source #

Constructors

Cons 
Instances
Functor T Source # 
Instance details

Defined in Data.Empty

Methods

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

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

Foldable T Source # 
Instance details

Defined in Data.Empty

Methods

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

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

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

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

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

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

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

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

toList :: T a -> [a] #

null :: T a -> Bool #

length :: T a -> Int #

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

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

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

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

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

Traversable T Source # 
Instance details

Defined in Data.Empty

Methods

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

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

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

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

NFData T Source # 
Instance details

Defined in Data.Empty

Methods

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

Show T Source # 
Instance details

Defined in Data.Empty

Methods

showsPrec :: Show a => Int -> T a -> ShowS Source #

Reverse T Source # 
Instance details

Defined in Data.Empty

Methods

reverse :: T a -> T a Source #

SortBy T Source # 
Instance details

Defined in Data.Empty

Methods

sortBy :: (a -> a -> Ordering) -> T a -> T a Source #

Sort T Source # 
Instance details

Defined in Data.Empty

Methods

sort :: Ord a => T a -> T a Source #

Iterate T Source # 
Instance details

Defined in Data.Empty

Methods

iterate :: (a -> a) -> a -> T a Source #

Repeat T Source # 
Instance details

Defined in Data.Empty

Methods

repeat :: a -> T a Source #

Zip T Source # 
Instance details

Defined in Data.Empty

Methods

zipWith :: (a -> b -> c) -> T a -> T b -> T c Source #

View T Source # 
Instance details

Defined in Data.Empty

ViewR T Source # 
Instance details

Defined in Data.Empty

Methods

viewR :: T a -> Maybe (T a, a) Source #

ViewL T Source # 
Instance details

Defined in Data.Empty

Methods

viewL :: T a -> Maybe (a, T a) Source #

Empty T Source # 
Instance details

Defined in Data.Empty

Methods

empty :: T a Source #

InsertBy T Source # 
Instance details

Defined in Data.NonEmptyPrivate

Methods

insertBy :: (a -> a -> Ordering) -> a -> T a -> T0 T a Source #

Insert T Source # 
Instance details

Defined in Data.NonEmptyPrivate

Methods

insert :: Ord a => a -> T a -> T0 T a Source #

Choose T Source # 
Instance details

Defined in Data.NonEmpty.Mixed

Methods

choose :: [a] -> [T a] Source #

Eq (T a) Source # 
Instance details

Defined in Data.Empty

Methods

(==) :: T a -> T a -> Bool #

(/=) :: T a -> T a -> Bool #

Ord (T a) Source # 
Instance details

Defined in Data.Empty

Methods

compare :: T a -> T a -> Ordering #

(<) :: T a -> T a -> Bool #

(<=) :: T a -> T a -> Bool #

(>) :: T a -> T a -> Bool #

(>=) :: T a -> T a -> Bool #

max :: T a -> T a -> T a #

min :: T a -> T a -> T a #

Show (T a) Source # 
Instance details

Defined in Data.Empty

Methods

showsPrec :: Int -> T a -> ShowS #

show :: T a -> String #

showList :: [T a] -> ShowS #

Arbitrary (T a) Source # 
Instance details

Defined in Data.Empty

Methods

arbitrary :: Gen (T a) #

shrink :: T a -> [T a] #

NFData (T a) Source # 
Instance details

Defined in Data.Empty

Methods

rnf :: T a -> () #