commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Bruno P. Kinoshita (JIRA)" <j...@apache.org>
Subject [jira] [Created] (SANDBOX-486) Port Myers algorithm from [collections]
Date Sat, 13 Dec 2014 03:46:13 GMT
Bruno P. Kinoshita created SANDBOX-486:
------------------------------------------

             Summary: Port Myers algorithm from [collections]
                 Key: SANDBOX-486
                 URL: https://issues.apache.org/jira/browse/SANDBOX-486
             Project: Commons Sandbox
          Issue Type: New Feature
          Components: Commons Text
            Reporter: Bruno P. Kinoshita
            Priority: Minor


As suggested by Luc \[[#1]\], we could port the Myers algorithm from \[collections\] to \[text\].
I haven't thoroughly studied the paper or the algorithm, but if I recall correctly, the first
time I read it in \[collections\], my impression was that it was some kind of diff algorithm.

Good places to start looking for more information are the algorithm paper \[[#2]\], the package
javadocs from \[collections\] \[[#3]\], and from this Wikipedia article \[[#4]\].

Oh, and from the \[collection\]'s source code as well, of course \[[#5]\].

Cheers,
Bruno

\[1\] {anchor:1} http://markmail.org/search/?q=text+commons+list%3Aorg.apache.commons.dev%2F+order%3Adate-backward#query:text%20commons%20list%3Aorg.apache.commons.dev%2F%20order%3Adate-backward+page:8+mid:fwqr5tcgftot6eww+state:results

\[2\] {anchor:2} http://www.cis.upenn.edu/~bcpierce/courses/dd/papers/diff.ps

\[3\] {anchor:3} https://commons.apache.org/proper/commons-collections/apidocs/org/apache/commons/collections4/sequence/package-summary.html

\[4\] {anchor:4} http://en.wikipedia.org/wiki/Diff_utility

\[5\] {anchor:5} https://github.com/apache/commons-collections/tree/trunk/src/main/java/org/apache/commons/collections4/sequence



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

Mime
View raw message