| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Darcs.Patch.CommuteFn
Synopsis
- type CommuteFn p1 p2 = forall wX wY. (p1 :> p2) wX wY -> Maybe ((p2 :> p1) wX wY)
- commuterIdFL :: CommuteFn p1 p2 -> CommuteFn p1 (FL p2)
- commuterFLId :: CommuteFn p1 p2 -> CommuteFn (FL p1) p2
- commuterIdRL :: CommuteFn p1 p2 -> CommuteFn p1 (RL p2)
- commuterRLId :: CommuteFn p1 p2 -> CommuteFn (RL p1) p2
- commuterRLFL :: forall p1 p2. CommuteFn p1 p2 -> CommuteFn (RL p1) (FL p2)
- type MergeFn p1 p2 = forall wX wY. (p1 :\/: p2) wX wY -> (p2 :/\: p1) wX wY
- type PartialMergeFn p1 p2 = forall wX wY. (p1 :\/: p2) wX wY -> Maybe ((p2 :/\: p1) wX wY)
- mergerIdFL :: MergeFn p1 p2 -> MergeFn p1 (FL p2)
- type TotalCommuteFn p1 p2 = forall wX wY. (p1 :> p2) wX wY -> (p2 :> p1) wX wY
- totalCommuterIdFL :: TotalCommuteFn p1 p2 -> TotalCommuteFn p1 (FL p2)
- totalCommuterFLId :: TotalCommuteFn p1 p2 -> TotalCommuteFn (FL p1) p2
- totalCommuterFLFL :: TotalCommuteFn p1 p2 -> TotalCommuteFn (FL p1) (FL p2)
- invertCommuter :: (Invert p, Invert q) => CommuteFn p q -> CommuteFn q p
Documentation
type CommuteFn p1 p2 = forall wX wY. (p1 :> p2) wX wY -> Maybe ((p2 :> p1) wX wY) Source #
CommuteFn is the basis of a general framework for building up commutation operations between different patch types in a generic manner. Unfortunately type classes are not well suited to the problem because of the multiple possible routes by which the commuter for (FL p1, FL p2) can be built out of the commuter for (p1, p2) - and more complicated problems when we start building multiple constructors on top of each other. The type class resolution machinery really can't cope with selecting some route, because it doesn't know that all possible routes should be equivalent.
Note that a CommuteFn cannot be lazy i.e. commute patches only when the
resulting sequences are demanded. This is because of the possibility of
failure (Nothing): all the commutes must be performed before we can know
whether the overall commute succeeds.
type TotalCommuteFn p1 p2 = forall wX wY. (p1 :> p2) wX wY -> (p2 :> p1) wX wY Source #
totalCommuterIdFL :: TotalCommuteFn p1 p2 -> TotalCommuteFn p1 (FL p2) Source #
TODO document laziness or lack thereof
totalCommuterFLId :: TotalCommuteFn p1 p2 -> TotalCommuteFn (FL p1) p2 Source #
TODO document laziness or lack thereof
totalCommuterFLFL :: TotalCommuteFn p1 p2 -> TotalCommuteFn (FL p1) (FL p2) Source #
TODO document laziness or lack thereof