Compute and return the destination text (all equalities and insertions). @param diffs LinkedList of Diff objects. @return Destination text.
(LinkedList<Diff> diffs)
| 1400 | * @return Destination text. |
| 1401 | */ |
| 1402 | public String diff_text2(LinkedList<Diff> diffs) { |
| 1403 | StringBuilder text = new StringBuilder(); |
| 1404 | for (Diff aDiff : diffs) { |
| 1405 | if (aDiff.operation != Operation.DELETE) { |
| 1406 | text.append(aDiff.text); |
| 1407 | } |
| 1408 | } |
| 1409 | return text.toString(); |
| 1410 | } |
| 1411 | |
| 1412 | /** |
| 1413 | * Compute the Levenshtein distance; the number of inserted, deleted or |
no test coverage detected