Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data Prim wX wY where
- 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 DirPatchType wX wY Source #
Eq2 DirPatchType Source # | |
Eq (DirPatchType wX wY) Source # | |
Ord (DirPatchType wX wY) Source # | |
data FilePatchType wX wY Source #
RmFile | |
AddFile | |
Hunk !Int [ByteString] [ByteString] | |
TokReplace !String !String !String | |
Binary ByteString ByteString |
Eq2 FilePatchType Source # | |
Eq (FilePatchType wX wY) Source # | |
Ord (FilePatchType wX wY) Source # | |
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.