diff options
| author | Antoni Villalonga i Noceras <antoni@friki.cat> | 2020-08-10 01:32:51 +0200 |
|---|---|---|
| committer | Rob Landley <rob@landley.net> | 2020-08-11 07:24:28 -0500 |
| commit | 98943e25c8d24423c74e4a31d70f274c78e35e51 (patch) | |
| tree | 4b1fe94d65fd3902cccc9ad0077eb0ba6f747a1b /toys/pending/diff.c | |
| parent | efb8060a591b6ed13c16c4034db43652e03f90d5 (diff) | |
| download | toybox-98943e25c8d24423c74e4a31d70f274c78e35e51.tar.gz | |
Fix spelling errors
Diffstat (limited to 'toys/pending/diff.c')
| -rw-r--r-- | toys/pending/diff.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/toys/pending/diff.c b/toys/pending/diff.c index d7bb43c4..e93c622c 100644 --- a/toys/pending/diff.c +++ b/toys/pending/diff.c @@ -253,7 +253,7 @@ int bcomp(const void *a, const void *b) * classes of lines in file[1], with e.last = true on the last element of each class. * The elements are ordered by serial within classes. * 4. Form the p vector stored in p_vector. p_vector[i], if non-zero, now points in e vector - * to the begining of the equiv class of lines in file[1] equivalent to line + * to the beginning of the equiv class of lines in file[1] equivalent to line * i in file[0]. * 5. Form the k-candidates as discribed in do_merge. * 6. Create a vector J[i] = j, such that i'th line in file[0] is j'th line of |