|
|
1.1 root 1: .pa 1
2: .he 'PROOF (I)'1/15/73'PROOF (I)'
3: .ti 0
4: NAME proof -- compare two text files
5: .sp
6: .ti 0
7: SYNOPSIS proof_____
8: oldfile newfile
9: .sp
10: .ti 0
11: DESCRIPTION proof_____
12: lists
13: those lines of
14: .ul
15: newfile
16: that differ from corresponding lines in
17: .ul
18: oldfile.
19: The line number in
20: .ul
21: newfile
22: is given.
23: When changes, insertions or deletions have
24: been made the program attempts to resynchronize
25: the text in the two files by finding a sequence of
26: lines in both files that again agree.
27: .sp
28: .ti 0
29: FILES --
30: .sp
31: .ti 0
32: SEE ALSO cmp(I)
33: .sp
34: .ti 0
35: DIAGNOSTICS yes,
36: but they are undecipherable, e.g. "?1".
37: .sp
38: .ti 0
39: BUGS proof_____
40: is still evolving. Any bugs discovered or suggestions
41: should be brought to ENP.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.