drygdryg/calc
1
0
Fork 0
mirror of https://github.com/lcn2/calc.git synced 2025-08-16 01:03:29 +03:00
Code Issues Packages Projects Releases Wiki Activity

Fix many spelling errors

Browse Source
This commit is contained in:
Landon Curt Noll
2021-02-12 22:09:47 -08:00
parent 486f4c5626
commit 507fe026e5
154 changed files with 482 additions and 476 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
help/Makefile
View File

@@ -69,7 +69,7 @@ TOP_MAKE_FILE= Makefile
#INCDIR= /dev/env/DJDIR/include
INCDIR= /usr/include
# where to install calc realted things
# where to install calc related things
#
# ${BINDIR} where to install calc binary files
# ${LIBDIR} where calc link library (*.a) files are installed
@@ -209,7 +209,7 @@ BLT_HELP_FILES_5= errorcodes
STD_HELP_FILES_6= file history interrupt list mat
# beacuse obj is built special (due to confusion with it as
# because obj is built special (due to confusion with it as
# a symlink for some built environments, we treat obj specially
# and call it obj.file
#
@@ -249,7 +249,7 @@ FULL_HELP_FILES= ${STD_HELP_FILES_1} ${STD_HELP_FILES_2} \
${BLT_HELP_FILES_13} ${STD_HELP_FILES_14} \
${BLT_HELP_FILES_14} ${STD_HELP_FILES_15}
# These full files are those who are not built or constrcuted
# These full files are those who are not built or constructed
#
STD_HELP_FILES= ${STD_HELP_FILES_1} ${STD_HELP_FILES_2} \
${STD_HELP_FILES_4} ${STD_HELP_FILES_6} \
@@ -271,7 +271,7 @@ BLT_HELP_FILES= ${BLT_HELP_FILES_3} ${BLT_HELP_FILES_5} \
# The detailed list of help files to install
#
# This list is prodiced by the detaillist rule when no WARNINGS are detected.
# This list is produced by the detaillist rule when no WARNINGS are detected.
#
# Please use:
#
@@ -338,7 +338,7 @@ all: ${FULL_HELP_FILES} full ${DETAIL_HELP} ${DETAIL_CLONE} \
# used by the upper level Makefile to determine of we have done all
#
# NOTE: Due to bogus shells found on one common system we must have
# an non-emoty else clause for every if condition. *sigh*
# an non-empty else clause for every if condition. *sigh*
#
.all:
${RM} -f .all
@@ -596,18 +596,18 @@ ${SINGULAR_FILES}: ${PLURAL_FILES}
# Form the builtin file
#
# We ave a "chicken-and-egg" problem. We want the builtn help file to
# We have a "chicken-and-egg" problem. We want the builtin help file to
# accurately reflect the function list. It would be nice if we could
# just execute calc show builtin, but calc may not have been built or
# buildable at this point. The hack-a-round used is to convert ../func.c
# into a standalone program that generates a suitable function list
# that is standwiched between the top and bottom builtin help text.
# build-able at this point. The hack-a-round used is to convert ../func.c
# into a stand-alone program that generates a suitable function list
# that is sandwiched between the top and bottom builtin help text.
#
# We form funclist.c by sedding out unwanted stuff from builtins table,
# converting NUMBER* and VALUE into harmless types and converting
# the showbuiltins() function into main(). Combined with the -DFUNCLIST
# we will avoid all of the complex calc types, macros and defines and
# be left with just main() and a mininal builtins table.
# be left with just main() and a minimal builtins table.
#
# Building funclist.o a portable fashion is ugly because some systems
# do not treat -I.. correctly!
@@ -662,7 +662,7 @@ calcliblist:
done
# The BSDI cdrom makefile expects all help files to be pre-built. This rule
# creats these fils so that the release can be shipped off to BSDI. You can
# creates these files so that the release can be shipped off to BSDI. You can
# ignore this rule.
#
bsdi: all

2
help/address
View File

@@ -75,7 +75,7 @@ DESCRIPTION
Except in cases like strcat(A, "") when *A identified with a literal
string as above, definitions of string values using strcat() or substr()
will copy the relevant strings to newly allocated addresses which will
be useable only while the variables retain these defined values.
be usable only while the variables retain these defined values.
For example, after
; B = C = strcat("a", "bc");

