1
0
Fork 0
mirror of git://git.code.sf.net/p/cdesktopenv/code synced 2025-03-09 15:50:02 +00:00

Fix many spelling errors and word repetitions (#188)

Many of the errors fixed in this commit are word repetitions
such as 'the the' and minor spelling errors. One formatting
error in the ksh man page has also been fixed.
This commit is contained in:
Johnothan King 2021-02-19 19:22:24 -08:00 committed by GitHub
parent 4e47f89b06
commit 2b805f7f1c
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
34 changed files with 95 additions and 95 deletions

View file

@ -303,7 +303,7 @@ closes the current method (releasing its resources),
temporarily instantiates the default method
(either \f5ASO_INTRINSIC\fP if available or \f5AS_SIGNAL\fP otherwise),
and initializes \f5meth\fP and instantiates it as the new method.
If \f5disc\fP is \f50\fP the the global discipline is not modified.
If \f5disc\fP is \f50\fP then the global discipline is not modified.
If \f5meth\fP is \f50\fP then \f51\fP is returned if \f5asoinit()\fP has
already been called to initialize a method, otherwise \f50\fP is returned.
If \f5meth->lockf\fP is \f50\fP and \f5(meth->type & ASO_INTRINSIC) != 0\fP

View file

@ -176,7 +176,7 @@ static unsigned char map[UCHAR_MAX];
static Optstate_t state;
#if 0 /* #if !_PACKAGE_astsa // this somehow corrupts "Or:" usage mesages, e.g. in 'typeset -\?' */
#if 0 /* #if !_PACKAGE_astsa // this somehow corrupts "Or:" usage messages, e.g. in 'typeset -\?' */
#define ID ast.id

View file

@ -675,7 +675,7 @@ static int des_setkey(register const char *key) {
/*
* Encrypt (or decrypt if num_iter < 0) the 8 chars at "in" with abs(num_iter)
* iterations of DES, using the the given 24-bit salt and the pre-computed key
* iterations of DES, using the given 24-bit salt and the pre-computed key
* schedule, and store the resulting 8 chars at "out" (in == out is permitted).
*
* NOTE: the performance of this routine is critically dependent on your

View file

@ -100,7 +100,7 @@ extern long int random();
/* For each of the currently supported random number generators, we have a
break value on the amount of state information (you need at least thi
break value on the amount of state information (you need at least the
bytes of state info to support this random number generator), a degree for
the polynomial (actually a trinomial) that the R.N.G. is based on, and
separation between the two lower order coefficients of the trinomial. */