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

Safe Haskell | None
Language | Haskell2010

Darcs.Patch.Rebase.Fixup

Synopsis

- data RebaseFixup p wX wY where
  - PrimFixup :: PrimOf p wX wY -> RebaseFixup p wX wY
  - NameFixup :: RebaseName p wX wY -> RebaseFixup p wX wY
- commuteNamedFixup :: (FromPrim p, Effect p, Commute p, Invert p) => (Named p :> RebaseFixup p) wX wY -> Maybe ((FL (RebaseFixup p) :> Named p) wX wY)
- commuteFixupNamed :: (FromPrim p, Effect p, Commute p, Invert p) => (RebaseFixup p :> Named p) wX wY -> Maybe ((Named p :> FL (RebaseFixup p)) wX wY)
- commuteNamedFixups :: (FromPrim p, Effect p, Commute p, Invert p) => (Named p :> FL (RebaseFixup p)) wX wY -> Maybe ((FL (RebaseFixup p) :> Named p) wX wY)
- flToNamesPrims :: PrimPatchBase p => FL (RebaseFixup p) wX wY -> (FL (RebaseName p) :> FL (PrimOf p)) wX wY
- namedToFixups :: Effect p => Named p wX wY -> FL (RebaseFixup p) wX wY

# Documentation

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

Instances

Show2 (PrimOf p) => Show2 (RebaseFixup p) # |
Methods showDict2 :: ShowDict (RebaseFixup p wX wY) #
MyEq (PrimOf p) => MyEq (RebaseFixup p) # |
Methods unsafeCompare :: RebaseFixup p wA wB -> RebaseFixup p wC wD -> Bool # (=\/=) :: RebaseFixup p wA wB -> RebaseFixup p wA wC -> EqCheck wB wC # (=/\=) :: RebaseFixup p wA wC -> RebaseFixup p wB wC -> EqCheck wA wB #
PrimPatchBase p => Commute (RebaseFixup p) # |
Methods commute :: (RebaseFixup p :> RebaseFixup p) wX wY -> Maybe ((RebaseFixup p :> RebaseFixup p) wX wY) #
PatchInspect (PrimOf p) => PatchInspect (RebaseFixup p) # |
Methods listTouchedFiles :: RebaseFixup p wX wY -> [FilePath] # hunkMatches :: (ByteString -> Bool) -> RebaseFixup p wX wY -> Bool #
Invert (PrimOf p) => Invert (RebaseFixup p) # |
Methods invert :: RebaseFixup p wX wY -> RebaseFixup p wY wX #
(PrimPatchBase p, Apply p, (~) ((* -> *) -> *) (ApplyState p) (ApplyState (PrimOf p))) => Apply (RebaseFixup p) # |
Associated Types type ApplyState (RebaseFixup p :: * -> * -> *) :: (* -> *) -> * # Methods apply :: ApplyMonad (ApplyState (RebaseFixup p)) m => RebaseFixup p wX wY -> m () #
PrimPatchBase p => PrimPatchBase (RebaseFixup p) # |
Associated Types type PrimOf (RebaseFixup p :: * -> * -> *) :: * -> * -> * #
Effect (RebaseFixup p) # |
Methods effect :: RebaseFixup p wX wY -> FL (PrimOf (RebaseFixup p)) wX wY # effectRL :: RebaseFixup p wX wY -> RL (PrimOf (RebaseFixup p)) wX wY #
Show2 (PrimOf p) => Show1 (RebaseFixup p wX) # |
Methods showDict1 :: ShowDict (RebaseFixup p wX wX) #
Show2 (PrimOf p) => Show (RebaseFixup p wX wY) # |
Methods showsPrec :: Int -> RebaseFixup p wX wY -> ShowS # show :: RebaseFixup p wX wY -> String # showList :: [RebaseFixup p wX wY] -> ShowS #
type ApplyState (RebaseFixup p) # |
type ApplyState (RebaseFixup p) = ApplyState p
type PrimOf (RebaseFixup p) # |
type PrimOf (RebaseFixup p) = PrimOf p

commuteNamedFixup :: (FromPrim p, Effect p, Commute p, Invert p) => (Named p :> RebaseFixup p) wX wY -> Maybe ((FL (RebaseFixup p) :> Named p) wX wY) #

commuteFixupNamed :: (FromPrim p, Effect p, Commute p, Invert p) => (RebaseFixup p :> Named p) wX wY -> Maybe ((Named p :> FL (RebaseFixup p)) wX wY) #

commuteNamedFixups :: (FromPrim p, Effect p, Commute p, Invert p) => (Named p :> FL (RebaseFixup p)) wX wY -> Maybe ((FL (RebaseFixup p) :> Named p) wX wY) #

flToNamesPrims :: PrimPatchBase p => FL (RebaseFixup p) wX wY -> (FL (RebaseName p) :> FL (PrimOf p)) wX wY #

Split a sequence of fixups into names and prims

namedToFixups :: Effect p => Named p wX wY -> FL (RebaseFixup p) wX wY #