Safe Haskell | None |
---|---|
Language | Haskell2010 |
Darcs.Patch.Rebase.Fixup
Synopsis
- data RebaseFixup (prim :: Type -> Type -> Type) wX wY where
- PrimFixup :: forall (prim :: Type -> Type -> Type) wX wY. prim wX wY -> RebaseFixup prim wX wY
- NameFixup :: forall wX wY (prim :: Type -> Type -> Type). RebaseName wX wY -> RebaseFixup prim wX wY
- commuteNamedFixup :: forall (prim :: Type -> Type -> Type) wX wY. Commute prim => (Named prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> Named prim) wX wY)
- commuteFixupNamed :: forall (prim :: Type -> Type -> Type) wX wY. Commute prim => (RebaseFixup prim :> Named prim) wX wY -> Maybe ((Named prim :> RebaseFixup prim) wX wY)
- pushFixupFixup :: forall (prim :: Type -> Type -> Type). PrimPatch prim => DiffAlgorithm -> PushFixupFn (RebaseFixup prim) (RebaseFixup prim) (FL (RebaseFixup prim)) (Maybe2 (RebaseFixup prim))
- flToNamesPrims :: forall (prim :: Type -> Type -> Type) wX wY. FL (RebaseFixup prim) wX wY -> (FL RebaseName :> FL prim) wX wY
- namedToFixups :: forall (p :: Type -> Type -> Type) wX wY. Effect p => Named p wX wY -> FL (RebaseFixup (PrimOf p)) wX wY
Documentation
data RebaseFixup (prim :: Type -> Type -> Type) wX wY where Source #
A single rebase fixup, needed to ensure that the actual patches being stored in the rebase state have the correct context.
Constructors
PrimFixup :: forall (prim :: Type -> Type -> Type) wX wY. prim wX wY -> RebaseFixup prim wX wY | |
NameFixup :: forall wX wY (prim :: Type -> Type -> Type). RebaseName wX wY -> RebaseFixup prim wX wY |
Instances
commuteNamedFixup :: forall (prim :: Type -> Type -> Type) wX wY. Commute prim => (Named prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> Named prim) wX wY) Source #
commuteFixupNamed :: forall (prim :: Type -> Type -> Type) wX wY. Commute prim => (RebaseFixup prim :> Named prim) wX wY -> Maybe ((Named prim :> RebaseFixup prim) wX wY) Source #
pushFixupFixup :: forall (prim :: Type -> Type -> Type). PrimPatch prim => DiffAlgorithm -> PushFixupFn (RebaseFixup prim) (RebaseFixup prim) (FL (RebaseFixup prim)) (Maybe2 (RebaseFixup prim)) Source #
flToNamesPrims :: forall (prim :: Type -> Type -> Type) wX wY. FL (RebaseFixup prim) wX wY -> (FL RebaseName :> FL prim) wX wY Source #
Split a sequence of fixups into names and prims
namedToFixups :: forall (p :: Type -> Type -> Type) wX wY. Effect p => Named p wX wY -> FL (RebaseFixup (PrimOf p)) wX wY Source #