aboutsummaryrefslogtreecommitdiff
path: root/coreutils/diff.c
diff options
context:
space:
mode:
authorDenis Vlasenko <vda.linux@googlemail.com>2006-09-17 16:28:10 +0000
committerDenis Vlasenko <vda.linux@googlemail.com>2006-09-17 16:28:10 +0000
commit9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e (patch)
tree94c3c0678d1349497abe2db6004e9331e50f6d37 /coreutils/diff.c
parenta6127aacef047ed7661722705b052811fbe7f467 (diff)
downloadbusybox-w32-9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e.tar.gz
busybox-w32-9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e.tar.bz2
busybox-w32-9213a9e0f2d8fd638ecd02e2628d96dd5c7d233e.zip
whitespace cleanup
Diffstat (limited to 'coreutils/diff.c')
-rw-r--r--coreutils/diff.c4
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)
820} 820}
821 821
822/* 822/*
823 * The following code uses an algorithm due to Harold Stone, 823 * The following code uses an algorithm due to Harold Stone,
824 * which finds a pair of longest identical subsequences in 824 * which finds a pair of longest identical subsequences in
825 * the two files. 825 * the two files.
826 * 826 *
827 * The major goal is to generate the match vector J. 827 * The major goal is to generate the match vector J.