Darcs.Patch.Prim.V1.Commute

Documentation

data Perhaps a

Constructors

Unknown

Failed

Succeeded a

Instances

Monad Perhaps

Defined in Darcs.Patch.Prim.V1.Commute

Methods

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

(>>) :: Perhaps a -> Perhaps b -> Perhaps b

return :: a -> Perhaps a

Functor Perhaps

Defined in Darcs.Patch.Prim.V1.Commute

Methods

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

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

Applicative Perhaps

Defined in Darcs.Patch.Prim.V1.Commute

Methods

pure :: a -> Perhaps a

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

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

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

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

Alternative Perhaps

Defined in Darcs.Patch.Prim.V1.Commute

Methods

empty :: Perhaps a

(<|>) :: Perhaps a -> Perhaps a -> Perhaps a

some :: Perhaps a -> Perhaps [a]

many :: Perhaps a -> Perhaps [a]

MonadPlus Perhaps

Defined in Darcs.Patch.Prim.V1.Commute

Methods

mzero :: Perhaps a

mplus :: Perhaps a -> Perhaps a -> Perhaps a

toPerhaps :: Maybe a -> Perhaps a

type CommuteFunction = forall wX wY. (Prim :> Prim) wX wY -> Perhaps ((Prim :> Prim) wX wY)

speedyCommute :: CommuteFunction

cleverCommute :: CommuteFunction -> CommuteFunction

commuteFiledir :: CommuteFunction

commuteFilepatches :: CommuteFunction

Orphan instances

Commute Prim

Methods

commute :: (Prim :> Prim) wX wY -> Maybe ((Prim :> Prim) wX wY)

CleanMerge Prim

Methods

cleanMerge :: (Prim :\/: Prim) wX wY -> Maybe ((Prim :/\: Prim) wX wY)