Disco.Exhaustiveness.Possibilities

Meaningful types and functions for describing combinations of different possible options.

Documentation

data Possibilities a

Instances

Applicative Possibilities

Defined in Disco.Exhaustiveness.Possibilities

Methods

pure :: a -> Possibilities a

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

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

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

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

Functor Possibilities

Defined in Disco.Exhaustiveness.Possibilities

Methods

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

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

Monoid (Possibilities a)

Defined in Disco.Exhaustiveness.Possibilities

Methods

mempty :: Possibilities a

mappend :: Possibilities a -> Possibilities a -> Possibilities a

mconcat :: [Possibilities a] -> Possibilities a

Semigroup (Possibilities a)

Defined in Disco.Exhaustiveness.Possibilities

Methods

(<>) :: Possibilities a -> Possibilities a -> Possibilities a

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

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

Show a => Show (Possibilities a)

Defined in Disco.Exhaustiveness.Possibilities

Methods

showsPrec :: Int -> Possibilities a -> ShowS

show :: Possibilities a -> String

showList :: [Possibilities a] -> ShowS

Eq a => Eq (Possibilities a)

Defined in Disco.Exhaustiveness.Possibilities

Methods

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

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

Ord a => Ord (Possibilities a)

Defined in Disco.Exhaustiveness.Possibilities

Methods

compare :: Possibilities a -> Possibilities a -> Ordering

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

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

(>) :: Possibilities a -> Possibilities a -> Bool

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

max :: Possibilities a -> Possibilities a -> Possibilities a

min :: Possibilities a -> Possibilities a -> Possibilities a

retSingle :: Monad m => a -> m (Possibilities a)

allCombinations :: [Possibilities a] -> Possibilities [a]

List all possible paths through the list of Possibilites

Ex. > allCombinations [ Possibilities [1] , Possibilities [2,3] , Possibilities [4] , Possibilities [5,6,7] ] === Possibilities {getPossibilities = [[1,2,4,5] ,[1,2,4,6] ,[1,2,4,7] ,[1,3,4,5] ,[1,3,4,6] ,[1,3,4,7] ]}

2 5 1 4 --6 / 3 7

If any any of the Possibilities is empty, an empty Possibility is returned

In other words, this lists all elements of the cartesian product of multiple sets

anyOf :: [Possibilities a] -> Possibilities a

none :: Possibilities a -> Bool

getPossibilities :: Possibilities a -> [a]