Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Prim wX wY where
- Move :: !AnchoredPath -> !AnchoredPath -> Prim wX wY
- DP :: !AnchoredPath -> !(DirPatchType wX wY) -> Prim wX wY
- FP :: !AnchoredPath -> !(FilePatchType wX wY) -> Prim wX wY
- ChangePref :: !String -> !String -> !String -> Prim wX wY
- data DirPatchType wX wY
- data FilePatchType wX wY
- = RmFile
- | AddFile
- | Hunk !Int [ByteString] [ByteString]
- | TokReplace !String !String !String
- | Binary ByteString ByteString
- isIdentity :: Prim wX wY -> EqCheck wX wY
- comparePrim :: Prim wX wY -> Prim wW wZ -> Ordering
Documentation
data Prim wX wY where Source #
Move :: !AnchoredPath -> !AnchoredPath -> Prim wX wY | |
DP :: !AnchoredPath -> !(DirPatchType wX wY) -> Prim wX wY | |
FP :: !AnchoredPath -> !(FilePatchType wX wY) -> Prim wX wY | |
ChangePref :: !String -> !String -> !String -> Prim wX wY |
Instances
data DirPatchType wX wY Source #
Instances
data FilePatchType wX wY Source #
RmFile | |
AddFile | |
Hunk !Int [ByteString] [ByteString] | |
TokReplace !String !String !String | |
Binary ByteString ByteString |
Instances
isIdentity :: Prim wX wY -> EqCheck wX wY Source #
comparePrim :: Prim wX wY -> Prim wW wZ -> Ordering Source #
comparePrim
p1 p2
is used to provide an arbitrary ordering between
p1
and p2
. Basically, identical patches are equal and
Move < DP < FP < ChangePref
.
Everything else is compared in dictionary order of its arguments.