* compose Longest Common Subsequence and Shortest Edit Script. * The algorithm implemented here is based on "An O(NP) Sequence Comparison Alg

* patching with Shortest Edit Script (SES) */

* patching with Unified Format Hunks */

* compose Unified Format Hunks from Shortest Edit Script */

* merge changes B and C into A */

* Intdifftest * check list is following * - editdistance * - LCS * - SES */

* Strdiff3test * check list is following * - merge function * - detect confliction */

* Patchtest * check list is following * - patch function * - uniPatch function */

* add elements whose SES's type is ADD */

* compose differences */

These are the replacements for the above */

* initialize */

These should be deprecated */

* join elem vectors */

* join SES vectors */