3 * A PHP diff engine for phpwiki. (Taken from phpwiki-1.3.3)
5 * Copyright © 2000, 2001 Geoffrey T. Dairiki <dairiki@dairiki.org>
6 * You may copy this code freely under the conditions of the GPL.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License along
19 * with this program; if not, write to the Free Software Foundation, Inc.,
20 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
21 * http://www.gnu.org/copyleft/gpl.html
24 * @ingroup DifferenceEngine
25 * @defgroup DifferenceEngine DifferenceEngine
29 * The base class for all other DiffOp classes.
31 * The classes that extend DiffOp are: DiffOpCopy, DiffOpDelete, DiffOpAdd and
32 * DiffOpChange. FakeDiffOp also extends DiffOp, but it is not located in this file.
35 * @ingroup DifferenceEngine
37 abstract class DiffOp
{
57 public function getType() {
64 public function getOrig() {
72 public function getClosing( $i = null ) {
74 return $this->closing
;
76 if ( array_key_exists( $i, $this->closing
) ) {
77 return $this->closing
[$i];
82 abstract public function reverse();
87 public function norig() {
88 return $this->orig ?
count( $this->orig
) : 0;
94 public function nclosing() {
95 return $this->closing ?
count( $this->closing
) : 0;
100 * Extends DiffOp. Used to mark strings that have been
101 * copied from one string array to the other.
104 * @ingroup DifferenceEngine
106 class DiffOpCopy
extends DiffOp
{
107 public $type = 'copy';
109 public function __construct( $orig, $closing = false ) {
110 if ( !is_array( $closing ) ) {
114 $this->closing
= $closing;
120 public function reverse() {
121 return new DiffOpCopy( $this->closing
, $this->orig
);
126 * Extends DiffOp. Used to mark strings that have been
127 * deleted from the first string array.
130 * @ingroup DifferenceEngine
132 class DiffOpDelete
extends DiffOp
{
133 public $type = 'delete';
135 public function __construct( $lines ) {
136 $this->orig
= $lines;
137 $this->closing
= false;
143 public function reverse() {
144 return new DiffOpAdd( $this->orig
);
149 * Extends DiffOp. Used to mark strings that have been
150 * added from the first string array.
153 * @ingroup DifferenceEngine
155 class DiffOpAdd
extends DiffOp
{
156 public $type = 'add';
158 public function __construct( $lines ) {
159 $this->closing
= $lines;
164 * @return DiffOpDelete
166 public function reverse() {
167 return new DiffOpDelete( $this->closing
);
172 * Extends DiffOp. Used to mark strings that have been
173 * changed from the first string array (both added and subtracted).
176 * @ingroup DifferenceEngine
178 class DiffOpChange
extends DiffOp
{
179 public $type = 'change';
181 public function __construct( $orig, $closing ) {
183 $this->closing
= $closing;
187 * @return DiffOpChange
189 public function reverse() {
190 return new DiffOpChange( $this->closing
, $this->orig
);
195 * Class used internally by Diff to actually compute the diffs.
197 * The algorithm used here is mostly lifted from the perl module
198 * Algorithm::Diff (version 1.06) by Ned Konz, which is available at:
199 * http://www.perl.com/CPAN/authors/id/N/NE/NEDKONZ/Algorithm-Diff-1.06.zip
201 * More ideas are taken from:
202 * http://www.ics.uci.edu/~eppstein/161/960229.html
204 * Some ideas (and a bit of code) are from analyze.c, from GNU
205 * diffutils-2.7, which can be found at:
206 * ftp://gnudist.gnu.org/pub/gnu/diffutils/diffutils-2.7.tar.gz
208 * closingly, some ideas (subdivision by NCHUNKS > 2, and some optimizations)
211 * Line length limits for robustness added by Tim Starling, 2005-08-31
212 * Alternative implementation added by Guy Van den Broeck, 2008-07-30
214 * @author Geoffrey T. Dairiki, Tim Starling, Guy Van den Broeck
216 * @ingroup DifferenceEngine
219 const MAX_XREF_LENGTH
= 10000;
221 protected $xchanged, $ychanged;
223 protected $xv = [], $yv = [];
224 protected $xind = [], $yind = [];
226 protected $seq = [], $in_seq = [];
231 * @param string[] $from_lines
232 * @param string[] $to_lines
236 public function diff( $from_lines, $to_lines ) {
238 // Diff and store locally
239 $this->diffLocal( $from_lines, $to_lines );
241 // Merge edits when possible
242 $this->shiftBoundaries( $from_lines, $this->xchanged
, $this->ychanged
);
243 $this->shiftBoundaries( $to_lines, $this->ychanged
, $this->xchanged
);
245 // Compute the edit operations.
246 $n_from = count( $from_lines );
247 $n_to = count( $to_lines );
251 while ( $xi < $n_from ||
$yi < $n_to ) {
252 assert( $yi < $n_to ||
$this->xchanged
[$xi] );
253 assert( $xi < $n_from ||
$this->ychanged
[$yi] );
255 // Skip matching "snake".
257 while ( $xi < $n_from && $yi < $n_to
258 && !$this->xchanged
[$xi] && !$this->ychanged
[$yi]
260 $copy[] = $from_lines[$xi++
];
264 $edits[] = new DiffOpCopy( $copy );
267 // Find deletes & adds.
269 while ( $xi < $n_from && $this->xchanged
[$xi] ) {
270 $delete[] = $from_lines[$xi++
];
274 while ( $yi < $n_to && $this->ychanged
[$yi] ) {
275 $add[] = $to_lines[$yi++
];
278 if ( $delete && $add ) {
279 $edits[] = new DiffOpChange( $delete, $add );
280 } elseif ( $delete ) {
281 $edits[] = new DiffOpDelete( $delete );
283 $edits[] = new DiffOpAdd( $add );
291 * @param string[] $from_lines
292 * @param string[] $to_lines
294 private function diffLocal( $from_lines, $to_lines ) {
295 global $wgExternalDiffEngine;
297 if ( $wgExternalDiffEngine == 'wikidiff3' ) {
299 $wikidiff3 = new WikiDiff3();
300 $wikidiff3->diff( $from_lines, $to_lines );
301 $this->xchanged
= $wikidiff3->removed
;
302 $this->ychanged
= $wikidiff3->added
;
306 $n_from = count( $from_lines );
307 $n_to = count( $to_lines );
308 $this->xchanged
= $this->ychanged
= [];
309 $this->xv
= $this->yv
= [];
310 $this->xind
= $this->yind
= [];
315 // Skip leading common lines.
316 for ( $skip = 0; $skip < $n_from && $skip < $n_to; $skip++
) {
317 if ( $from_lines[$skip] !== $to_lines[$skip] ) {
320 $this->xchanged
[$skip] = $this->ychanged
[$skip] = false;
322 // Skip trailing common lines.
325 for ( $endskip = 0; --$xi > $skip && --$yi > $skip; $endskip++
) {
326 if ( $from_lines[$xi] !== $to_lines[$yi] ) {
329 $this->xchanged
[$xi] = $this->ychanged
[$yi] = false;
332 // Ignore lines which do not exist in both files.
333 for ( $xi = $skip; $xi < $n_from - $endskip; $xi++
) {
334 $xhash[$this->lineHash( $from_lines[$xi] )] = 1;
337 for ( $yi = $skip; $yi < $n_to - $endskip; $yi++
) {
338 $line = $to_lines[$yi];
339 $this->ychanged
[$yi] = empty( $xhash[$this->lineHash( $line )] );
340 if ( $this->ychanged
[$yi] ) {
343 $yhash[$this->lineHash( $line )] = 1;
347 for ( $xi = $skip; $xi < $n_from - $endskip; $xi++
) {
348 $line = $from_lines[$xi];
349 $this->xchanged
[$xi] = empty( $yhash[$this->lineHash( $line )] );
350 if ( $this->xchanged
[$xi] ) {
358 $this->compareSeq( 0, count( $this->xv
), 0, count( $this->yv
) );
363 * Returns the whole line if it's small enough, or the MD5 hash otherwise
365 * @param string $line
369 private function lineHash( $line ) {
370 if ( strlen( $line ) > self
::MAX_XREF_LENGTH
) {
378 * Divide the Largest Common Subsequence (LCS) of the sequences
379 * [XOFF, XLIM) and [YOFF, YLIM) into NCHUNKS approximately equally
382 * Returns (LCS, PTS). LCS is the length of the LCS. PTS is an
383 * array of NCHUNKS+1 (X, Y) indexes giving the diving points between
384 * sub sequences. The first sub-sequence is contained in [X0, X1),
385 * [Y0, Y1), the second in [X1, X2), [Y1, Y2) and so on. Note
386 * that (X0, Y0) == (XOFF, YOFF) and
387 * (X[NCHUNKS], Y[NCHUNKS]) == (XLIM, YLIM).
389 * This function assumes that the first lines of the specified portions
390 * of the two files do not match, and likewise that the last lines do not
391 * match. The caller must trim matching lines from the beginning and end
392 * of the portions it is going to specify.
398 * @param int $nchunks
400 * @return array List of two elements, integer and array[].
402 private function diag( $xoff, $xlim, $yoff, $ylim, $nchunks ) {
405 if ( $xlim - $xoff > $ylim - $yoff ) {
406 // Things seems faster (I'm not sure I understand why)
407 // when the shortest sequence in X.
409 list( $xoff, $xlim, $yoff, $ylim ) = [ $yoff, $ylim, $xoff, $xlim ];
413 for ( $i = $ylim - 1; $i >= $yoff; $i-- ) {
414 $ymatches[$this->xv
[$i]][] = $i;
417 for ( $i = $ylim - 1; $i >= $yoff; $i-- ) {
418 $ymatches[$this->yv
[$i]][] = $i;
423 $this->seq
[0] = $yoff - 1;
427 $numer = $xlim - $xoff +
$nchunks - 1;
429 for ( $chunk = 0; $chunk < $nchunks; $chunk++
) {
431 for ( $i = 0; $i <= $this->lcs
; $i++
) {
432 $ymids[$i][$chunk - 1] = $this->seq
[$i];
436 $x1 = $xoff +
(int)( ( $numer +
( $xlim - $xoff ) * $chunk ) / $nchunks );
437 // @codingStandardsIgnoreStart Ignore Squiz.WhiteSpace.SemicolonSpacing.Incorrect
438 for ( ; $x < $x1; $x++
) {
439 // @codingStandardsIgnoreEnd
440 $line = $flip ?
$this->yv
[$x] : $this->xv
[$x];
441 if ( empty( $ymatches[$line] ) ) {
446 $matches = $ymatches[$line];
448 while ( list( , $y ) = each( $matches ) ) {
449 if ( empty( $this->in_seq
[$y] ) ) {
450 $k = $this->lcsPos( $y );
452 $ymids[$k] = $ymids[$k - 1];
457 while ( list( , $y ) = each( $matches ) ) {
458 if ( $y > $this->seq
[$k - 1] ) {
459 assert( $y < $this->seq
[$k] );
460 // Optimization: this is a common case:
461 // next match is just replacing previous match.
462 $this->in_seq
[$this->seq
[$k]] = false;
464 $this->in_seq
[$y] = 1;
465 } elseif ( empty( $this->in_seq
[$y] ) ) {
466 $k = $this->lcsPos( $y );
468 $ymids[$k] = $ymids[$k - 1];
474 $seps[] = $flip ?
[ $yoff, $xoff ] : [ $xoff, $yoff ];
475 $ymid = $ymids[$this->lcs
];
476 for ( $n = 0; $n < $nchunks - 1; $n++
) {
477 $x1 = $xoff +
(int)( ( $numer +
( $xlim - $xoff ) * $n ) / $nchunks );
479 $seps[] = $flip ?
[ $y1, $x1 ] : [ $x1, $y1 ];
481 $seps[] = $flip ?
[ $ylim, $xlim ] : [ $xlim, $ylim ];
483 return [ $this->lcs
, $seps ];
491 private function lcsPos( $ypos ) {
493 if ( $end == 0 ||
$ypos > $this->seq
[$end] ) {
494 $this->seq
[++
$this->lcs
] = $ypos;
495 $this->in_seq
[$ypos] = 1;
501 while ( $beg < $end ) {
502 $mid = (int)( ( $beg +
$end ) / 2 );
503 if ( $ypos > $this->seq
[$mid] ) {
510 assert( $ypos != $this->seq
[$end] );
512 $this->in_seq
[$this->seq
[$end]] = false;
513 $this->seq
[$end] = $ypos;
514 $this->in_seq
[$ypos] = 1;
520 * Find LCS of two sequences.
522 * The results are recorded in the vectors $this->{x,y}changed[], by
523 * storing a 1 in the element for each line that is an insertion
524 * or deletion (ie. is not in the LCS).
526 * The subsequence of file 0 is [XOFF, XLIM) and likewise for file 1.
528 * Note that XLIM, YLIM are exclusive bounds.
529 * All line numbers are origin-0 and discarded lines are not counted.
536 private function compareSeq( $xoff, $xlim, $yoff, $ylim ) {
537 // Slide down the bottom initial diagonal.
538 while ( $xoff < $xlim && $yoff < $ylim && $this->xv
[$xoff] == $this->yv
[$yoff] ) {
543 // Slide up the top initial diagonal.
544 while ( $xlim > $xoff && $ylim > $yoff
545 && $this->xv
[$xlim - 1] == $this->yv
[$ylim - 1]
551 if ( $xoff == $xlim ||
$yoff == $ylim ) {
554 // This is ad hoc but seems to work well.
555 // $nchunks = sqrt(min($xlim - $xoff, $ylim - $yoff) / 2.5);
556 // $nchunks = max(2,min(8,(int)$nchunks));
557 $nchunks = min( 7, $xlim - $xoff, $ylim - $yoff ) +
1;
558 list( $lcs, $seps ) = $this->diag( $xoff, $xlim, $yoff, $ylim, $nchunks );
562 // X and Y sequences have no common subsequence:
564 while ( $yoff < $ylim ) {
565 $this->ychanged
[$this->yind
[$yoff++
]] = 1;
567 while ( $xoff < $xlim ) {
568 $this->xchanged
[$this->xind
[$xoff++
]] = 1;
571 // Use the partitions to split this problem into subproblems.
574 while ( $pt2 = next( $seps ) ) {
575 $this->compareSeq( $pt1[0], $pt2[0], $pt1[1], $pt2[1] );
582 * Adjust inserts/deletes of identical lines to join changes
583 * as much as possible.
585 * We do something when a run of changed lines include a
586 * line at one end and has an excluded, identical line at the other.
587 * We are free to choose which identical line is included.
588 * `compareseq' usually chooses the one at the beginning,
589 * but usually it is cleaner to consider the following identical line
590 * to be the "change".
592 * This is extracted verbatim from analyze.c (GNU diffutils-2.7).
594 private function shiftBoundaries( $lines, &$changed, $other_changed ) {
598 assert( count( $lines ) == count( $changed ) );
599 $len = count( $lines );
600 $other_len = count( $other_changed );
604 * Scan forwards to find beginning of another run of changes.
605 * Also keep track of the corresponding point in the other file.
607 * Throughout this code, $i and $j are adjusted together so that
608 * the first $i elements of $changed and the first $j elements
609 * of $other_changed both contain the same number of zeros
611 * Furthermore, $j is always kept so that $j == $other_len or
612 * $other_changed[$j] == false.
614 while ( $j < $other_len && $other_changed[$j] ) {
618 while ( $i < $len && !$changed[$i] ) {
619 assert( $j < $other_len && ! $other_changed[$j] );
622 while ( $j < $other_len && $other_changed[$j] ) {
633 // Find the end of this run of changes.
634 while ( ++
$i < $len && $changed[$i] ) {
640 * Record the length of this run of changes, so that
641 * we can later determine whether the run has grown.
643 $runlength = $i - $start;
646 * Move the changed region back, so long as the
647 * previous unchanged line matches the last changed one.
648 * This merges with previous changed regions.
650 while ( $start > 0 && $lines[$start - 1] == $lines[$i - 1] ) {
651 $changed[--$start] = 1;
652 $changed[--$i] = false;
653 while ( $start > 0 && $changed[$start - 1] ) {
657 while ( $other_changed[--$j] ) {
660 assert( $j >= 0 && !$other_changed[$j] );
664 * Set CORRESPONDING to the end of the changed run, at the last
665 * point where it corresponds to a changed run in the other file.
666 * CORRESPONDING == LEN means no such point has been found.
668 $corresponding = $j < $other_len ?
$i : $len;
671 * Move the changed region forward, so long as the
672 * first changed line matches the following unchanged one.
673 * This merges with following changed regions.
674 * Do this second, so that if there are no merges,
675 * the changed region is moved forward as far as possible.
677 while ( $i < $len && $lines[$start] == $lines[$i] ) {
678 $changed[$start++
] = false;
680 while ( $i < $len && $changed[$i] ) {
684 assert( $j < $other_len && ! $other_changed[$j] );
686 if ( $j < $other_len && $other_changed[$j] ) {
688 while ( $j < $other_len && $other_changed[$j] ) {
693 } while ( $runlength != $i - $start );
696 * If possible, move the fully-merged run of changes
697 * back to a corresponding run in the other file.
699 while ( $corresponding < $i ) {
700 $changed[--$start] = 1;
703 while ( $other_changed[--$j] ) {
706 assert( $j >= 0 && !$other_changed[$j] );
713 * Class representing a 'diff' between two sequences of strings.
716 * @ingroup DifferenceEngine
727 * Computes diff between sequences of strings.
729 * @param string[] $from_lines An array of strings.
730 * Typically these are lines from a file.
731 * @param string[] $to_lines An array of strings.
733 public function __construct( $from_lines, $to_lines ) {
734 $eng = new DiffEngine
;
735 $this->edits
= $eng->diff( $from_lines, $to_lines );
741 public function getEdits() {
746 * Compute reversed Diff.
750 * $diff = new Diff($lines1, $lines2);
751 * $rev = $diff->reverse();
753 * @return Object A Diff object representing the inverse of the
756 public function reverse() {
759 /** @var DiffOp $edit */
760 foreach ( $this->edits
as $edit ) {
761 $rev->edits
[] = $edit->reverse();
768 * Check for empty diff.
770 * @return bool True if two sequences were identical.
772 public function isEmpty() {
773 foreach ( $this->edits
as $edit ) {
774 if ( $edit->type
!= 'copy' ) {
783 * Compute the length of the Longest Common Subsequence (LCS).
785 * This is mostly for diagnostic purposed.
787 * @return int The length of the LCS.
789 public function lcs() {
791 foreach ( $this->edits
as $edit ) {
792 if ( $edit->type
== 'copy' ) {
793 $lcs +
= count( $edit->orig
);
801 * Get the original set of lines.
803 * This reconstructs the $from_lines parameter passed to the
806 * @return string[] The original sequence of strings.
808 public function orig() {
811 foreach ( $this->edits
as $edit ) {
813 array_splice( $lines, count( $lines ), 0, $edit->orig
);
821 * Get the closing set of lines.
823 * This reconstructs the $to_lines parameter passed to the
826 * @return string[] The sequence of strings.
828 public function closing() {
831 foreach ( $this->edits
as $edit ) {
832 if ( $edit->closing
) {
833 array_splice( $lines, count( $lines ), 0, $edit->closing
);
842 * @todo document, bad name.
844 * @ingroup DifferenceEngine
846 class MappedDiff
extends Diff
{
850 * Computes diff between sequences of strings.
852 * This can be used to compute things like
853 * case-insensitve diffs, or diffs which ignore
854 * changes in white-space.
856 * @param string[] $from_lines An array of strings.
857 * Typically these are lines from a file.
858 * @param string[] $to_lines An array of strings.
859 * @param string[] $mapped_from_lines This array should
860 * have the same size number of elements as $from_lines.
861 * The elements in $mapped_from_lines and
862 * $mapped_to_lines are what is actually compared
863 * when computing the diff.
864 * @param string[] $mapped_to_lines This array should
865 * have the same number of elements as $to_lines.
867 public function __construct( $from_lines, $to_lines,
868 $mapped_from_lines, $mapped_to_lines ) {
870 assert( count( $from_lines ) == count( $mapped_from_lines ) );
871 assert( count( $to_lines ) == count( $mapped_to_lines ) );
873 parent
::__construct( $mapped_from_lines, $mapped_to_lines );
876 $editCount = count( $this->edits
);
877 for ( $i = 0; $i < $editCount; $i++
) {
878 $orig = &$this->edits
[$i]->orig
;
879 if ( is_array( $orig ) ) {
880 $orig = array_slice( $from_lines, $xi, count( $orig ) );
881 $xi +
= count( $orig );
884 $closing = &$this->edits
[$i]->closing
;
885 if ( is_array( $closing ) ) {
886 $closing = array_slice( $to_lines, $yi, count( $closing ) );
887 $yi +
= count( $closing );
894 * Additions by Axel Boldt follow, partly taken from diff.php, phpwiki-1.3.3
900 * @ingroup DifferenceEngine
902 class HWLDFWordAccumulator
{
903 public $insClass = ' class="diffchange diffchange-inline"';
904 public $delClass = ' class="diffchange diffchange-inline"';
912 * @param string $new_tag
914 private function flushGroup( $new_tag ) {
915 if ( $this->group
!== '' ) {
916 if ( $this->tag
== 'ins' ) {
917 $this->line
.= "<ins{$this->insClass}>" .
918 htmlspecialchars( $this->group
) . '</ins>';
919 } elseif ( $this->tag
== 'del' ) {
920 $this->line
.= "<del{$this->delClass}>" .
921 htmlspecialchars( $this->group
) . '</del>';
923 $this->line
.= htmlspecialchars( $this->group
);
927 $this->tag
= $new_tag;
931 * @param string $new_tag
933 private function flushLine( $new_tag ) {
934 $this->flushGroup( $new_tag );
935 if ( $this->line
!= '' ) {
936 array_push( $this->lines
, $this->line
);
938 # make empty lines visible by inserting an NBSP
939 array_push( $this->lines
, ' ' );
945 * @param string[] $words
948 public function addWords( $words, $tag = '' ) {
949 if ( $tag != $this->tag
) {
950 $this->flushGroup( $tag );
953 foreach ( $words as $word ) {
954 // new-line should only come as first char of word.
958 if ( $word[0] == "\n" ) {
959 $this->flushLine( $tag );
960 $word = substr( $word, 1 );
962 assert( !strstr( $word, "\n" ) );
963 $this->group
.= $word;
970 public function getLines() {
971 $this->flushLine( '~done' );
980 * @ingroup DifferenceEngine
982 class WordLevelDiff
extends MappedDiff
{
983 const MAX_LINE_LENGTH
= 10000;
986 * @param string[] $orig_lines
987 * @param string[] $closing_lines
989 public function __construct( $orig_lines, $closing_lines ) {
991 list( $orig_words, $orig_stripped ) = $this->split( $orig_lines );
992 list( $closing_words, $closing_stripped ) = $this->split( $closing_lines );
994 parent
::__construct( $orig_words, $closing_words,
995 $orig_stripped, $closing_stripped );
999 * @param string[] $lines
1003 private function split( $lines ) {
1008 foreach ( $lines as $line ) {
1009 # If the line is too long, just pretend the entire line is one big word
1010 # This prevents resource exhaustion problems
1017 if ( strlen( $line ) > self
::MAX_LINE_LENGTH
) {
1019 $stripped[] = $line;
1022 if ( preg_match_all( '/ ( [^\S\n]+ | [0-9_A-Za-z\x80-\xff]+ | . ) (?: (?!< \n) [^\S\n])? /xs',
1025 foreach ( $m[0] as $word ) {
1028 foreach ( $m[1] as $stripped_word ) {
1029 $stripped[] = $stripped_word;
1035 return [ $words, $stripped ];
1041 public function orig() {
1042 $orig = new HWLDFWordAccumulator
;
1044 foreach ( $this->edits
as $edit ) {
1045 if ( $edit->type
== 'copy' ) {
1046 $orig->addWords( $edit->orig
);
1047 } elseif ( $edit->orig
) {
1048 $orig->addWords( $edit->orig
, 'del' );
1051 $lines = $orig->getLines();
1059 public function closing() {
1060 $closing = new HWLDFWordAccumulator
;
1062 foreach ( $this->edits
as $edit ) {
1063 if ( $edit->type
== 'copy' ) {
1064 $closing->addWords( $edit->closing
);
1065 } elseif ( $edit->closing
) {
1066 $closing->addWords( $edit->closing
, 'ins' );
1069 $lines = $closing->getLines();