non-empty-0.3: List-like structures with static restrictions on the number of elements
Data.Empty
data T a #
Constructors
Instances
Methods
fmap :: (a -> b) -> T a -> T b #
(<$) :: a -> T b -> T a #
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 #
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) #
rnf :: NFData a => T a -> () #
showsPrec :: Show a => Int -> T a -> ShowS #
reverse :: T a -> T a #
sortBy :: (a -> a -> Ordering) -> T a -> T a #
sort :: Ord a => T a -> T a #
iterate :: (a -> a) -> a -> T a #
repeat :: a -> T a #
zipWith :: (a -> b -> c) -> T a -> T b -> T c #
viewR :: T a -> Maybe (T a, a) #
viewL :: T a -> Maybe (a, T a) #
empty :: T a #
insertBy :: (a -> a -> Ordering) -> a -> T a -> T T a #
insert :: Ord a => a -> T a -> T T a #
choose :: [a] -> [T a] #
(==) :: T a -> T a -> Bool #
(/=) :: T a -> T a -> Bool #
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 #
showsPrec :: Int -> T a -> ShowS #
show :: T a -> String #
showList :: [T a] -> ShowS #
arbitrary :: Gen (T a) #
shrink :: T a -> [T a] #
rnf :: T a -> () #