Darcs.Patch.Prim.V1.Commute
Contents
data Perhaps a Source #
Constructors
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 #
fmap :: (a -> b) -> Perhaps a -> Perhaps b #
(<$) :: a -> Perhaps b -> Perhaps a #
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 #
empty :: Perhaps a #
(<|>) :: Perhaps a -> Perhaps a -> Perhaps a #
some :: Perhaps a -> Perhaps [a] #
many :: Perhaps a -> Perhaps [a] #
mzero :: Perhaps a #
mplus :: Perhaps a -> Perhaps a -> Perhaps a #
toPerhaps :: Maybe a -> Perhaps a Source #
type CommuteFunction = forall wX wY. (Prim :> Prim) wX wY -> Perhaps ((Prim :> Prim) wX wY) Source #
speedyCommute :: CommuteFunction Source #
cleverCommute :: CommuteFunction -> CommuteFunction Source #
commuteFiledir :: CommuteFunction Source #
commuteFilepatches :: CommuteFunction Source #
commute :: (Prim :> Prim) wX wY -> Maybe ((Prim :> Prim) wX wY) Source #
cleanMerge :: (Prim :\/: Prim) wX wY -> Maybe ((Prim :/\: Prim) wX wY) Source #