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

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 #

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

Instances details

Apply prim => Apply (RebaseFixup prim) # |

Instance details

Defined in Darcs.Patch.Rebase.Fixup

Associated Types

type ApplyState (RebaseFixup prim) |
Instance details Defined in Darcs.Patch.Rebase.Fixup type ApplyState (RebaseFixup prim) = ApplyState prim

Methods

apply :: ApplyMonad (ApplyState (RebaseFixup prim)) m => RebaseFixup prim wX wY -> m () #

unapply :: ApplyMonad (ApplyState (RebaseFixup prim)) m => RebaseFixup prim wX wY -> m () #

Commute prim => Commute (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods commute :: (RebaseFixup prim :> RebaseFixup prim) wX wY -> Maybe ((RebaseFixup prim :> RebaseFixup prim) wX wY) #
PatchListFormat (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods patchListFormat :: ListFormat (RebaseFixup prim) #
PrimPatch prim => PrimPatchBase (RebaseFixup prim) # |

Instance details

Defined in Darcs.Patch.Rebase.Fixup

Associated Types

type PrimOf (RebaseFixup prim) |
Instance details Defined in Darcs.Patch.Rebase.Fixup type PrimOf (RebaseFixup prim) = prim

PatchInspect prim => PatchInspect (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods listTouchedFiles :: RebaseFixup prim wX wY -> [AnchoredPath] # hunkMatches :: (ByteString -> Bool) -> RebaseFixup prim wX wY -> Bool #
Invert prim => Invert (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods invert :: RebaseFixup prim wX wY -> RebaseFixup prim wY wX #
ReadPatch prim => ReadPatch (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods readPatch' :: Parser (Sealed (RebaseFixup prim wX)) #
ShowPatchBasic prim => ShowPatchBasic (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showPatch :: ShowPatchFor -> RebaseFixup prim wX wY -> Doc #
Show2 prim => Show2 (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showDict2 :: ShowDict (RebaseFixup prim wX wY) #
Show2 prim => Show1 (RebaseFixup prim wX) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup Methods showDict1 :: Dict (Show (RebaseFixup prim wX wX0)) #
Show2 prim => Show (RebaseFixup prim wX wY) # |
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) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup type ApplyState (RebaseFixup prim) = ApplyState prim
type PrimOf (RebaseFixup prim) # |
Instance details Defined in Darcs.Patch.Rebase.Fixup type PrimOf (RebaseFixup prim) = prim

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 #

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 #