4
help/agd
View File

@@ -1,5 +1,5 @@
NAME
agd - inverse gudermannian function
agd - inverse Gudermannian function
SYNOPSIS
agd(z [,eps])
@@ -11,7 +11,7 @@ TYPES
return number or infinite error value
DESCRIPTION
Calculate the inverse gudermannian of z to a nultiple of eps with
Calculate the inverse Gudermannian of z to a multiple of eps with
errors in real and imaginary parts less in absolute value than .75 * eps,
or an error value if z is very close to one of the one of the branch
points of agd(z)..

2
help/builtin.end
View File

@@ -56,7 +56,7 @@
ptest(a,1,0)
Normally ptest performs a some checks to determine if the
value is divisable by some trivial prime. If the 2nd
value is divisible by some trivial prime. If the 2nd
argument is < 0, then the trivial check is omitted.
For example, ptest(a,10) performs the same work as:

2
help/catalan
View File

@@ -20,7 +20,7 @@ DESCRIPTION
combinatorial problems, e.g. for n >= 1, catalan(n) is the number of
ways of using parentheses to express a product of n + 1 letters in
terms of binary products; it is the number of ways of dissecting a
convex polygon with n + 2 sides into triangles by nonintersecting
convex polygon with n + 2 sides into triangles by non-intersecting
diagonals; it is the number of integer-component-incrementing paths
from (x,y) = (0,0) to (x,y) = (n,n) for which always y <= x.

2
help/cfsim
View File

@@ -30,7 +30,7 @@ DESCRIPTION
This corresponds to the use of rnd for functions like round(x, n, rnd).
If bit 3 or 4 of rnd is set, the lower order bits are ignored; bit 3
is ignored if bit 4 is set. Thusi, for rnd > 3, it sufficient to
is ignored if bit 4 is set. Thus, for rnd > 3, it sufficient to
consider the two cases rnd = 8 and rnd = 16.
If den(x) > 2, cfsim(x, 8) returns the value of the penultimate simple

2
help/cmp
View File

@@ -47,7 +47,7 @@ DESCRIPTION
obj point {x,y};
if points with real components are to be partially ordered by their
euclidean distance from the origin, an appropriate point_rel
Euclidean distance from the origin, an appropriate point_rel
function may be that given by
define point_rel(a,b) = sgn(a.x^2 + a.y^2 - b.x^2 - b.y^2);

26
help/command
View File

@@ -200,7 +200,7 @@ Command sequence
cd
cd dir
Change the current directory to 'dir'. If 'dir' is ommitted,
Change the current directory to 'dir'. If 'dir' is omitted,
change the current directory to the home directory, if $HOME
is set in the environment.
@@ -286,10 +286,10 @@ Command sequence
q() defined
a() defined
start statment #1
start statement #1
quit from q()
after statment #1
start statment #2
after statement #1
start statement #2
abort from a()
The QUIT within the q() function prevented the ``end of q()''
@@ -309,10 +309,10 @@ Command sequence
q() defined
a() defined
start statment #1
start statement #1
quit from q()
after statment #1
start statment #2
after statement #1
start statement #2
abort from a()
; <==== calc interactive prompt
@@ -330,10 +330,10 @@ Command sequence
q() defined
a() defined
start statment #1
start statement #1
quit from q()
after statment #1
start statment #2
after statement #1
start statement #2
abort from a()
The ABORT inside function a() halts the processing of statements
@@ -352,11 +352,11 @@ Command sequence
a() defined
; x = 3;
; {print "start #1"; if (x > 1) q()} print "after #1";
start statment #1
start statement #1
quit from q()
after statment #1
after statement #1
; {print "start #2"; if (x > 1) a()} print "after #2";
start statment #2
start statement #2
abort from a()
; {print "start #3"; if (x > 1) quit "quit from 3rd statement"}
start #3

2
help/config
View File

@@ -25,7 +25,7 @@ DESCRIPTION
"trace" turns tracing features on or off
"display" sets number of digits in prints.
"epsilon" sets error value for transcendentals.
"epsilon" sets error value for transcendental.
"maxprint" sets maximum number of elements printed.
"mode" sets printout mode.
"mode2" sets 2nd base printout mode.

6
help/define
View File

