Methods

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

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

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

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

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

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

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

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

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

toList :: NonEmptySet a -> [a] #

null :: NonEmptySet a -> Bool #

length :: NonEmptySet a -> Int #

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

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

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

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

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

Methods

structure :: Proxy (NonEmptySet a) -> Structure Source #

structureHash' :: Tagged (NonEmptySet a) MD5

Methods

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

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

toConstr :: NonEmptySet a -> Constr #

dataTypeOf :: NonEmptySet a -> DataType #

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

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

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

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

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

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

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

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

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

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

Methods

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

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

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

Methods

readsPrec :: Int -> ReadS (NonEmptySet a) #

readList :: ReadS [NonEmptySet a] #

readPrec :: ReadPrec (NonEmptySet a) #

readListPrec :: ReadPrec [NonEmptySet a] #

Methods

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

show :: NonEmptySet a -> String #

showList :: [NonEmptySet a] -> ShowS #

Methods

put :: NonEmptySet a -> Put #

get :: Get (NonEmptySet a) #

putList :: [NonEmptySet a] -> Put #

Methods

rnf :: NonEmptySet a -> () #

Methods

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

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

Methods

compare :: NonEmptySet a -> NonEmptySet a -> Ordering #

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

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

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

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

max :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a #

min :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a #