diff options
| author | snj <snj> | 2004-01-20 22:05:17 +0000 |
|---|---|---|
| committer | snj <snj> | 2004-01-20 22:05:17 +0000 |
| commit | e7ef6a6a11720201b4788679ef39d10c9b7015cf (patch) | |
| tree | 5f84c9d4a9dace1a117d3235fc49f239f6a5c9eb /devel/xdelta | |
| parent | 5256fc03fccba30a4c02e0eacf2c50dce0b11c57 (diff) | |
| download | pkgsrc-e7ef6a6a11720201b4788679ef39d10c9b7015cf.tar.gz | |
s/it's/its/
Diffstat (limited to 'devel/xdelta')
| -rw-r--r-- | devel/xdelta/DESCR | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/devel/xdelta/DESCR b/devel/xdelta/DESCR index 358114133bb..77b67ca02e1 100644 --- a/devel/xdelta/DESCR +++ b/devel/xdelta/DESCR @@ -9,7 +9,7 @@ delta's entropy H(P) will be very similar to the entropy of the portions of the TO file not found within the FROM file. The delta will compress just as well as the TO file will. This is a fundamentally different method of computing deltas than in the traditional "diff" program. The -diff program and it's variants use a least-common-subsequence (LCS) +diff program and its variants use a least-common-subsequence (LCS) algorithm to find a list of inserts and deletes that will modify the FROM file into the TO file. LCS is more expensive to compute and is sometimes more useful, especially to the human reader. Since LCS is a fairly |