@@ -52,7 +52,7 @@ DESCRIPTION
In the definition of a function, the builtin function param(n)
provides a way of referring to the parameters. If n (which may
result from evaluating an expreession) is zero, it returns the number
result from evaluating an expression) is zero, it returns the number
of arguments in a call to the function, and if 1 <= n <= param(0),
param(n) refers to the parameter with index n.
@@ -63,7 +63,7 @@ DESCRIPTION
In the statement form, if a return statement is encountered,
the "return" keyword is to be either immediately followed by an
expression or by a statement terminator (semicolon or rightbrace);
expression or by a statement terminator (semicolon or right-brace);
in the former case, the expression is evaluated, evaluation of
the function ceases, and the value obtained for the expression is
returned as the "value of the function"; in the no-expression case,
@@ -93,7 +93,7 @@ DESCRIPTION
definition has no effect on the new definition, but if the definition
is completed successfully, the new definition replaces the old one;
otherwise the old definition is retained. The number of parameters
and their names in the new definiton may be quite different from
and their names in the new definition may be quite different from
those in the old definition.
An attempt at a definition may fail because of scanerrors as the

2
help/digits
View File

@@ -25,7 +25,7 @@ DESCRIPTION
digits(12.3456) == 2 computes with the integer part only
digits(-1234) == 4 computes with the absolute value only
digits(0) == 1 specical case
digits(0) == 1 special case
digits(-0.123) == 1 combination of all of the above
EXAMPLE

2
help/estr
View File

@@ -22,7 +22,7 @@ DESCRIPTION
or is not an octal digit, and other non-text characters to their
escaped hex representation, e.g. char(165) becomes \xa5.
For real x, estr(x) represebts x in fractional mode.
For real x, estr(x) represents x in fractional mode.
EXAMPLE

2
help/euler
View File

@@ -21,7 +21,7 @@ DESCRIPTION
If euler(k) is called with negative k, zero is returned and the
memory used by the table iu freed.
Considerable runtime and memery are required for calculating
Considerable runtime and memory are required for calculating
euler(n) for large even n.
EXAMPLE

2
help/fgetfield
View File

@@ -16,7 +16,7 @@ DESCRIPTION
null value is returned. Otherwise the function returns the empty
string "" if the first non-white character is '\0', and in other cases,
the string formed by the non-white-space characters read until '\0' or
a white-space character or te end of the file is reached. In the
a white-space character or the end of the file is reached. In the
cases where the reading is stopped by '\0' or white-space character,
the file position will be that immediately after that character.

2
help/freopen
View File

@@ -1,5 +1,5 @@
NAME
freopen - close (if necessary) and reopen a filestream
freopen - close (if necessary) and reopen a file stream
SYNOPSIS
freopen(fs, mode [,filename])

4
help/gd
View File

@@ -1,5 +1,5 @@
NAME
gd - gudermannian function
gd - Gudermannian function
SYNOPSIS
gd(z [,eps])
@@ -11,7 +11,7 @@ TYPES
return number or "Log of zero or infinity" error value
DESCRIPTION
Calculate the gudermannian of z to a nultiple of eps with errors in
Calculate the Gudermannian of z to a multiple of eps with errors in
real and imaginary parts less in absolute value than .75 * eps,
or return an error value if z is close to one of the branch points
at odd multiples of (pi/2) * i.

2
help/inputlevel
View File

@@ -14,7 +14,7 @@ DESCRIPTION
eval(S) for some expression S which evaluates to a string. It
decreases by 1 when a file being read reaches EOF or a string
being eval-ed reaches '\0', or earlier if a quit statement is
encountered at top calculation-level in the flle or string. It
encountered at top calculation-level in the file or string. It
decreases to zero if an abort statement is encountered at any
function-level in the file or string. If a quit or abort
statement is encountered at top calculation-level at top input-level,

2
help/isatty
View File

@@ -1,5 +1,5 @@
NAME
isatty - returns 1 if fd assocatied with a tty
isatty - returns 1 if fd is associated with a tty
SYNOPSIS
isatty(fd)

2
help/isptr
View File

@@ -18,7 +18,7 @@ DESCRIPTION
3 if x is a string-pointer
4 if x is a number-pointer
Pointers are initially defined by using the addreess (&) operator
Pointers are initially defined by using the address (&) operator
with an "addressable" value; currently, these are octets, lvalues,
strings and real numbers.

