Documentation

Methods

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

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

foldMap' :: Monoid m => (a -> m) -> NonNonEmpty a -> m #

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

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

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

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

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

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

toList :: NonNonEmpty a -> [a] #

null :: NonNonEmpty a -> Bool #

length :: NonNonEmpty a -> Int #

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

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

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

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

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

Methods

fold1 :: Semigroup m => NonNonEmpty m -> m #

foldMap1 :: Semigroup m => (a -> m) -> NonNonEmpty a -> m #

foldMap1' :: Semigroup m => (a -> m) -> NonNonEmpty a -> m #

toNonEmpty :: NonNonEmpty a -> NonEmpty a #

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

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

head :: NonNonEmpty a -> a #

last :: NonNonEmpty a -> a #

foldrMap1 :: (a -> b) -> (a -> b -> b) -> NonNonEmpty a -> b #

foldlMap1' :: (a -> b) -> (b -> a -> b) -> NonNonEmpty a -> b #

foldlMap1 :: (a -> b) -> (b -> a -> b) -> NonNonEmpty a -> b #

foldrMap1' :: (a -> b) -> (a -> b -> b) -> NonNonEmpty a -> b #

Methods

liftEq :: (a -> b -> Bool) -> NonNonEmpty a -> NonNonEmpty b -> Bool #

Methods

liftCompare :: (a -> b -> Ordering) -> NonNonEmpty a -> NonNonEmpty b -> Ordering #

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NonNonEmpty a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NonNonEmpty a] -> ShowS #

Methods

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

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

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

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

Methods

pure :: a -> NonNonEmpty a #

(<*>) :: NonNonEmpty (a -> b) -> NonNonEmpty a -> NonNonEmpty b #

liftA2 :: (a -> b -> c) -> NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty c #

(*>) :: NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty b #

(<*) :: NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty a #

Methods

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

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

Methods

(>>=) :: NonNonEmpty a -> (a -> NonNonEmpty b) -> NonNonEmpty b #

(>>) :: NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty b #

return :: a -> NonNonEmpty a #

Methods

(<.>) :: NonNonEmpty (a -> b) -> NonNonEmpty a -> NonNonEmpty b #

(.>) :: NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty b #

(<.) :: NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty a #

liftF2 :: (a -> b -> c) -> NonNonEmpty a -> NonNonEmpty b -> NonNonEmpty c #

Methods

(>>-) :: NonNonEmpty a -> (a -> NonNonEmpty b) -> NonNonEmpty b #

join :: NonNonEmpty (NonNonEmpty a) -> NonNonEmpty a #

Methods

traverse1 :: Apply f => (a -> f b) -> NonNonEmpty a -> f (NonNonEmpty b) #

sequence1 :: Apply f => NonNonEmpty (f b) -> f (NonNonEmpty b) #

Methods

from1 :: forall (a :: k). NonNonEmpty a -> Rep1 NonNonEmpty a #

to1 :: forall (a :: k). Rep1 NonNonEmpty a -> NonNonEmpty a #

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonNonEmpty a -> c (NonNonEmpty a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonNonEmpty a) #

toConstr :: NonNonEmpty a -> Constr #

dataTypeOf :: NonNonEmpty a -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonNonEmpty a)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonNonEmpty a)) #

gmapT :: (forall b. Data b => b -> b) -> NonNonEmpty a -> NonNonEmpty a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonNonEmpty a -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonNonEmpty a -> r #

gmapQ :: (forall d. Data d => d -> u) -> NonNonEmpty a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> NonNonEmpty a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonNonEmpty a -> m (NonNonEmpty a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNonEmpty a -> m (NonNonEmpty a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonNonEmpty a -> m (NonNonEmpty a) #

Methods

(<>) :: NonNonEmpty a -> NonNonEmpty a -> NonNonEmpty a #

sconcat :: NonEmpty (NonNonEmpty a) -> NonNonEmpty a #

stimes :: Integral b => b -> NonNonEmpty a -> NonNonEmpty a #

Methods

from :: NonNonEmpty a -> Rep (NonNonEmpty a) x #

to :: Rep (NonNonEmpty a) x -> NonNonEmpty a #

Methods

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

show :: NonNonEmpty a -> String #

showList :: [NonNonEmpty a] -> ShowS #

Methods

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

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

Methods

compare :: NonNonEmpty a -> NonNonEmpty a -> Ordering #

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

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

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

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

max :: NonNonEmpty a -> NonNonEmpty a -> NonNonEmpty a #

min :: NonNonEmpty a -> NonNonEmpty a -> NonNonEmpty a #

Methods

reversing :: NonNonEmpty a -> NonNonEmpty a #

Methods

each :: Traversal (NonNonEmpty a) (NonNonEmpty b) a b #