Methods

mzip :: NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector (a, b)

mzipWith :: (a -> b -> c) -> NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector c

munzip :: NonEmptyVector (a, b) -> (NonEmptyVector a, NonEmptyVector b)

Methods

fold :: Monoid m => NonEmptyVector m -> m

foldMap :: Monoid m => (a -> m) -> NonEmptyVector a -> m

foldMap' :: Monoid m => (a -> m) -> NonEmptyVector a -> m

foldr :: (a -> b -> b) -> b -> NonEmptyVector a -> b

foldr' :: (a -> b -> b) -> b -> NonEmptyVector a -> b

foldl :: (b -> a -> b) -> b -> NonEmptyVector a -> b

foldl' :: (b -> a -> b) -> b -> NonEmptyVector a -> b

foldr1 :: (a -> a -> a) -> NonEmptyVector a -> a

foldl1 :: (a -> a -> a) -> NonEmptyVector a -> a

toList :: NonEmptyVector a -> [a]

null :: NonEmptyVector a -> Bool

length :: NonEmptyVector a -> Int

elem :: Eq a => a -> NonEmptyVector a -> Bool

maximum :: Ord a => NonEmptyVector a -> a

minimum :: Ord a => NonEmptyVector a -> a

sum :: Num a => NonEmptyVector a -> a

product :: Num a => NonEmptyVector a -> a

Methods

fold1 :: Semigroup m => NonEmptyVector m -> m

foldMap1 :: Semigroup m => (a -> m) -> NonEmptyVector a -> m

foldMap1' :: Semigroup m => (a -> m) -> NonEmptyVector a -> m

toNonEmpty :: NonEmptyVector a -> NonEmpty a

maximum :: Ord a => NonEmptyVector a -> a

minimum :: Ord a => NonEmptyVector a -> a

head :: NonEmptyVector a -> a

last :: NonEmptyVector a -> a

foldrMap1 :: (a -> b) -> (a -> b -> b) -> NonEmptyVector a -> b

foldlMap1' :: (a -> b) -> (b -> a -> b) -> NonEmptyVector a -> b

foldlMap1 :: (a -> b) -> (b -> a -> b) -> NonEmptyVector a -> b

foldrMap1' :: (a -> b) -> (a -> b -> b) -> NonEmptyVector a -> b

Methods

liftEq :: (a -> b -> Bool) -> NonEmptyVector a -> NonEmptyVector b -> Bool

Methods

liftCompare :: (a -> b -> Ordering) -> NonEmptyVector a -> NonEmptyVector b -> Ordering

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (NonEmptyVector a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [NonEmptyVector a]

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (NonEmptyVector a)

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [NonEmptyVector a]

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NonEmptyVector a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NonEmptyVector a] -> ShowS

Methods

traverse :: Applicative f => (a -> f b) -> NonEmptyVector a -> f (NonEmptyVector b)

sequenceA :: Applicative f => NonEmptyVector (f a) -> f (NonEmptyVector a)

mapM :: Monad m => (a -> m b) -> NonEmptyVector a -> m (NonEmptyVector b)

sequence :: Monad m => NonEmptyVector (m a) -> m (NonEmptyVector a)

Methods

pure :: a -> NonEmptyVector a

(<*>) :: NonEmptyVector (a -> b) -> NonEmptyVector a -> NonEmptyVector b

liftA2 :: (a -> b -> c) -> NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector c

(*>) :: NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector b

(<*) :: NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector a

Methods

fmap :: (a -> b) -> NonEmptyVector a -> NonEmptyVector b

(<$) :: a -> NonEmptyVector b -> NonEmptyVector a

Methods

(>>=) :: NonEmptyVector a -> (a -> NonEmptyVector b) -> NonEmptyVector b

(>>) :: NonEmptyVector a -> NonEmptyVector b -> NonEmptyVector b

return :: a -> NonEmptyVector a

Methods

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

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

toConstr :: NonEmptyVector a -> Constr

dataTypeOf :: NonEmptyVector a -> DataType

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

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

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

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

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

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

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

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

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

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

Methods

(<>) :: NonEmptyVector a -> NonEmptyVector a -> NonEmptyVector a

sconcat :: NonEmpty (NonEmptyVector a) -> NonEmptyVector a

stimes :: Integral b => b -> NonEmptyVector a -> NonEmptyVector a

Methods

readsPrec :: Int -> ReadS (NonEmptyVector a)

readList :: ReadS [NonEmptyVector a]

readPrec :: ReadPrec (NonEmptyVector a)

readListPrec :: ReadPrec [NonEmptyVector a]

Methods

showsPrec :: Int -> NonEmptyVector a -> ShowS

show :: NonEmptyVector a -> String

showList :: [NonEmptyVector a] -> ShowS

Methods

rnf :: NonEmptyVector a -> ()

Methods

(==) :: NonEmptyVector a -> NonEmptyVector a -> Bool

(/=) :: NonEmptyVector a -> NonEmptyVector a -> Bool

Methods

compare :: NonEmptyVector a -> NonEmptyVector a -> Ordering

(<) :: NonEmptyVector a -> NonEmptyVector a -> Bool

(<=) :: NonEmptyVector a -> NonEmptyVector a -> Bool

(>) :: NonEmptyVector a -> NonEmptyVector a -> Bool

(>=) :: NonEmptyVector a -> NonEmptyVector a -> Bool

max :: NonEmptyVector a -> NonEmptyVector a -> NonEmptyVector a

min :: NonEmptyVector a -> NonEmptyVector a -> NonEmptyVector a