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

Safe Haskell	Safe
Language	Haskell98

Data.Optional

Documentation

data T f a Source #

Constructors

Nil
Cons a (f a)

Instances

Functor f => Functor (T f) Source #
Methods fmap :: (a -> b) -> T f a -> T f b # (<$) :: a -> T f b -> T f a #
Foldable f => Foldable (T f) Source #
Methods fold :: Monoid m => T f m -> m # foldMap :: Monoid m => (a -> m) -> T f a -> m # foldr :: (a -> b -> b) -> b -> T f a -> b # foldr' :: (a -> b -> b) -> b -> T f a -> b # foldl :: (b -> a -> b) -> b -> T f a -> b # foldl' :: (b -> a -> b) -> b -> T f a -> b # foldr1 :: (a -> a -> a) -> T f a -> a # foldl1 :: (a -> a -> a) -> T f a -> a # toList :: T f a -> [a] # null :: T f a -> Bool # length :: T f a -> Int # elem :: Eq a => a -> T f a -> Bool # maximum :: Ord a => T f a -> a # minimum :: Ord a => T f a -> a # sum :: Num a => T f a -> a # product :: Num a => T f a -> a #
Traversable f => Traversable (T f) Source #
Methods traverse :: Applicative f => (a -> f b) -> T f a -> f (T f b) # sequenceA :: Applicative f => T f (f a) -> f (T f a) # mapM :: Monad m => (a -> m b) -> T f a -> m (T f b) # sequence :: Monad m => T f (m a) -> m (T f a) #
NFData f => NFData (T f) Source #
Methods rnf :: NFData a => T f a -> () Source #
Show f => Show (T f) Source #
Methods showsPrec :: Show a => Int -> T f a -> ShowS Source #
(Traversable f, Reverse f) => Reverse (T f) Source #
Methods reverse :: T f a -> T f a Source #
(InsertBy f, SortBy f) => SortBy (T f) Source #
Methods sortBy :: (a -> a -> Ordering) -> T f a -> T f a Source #
(Insert f, Sort f) => Sort (T f) Source #
Methods sort :: Ord a => T f a -> T f a Source #
Iterate f => Iterate (T f) Source #
Methods iterate :: (a -> a) -> a -> T f a Source #
Repeat f => Repeat (T f) Source #
Methods repeat :: a -> T f a Source #
Zip f => Zip (T f) Source #
Methods zipWith :: (a -> b -> c) -> T f a -> T f b -> T f c Source #
(Cons f, Empty f) => Cons (T f) Source #
Methods cons :: a -> T f a -> T f a Source #
Empty (T f) Source #
Methods empty :: T f a Source #
InsertBy f => InsertBy (T f) Source #
Methods insertBy :: (a -> a -> Ordering) -> a -> T f a -> T (T f) a Source #
Insert f => Insert (T f) Source #
Methods insert :: Ord a => a -> T f a -> T (T f) a Source #
(Eq a, Eq (f a)) => Eq (T f a) Source #
Methods (==) :: T f a -> T f a -> Bool # (/=) :: T f a -> T f a -> Bool #
(Ord a, Ord (f a)) => Ord (T f a) Source #
Methods compare :: T f a -> T f a -> Ordering # (<) :: T f a -> T f a -> Bool # (<=) :: T f a -> T f a -> Bool # (>) :: T f a -> T f a -> Bool # (>=) :: T f a -> T f a -> Bool # max :: T f a -> T f a -> T f a # min :: T f a -> T f a -> T f a #
(Show f, Show a) => Show (T f a) Source #
Methods showsPrec :: Int -> T f a -> ShowS # show :: T f a -> String # showList :: [T f a] -> ShowS #
(Arbitrary f, Arbitrary a) => Arbitrary (T f a) Source #
Methods arbitrary :: Gen (T f a) # shrink :: T f a -> [T f a] #
(NFData f, NFData a) => NFData (T f a) Source #
Methods rnf :: T f a -> () #

(?:) :: a -> f a -> T f a infixr 5 Source #

fromEmpty :: T a -> T f a Source #

fromNonEmpty :: T f a -> T f a Source #