Mercurial > octave-antonio
changeset 18790:322eb69e30ad stable
doc: Fix some Latin wording in documentation.
* external.txi, interp.txi, sparse.txi: Use "a priori" rather than "a-priori".
Don't use "Firstly".
author | Rik <rik@octave.org> |
---|---|
date | Mon, 02 Jun 2014 08:59:26 -0700 |
parents | dccbc8bff5cb |
children | 96f22d6674c4 |
files | doc/interpreter/external.txi doc/interpreter/interp.txi doc/interpreter/sparse.txi |
diffstat | 3 files changed, 7 insertions(+), 7 deletions(-) [+] |
line wrap: on
line diff
--- a/doc/interpreter/external.txi Sun Jun 01 21:41:58 2014 -0700 +++ b/doc/interpreter/external.txi Mon Jun 02 08:59:26 2014 -0700 @@ -807,7 +807,7 @@ @} sm.cidx(j+1) = ii; @} -sm.maybe_compress (); // If don't know a-priori the final # of nz. +sm.maybe_compress (); // If don't know a priori the final # of nz. @end example @noindent @@ -847,7 +847,7 @@ @} sm.cidx(j+1) = ii; @} -sm.maybe_mutate (); // If don't know a-priori the final # of nz. +sm.maybe_mutate (); // If don't know a priori the final # of nz. @end example Note that both increasing and decreasing the number of non-zero elements in
--- a/doc/interpreter/interp.txi Sun Jun 01 21:41:58 2014 -0700 +++ b/doc/interpreter/interp.txi Mon Jun 02 08:59:26 2014 -0700 @@ -88,9 +88,9 @@ @DOCSTRING(interpft) -There are two significant limitations on Fourier interpolation. Firstly, +There are two significant limitations on Fourier interpolation. First, the function signal is assumed to be periodic, and so non-periodic -signals will be poorly represented at the edges. Secondly, both the +signals will be poorly represented at the edges. Second, both the signal and its interpolation are required to be sampled at equispaced points. An example of the use of @code{interpft} is
--- a/doc/interpreter/sparse.txi Sun Jun 01 21:41:58 2014 -0700 +++ b/doc/interpreter/sparse.txi Mon Jun 02 08:59:26 2014 -0700 @@ -47,7 +47,7 @@ problems where only the non-zero elements of the matrix are stored. Not only does this reduce the amount of memory to store the matrix, but it also means that operations on this type of matrix can -take advantage of the a-priori knowledge of the positions of the +take advantage of the a priori knowledge of the positions of the non-zero elements to accelerate their calculations. A matrix type that stores only the non-zero elements is generally called @@ -73,7 +73,7 @@ There are many different means of storing sparse matrix data. What all of the methods have in common is that they attempt to reduce the complexity -and storage given a-priori knowledge of the particular class of problems +and storage given a priori knowledge of the particular class of problems that will be solved. A good summary of the available techniques for storing sparse matrix is given by Saad @footnote{Y. Saad "SPARSKIT: A basic toolkit for sparse matrix computation", 1994, @@ -573,7 +573,7 @@ same manner as there full counterparts. However, there are certain differences and especially differences with other products sparse implementations. -Firstly, the @qcode{"./"} and @qcode{".^"} operators must be used with care. +First, the @qcode{"./"} and @qcode{".^"} operators must be used with care. Consider what the examples @example