Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- class PrimConstruct prim where
- addfile :: FilePath -> prim wX wY
- rmfile :: FilePath -> prim wX wY
- adddir :: FilePath -> prim wX wY
- rmdir :: FilePath -> prim wX wY
- move :: FilePath -> FilePath -> prim wX wY
- changepref :: String -> String -> String -> prim wX wY
- hunk :: FilePath -> Int -> [ByteString] -> [ByteString] -> prim wX wY
- tokreplace :: FilePath -> String -> String -> String -> prim wX wY
- binary :: FilePath -> ByteString -> ByteString -> prim wX wY
- primFromHunk :: FileHunk wX wY -> prim wX wY
- anIdentity :: prim wX wX
- class PrimCanonize prim where
- tryToShrink :: FL prim wX wY -> FL prim wX wY
- tryShrinkingInverse :: FL prim wX wY -> Maybe (FL prim wX wY)
- sortCoalesceFL :: FL prim wX wY -> FL prim wX wY
- canonize :: DiffAlgorithm -> prim wX wY -> FL prim wX wY
- canonizeFL :: DiffAlgorithm -> FL prim wX wY -> FL prim wX wY
- coalesce :: (prim :> prim) wX wY -> Maybe (FL prim wX wY)
- class PrimClassify prim where
- primIsAddfile :: prim wX wY -> Bool
- primIsRmfile :: prim wX wY -> Bool
- primIsAdddir :: prim wX wY -> Bool
- primIsRmdir :: prim wX wY -> Bool
- primIsMove :: prim wX wY -> Bool
- primIsHunk :: prim wX wY -> Bool
- primIsTokReplace :: prim wX wY -> Bool
- primIsBinary :: prim wX wY -> Bool
- primIsSetpref :: prim wX wY -> Bool
- is_filepatch :: prim wX wY -> Maybe FileName
- class PrimDetails prim where
- summarizePrim :: prim wX wY -> [SummDetail]
- class PrimShow prim where
- showPrim :: FileNameFormat -> prim wA wB -> Doc
- showPrimCtx :: ApplyMonad (ApplyState prim) m => FileNameFormat -> prim wA wB -> m Doc
- class PrimRead prim where
- readPrim :: ParserM m => FileNameFormat -> m (Sealed (prim wX))
- class PrimApply prim where
- applyPrimFL :: ApplyMonad (ApplyState prim) m => FL prim wX wY -> m ()
- class (PrimPatchCommon prim, ReadPatch prim, ShowPatch prim, ShowContextPatch prim, PatchListFormat prim) => PrimPatch prim
- class PrimPatch (PrimOf p) => PrimPatchBase p where
- type PrimOf (p :: * -> * -> *) :: * -> * -> *
- class FromPrim p where
- class FromPrims p where
- class FromPrim p => ToFromPrim p where
- class (Apply prim, Commute prim, Invert prim, Eq2 prim, IsHunk prim, PatchInspect prim, RepairToFL prim, Show2 prim, PrimConstruct prim, PrimCanonize prim, PrimClassify prim, PrimDetails prim, PrimApply prim) => PrimPatchCommon prim
Documentation
class PrimConstruct prim where Source #
addfile :: FilePath -> prim wX wY Source #
rmfile :: FilePath -> prim wX wY Source #
adddir :: FilePath -> prim wX wY Source #
rmdir :: FilePath -> prim wX wY Source #
move :: FilePath -> FilePath -> prim wX wY Source #
changepref :: String -> String -> String -> prim wX wY Source #
hunk :: FilePath -> Int -> [ByteString] -> [ByteString] -> prim wX wY Source #
tokreplace :: FilePath -> String -> String -> String -> prim wX wY Source #
binary :: FilePath -> ByteString -> ByteString -> prim wX wY Source #
primFromHunk :: FileHunk wX wY -> prim wX wY Source #
anIdentity :: prim wX wX Source #
Instances
class PrimCanonize prim where Source #
tryToShrink :: FL prim wX wY -> FL prim wX wY Source #
tryToShrink ps
simplifies ps
by getting rid of self-cancellations
or coalescing patches
Question (Eric Kow): what properties should this have? For example, the prim1 implementation only gets rid of the first self-cancellation it finds (as far as I can tell). Is that OK? Can we try harder?
tryShrinkingInverse :: FL prim wX wY -> Maybe (FL prim wX wY) Source #
tryShrinkingInverse ps
deletes the first subsequence of
primitive patches that is followed by the inverse subsequence,
if one exists. If not, it returns Nothing
sortCoalesceFL :: FL prim wX wY -> FL prim wX wY Source #
sortCoalesceFL
ps
coalesces as many patches in ps
as
possible, sorting the results in some standard order.
canonize :: DiffAlgorithm -> prim wX wY -> FL prim wX wY Source #
It can sometimes be handy to have a canonical representation of a given
patch. We achieve this by defining a canonical form for each patch type,
and a function canonize
which takes a patch and puts it into
canonical form. This routine is used by the diff function to create an
optimal patch (based on an LCS algorithm) from a simple hunk describing the
old and new version of a file.
canonizeFL :: DiffAlgorithm -> FL prim wX wY -> FL prim wX wY Source #
canonizeFL
ps
puts a sequence of primitive patches into
canonical form. Even if the patches are just hunk patches,
this is not necessarily the same set of results as you would get
if you applied the sequence to a specific tree and recalculated
a diff.
Note that this process does not preserve the commutation behaviour of the patches and is therefore not appropriate for use when working with already recorded patches (unless doing amend-record or the like).
coalesce :: (prim :> prim) wX wY -> Maybe (FL prim wX wY) Source #
Instances
class PrimClassify prim where Source #
primIsAddfile :: prim wX wY -> Bool Source #
primIsRmfile :: prim wX wY -> Bool Source #
primIsAdddir :: prim wX wY -> Bool Source #
primIsRmdir :: prim wX wY -> Bool Source #
primIsMove :: prim wX wY -> Bool Source #
primIsHunk :: prim wX wY -> Bool Source #
primIsTokReplace :: prim wX wY -> Bool Source #
primIsBinary :: prim wX wY -> Bool Source #
primIsSetpref :: prim wX wY -> Bool Source #
is_filepatch :: prim wX wY -> Maybe FileName Source #
Instances
class PrimDetails prim where Source #
summarizePrim :: prim wX wY -> [SummDetail] Source #
Instances
PrimDetails Prim Source # | |
Defined in Darcs.Patch.Prim.V1.Details summarizePrim :: Prim wX wY -> [SummDetail] Source # | |
PrimDetails Prim Source # | |
Defined in Darcs.Patch.Prim.FileUUID.Details summarizePrim :: Prim wX wY -> [SummDetail] Source # | |
PrimDetails Prim Source # | |
Defined in Darcs.Patch.V2.Prim summarizePrim :: Prim wX wY -> [SummDetail] Source # | |
PrimDetails Prim Source # | |
Defined in Darcs.Patch.V1.Prim summarizePrim :: Prim wX wY -> [SummDetail] Source # |
class PrimShow prim where Source #
showPrim :: FileNameFormat -> prim wA wB -> Doc Source #
showPrimCtx :: ApplyMonad (ApplyState prim) m => FileNameFormat -> prim wA wB -> m Doc Source #
Instances
ApplyState Prim ~ Tree => PrimShow Prim Source # | |
Defined in Darcs.Patch.Prim.V1.Show showPrim :: FileNameFormat -> Prim wA wB -> Doc Source # showPrimCtx :: ApplyMonad (ApplyState Prim) m => FileNameFormat -> Prim wA wB -> m Doc Source # | |
PrimShow Prim Source # | |
Defined in Darcs.Patch.Prim.FileUUID.Show showPrim :: FileNameFormat -> Prim wA wB -> Doc Source # showPrimCtx :: ApplyMonad (ApplyState Prim) m => FileNameFormat -> Prim wA wB -> m Doc Source # |
class PrimApply prim where Source #
applyPrimFL :: ApplyMonad (ApplyState prim) m => FL prim wX wY -> m () Source #
Instances
PrimApply Prim Source # | |
Defined in Darcs.Patch.Prim.V1.Apply applyPrimFL :: ApplyMonad (ApplyState Prim) m => FL Prim wX wY -> m () Source # | |
PrimApply Prim Source # | |
Defined in Darcs.Patch.Prim.FileUUID.Apply applyPrimFL :: ApplyMonad (ApplyState Prim) m => FL Prim wX wY -> m () Source # | |
PrimApply Prim Source # | |
Defined in Darcs.Patch.V2.Prim applyPrimFL :: ApplyMonad (ApplyState Prim) m => FL Prim wX wY -> m () Source # | |
PrimApply Prim Source # | |
Defined in Darcs.Patch.V1.Prim applyPrimFL :: ApplyMonad (ApplyState Prim) m => FL Prim wX wY -> m () Source # |
class (PrimPatchCommon prim, ReadPatch prim, ShowPatch prim, ShowContextPatch prim, PatchListFormat prim) => PrimPatch prim Source #
Instances
PrimPatch Prim Source # | |
Defined in Darcs.Patch.Prim.FileUUID | |
PrimPatch Prim Source # | |
Defined in Darcs.Patch.V2.Prim | |
PrimPatch Prim Source # | |
Defined in Darcs.Patch.V1.Prim |
class PrimPatch (PrimOf p) => PrimPatchBase p Source #
Instances
class FromPrim p where Source #
Instances
FromPrim Prim Source # | |
FromPrim Prim Source # | |
FromPrim Prim Source # | |
FromPrim DummyPatch Source # | |
Defined in Darcs.Patch.Dummy fromPrim :: PrimOf DummyPatch wX wY -> DummyPatch wX wY Source # | |
FromPrim p => FromPrim (FL p) Source # | |
FromPrim p => FromPrim (Bracketed p) Source # | |
FromPrim (RepoPatchV1 prim) Source # | |
Defined in Darcs.Patch.V1.Core fromPrim :: PrimOf (RepoPatchV1 prim) wX wY -> RepoPatchV1 prim wX wY Source # | |
FromPrim (RepoPatchV2 prim) Source # | |
Defined in Darcs.Patch.V2.RepoPatch fromPrim :: PrimOf (RepoPatchV2 prim) wX wY -> RepoPatchV2 prim wX wY Source # |
class FromPrim p => ToFromPrim p where Source #
Instances
ToFromPrim Prim Source # | |
ToFromPrim Prim Source # | |
ToFromPrim (RepoPatchV2 prim) Source # | |
Defined in Darcs.Patch.V2.RepoPatch toPrim :: RepoPatchV2 prim wX wY -> Maybe (PrimOf (RepoPatchV2 prim) wX wY) Source # |
class (Apply prim, Commute prim, Invert prim, Eq2 prim, IsHunk prim, PatchInspect prim, RepairToFL prim, Show2 prim, PrimConstruct prim, PrimCanonize prim, PrimClassify prim, PrimDetails prim, PrimApply prim) => PrimPatchCommon prim Source #
This class describes the abstract interface to primitive patches that is indepenent of the on-disk format.
Instances
PrimPatchCommon Prim Source # | |
Defined in Darcs.Patch.Prim.V1 | |
PrimPatchCommon Prim Source # | |
Defined in Darcs.Patch.Prim.FileUUID | |
PrimPatchCommon Prim Source # | |
Defined in Darcs.Patch.V2.Prim | |
PrimPatchCommon Prim Source # | |
Defined in Darcs.Patch.V1.Prim |