úÎ Ù ô Safe-InferredJA hunk is a collection of changes that occur in a document. A hunk can be . some changes only in A, only in B, in both A & B (equally), or conflicting O between A, B and the original document. All hunks take 3 constructors, which O are, in order - the elements in the left document, the original document, and C the right document. This order matches the order of parameters to . IPerform a 3-way diff against 2 documents and the original document. This  returns a list of s, where each ! contains the original document, O a change in the left or right side, or is in conflict. This can be considered  a ' low level'9 interface to the 3-way diff algorithm - you may be more  interested in . An infix synonym for .       diff3-0.2.0.2Data.Algorithm.Diff3HunkConflict Unchanged RightChange LeftChangediff3merge<>base Data.MonoidmappendtoHunk takeSecond takeFirstisB shortestMatchshortestConflict incurMotion $fFunctorHunk