2
help/jacobi
View File

@@ -184,7 +184,7 @@ DESCRIPTION
The above calc pseudo code is provided to help illustrate the
properties of the jacobi symbol only. The use of calc's jacobi
builtin is recommended for both speed as well as to handle
specical cases.
special cases.
For more information on the Legendre symbol and the Jacobi symbol:

8
help/max
View File

@@ -12,7 +12,7 @@ TYPES
DESCRIPTION
If an argument x_i is a list with elements e_1, e_2, ..., e_n, it
is treated as if x_i were replaced by e_1, e_2, ..., e_n; this may
continue recurively if any of the e_j is a list.
continue recursively if any of the e_j is a list.
If an argument x_i is an object of type xx, then x_i is replaced by
xx_max(x_i) if the function xx_max() has been defined. If the
@@ -29,14 +29,14 @@ DESCRIPTION
will return the same as max(a, b, c).
Assuming the above replacements, and that the x_1, x_2, ..., are
of sufficently simple ordered types (e.g. real numbers or strings),
of sufficiently simple ordered types (e.g. real numbers or strings),
or, if some are objects, the relevant xx_rel(a,b) has been defined
and returns a real-number value for any comparison that has to be made,
max(x_1, x_2, ...) returns the value determined by max(x_1) = x_1,
and succesively for later arguments, by the use of the equivalent of
and successively for later arguments, by the use of the equivalent of
max(a,b) = (a < b) ? b : a. If the ordering determined by < is total,
max(x_1, ...) will be the maximum value among the arguments. For a
preorder relation it may be one of several maximal values. For
pre-order relation it may be one of several maximal values. For
other relations, it may be difficult to predict the result.
EXAMPLE

6
help/memsize
View File

@@ -12,13 +12,13 @@ TYPES
DESCRIPTION
This is analogous to the C operator sizeof. It attempts to assess
the number of bytes in memory used to store a value and all its
components plus all of the related structue overhead. Unlike
components plus all of the related structure overhead. Unlike
sizeof(x), this builtin includes overhead.
Unlike size(x), this builtin incldues the trailing \0 byte on the
Unlike size(x), this builtin includes the trailing \0 byte on the
end of strings.
Unlike sizeof(x), this builtin includes the size demonitor for integers
Unlike sizeof(x), this builtin includes the size denominator for integers
and the imaginary part for complex values. Storage for holding
0, 1 and -1 values are also included.

2
help/meq
View File

@@ -1,5 +1,5 @@
NAME
meq - test for equality modulo a specifed number
meq - test for equality modulo a specified number
SYNOPSIS
meq(x, y, md)

8
help/min
View File

@@ -12,7 +12,7 @@ TYPES
DESCRIPTION
If an argument x_i is a list with elements e_1, e_2, ..., e_n, it
is treated as if x_i were replaced by e_1, e_2, ..., e_n; this may
continue recurively if any of the e_j is a list.
continue recursively if any of the e_j is a list.
If an argument x_i is an object of type xx, then x_i is replaced by
xx_min(x_i) if the function xx_min() has been defined. If the
@@ -29,14 +29,14 @@ DESCRIPTION
will return the same as min(a, b, c).
Assuming the above replacements, and that the x_1, x_2, ..., are
of sufficently simple ordered types (e.g. real numbers or strings),
of sufficiently simple ordered types (e.g. real numbers or strings),
or, if some are objects, the relevant xx_rel(a,b) has been defined
and returns a real-number value for any comparison that has to be made,
min(x_1, x_2, ...) returns the value determined by min(x_1) = x_1,
and succesively for later arguments, by the use of the equivalent of
and successively for later arguments, by the use of the equivalent of
min(a,b) = (a < b) ? a : b. If the ordering determined by < is total,
min(x_1, ...) will be the minimum value among the arguments. For a
preorder relation it may be one of several minimal values. For other
pre-order relation it may be one of several minimal values. For other
relations, it may be difficult to predict the result.
EXAMPLE

2
help/mne
View File

@@ -1,5 +1,5 @@
NAME
mne - test for inequality of real numbers modulo a specifed number
mne - test for inequality of real numbers modulo a specified number
SYNOPSIS
mne(x, y, md)

