Safe Haskell | None |
---|---|
Language | Haskell2010 |
Darcs.Patch.Prim.Class
Documentation
class PrimConstruct prim where
Methods
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
Instances
class PrimCanonize prim where
Methods
tryToShrink :: FL prim wX wY -> FL prim wX wY
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)
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
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
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
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).
class PrimClassify prim where
Methods
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
Instances
class PrimDetails prim where
Methods
summarizePrim :: prim wX wY -> [SummDetail]
class PrimShow prim where
Methods
showPrim :: FileNameFormat -> prim wA wB -> Doc
showPrimFL :: PrimShow prim => FileNameFormat -> FL prim wA wB -> Doc
class PrimRead prim where
Methods
readPrim :: ParserM m => FileNameFormat -> m (Sealed (prim wX))
class PrimApply prim where
Methods
applyPrimFL :: ApplyMonad m (ApplyState prim) => FL prim wX wY -> m ()
class (Patchy prim, MyEq prim, PatchListFormat prim, IsHunk prim, RepairToFL prim, PatchInspect prim, ReadPatch prim, ShowPatch prim, PrimConstruct prim, PrimCanonize prim, PrimClassify prim, PrimDetails prim, PrimShow prim, PrimRead prim, PrimApply prim) => PrimPatch prim
class PrimPatch (PrimOf p) => PrimPatchBase p
Associated Types
type PrimOf p :: * -> * -> *
Instances
PrimPatchBase DummyPatch | |
PrimPatchBase p => PrimPatchBase (RL p) | |
PrimPatchBase p => PrimPatchBase (FL p) | |
PrimPatchBase p => PrimPatchBase (Named p) | |
PrimPatchBase p => PrimPatchBase (RebaseName p) | |
PrimPatchBase p => PrimPatchBase (RebaseFixup p) | |
PrimPatch prim => PrimPatchBase (Patch prim) | |
PrimPatch prim => PrimPatchBase (RealPatch prim) | |
PrimPatchBase p => PrimPatchBase (PatchInfoAnd p) | |
PrimPatchBase p => PrimPatchBase (Rebasing p) | |
PrimPatchBase p => PrimPatchBase (WithDroppedDeps p) | |
PrimPatch (PrimOf p) => PrimPatchBase (RebaseChange p) | |
PrimPatchBase p => PrimPatchBase (RebaseSelect p) |
class FromPrim p where
class FromPrims p where
class FromPrim p => ToFromPrim p where
Instances
ToFromPrim (RealPatch prim) |