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

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