Safe Haskell	None
Language	Haskell2010

Darcs.Patch.Rebase.Fixup

Synopsis

data RebaseFixup prim wX wY where
- PrimFixup :: prim wX wY -> RebaseFixup prim wX wY
- NameFixup :: RebaseName wX wY -> RebaseFixup prim wX wY
commuteNamedFixup :: Commute prim => (Named prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> Named prim) wX wY)
commuteFixupNamed :: Commute prim => (RebaseFixup prim :> Named prim) wX wY -> Maybe ((Named prim :> RebaseFixup prim) wX wY)
pushFixupFixup :: PrimPatch prim => DiffAlgorithm -> PushFixupFn (RebaseFixup prim) (RebaseFixup prim) (FL (RebaseFixup prim)) (Maybe2 (RebaseFixup prim))
flToNamesPrims :: FL (RebaseFixup prim) wX wY -> (FL RebaseName :> FL prim) wX wY
namedToFixups :: (PrimPatch (PrimOf p), Effect p) => Named p wX wY -> FL (RebaseFixup (PrimOf p)) wX wY

Documentation

data RebaseFixup prim 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 :: prim wX wY -> RebaseFixup prim wX wY
NameFixup :: RebaseName wX wY -> RebaseFixup prim wX wY

Instances

Instances details

PatchListFormat (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods patchListFormat :: ListFormat (RebaseFixup prim) Source #
Show2 prim => Show2 (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showDict2 :: ShowDict (RebaseFixup prim wX wY) Source #
Invert prim => Invert (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods invert :: RebaseFixup prim wX wY -> RebaseFixup prim wY wX Source #
Commute prim => Commute (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods commute :: (RebaseFixup prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> RebaseFixup prim) wX wY) Source #
PatchInspect prim => PatchInspect (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods listTouchedFiles :: RebaseFixup prim wX wY -> [AnchoredPath] Source # hunkMatches :: (ByteString -> Bool) -> RebaseFixup prim wX wY -> Bool Source #
Apply prim => Apply (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Associated Types type ApplyState (RebaseFixup prim) :: (Type -> Type) -> Type Source # Methods apply :: ApplyMonad (ApplyState (RebaseFixup prim)) m => RebaseFixup prim wX wY -> m () Source # unapply :: ApplyMonad (ApplyState (RebaseFixup prim)) m => RebaseFixup prim wX wY -> m () Source #
ShowPatchBasic prim => ShowPatchBasic (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showPatch :: ShowPatchFor -> RebaseFixup prim wX wY -> Doc Source #
ReadPatch prim => ReadPatch (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods readPatch' :: Parser (Sealed (RebaseFixup prim wX)) Source #
PrimPatch prim => PrimPatchBase (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Associated Types type PrimOf (RebaseFixup prim) :: Type -> Type -> Type Source #
Show2 prim => Show1 (RebaseFixup prim wX) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showDict1 :: Dict (Show (RebaseFixup prim wX wX0)) Source #
Show2 prim => Show (RebaseFixup prim wX wY) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showsPrec :: Int -> RebaseFixup prim wX wY -> ShowS # show :: RebaseFixup prim wX wY -> String # showList :: [RebaseFixup prim wX wY] -> ShowS #
type ApplyState (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup type ApplyState (RebaseFixup prim) = ApplyState prim
type PrimOf (RebaseFixup prim) Source #
Instance details Defined in Darcs.Patch.Rebase.Fixup type PrimOf (RebaseFixup prim) = prim

commuteNamedFixup :: Commute prim => (Named prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> Named prim) wX wY) Source #

commuteFixupNamed :: Commute prim => (RebaseFixup prim :> Named prim) wX wY -> Maybe ((Named prim :> RebaseFixup prim) wX wY) Source #

pushFixupFixup :: PrimPatch prim => DiffAlgorithm -> PushFixupFn (RebaseFixup prim) (RebaseFixup prim) (FL (RebaseFixup prim)) (Maybe2 (RebaseFixup prim)) Source #

flToNamesPrims :: FL (RebaseFixup prim) wX wY -> (FL RebaseName :> FL prim) wX wY Source #

Split a sequence of fixups into names and prims

namedToFixups :: (PrimPatch (PrimOf p), Effect p) => Named p wX wY -> FL (RebaseFixup (PrimOf p)) wX wY Source #