diff options
| author | Denis Vlasenko <vda.linux@googlemail.com> | 2006-09-17 16:28:10 +0000 |
|---|---|---|
| committer | Denis Vlasenko <vda.linux@googlemail.com> | 2006-09-17 16:28:10 +0000 |
| commit | 9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e (patch) | |
| tree | 94c3c0678d1349497abe2db6004e9331e50f6d37 /coreutils/diff.c | |
| parent | a6127aacef047ed7661722705b052811fbe7f467 (diff) | |
| download | busybox-9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e.tar.gz | |
whitespace cleanup
Diffstat (limited to 'coreutils/diff.c')
| -rw-r--r-- | coreutils/diff.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/coreutils/diff.c b/coreutils/diff.c index 22c157412..3c409b2cf 100644 --- a/coreutils/diff.c +++ b/coreutils/diff.c @@ -820,8 +820,8 @@ static void output(char *file1, FILE * f1, char *file2, FILE * f2) } /* - * The following code uses an algorithm due to Harold Stone, - * which finds a pair of longest identical subsequences in + * The following code uses an algorithm due to Harold Stone, + * which finds a pair of longest identical subsequences in * the two files. * * The major goal is to generate the match vector J. |