monad-ideals-0.1.0.0: Ideal Monads and coproduct of them
Copyright(C) 2024 Koji Miyazato
LicenseBSD-style (see the file LICENSE)
MaintainerKoji Miyazato <viercc@gmail.com>
Stabilityexperimental
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.List.NotOne

Description

 
Synopsis

Documentation

data NotOne a Source #

List sans singleton

Constructors

Zero 
Multiple (TwoOrMore a) 

Instances

Instances details
Foldable NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

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

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

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

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

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

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

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

toList :: NotOne a -> [a] #

null :: NotOne a -> Bool #

length :: NotOne a -> Int #

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

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

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

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

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

Traversable NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

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

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

Functor NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

Isolated NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

impureBind :: NotOne a -> (a -> Unite NotOne b) -> Unite NotOne b Source #

Alt NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

(<!>) :: NotOne a -> NotOne a -> NotOne a #

some :: Applicative NotOne => NotOne a -> NotOne [a] #

many :: Applicative NotOne => NotOne a -> NotOne [a] #

Apply NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

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

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

Bind NotOne Source #
(>>-) = flip foldMap
Instance details

Defined in Data.List.NotOne

Methods

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

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

Plus NotOne Source # 
Instance details

Defined in Data.List.NotOne

Methods

zero :: NotOne a #

Monoid (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Methods

mempty :: NotOne a #

mappend :: NotOne a -> NotOne a -> NotOne a #

mconcat :: [NotOne a] -> NotOne a #

Semigroup (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

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

Read a => Read (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Show a => Show (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

show :: NotOne a -> String #

showList :: [NotOne a] -> ShowS #

Eq a => Eq (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Methods

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

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

Ord a => Ord (NotOne a) Source # 
Instance details

Defined in Data.List.NotOne

Methods

compare :: NotOne a -> NotOne a -> Ordering #

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

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

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

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

max :: NotOne a -> NotOne a -> NotOne a #

min :: NotOne a -> NotOne a -> NotOne a #

notOne :: [a] -> Either a (NotOne a) Source #