2
help/operator
View File

@@ -12,7 +12,7 @@ operators
binding. Except where otherwise indicated, operators at the same
level of precedence associate from left to right.
Unlike C, calc has a definite order for evaluation of terms (addends
Unlike C, calc has a definite order for evaluation of terms (adds
in a sum, factors in a product, arguments for a function or a
matrix, etc.). This order is always from left to right. but
skipping of terms may occur for ||, && and ? : . For example,

2
help/overview
View File

@@ -65,7 +65,7 @@
help unexpected
It contains information about differences between C and calc
that may surprize you.
that may surprise you.
To learn about calc standard resource files, try:

4
help/pound
View File

@@ -10,13 +10,13 @@ SYNOPSIS
TYPES
x, y integer or real
return integer (uniary operator case)
return integer (unary operator case)
integer or real (binary operator case)
DESCRIPTION
The pound sign or sharp sign "#" has special meaning in calc.
As a uniary operator:
As a unary operator:
# value

4
help/printf
View File

@@ -14,7 +14,7 @@ DESCRIPTION
The function printf() is similar to the C function with the same name.
The most significant difference is that there is no requirement
that the types of values of the arguments x_i match the
corresponding format specifier in fmt. Thus, whatver the
corresponding format specifier in fmt. Thus, whatever the
format specifier, a number is printed as a number, a string as
a string, a list as a list, a matrix as a matrix, an xx-object
as an xx-object, etc.
@@ -26,7 +26,7 @@ DESCRIPTION
an optional '-'
zero or more decimal digits
an optional '. followed by zero or more decimal deigits
an optional '. followed by zero or more decimal digits
an optional 'l'
one of the letters: d, s, c, f, e, g, r, o, x, b,

16
help/protect
View File

@@ -36,7 +36,7 @@ DESCRIPTION
where V is an lvalue. Attempting either of these assignments
will return an error value and leave the value of A or V unchanged.
Initally, when created, any lvalue A has zero status corresponding
Initially, when created, any lvalue A has zero status corresponding
to "no protection". This may be restored at any time by protect(A, 0).
If N is positive and A does not already have the protection
@@ -64,7 +64,7 @@ DESCRIPTION
X[2][0] and X[2][1] have depth 2; X[2][0].x, X[2][0].y, X[2][1].x
and X[2][1].y have depth 3. For any lvalue A, protect(A, N, depth)
applies protect(A, N) to A and to all elements, elements of
elements, etc., up tothe stated depth. In the above example,
elements, etc., up to the stated depth. In the above example,
protect(X, 20, 2) gives no-type-change and no-copy-to protection
to 8 of the listed lvalues, but not to the components of the
objects X[2][0] and X[2][1]; With any d >= 3, protect(X, 20, d)
@@ -73,7 +73,7 @@ DESCRIPTION
If B is a variable with positive status and assignment of B to A is
permitted, execution of the assignment A = B adds to the protections
of A all protections of B that A does not already have. Except when
the value returned is the result of the evqluation of an lvalue with
the value returned is the result of the evaluation of an lvalue with
positive status, calc's builtin operators and functions return values
with zero protection status. For example, whatever the protection
statuses of X and Y, X + sqrt(Y) will have zero status, but
@@ -97,7 +97,7 @@ DESCRIPTION
gives no-assign-to protection to the variable; i.e. noassignto(`A)
achieves the same as protect(A,1).
In the brief descriptions above of builtin kinds of protectiopn,
In the brief descriptions above of builtin kinds of protection,
"assign" refers to use of '=' as in A = expr to assign the value
of expr to A, and in A = {..., expr, ...} to assign the value of expr
to some component of A, and to the assignments implicit in
@@ -110,7 +110,7 @@ DESCRIPTION
"Copying" refers to initialization using {...} and to the operations
copy and blkcpy as applied to strings, blocks, lists and matrices.
Although A = {..., expr, ...) assigns the value of expr to an
elment of A, it is also regarded as copying to A. Thus, initialization
element of A, it is also regarded as copying to A. Thus, initialization
of A may be prevented either by giving no-copy-to protection to A or
no-assignment=to protection to the elements of A. Assignments to and
from characters or octets in strings or blocks are also regarded as
@@ -151,12 +151,12 @@ DESCRIPTION
Although M = mat[2] = {...} and mat M[2] = {...} do the same thing,
these are different from (M = mat[2]) = {...} and (mat M[3]) = {...}.
In the former pair of statements, the result of mat[2] = {...} is being
assigned to M. In the latter statments, a matrix with zero elements is
assigned to M. In the latter statements, a matrix with zero elements is
being assigned to M and then that matrix is being "reinitialized". Both
will fail if M has no-asssign-to protection, but only the latter
will fail if M has no-assign-to protection, but only the latter
would be prevented by M having no-copy-to protection.
When the functions which mave move elements like of sort, reverse,
When the functions which can move elements like of sort, reverse,
swap, insert, pop, remove, push and append. are evaluated, the
protection statuses move with the values, e.g. if among the values
and elements involved, there is just one with value 42, then the

4
help/ptest
View File

@@ -40,12 +40,12 @@ DESCRIPTION
is sufficient to consider 1 < b < n - 1.
Note that if ptest returns 1, this does not mean that n is
prime! If n is composit (not prime) and a pseudoprime then
prime! If n is composite (not prime) and a pseudoprime then
ptest may return 1. For this reason, if ptest returns 1, this
is not proof that n is prime.
If ptest returns 0, then this is proof that n is not prime
(composit).
(composite).
The bases for ptest(n, count, skip) are selected as follows:

10
help/quomod
View File

@@ -20,13 +20,13 @@ DESCRIPTION
If y is zero, zero is assigned to Q, x to R and 0 or 1 returned
according as x is zero or nonzero.
In the remaining case, y nonzero and x/y not an intger, there
In the remaining case, y nonzero and x/y not an integer, there
are two pairs (q,r) for which x = q * y + r, q is an integer, and
abs(r) < abs(y). Depending on the low 5 bits of rnd, the q and r
of one of these pairs will be assigned to Q and R respectively,
and the number 1 returned. The effects of rnd can be described in
terms of the way q is related to x/y, e.g. by rounding down,
rounding towards zero, rounding to a nearest integeri, etc. or
rounding towards zero, rounding to a nearest integer, etc. or
by properties of the remainder r, e.g. positive, negative,
smallest, etc. The effects of the most commonly used values of
rnd are described in the following table:
@@ -36,7 +36,7 @@ DESCRIPTION
0 round down. q = floor(x/y) same sign as y
1 round up, q = ceil(x/y) opposite sign to y
2 round to zero, q = int(x/y) same sign as x, r = y * frac(x/y)
3 round from zero oppsite sign to x
3 round from zero opposite sign to x
4 positive
5 negative
6 same sign as x/y
@@ -49,7 +49,7 @@ DESCRIPTION
is the smallest (in absolute value) remainder except when x/y is
halfway between consecutive integers, in which case the rounding
is as given by the 4 low bits of rnd. Using rnd = 24 gives the
cpmmonly used principle of rounding: round to the nearest integer,
commonly used principle of rounding: round to the nearest integer,
but take the even integer when there are two equally close integers.
For more detail on the effects of rnd for values other than those
@@ -66,7 +66,7 @@ DESCRIPTION
An error values is returned and the values of Q and R are not changed
if Q and R are not both lvalues, or if the current value of any
argument is not as specified above, or if Q or R has no-assign-to
prptection, e.g. after protect(Q,1).
protection, e.g. after protect(Q,1).
EXAMPLE

2
help/rand
View File

@@ -197,7 +197,7 @@ DESCRIPTION
The truly paranoid might suggest that my claims in the MAGIC NUMBERS
section are a lie intended to entrap people. Well they are not, but
if you that paranoid why would you use a non-cryprographically strong
if you that paranoid why would you use a non-cryptographically strong
pseudo-random number generator in the first place? You would be
better off using the random() builtin function.

2
help/rsearch
View File

@@ -14,7 +14,7 @@ TYPES
DESCRIPTION
Negative values of c and nonpositive values of d are treated as
Negative values of c and non-positive values of d are treated as
offsets from size(a), i.e. as if c were replaced by size(a) + c
and d by size(a) + d. Any such adjustment is assumed to have been
made.

6
help/script
View File

@@ -48,7 +48,7 @@ Calc shell scripts
( ... ) for shell-function arguments, { ... } for brace
expansion, $ for parameter or variable expansion, <, <<, >, >>
for redirection of input or output, etc.) it will usually be
necessary to quote or escape tho characters, or usually more
necessary to quote or escape th characters, or usually more
conveniently, quote whole expressions with single or double
quotes.
@@ -132,7 +132,7 @@ Calc shell scripts
./addall2 2 3 4
the $* in ths script expands to 2 3 4, and because of the "-s"
the $* in this script expands to 2 3 4, and because of the "-s"
in the options, calc starts with argv(0) = "2", argv(1) = "3",
argv(2)= "4". As there is only one calc process involved and
the eval() function accepts as argument any string that
@@ -156,7 +156,7 @@ Calc shell scripts
IMPORTANT NOTE:
The -f flag must be at the very end of the #! line.
The #! line must be the first line of the exeuctable file.
The #! line must be the first line of the executable file.
The path after the #! must be the full path to the calc executable.
After the command:

2
help/search
View File

@@ -14,7 +14,7 @@ TYPES
DESCRIPTION
Negative values of c and nonpositive values for d are treated as
Negative values of c and non-positive values for d are treated as
offsets from size(a), i.e. as if c were replaced by size(a) + c,
and d by size(a) + d. Any such adjustment is assumed in the following
description.

4
help/sha1
View File

@@ -25,7 +25,7 @@ DESCRIPTION
The new arg1 HASH state is returned.
If arg1 is not a a HASH state, then the initial HASH is
used and modifed by arg1 and any val args supplied. The
used and modified by arg1 and any val args supplied. The
return value is the new HASH state.
The following table gives a summary of actions and return values.
@@ -60,7 +60,7 @@ EXAMPLE
; sha1("x", "y", "z") == sha1("xy")
0
; sha1(sha1("this is", 7^19-8, "a composit", 3i+4.5, "hash"))
; sha1(sha1("this is", 7^19-8, "a composite", 3i+4.5, "hash"))
0xc3e1b562bf45b3bcfc055ac65b5b39cdeb6a6c55
; x = sha1(list(1,2,3), "curds and whey", 2^21701-1, pi())

6
help/size
View File

@@ -15,7 +15,7 @@ DESCRIPTION
null 0
real number 1
complex number 1
string length of string (not counding the trailing \0)
string length of string (not including the trailing \0)
matrix number of elements
list number of members
association number of (elements, value) pairs
@@ -25,9 +25,9 @@ DESCRIPTION
random state 1
config state 1
hash state 1
block numer of octets of data it currently holds
block number of octets of data it currently holds
octet 1
named block numer of octets of data it currently holds
named block number of octets of data it currently holds
EXAMPLE
; print size(null()), size(3), size(2 - 7i), size("abc")

4
help/sizeof
View File

@@ -15,10 +15,10 @@ DESCRIPTION
a value and all of its components. Unlike memsize(x), this
builtin does not include the size of the overhead.
Unlike size(x), this builtin incldues the trailing \0 byte on the
Unlike size(x), this builtin includes the trailing \0 byte on the
end of strings.
For numeric values, sizeof(x) ignores the demoninator if 'x' is
For numeric values, sizeof(x) ignores the denominator if 'x' is
an integer. For complex values, sizeof(x) ignores the imaginary
part if 'x' is real. Because the 0, 1 and -1 numeric values are
shared static values, sizeof(x) reports such values as having

4
help/sort
View File

@@ -56,7 +56,7 @@ DESCRIPTION
precede b, while precedes(a,b) being zero intends that the order
of a and b is to be as in the original x. For any integer-valued
precedes() function, the algorithm will return a result for sort(x),
but to guarantee fulfilment of the intentions just described,
but to guarantee fulfillment of the intentions just described,
precedes() should satisfy the conditions:
(1) For all a, b, c, precedes(a,b) implies precedes(a,c) || precedes (c,b),
@@ -159,7 +159,7 @@ DESCRIPTION
Examples of effects of various precedes functions for sorting
lists of integers:
a > b Sorts into nonincreasing order.
a > b Sorts into non-increasing order.
abs(a) < abs(b) Sorts into nondecreasing order of
absolute values, numbers with the

2
help/srandom
View File

@@ -267,7 +267,7 @@ DESCRIPTION
speed relative the default Blum generator. As of Feb 1997,
the Blum moduli associated with 13 <= newn < 20 appear to
be well beyond the scope of hardware and algorithms,
and 9 <= newn < 12 might be factorable with extreme difficulty.
and 9 <= newn < 12 might be factor-able with extreme difficulty.
The following table may be useful as a guide for how easy it
is to factor the modulus:

2
help/strncpy
View File

@@ -1,5 +1,5 @@
NAME
strncpy - copy a number of chracters from head or all of a stringr
strncpy - copy a number of characters from head or all of a string
to head or all of a string
SYNOPSIS

2
help/strpos
View File

@@ -11,7 +11,7 @@ TYPES
return int
DESCRIPTION
This function returns the location of the first occurance of the string t
This function returns the location of the first occurrence of the string t
in the string s. If t is not found within s, 0 is returned. If t is
found at the beginning of s, 1 is returned.

2
help/strtolower
View File

@@ -14,7 +14,7 @@ DESCRIPTION
All ASCII upper case letters get transformed into lower case letters. This
function can be locale dependent.
The function returns the lowercase'd string.
The function returns the lowercased string.
EXAMPLE
; strtolower(" GNU Lesser General Public License");

2
help/strtoupper
View File

@@ -14,7 +14,7 @@ DESCRIPTION
All ASCII lower case letters get transformed into upper case letters. This
function can be locale dependent.
The function returns the lowercase'd string.
The function returns the lowercased string.
EXAMPLE
; strtoupper(" GNU Lesser General Public License");

2
help/sum
View File

@@ -12,7 +12,7 @@ TYPES
DESCRIPTION
If an argument x_i is a list with elements e_1, e_2, ..., e_n, it
is treated as if x_i were replaced by e_1, e_2, ..., e_n; this may
continue recurively if any of the e_j is a list.
continue recursively if any of the e_j is a list.
If an argument x_i is an object of type xx, then x_i is replaced by
xx_sum(x_i) if the function xx_sum() has been defined. If the

2
help/system
View File

@@ -10,7 +10,7 @@ TYPES
return int
DESCRIPTION
This function excutes the shell command found in the srtring, cmd.
This function executes the shell command found in the string, cmd.
The return value is system dependent. On POSIX P1003.1 compliant
systems the return value is defined by the waitpid system call.
Typically a shell command that returns with a 0 exit status will

2
help/time
View File

@@ -9,7 +9,7 @@ TYPES
DESCRIPTION
The time() builtin returns the number of seconds since the Epoch,
which according to Posix is:
which according to POSIX is:
Thr Jan 1 00:00:00 UTC 1970

2
help/trunc
View File

@@ -14,7 +14,7 @@ DESCRIPTION
Truncate x to j decimal places. If j is omitted, 0 places is assumed.
Specifying zero places makes the result identical to int().
Truncation of a non-integer prodcues values nearer to zero.
Truncation of a non-integer produces values nearer to zero.
EXAMPLE
; print trunc(pi()), trunc(pi(), 5)

2
help/unexpected
View File

@@ -185,7 +185,7 @@ Unexpected
calc always evaluates terms from left to right
==============================================
Calc has a definite order for evaluation of terms (addends in a
Calc has a definite order for evaluation of terms (adds in a
sum, factors in a product, arguments for a function or a matrix,
etc.). This order is always from left to right. but skipping of
terms may occur for ||, && and ? : .

2
help/version
View File

@@ -17,7 +17,7 @@ DESCRIPTION
x.y
where x, y, z, w, v are integers (without leading 0's) and,
t is the liternal character 't'.
t is the literal character 't'.
EXAMPLE
; version()

4
help/wishlist
View File

@@ -18,6 +18,8 @@ Please read CONTRIB-CODE or run the following calc command:
become known. In particular, look at better algorithms for
very large numbers -- multiply, square and mod in particular.
* Correct typos in text and code comments.
* Implement an autoload feature. Associate a calc resource filename
with a function or global variable. On the first reference of
such item, perform an automatic load of that file.
@@ -69,7 +71,7 @@ Please read CONTRIB-CODE or run the following calc command:
If you have a command that takes a very long time to execute,
it would be nice if you could get at its result without having
to spend the time to reexecute it.
to spend the time to re-execute it.
* Add a binding to delete a value from the history list.