darcs-2.16.5: a distributed, interactive, smart revision control system

Safe Haskell | Safe-Inferred
Language | Haskell2010

Darcs.Patch.Prim.V1.Commute

Contents

- Orphan instances

# Documentation

data Perhaps a #

Constructors

Unknown |
Failed |
Succeeded a |

#### Instances

Instances details

Alternative Perhaps # |
Instance details 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] #
Applicative Perhaps # |
Instance details 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 #
Functor Perhaps # |
Instance details Defined in Darcs.Patch.Prim.V1.Commute Methods fmap :: (a -> b) -> Perhaps a -> Perhaps b # (<$) :: a -> Perhaps b -> Perhaps a #
Monad Perhaps # |
Instance details 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 #
MonadPlus Perhaps # |
Instance details 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 # |
Instance details Methods commute :: (Prim :> Prim) wX wY -> Maybe ((Prim :> Prim) wX wY) #
CleanMerge Prim # |
Instance details Methods cleanMerge :: (Prim :\/: Prim) wX wY -> Maybe ((Prim :/\: Prim) wX wY) #