Mercurial > hg > octave-max
changeset 7001:8b0cfeb06365
[project @ 2007-10-10 18:02:59 by jwe]
line wrap: on
line diff
--- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,7 @@ +2007-10-10 Kim Hansen <kimhanse@gmail.com> + + * run-octave.in: Use $args. Eliminate "if [ -n "$args" ]" conditional. + 2007-10-09 John W. Eaton <jwe@octave.org> * gdbinit.in: Delete.
--- a/doc/ChangeLog +++ b/doc/ChangeLog @@ -1,3 +1,14 @@ +2007-10-10 Olli Saarela <Olli.Saarela@kcl.fi> + + * interpreter/arith.txi, interpreter/basics.txi, + interpreter/container.txi, interpreter/dynamic.txi, + interpreter/eval.txi, interpreter/expr.txi, interpreter/func.txi, + interpreter/geometry.txi, interpreter/intro.txi, + interpreter/numbers.txi, interpreter/plot.txi, + interpreter/poly.txi, interpreter/set.txi, interpreter/sparse.txi, + interpreter/stmt.txi, interpreter/strings.txi, + interpreter/testfun.txi, interpreter/tips.txi: Spelling fixes. + 2007-10-06 John W. Eaton <jwe@octave.org> * interpreter/octave.texi: Add David Bateman and Søren Hauberg as
--- a/doc/interpreter/arith.txi +++ b/doc/interpreter/arith.txi @@ -149,7 +149,7 @@ @DOCSTRING(acsch) @DOCSTRING(acoth) -Each of these functions expect a single argument. For matrix arguments, +Each of these functions expects a single argument. For matrix arguments, they work on an element by element basis. For example, @example
--- a/doc/interpreter/basics.txi +++ b/doc/interpreter/basics.txi @@ -351,7 +351,7 @@ Another set of command-line editing functions use Meta characters. On some terminals, you type @kbd{M-u} by holding down @key{META} and pressing @key{u}. If your terminal does not have a @key{META} key, you -can still type Meta charcters using two-character sequences starting +can still type Meta characters using two-character sequences starting with @kbd{ESC}. Thus, to enter @kbd{M-u}, you could type @key{ESC}@key{u}. The @kbd{ESC} character sequences are also allowed on terminals with real Meta keys. In the following sections, Meta
--- a/doc/interpreter/container.txi +++ b/doc/interpreter/container.txi @@ -291,7 +291,7 @@ @end example Elements can be deleted from a structure array in a similar manner to a -numerial array, by assignment the elements to an empty matrix. For +numerical array, by assigning the elements to an empty matrix. For example @example @@ -690,7 +690,7 @@ @end example @noindent -@code{@var{a}, @var{b}} is a somma separated list. Comma separated lists +@code{@var{a}, @var{b}} is a comma separated list. Comma separated lists can appear on both the right and left hand side of an equation. For example @@ -701,7 +701,7 @@ @noindent where @code{@var{i}, @var{j}} is equally a comma separated list. Comma separated lists can not be directly manipulated by the user. However, -both structures are cell arrays can be converted into into comma +both structures are cell arrays can be converted into comma separated lists, which makes them useful to keep the input arguments and return values of functions organized. Another example of where a comma separated list can be used is in the creation of a new array. If all the @@ -721,7 +721,7 @@ function. The list of elements from the cell array will be passed as an argument list to a given function as if it is called with the elements as arguments. The two calls to @code{printf} in the following example are -identical but the latter is more simple and handles more situations +identical but the latter is simpler and handles more situations @example c = @{"GNU", "Octave", "is", "Free", "Software"@};
--- a/doc/interpreter/dynamic.txi +++ b/doc/interpreter/dynamic.txi @@ -56,7 +56,7 @@ Also, as oct- and mex-files are dynamically linked to octave, they introduce to possibility of having Octave abort due to coding errors in -the user code. For example a segmentation violation in the users code +the user code. For example a segmentation violation in the user's code will cause Octave to abort. @menu @@ -244,8 +244,8 @@ value to obtain or set. @end deftypefn -Note that these function do significant error checking and so in some -circumstances the user might prefer the access the data of the array or +Note that these functions do significant error checking and so in some +circumstances the user might prefer to access the data of the array or matrix directly through the fortran_vec method discussed below. @deftypefn Method octave_idx_type nelem (void) const @@ -393,7 +393,7 @@ @node Cell Arrays in Oct-Files @subsection Cell Arrays in Oct-Files -Octave's cell type is equally accessible within an oct-files. A cell +Octave's cell type is equally accessible within oct-files. A cell array is just an array of @code{octave_value}s, and so each element of the cell array can then be treated just like any other @code{octave_value}. A simple example is @@ -440,7 +440,7 @@ @end group @end example -The commented code above demonstrates how to iterated over all of the +The commented code above demonstrates how to iterate over all of the fields of the structure, where as the following code demonstrates finding a particular field in a more concise manner. @@ -510,8 +510,8 @@ returns the number of non-zero elements. If the user really requires the number of elements in the matrix, including the non-zero elements, they should use @code{numel} rather than @code{nelem}. Note that for very -large matrices, where the product of the two dimensions is large that -the representation of the an unsigned int, then @code{numel} can overflow. +large matrices, where the product of the two dimensions is larger than +the representation of an unsigned int, then @code{numel} can overflow. An example is @code{speye(1e6)} which will create a matrix with a million rows and columns, but only a million non-zero elements. Therefore the number of rows by the number of columns in this case is more than two @@ -984,8 +984,8 @@ @subsection Input Parameter Checking in Oct-Files As oct-files are compiled functions they have the possibility of causing -Octave to abort abnormally. It is therefore inportant that the input -parameters to each and every function has the minimum of parameter +Octave to abort abnormally. It is therefore important that +each and every function has the minimum of parameter checking needed to ensure that Octave behaves well. The minimum requirement, as previously discussed, is to check the number @@ -1099,7 +1099,7 @@ The major issue is that the help string will typically be longer than a single line of text, and so the formatting of long help strings need to -be taken into account. There are several manner in which to treat this +be taken into account. There are several manners in which to treat this issue, but the most common is illustrated in the following example @example @@ -1506,7 +1506,7 @@ @subsection Sparse Matrices with Mex-Files The Octave format for sparse matrices is identical to the mex format in -that it is a compressed colument sparse format. Also in both, sparse +that it is a compressed column sparse format. Also in both, sparse matrices are required to be two dimensional. The only difference is that the real and imaginary parts of the matrix are stored separately.
--- a/doc/interpreter/eval.txi +++ b/doc/interpreter/eval.txi @@ -23,7 +23,7 @@ @node Calling a Function by its Name @section Calling a Function by its Name -The @code{feval} function allow you to call a function from a string +The @code{feval} function allows you to call a function from a string containing its name. This is useful when writing a function that need to call user-supplied functions. The @code{feval} function takes the name of the function to call as its first argument, and the remaining
--- a/doc/interpreter/expr.txi +++ b/doc/interpreter/expr.txi @@ -444,7 +444,7 @@ Power operator. If @var{x} and @var{y} are both scalars, this operator returns @var{x} raised to the power @var{y}. If @var{x} is a scalar and @var{y} is a square matrix, the result is computed using an eigenvalue -expansion. If @var{x} is a square matrix. the result is computed by +expansion. If @var{x} is a square matrix, the result is computed by repeated multiplication if @var{y} is an integer, and by an eigenvalue expansion if @var{y} is not an integer. An error results if both @var{x} and @var{y} are matrices.
--- a/doc/interpreter/func.txi +++ b/doc/interpreter/func.txi @@ -1072,7 +1072,7 @@ @var{name} ("@var{arg1}", "@var{arg2}", @dots{}) @end example -A function can be used as a command if it accept string input arguments. +A function can be used as a command if it accepts string input arguments. To do this, the function must be marked as a command, which can be done with the @code{mark_as_command} command like this
--- a/doc/interpreter/geometry.txi +++ b/doc/interpreter/geometry.txi @@ -356,7 +356,7 @@ @node Convex Hull @section Convex Hull -The convex hull of a set of points, is the minimum convex envelope +The convex hull of a set of points is the minimum convex envelope containing all of the points. Octave has the functions @code{convhull} and @code{convhulln} to calculate the convec hull of 2-dimensional and N-dimensional sets of points.
--- a/doc/interpreter/intro.txi +++ b/doc/interpreter/intro.txi @@ -267,7 +267,7 @@ @end example @noindent -will create a fille called @file{foo.eps} that contains a rendering of +will create a file called @file{foo.eps} that contains a rendering of the current plot. The command @example @@ -513,7 +513,7 @@ beginning. Functions in Octave may be defined in several different ways. The -catagory name for functions may include another name that indicates the +category name for functions may include another name that indicates the way that the function is defined. These additional tags include @table @asis @@ -546,7 +546,7 @@ Command descriptions have a format similar to function descriptions, except that the word `Function' is replaced by `Command. Commands are -functions that may called without surrounding their arguments in +functions that may be called without surrounding their arguments in parentheses. For example, here is the description for Octave's @code{cd} command:
--- a/doc/interpreter/numbers.txi +++ b/doc/interpreter/numbers.txi @@ -599,7 +599,7 @@ program, it can be necessary to type checking at run-time. Doing this also allows you to change the behaviour of a function depending on the type of the input. As an example, this naive implementation of @code{abs} -return the absolute value of the input if it is a real number, and the +returns the absolute value of the input if it is a real number, and the length of the input if it is a complex number. @example
--- a/doc/interpreter/plot.txi +++ b/doc/interpreter/plot.txi @@ -144,7 +144,7 @@ @DOCSTRING(loglogerr) Finally, the @code{polar} function allows you to easily plot data in -polor coordinates. However, the display coordinates remain rectangular +polar coordinates. However, the display coordinates remain rectangular and linear. For example, @example @@ -591,7 +591,7 @@ A four-element vector specifying the coordinates of the lower left corner and width and height of the plot, in normalized units. For example, @code{[0.2, 0.3, 0.4, 0.5]} sets the lower left corner of the -axes at @math{(0.2, 0.3)} and the width and heigth to be 0.4 and 0.5 +axes at @math{(0.2, 0.3)} and the width and height to be 0.4 and 0.5 respectively. @item title @@ -714,7 +714,7 @@ A four-element vector specifying the coordinates of the lower left corner and width and height of the plot, in normalized units. For example, @code{[0.2, 0.3, 0.4, 0.5]} sets the lower left corner of the -axes at @math{(0.2, 0.3)} and the width and heigth to be 0.4 and 0.5 +axes at @math{(0.2, 0.3)} and the width and height to be 0.4 and 0.5 respectively. @end table @@ -788,7 +788,7 @@ @item xdata @itemx ydata -Two-element vectors specifing the range of the x- and y- coordinates for +Two-element vectors specifying the range of the x- and y- coordinates for the image. @end table @@ -934,7 +934,7 @@ @node Line Styles @subsection Line Styles -Line styles are specified by the folowing properties: +Line styles are specified by the following properties: @table @code @item linestyle @@ -957,7 +957,7 @@ @node Marker Styles @subsection Marker Styles -Marker styles are specified by the folowing properties: +Marker styles are specified by the following properties: @table @code @item marker A character indicating a plot marker to be place at each data point, or
--- a/doc/interpreter/poly.txi +++ b/doc/interpreter/poly.txi @@ -125,7 +125,7 @@ about the function. The following example shows how to combine two linear functions and a -quadratic into one function. Each of these functions are expressed +quadratic into one function. Each of these functions is expressed on adjoined intervals. @example
--- a/doc/interpreter/set.txi +++ b/doc/interpreter/set.txi @@ -6,7 +6,7 @@ @chapter Sets Octave has a limited set of functions for managing sets of data, where a -set is defined as a collection unique elements. In Octave a set is +set is defined as a collection of unique elements. In Octave a set is represented as a vector of numbers. @DOCSTRING(create_set)
--- a/doc/interpreter/sparse.txi +++ b/doc/interpreter/sparse.txi @@ -85,7 +85,7 @@ In fact, the column index contains one more element than the number of columns, with the first element always being zero. The advantage of -this is a simplification in the code, in that their is no special case +this is a simplification in the code, in that there is no special case for the first or last columns. A short example, demonstrating this in C is. @@ -148,7 +148,7 @@ all elements in the rows are stored in increasing order of their row index, which makes certain operations faster. However, it imposes the need to sort the elements on the creation of sparse matrices. Having -dis-ordered elements is potentially an advantage in that it makes operations +disordered elements is potentially an advantage in that it makes operations such as concatenating two sparse matrices together easier and faster, however it adds complexity and speed problems elsewhere. @@ -187,7 +187,7 @@ creates an @var{r}-by-@var{c} sparse matrix with a density of filled elements of @var{d}. -Other functions of interest that directly creates a sparse matrices, are +Other functions of interest that directly create sparse matrices, are @dfn{spdiag} or its generalization @dfn{spdiags}, that can take the definition of the diagonals of the matrix and create the sparse matrix that corresponds to this. For example @@ -376,7 +376,7 @@ @end float One use of sparse matrices is in graph theory, where the -interconnections between nodes is represented as an adjacency +interconnections between nodes are represented as an adjacency matrix. That is, if the i-th node in a graph is connected to the j-th node. Then the ij-th node (and in the case of undirected graphs the ji-th node) of the sparse adjacency matrix is non-zero. If each node @@ -444,7 +444,8 @@ explicitly calling its function name. The table below lists all of the sparse functions of Octave. Note that -in this specific sparse forms of the functions are typically the same as +the names of the +specific sparse forms of the functions are typically the same as the general versions with a @dfn{sp} prefix. In the table below, and the rest of this article the specific sparse versions of the functions are used. @@ -631,7 +632,7 @@ @caption{Structure of simple sparse matrix.} @end float -The standard Cholesky factorization of this matrix, can be +The standard Cholesky factorization of this matrix can be obtained by the same command that would be used for a full matrix. This can be visualized with the command @code{r = chol(A); spy(r);}. @@ -1010,7 +1011,7 @@ stiffness) matrix for each simplex (represented as 3-by-3 elements on the diagonal of the element-wise system matrix @code{SE}. Based on @code{SE} and a N-by-DE connectivity matrix @code{C}, representing the connections -between simplices and vectices, the global connectivity matrix @code{S} is +between simplices and vertices, the global connectivity matrix @code{S} is calculated. @example
--- a/doc/interpreter/stmt.txi +++ b/doc/interpreter/stmt.txi @@ -551,7 +551,7 @@ @noindent In this case the variable @code{i} takes on the value of the columns of the matrix or cell matrix. So the first loop iterates twice, producing -two column vectors @code{[1;2]}, follwed by @code{[3;4]}, and likewise +two column vectors @code{[1;2]}, followed by @code{[3;4]}, and likewise for the loop over the cell array. This can be extended to loops over multidimensional arrays. For example
--- a/doc/interpreter/strings.txi +++ b/doc/interpreter/strings.txi @@ -203,7 +203,7 @@ @noindent To determine if two functions are identical it is therefore necessary to use the @code{strcmp} or @code{strncpm} functions. Similar -functions exists for doing case-insensitive comparisons. +functions exist for doing case-insensitive comparisons. @DOCSTRING(strcmp) @@ -228,7 +228,7 @@ @end example For more complex manipulations, such as searching, replacing, and -general regular expressions, the following function come with Octave. +general regular expressions, the following functions come with Octave. @DOCSTRING(deblank)
--- a/doc/interpreter/testfun.txi +++ b/doc/interpreter/testfun.txi @@ -112,7 +112,7 @@ Sometimes during development there is a test that should work but is known to fail. You still want to leave the test in because when the final code is ready the test should pass, but you may not be able to -fix it immediately. To avoid unecessary bug reports for these known +fix it immediately. To avoid unnecessary bug reports for these known failures, mark the block with @code{xtest} rather than @code{test}: @example
--- a/doc/interpreter/tips.txi +++ b/doc/interpreter/tips.txi @@ -275,7 +275,7 @@ As noted above, documentation is typically in a commented header block on an Octave function following the copyright statement. The help string -shown above is an unformated stringed and will be displayed as is by +shown above is an unformatted string and will be displayed as is by Octave. Here are some tips for the writing of documentation strings. @itemize @bullet @@ -518,7 +518,7 @@ @@end example @@end ifinfo -If @@var@{n@} is a vector generate all combinations of the elements +If @@var@{n@} is a vector, this generates all combinations of the elements of @@var@{n@}, taken @@var@{k@} at a time, one row per combination. The resulting @@var@{c@} has size @@code@{[nchoosek (length (@@var@{n@}), @@var@{k@}), @@var@{k@}]@}.
--- a/liboctave/ChangeLog +++ b/liboctave/ChangeLog @@ -1,3 +1,7 @@ +2007-10-10 Olli Saarela <Olli.Saarela@kcl.fi> + + * DASPK-opts.in, DASRT-opts.in, DASSL-opts.in: Spelling fixes. + 2007-10-10 John W. Eaton <jwe@octave.org> * LPsolve.h, LPsolve.cc: Delete.
--- a/liboctave/DASPK-opts.in +++ b/liboctave/DASPK-opts.in @@ -265,7 +265,7 @@ OPTION NAME = "initial step size" DOC_ITEM -Differential-algebraic problems may occaisionally suffer from severe +Differential-algebraic problems may occasionally suffer from severe scaling difficulties on the first step. If you know a great deal about the scaling of your problem, you can help to alleviate this problem by specifying an initial stepsize (default is computed
--- a/liboctave/DASRT-opts.in +++ b/liboctave/DASRT-opts.in @@ -62,7 +62,7 @@ OPTION NAME = "initial step size" DOC_ITEM -Differential-algebraic problems may occaisionally suffer from severe +Differential-algebraic problems may occasionally suffer from severe scaling difficulties on the first step. If you know a great deal about the scaling of your problem, you can help to alleviate this problem by specifying an initial stepsize.
--- a/liboctave/DASSL-opts.in +++ b/liboctave/DASSL-opts.in @@ -90,7 +90,7 @@ OPTION NAME = "initial step size" DOC_ITEM -Differential-algebraic problems may occaisionally suffer from severe +Differential-algebraic problems may occasionally suffer from severe scaling difficulties on the first step. If you know a great deal about the scaling of your problem, you can help to alleviate this problem by specifying an initial stepsize.
--- a/run-octave.in +++ b/run-octave.in @@ -46,14 +46,8 @@ fi fi -if [ -n "$args" ]; then - OCTAVE_SITE_INITFILE="$top_srcdir/scripts/startup/main-rcfile" \ - LD_PRELOAD="$liboctinterp $liboctave $libcruft" \ - %library_path_var%="$builddir/src:$builddir/liboctave:$builddir/libcruft:$%library_path_var%" \ - exec $driver "$builddir/src/octave" --no-initial-path --path="$LOADPATH" --image-path="$IMAGEPATH" "$@" -else - OCTAVE_SITE_INITFILE="$top_srcdir/scripts/startup/main-rcfile" \ - LD_PRELOAD="$liboctinterp $liboctave $libcruft" \ - %library_path_var%="$builddir/src:$builddir/liboctave:$builddir/libcruft:$%library_path_var%" \ - exec $driver "$builddir/src/octave" "$@" -fi +OCTAVE_SITE_INITFILE="$top_srcdir/scripts/startup/main-rcfile" \ +LD_PRELOAD="$liboctinterp $liboctave $libcruft" \ +%library_path_var%="$builddir/src:$builddir/liboctave:$builddir/libcruft:$%library_path_var%" \ + exec $driver "$builddir/src/octave" $args "$@" +
--- a/scripts/ChangeLog +++ b/scripts/ChangeLog @@ -1,3 +1,29 @@ +2007-10-10 Olli Saarela <Olli.Saarela@kcl.fi> + + * control/hinf/hinfsyn.m, control/hinf/wgt1o.m, + control/system/buildssic.m, control/system/c2d.m, + control/system/d2c.m, control/system/ord2.m, control/system/ss.m, + control/system/ss2sys.m, control/system/ss2tf.m, + control/system/syscont.m, control/system/sysdimensions.m, + control/system/sysdisc.m, control/system/sysmult.m, + control/system/sysrepdemo.m, control/system/tf2ss.m, elfun/lcm.m, + finance/fv.m, general/cumtrapz.m, general/gradient.m, + general/interp1.m, general/interp2.m, general/interp3.m, + general/interpft.m, general/interpn.m, general/polyarea.m, + general/rat.m, general/structfun.m, general/trapz.m, + geometry/tsearchn.m, image/rgb2hsv.m, linear-algebra/krylov.m, + miscellaneous/ans.m, miscellaneous/gzip.m, optimization/glpk.m, + optimization/sqp.m, plot/findobj.m, plot/legend.m, plot/peaks.m, + plot/plot3.m, plot/stem.m, polynomial/deconv.m, + polynomial/pchip.m, polynomial/spline.m, polynomial/unmkpp.m, + sparse/pcr.m, sparse/spalloc.m, sparse/spconvert.m, + specfun/factor.m, specfun/legendre.m, statistics/base/mean.m, + statistics/base/meansq.m, statistics/base/var.m, + statistics/tests/chisquare_test_independence.m, + statistics/tests/t_test.m, statistics/tests/u_test.m, + strings/dec2base.m, strings/mat2str.m, testfun/speed.m, + testfun/test.m: Spelling fixes. + 2007-10-10 Ben Abbott <bpabbott@mac.com> * polynomial/mpoles.m: Return indx = ordr(indx), not indx(ordr).
--- a/scripts/control/hinf/hinfsyn.m +++ b/scripts/control/hinf/hinfsyn.m @@ -73,7 +73,7 @@ ## @item tol ## threshold for 0. Default: 200*@code{eps}. ## -## @var{gmax}, @var{min}, @var{tol}, and @var{tol} must all be postive scalars. +## @var{gmax}, @var{min}, @var{tol}, and @var{tol} must all be positive scalars. ## @end table ## @strong{Outputs} ## @table @var
--- a/scripts/control/hinf/wgt1o.m +++ b/scripts/control/hinf/wgt1o.m @@ -31,7 +31,7 @@ ## H-2/H-infinity ## @end ifinfo ## design procedure. -## These function are part of the augmented plant @var{P} +## These functions are part of the augmented plant @var{P} ## (see @command{hinfdemo} for an application example). ## ## @strong{Inputs}
--- a/scripts/control/system/buildssic.m +++ b/scripts/control/system/buildssic.m @@ -62,14 +62,14 @@ ## are input numbers of @var{s1}--@var{s8}. ## ## @item olst -## output list, specifiy the outputs of the resulting +## output list, specifies the outputs of the resulting ## systems. Elements are output numbers of @var{s1}--@var{s8}. ## The numbers are allowed to be negative and may ## appear in any order. An empty matrix means ## all outputs. ## ## @item ilst -## input list, specifiy the inputs of the resulting +## input list, specifies the inputs of the resulting ## systems. Elements are input numbers of @var{s1}--@var{s8}. ## The numbers are allowed to be negative and may ## appear in any order. An empty matrix means @@ -91,7 +91,7 @@ ## @end group ## @end example ## -## The closed loop system @var{GW} can be optained by +## The closed loop system @var{GW} can be obtained by ## @example ## GW = buildssic([1 2; 2 -1], 2, [1 2 3], 2, G, K); ## @end example @@ -151,7 +151,7 @@ ## GW = buildssic([1, 4; 2, 4; 3, 1], 3, [2, 3, 5], ## [3, 4], G, W1, W2, One); ## @end example -## where ``One'' is a unity gain (auxillary) function with order 0. +## where ``One'' is a unity gain (auxiliary) function with order 0. ## (e.g. @code{One = ugain(1);}) ## @end deftypefn
--- a/scripts/control/system/c2d.m +++ b/scripts/control/system/c2d.m @@ -130,7 +130,7 @@ endif if (!is_sample(T)) - error("sampling period T must be a postive, real scalar"); + error("sampling period T must be a positive, real scalar"); elseif (! (strcmp (opt, "ex") || strcmp (opt, "bi") || strcmp (opt, "matched")))
--- a/scripts/control/system/d2c.m +++ b/scripts/control/system/d2c.m @@ -79,7 +79,7 @@ error(["d2c: invalid opt passed=",opt]); endif elseif(!is_sample(opt)) - error("tol must be a postive scalar") + error("tol must be a positive scalar") elseif(opt > 1e-2) warning(["d2c: ridiculous error tolerance passed=",num2str(opt); ... ", intended c2d call?"])
--- a/scripts/control/system/ord2.m +++ b/scripts/control/system/ord2.m @@ -30,7 +30,7 @@ ## @item gain ## dc-gain ## This is steady state value only for damp > 0. -## gain is assumed to be 1.0 if ommitted. +## gain is assumed to be 1.0 if omitted. ## @end table ## ## @strong{Output}
--- a/scripts/control/system/ss.m +++ b/scripts/control/system/ss.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {@var{outsys} =} ss (@var{a}, @var{b}, @var{c}, @var{d}, @var{tsam}, @var{n}, @var{nz}, @var{stname}, @var{inname}, @var{outname}, @var{outlist}) -## Create system structure from state-space data. May be continous, +## Create system structure from state-space data. May be continuous, ## discrete, or mixed (sampled data) ## ## @strong{Inputs} @@ -71,7 +71,7 @@ ## If @var{tsam} is greater than 0, @math{outlist = 1:@code{rows}(@var{c})}. ## @end table ## -## Unlike states, discrete/continous outputs may appear in any order. +## Unlike states, discrete/continuous outputs may appear in any order. ## ## @code{sys2ss} returns a vector @var{yd} where ## @var{yd}(@var{outlist}) = 1; all other entries of @var{yd} are 0.
--- a/scripts/control/system/ss2sys.m +++ b/scripts/control/system/ss2sys.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {} ss (@var{a}, @var{b}, @var{c}, @var{d}, @var{tsam}, @var{n}, @var{nz}, @var{stname}, @var{inname}, @var{outname}, @var{outlist}) -## Create system structure from state-space data. May be continous, +## Create system structure from state-space data. May be continuous, ## discrete, or mixed (sampled data) ## ## @strong{Inputs} @@ -71,7 +71,7 @@ ## If @var{tsam} is greater than 0, @math{outlist = 1:@code{rows}(@var{c})}. ## @end table ## -## Unlike states, discrete/continous outputs may appear in any order. +## Unlike states, discrete/continuous outputs may appear in any order. ## ## @code{sys2ss} returns a vector @var{yd} where ## @var{yd}(@var{outlist}) = 1; all other entries of @var{yd} are 0.
--- a/scripts/control/system/ss2tf.m +++ b/scripts/control/system/ss2tf.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {[@var{num}, @var{den}] =} ss2tf (@var{a}, @var{b}, @var{c}, @var{d}) -## Conversion from tranfer function to state-space. +## Conversion from transfer function to state-space. ## The state space system: ## @iftex ## @tex
--- a/scripts/control/system/syscont.m +++ b/scripts/control/system/syscont.m @@ -58,7 +58,7 @@ Acc = Acd = Bcc = Ccc = Ccd = Dcc = []; if(isempty(st_c) & isempty(y_c)) - error("syscont: expecting continous states and/or continous outputs"); + error("syscont: expecting continuous states and/or continuous outputs"); elseif (isempty(st_c)) warning("syscont: no continuous states"); elseif(isempty(y_c))
--- a/scripts/control/system/sysdimensions.m +++ b/scripts/control/system/sysdimensions.m @@ -61,7 +61,7 @@ ## @item yd ## binary vector; @var{yd}(@var{ii}) is nonzero if output @var{ii} is ## discrete. -## @math{yd(ii) = 0} if output @var{ii} is continous +## @math{yd(ii) = 0} if output @var{ii} is continuous ## @end table ## @seealso{sysgetsignals, sysgettsam} ## @end deftypefn
--- a/scripts/control/system/sysdisc.m +++ b/scripts/control/system/sysdisc.m @@ -33,7 +33,7 @@ ## no purely discrete path from inputs to outputs). ## @item adc ## @itemx cdc -## Connections from continuous states to discrete states and discrete. +## Connections from continuous states to discrete states and discrete ## outputs, respectively. ## @end table ## @end deftypefn @@ -53,7 +53,7 @@ Add = Adc = Bdd = Cdd = Cdc = Ddd = []; if(isempty(st_d) & isempty(y_d)) - error("sysdisc: expecting discrete states and/or continous outputs"); + error("sysdisc: expecting discrete states and/or continuous outputs"); elseif (isempty(st_d)) warning("sysdisc: no discrete states"); elseif(isempty(y_d))
--- a/scripts/control/system/sysmult.m +++ b/scripts/control/system/sysmult.m @@ -79,7 +79,7 @@ if(An) bd = Ab(1:An)* Bd(alist,:); if(norm(bd,1)) - warning("sysmult: inputs -> Bsys discrete outputs -> continous states of Asys"); + warning("sysmult: inputs -> Bsys discrete outputs -> continuous states of Asys"); endif endif ## check direct feed-through of continuous state through discrete outputs
--- a/scripts/control/system/sysrepdemo.m +++ b/scripts/control/system/sysrepdemo.m @@ -206,7 +206,7 @@ run_cmd; cmd = "outname = \"e(t)\";"; run_cmd - disp("Since the system is continous time and without states,") + disp("Since the system is continuous time and without states,") disp("the ss inputs tsam, n, and nz are all zero:") cmd = "sys = ss([],[],[],D,0,0,0,[],inname,outname);"; run_cmd
--- a/scripts/control/system/tf2ss.m +++ b/scripts/control/system/tf2ss.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {[@var{a}, @var{b}, @var{c}, @var{d}] =} tf2ss (@var{num}, @var{den}) -## Conversion from tranfer function to state-space. +## Conversion from transfer function to state-space. ## The state space system: ## @iftex ## @tex
--- a/scripts/elfun/lcm.m +++ b/scripts/elfun/lcm.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Mapping Function} {} lcm (@var{x}, @dots{}) -## Compute the least common multiple of the elements elements of @var{x}, or +## Compute the least common multiple of the elements of @var{x}, or ## the list of all the arguments. For example, ## ## @example
--- a/scripts/finance/fv.m +++ b/scripts/finance/fv.m @@ -26,7 +26,7 @@ ## The optional argument @var{l} may be used to specify an ## additional lump-sum payment. ## -## The optional argument @var{method} may be used ot specify whether the +## The optional argument @var{method} may be used to specify whether the ## payments are made at the end (@code{"e"}, default) or at the ## beginning (@code{"b"}) of each period. ##
--- a/scripts/general/cumtrapz.m +++ b/scripts/general/cumtrapz.m @@ -22,11 +22,11 @@ ## @deftypefnx {Function File} {@var{z} =} cumtrapz (@var{x}, @var{y}) ## @deftypefnx {Function File} {@var{z} =} cumtrapz (@dots{}, @var{dim}) ## -## Cumulative numerical intergration using trapezodial method. -## @code{cumtrapz (@var{y})} computes the cummulative integral of the +## Cumulative numerical integration using trapezoidal method. +## @code{cumtrapz (@var{y})} computes the cumulative integral of the ## @var{y} along the first non singleton dimension. If the argument ## @var{x} is omitted a equally spaced vector is assumed. @code{cumtrapz -## (@var{x}, @var{y})} evaluates the cummulative integral with respect +## (@var{x}, @var{y})} evaluates the cumulative integral with respect ## to @var{x}. ## ## @seealso{trapz,cumsum}
--- a/scripts/general/gradient.m +++ b/scripts/general/gradient.m @@ -34,7 +34,7 @@ ## ## Spacing values between two points can be provided by the ## @var{dx}, @var{dy} or @var{h} parameters. If @var{h} is supplied it -## is assumed to be the spacing in all directions. Otherwise, seperate +## is assumed to be the spacing in all directions. Otherwise, separate ## values of the spacing can be supplied by the @var{dx}, etc variables. ## A scalar value specifies an equidistant spacing, while a vector value ## can be used to specify a variable spacing. The length must match
--- a/scripts/general/interp1.m +++ b/scripts/general/interp1.m @@ -26,7 +26,7 @@ ## One-dimensional interpolation. Interpolate @var{y}, defined at the ## points @var{x}, at the points @var{xi}. The sample points @var{x} ## must be strictly monotonic. If @var{y} is an array, treat the columns -## of @var{y} seperately. +## of @var{y} separately. ## ## Method is one of: ##
--- a/scripts/general/interp2.m +++ b/scripts/general/interp2.m @@ -44,7 +44,7 @@ ## 1:columns (@var{z})} ## ## @item interp2 (@var{z}, @var{n}) -## Interleaves the Matrix @var{z} n-times. If @var{n} is ommited a value +## Interleaves the Matrix @var{z} n-times. If @var{n} is omitted a value ## of @code{@var{n} = 1} is assumed. ## @end table ##
--- a/scripts/general/interp3.m +++ b/scripts/general/interp3.m @@ -33,10 +33,10 @@ ## respect a similar format to @var{x}, etc, and they represent the points ## at which the array @var{vi} is interpolated. ## -## If @var{x}, @var{y}, @var{z} are ommitted, they are assumed to be +## If @var{x}, @var{y}, @var{z} are omitted, they are assumed to be ## @code{x = 1 : size (@var{v}, 2)}, @code{y = 1 : size (@var{v}, 1)} and ## @code{z = 1 : size (@var{v}, 3)}. If @var{m} is specified, then -## the interpolation adds a point half way between each of the interplation +## the interpolation adds a point half way between each of the interpolation ## points. This process is performed @var{m} times. If only @var{v} is ## specified, then @var{m} is assumed to be @code{1}. ##
--- a/scripts/general/interpft.m +++ b/scripts/general/interpft.m @@ -24,11 +24,11 @@ ## Fourier interpolation. If @var{x} is a vector, then @var{x} is ## resampled with @var{n} points. The data in @var{x} is assumed to be ## equispaced. If @var{x} is an array, then operate along each column of -## the array seperately. If @var{dim} is specified, then interpolate +## the array separately. If @var{dim} is specified, then interpolate ## along the dimension @var{dim}. ## ## @code{interpft} assumes that the interpolated function is periodic, -## and so assumption are made about the end points of the inetrpolation. +## and so assumptions are made about the end points of the interpolation. ## ## @seealso{interp1} ## @end deftypefn
--- a/scripts/general/interpn.m +++ b/scripts/general/interpn.m @@ -34,9 +34,9 @@ ## similar format to @var{x1}, etc, and they represent the points at which ## the array @var{vi} is interpolated. ## -## If @var{x1}, @dots{}, @var{xn} are ommitted, they are assumed to be +## If @var{x1}, @dots{}, @var{xn} are omitted, they are assumed to be ## @code{x1 = 1 : size (@var{v}, 1)}, etc. If @var{m} is specified, then -## the interpolation adds a point half way between each of the interplation +## the interpolation adds a point half way between each of the interpolation ## points. This process is performed @var{m} times. If only @var{v} is ## specified, then @var{m} is assumed to be @code{1}. ##
--- a/scripts/general/polyarea.m +++ b/scripts/general/polyarea.m @@ -23,8 +23,8 @@ ## ## Determines area of a polygon by triangle method. The variables ## @var{x} and @var{y} define the vertex pairs, and must therefore have -## the same shape. Then might be either vectors or arrays. If they are -## arrays then the columns of @var{x} and @var{y} are treated seperately +## the same shape. They can be either vectors or arrays. If they are +## arrays then the columns of @var{x} and @var{y} are treated separately ## and an area returned for each. ## ## If the optional @var{dim} argument is given, then @code{polyarea}
--- a/scripts/general/rat.m +++ b/scripts/general/rat.m @@ -29,7 +29,7 @@ ## rat(e) = 3 + 1/(-4 + 1/(2 + 1/(5 + 1/(-2 + 1/(-7))))) = 1457/536 ## @end example ## -## Called with two arguments returns the numerator and deniminator seperately +## Called with two arguments returns the numerator and denominator separately ## as two matrices. ## @end deftypefn ## @seealso{rats}
--- a/scripts/general/structfun.m +++ b/scripts/general/structfun.m @@ -24,7 +24,7 @@ ## @deftypefnx {Function File} {} structfun (@dots{}, 'UniformOutput', @var{val}) ## ## Evaluate the function named @var{name} on the fields of the structure -## @var{s}. The fields of @var{s} are passed the the function @var{func} +## @var{s}. The fields of @var{s} are passed to the function @var{func} ## individually. ## ## @code{structfun} accepts an arbitrary function @var{func} in the form of
--- a/scripts/general/trapz.m +++ b/scripts/general/trapz.m @@ -22,7 +22,7 @@ ## @deftypefnx {Function File} {@var{z} =} trapz (@var{x}, @var{y}) ## @deftypefnx {Function File} {@var{z} =} trapz (@dots{}, @var{dim}) ## -## Numerical intergration using trapezodial method. @code{trapz +## Numerical integration using trapezoidal method. @code{trapz ## (@var{y})} computes the integral of the @var{y} along the first ## non singleton dimension. If the argument @var{x} is omitted a ## equally spaced vector is assumed. @code{trapz (@var{x}, @var{y})}
--- a/scripts/geometry/tsearchn.m +++ b/scripts/geometry/tsearchn.m @@ -22,7 +22,7 @@ ## Searches for the enclosing Delaunay convex hull. For @code{@var{t} = ## delaunayn (@var{x})}, finds the index in @var{t} containing the ## points @var{xi}. For points outside the convex hull, @var{idx} is NaN. -## If requested @code{tsearchn} also returns the barycentric coorinates @var{p} +## If requested @code{tsearchn} also returns the barycentric coordinates @var{p} ## of the enclosing triangles. ## @seealso{delaunay, delaunayn} ## @end deftypefn
--- a/scripts/image/rgb2hsv.m +++ b/scripts/image/rgb2hsv.m @@ -25,7 +25,7 @@ ## ## In the HSV space each color is represented by their hue, saturation ## and value (brightness). Value gives the amount of light in the color. -## Hue describes the dominant wavelegth. +## Hue describes the dominant wavelength. ## Saturation is the amount of Hue mixed into the color. ## @seealso{hsv2rgb} ## @end deftypefn
--- a/scripts/linear-algebra/krylov.m +++ b/scripts/linear-algebra/krylov.m @@ -35,7 +35,7 @@ ## subspace (based on @var{eps1}). ## ## If @var{b} is a vector and @var{k} is greater than @var{m-1}, then -## @var{h} contains the Hessenberg decompostion of @var{a}. +## @var{h} contains the Hessenberg decomposition of @var{a}. ## ## The optional parameter @var{eps1} is the threshold for zero. The ## default value is 1e-12.
--- a/scripts/miscellaneous/ans.m +++ b/scripts/miscellaneous/ans.m @@ -1,6 +1,6 @@ ## -*- texinfo -*- ## @defvr {Automatic Variable} ans -## The the most recently computed result that was not +## The most recently computed result that was not ## explicitly assigned to a variable. For example, after the expression ## ## @example
--- a/scripts/miscellaneous/gzip.m +++ b/scripts/miscellaneous/gzip.m @@ -22,7 +22,7 @@ ## @deftypefnx {Function File} {@var{entries} =} gzip (@var{files}, @var{outdir}) ## Compress the list of files and/or directories specified in @var{files}. ## Each file is compressed separately and a new file with a '.gz' extension -## is create. The original file is not touch. If @var{rootdir} is defined +## is created. The original file is not touched. If @var{rootdir} is defined ## the compressed versions of the files are placed in this directory. ## @seealso{gunzip, zip, tar} ## @end deftypefn
--- a/scripts/optimization/glpk.m +++ b/scripts/optimization/glpk.m @@ -168,9 +168,9 @@ ## Scaling option: ## @table @asis ## @item 0 -## No scaling . +## No scaling. ## @item 1 -## Equilibration scaling . +## Equilibration scaling. ## @item 2 ## Geometric mean scaling, then equilibration scaling. ## @end table @@ -249,7 +249,7 @@ ## Interior point method. ## @end table ## @item save (default: 0) -## If this parameter is nonzero, save a copy of the problem problem in +## If this parameter is nonzero, save a copy of the problem in ## CPLEX LP format to the file @file{"outpb.lp"}. There is currently no ## way to change the name of the output file. ## @end table
--- a/scripts/optimization/sqp.m +++ b/scripts/optimization/sqp.m @@ -56,7 +56,7 @@ ## ## The first argument is the initial guess for the vector @var{x}. ## -## The second argument is a function handle pointing to the ojective +## The second argument is a function handle pointing to the objective ## function. The objective function must be of the form ## ## @example @@ -708,4 +708,4 @@ res = [feval(cigradfcn,x); eye(numel(x)); -eye(numel(x))]; endif -### endfunction \ No newline at end of file +### endfunction
--- a/scripts/plot/findobj.m +++ b/scripts/plot/findobj.m @@ -23,7 +23,7 @@ ## @deftypefnx {Function File} {@var{h} =} findobj ('flat', @dots{}) ## @deftypefnx {Function File} {@var{h} =} findobj (@var{h}, @dots{}) ## @deftypefnx {Function File} {@var{h} =} findobj (@var{h}, '-depth', @var{d}, @dots{}) -## Find object with specified property values. The simpliest form is +## Find object with specified property values. The simplest form is ## ## @example ## findobj (@var{propName}, @var{propValue})
--- a/scripts/plot/legend.m +++ b/scripts/plot/legend.m @@ -58,7 +58,7 @@ ## can be appended to any location string ## @end multitable ## -## Some specific functions are directely avaliable using @var{func}: +## Some specific functions are directly available using @var{func}: ## ## @table @code ## @item "show"
--- a/scripts/plot/peaks.m +++ b/scripts/plot/peaks.m @@ -41,7 +41,7 @@ ## ## Called without a return argument, @code{peaks} plots the surface of the ## above function using @code{mesh}. If @var{n} is a scalar, the @code{peaks} -## returns the values of the above funxtion on a @var{n}-by-@var{n} mesh over +## returns the values of the above function on a @var{n}-by-@var{n} mesh over ## the range @code{[-3,3]}. The default value for @var{n} is 49. ## ## If @var{n} is a vector, then it represents the @var{x} and @var{y} values
--- a/scripts/plot/plot3.m +++ b/scripts/plot/plot3.m @@ -31,7 +31,7 @@ ## be plotted in three dimensions. If all arguments are vectors of the ## same length, then a single continuous line is drawn. If all arguments ## are matrices, then each column of the matrices is treated as a -## seperate line. No attempt is made to transpose the arguments to make +## separate line. No attempt is made to transpose the arguments to make ## the number of rows match. ## ## If only two arguments are given, as @@ -61,7 +61,7 @@ ## @end example ## ## @noindent -## in which each set of three arguments is treated as a seperate line or +## in which each set of three arguments is treated as a separate line or ## set of lines in three dimensions. ## ## To plot multiple one- or two-argument groups, separate each group
--- a/scripts/plot/stem.m +++ b/scripts/plot/stem.m @@ -48,7 +48,7 @@ ## @noindent ## plots 10 bars with heights from 2 to 20 ## (the color is blue, and @var{h} is a 2-by-10 array of handles in -## which the first row holds the line handles and the +## which the first row holds the line handles and ## the second row holds the marker handles); ## ## @example @@ -60,7 +60,7 @@ ## plots 10 stems with heights from 2 to 20 ## (the color is black, line style is @code{"-."}, and @var{h} is a 2-by-10 ## array of handles in which the first row holds the line handles and -## the second rows holds the marker handles); +## the second row holds the marker handles); ## ## @example ## x = 1:10;
--- a/scripts/polynomial/deconv.m +++ b/scripts/polynomial/deconv.m @@ -26,7 +26,7 @@ ## ## If @var{y} and @var{a} are polynomial coefficient vectors, @var{b} will ## contain the coefficients of the polynomial quotient and @var{r} will be -## a remander polynomial of lowest order. +## a remainder polynomial of lowest order. ## @seealso{conv, poly, roots, residue, polyval, polyderiv, polyinteg} ## @end deftypefn
--- a/scripts/polynomial/pchip.m +++ b/scripts/polynomial/pchip.m @@ -39,7 +39,7 @@ ## @ifinfo ## @code{[@var{s1}, @var{s2}, @dots{}, @var{sk}, @var{n}]} ## @end ifinfo -## The array is then reshaped internally to a matrix where to leading +## The array is then reshaped internally to a matrix where the leading ## dimension is given by ## @iftex ## @tex @@ -49,9 +49,9 @@ ## @ifinfo ## @code{@var{s1} * @var{s2} * @dots{} * @var{sk}} ## @end ifinfo -## and each row this matrix is then treated seperately. Note that this +## and each row in this matrix is then treated separately. Note that this ## is exactly the opposite treatment than @code{interp1} and is done -## for compatiability. +## for compatibility. ## ## Called with a third input argument, @code{pchip} evaluates the ## piece-wise polynomial at the points @var{xi}. There is an equivalence
--- a/scripts/polynomial/spline.m +++ b/scripts/polynomial/spline.m @@ -63,9 +63,9 @@ ## @ifinfo ## @code{@var{s1} * @var{s2} * @dots{} * @var{sk}} ## @end ifinfo -## and each row this matrix is then treated seperately. Note that this +## and each row this matrix is then treated separately. Note that this ## is exactly the opposite treatment than @code{interp1} and is done -## for compatiability. +## for compatibility. ## ## Called with a third input argument, @code{spline} evaluates the ## piece-wise spline at the points @var{xi}. There is an equivalence
--- a/scripts/polynomial/unmkpp.m +++ b/scripts/polynomial/unmkpp.m @@ -30,7 +30,7 @@ ## Polynomial coefficients for points in sample interval. @code{@var{p} ## (@var{i}, :)} contains the coefficients for the polynomial over ## interval @var{i} ordered from highest to lowest. If @code{@var{d} > -## 1}, @code{@var{p} (@var{r}, @var{i}, :)} contains the coeffients for +## 1}, @code{@var{p} (@var{r}, @var{i}, :)} contains the coefficients for ## the r-th polynomial defined on interval @var{i}. However, this is ## stored as a 2-D array such that @code{@var{c} = reshape (@var{p} (:, ## @var{j}), @var{n}, @var{d})} gives @code{@var{c} (@var{i}, @var{r})}
--- a/scripts/sparse/pcr.m +++ b/scripts/sparse/pcr.m @@ -92,7 +92,7 @@ ## @item ## @var{resvec} describes the convergence history of the method, ## so that @code{@var{resvec} (i)} contains the Euclidean norms of the -## residualafter the (@var{i}-1)-th iteration, @code{@var{i} = +## residual after the (@var{i}-1)-th iteration, @code{@var{i} = ## 1,2, @dots{}, @var{iter}+1}. ## @end itemize ## @@ -291,7 +291,7 @@ if (breakdown) flag = 3; if (nargout < 2) - warning ("pcr: breakdown occured:\n"); + warning ("pcr: breakdown occurred:\n"); warning ("system matrix singular or preconditioner indefinite?\n"); endif endif
--- a/scripts/sparse/spalloc.m +++ b/scripts/sparse/spalloc.m @@ -20,7 +20,7 @@ ## Returns an empty sparse matrix of size @var{r}-by-@var{c}. As Octave ## resizes sparse matrices at the first opportunity, so that no additional ## space is needed, the argument @var{nz} is ignored. This function is -## provided only for compatiability reasons. +## provided only for compatibility reasons. ## ## It should be noted that this means that code like ##
--- a/scripts/sparse/spconvert.m +++ b/scripts/sparse/spconvert.m @@ -21,7 +21,7 @@ ## produced by other programs into Octave's internal sparse format. The ## input @var{x} is either a 3 or 4 column real matrix, containing ## the row, column, real and imaginary parts of the elements of the -## sparse matrix. An element with a zero real and imaginay part can +## sparse matrix. An element with a zero real and imaginary part can ## be used to force a particular matrix size. ## @end deftypefn
--- a/scripts/specfun/factor.m +++ b/scripts/specfun/factor.m @@ -24,8 +24,8 @@ ## Return prime factorization of @var{q}. That is @code{prod (@var{p}) ## == @var{q}}. If @code{@var{q} == 1}, returns 1. ## -## With two output arguments, returns the uniques primes @var{p} and -## their mulyiplicities. That is @code{prod (@var{p} .^ @var{n}) == +## With two output arguments, returns the unique primes @var{p} and +## their multiplicities. That is @code{prod (@var{p} .^ @var{n}) == ## @var{q}}. ## ## @end deftypefn
--- a/scripts/specfun/legendre.m +++ b/scripts/specfun/legendre.m @@ -35,7 +35,7 @@ ## @end group ## ## with: -## Legendre Polynom of degree n +## Legendre polynomial of degree n ## ## @group ## 1 d^n 2 n
--- a/scripts/statistics/base/mean.m +++ b/scripts/statistics/base/mean.m @@ -42,7 +42,7 @@ ## Compute the (ordinary) arithmetic mean. This is the default. ## ## @item "g" -## Computer the geometric mean. +## Compute the geometric mean. ## ## @item "h" ## Compute the harmonic mean.
--- a/scripts/statistics/base/meansq.m +++ b/scripts/statistics/base/meansq.m @@ -21,7 +21,7 @@ ## @deftypefn {Function File} {} meansq (@var{x}) ## @deftypefnx {Function File} {} meansq (@var{x}, @var{dim}) ## For vector arguments, return the mean square of the values. -## For matrix arguments, return a row vector contaning the mean square +## For matrix arguments, return a row vector containing the mean square ## of each column. With the optional @var{dim} argument, returns the ## mean squared of the values along this dimension. ## @end deftypefn
--- a/scripts/statistics/base/var.m +++ b/scripts/statistics/base/var.m @@ -20,7 +20,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {} var (@var{x}) ## For vector arguments, return the (real) variance of the values. -## For matrix arguments, return a row vector contaning the variance for +## For matrix arguments, return a row vector containing the variance for ## each column. ## ## The argument @var{opt} determines the type of normalization to use.
--- a/scripts/statistics/tests/chisquare_test_independence.m +++ b/scripts/statistics/tests/chisquare_test_independence.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {[@var{pval}, @var{chisq}, @var{df}] =} chisquare_test_independence (@var{x}) -## Perform a chi-square test for indepence based on the contingency +## Perform a chi-square test for independence based on the contingency ## table @var{x}. Under the null hypothesis of independence, ## @var{chisq} approximately has a chi-square distribution with ## @var{df} degrees of freedom. @@ -51,4 +51,4 @@ printf(" pval: %g\n", pval); endif -endfunction \ No newline at end of file +endfunction
--- a/scripts/statistics/tests/t_test.m +++ b/scripts/statistics/tests/t_test.m @@ -31,7 +31,7 @@ ## @code{mean (@var{x}) != @var{m}}. If @var{alt} is @code{">"}, the ## one-sided alternative @code{mean (@var{x}) > @var{m}} is considered. ## Similarly for @var{"<"}, the one-sided alternative @code{mean -## (@var{x}) < @var{m}} is considered, The default is the two-sided +## (@var{x}) < @var{m}} is considered. The default is the two-sided ## case. ## ## The p-value of the test is returned in @var{pval}.
--- a/scripts/statistics/tests/u_test.m +++ b/scripts/statistics/tests/u_test.m @@ -31,7 +31,7 @@ ## PROB (@var{x} > @var{y}) != 1/2. If @var{alt} is @code{">"}, the ## one-sided alternative PROB (@var{x} > @var{y}) > 1/2 is considered. ## Similarly for @code{"<"}, the one-sided alternative PROB (@var{x} > -## @var{y}) < 1/2 is considered, The default is the two-sided case. +## @var{y}) < 1/2 is considered. The default is the two-sided case. ## ## The p-value of the test is returned in @var{pval}. ##
--- a/scripts/strings/dec2base.m +++ b/scripts/strings/dec2base.m @@ -19,7 +19,7 @@ ## -*- texinfo -*- ## @deftypefn {Function File} {} dec2base (@var{n}, @var{b}, @var{len}) -## Return a string of symbols in base @var{b} corresponding to the +## Return a string of symbols in base @var{b} corresponding to ## the nonnegative integer @var{n}. ## ## @example
--- a/scripts/strings/mat2str.m +++ b/scripts/strings/mat2str.m @@ -21,7 +21,7 @@ ## @deftypefn {Function File} {@var{s} =} mat2str (@var{x}, @var{n}) ## @deftypefnx {Function File} {@var{s} =} mat2str (@dots{}, 'class') ## -## Format real/complex numerial matrices as strings. This function +## Format real/complex numerical matrices as strings. This function ## returns values that are suitable for the use of the @code{eval} ## function. ##
--- a/scripts/testfun/speed.m +++ b/scripts/testfun/speed.m @@ -52,7 +52,7 @@ ## expression @var{f} should produce a value @var{v} and expression @var{f2} ## should produce a value @var{v2}, and these shall be compared using ## @code{assert(@var{v},@var{v2},@var{tol})}. If @var{tol} is positive, -## the tolerance is assumed to be absolutr. If @var{tol} is negative, +## the tolerance is assumed to be absolute. If @var{tol} is negative, ## the tolerance is assumed to be relative. The default is @code{eps}. ## ## @item @var{order} @@ -60,7 +60,7 @@ ## is a structure with fields @code{a} and @code{p}. ## ## @item @var{n} -## The values @var{n} for which the expression was calculated and the +## The values @var{n} for which the expression was calculated and ## the execution time was greater than zero. ## ## @item @var{T_f} @@ -128,7 +128,7 @@ ## "v2=xcorr_orig(x,n)", -100*eps) ## @end example ## -## Assuming one of the two versions is in @var{xcorr_orig}, this would +## Assuming one of the two versions is in @var{xcorr_orig}, this ## would compare their speed and their output values. Note that the ## FFT version is not exact, so we specify an acceptable tolerance on ## the comparison @code{100*eps}, and the errors should be computed
--- a/scripts/testfun/test.m +++ b/scripts/testfun/test.m @@ -54,12 +54,12 @@ ## ## Called with a single output argument @var{success}, @code{test} returns ## true if all of the tests were successful. Called with two output arguments -## @var{n} and @var{max}, the number of sucessful test and the total number +## @var{n} and @var{max}, the number of successful tests and the total number ## of tests in the file @var{name} are returned. ## ## If the second argument is the string 'grabdemo', the contents of the demo ## blocks are extracted but not executed. Code for all code blocks is -## concatented and returned as @var{code} with @var{idx} being a vector of +## concatenated and returned as @var{code} with @var{idx} being a vector of ## positions of the ends of the demo blocks. ## ## If the second argument is 'explain', then @var{name} is ignored and an
--- a/src/ChangeLog +++ b/src/ChangeLog @@ -1,3 +1,16 @@ +2007-10-10 Olli Saarela <Olli.Saarela@kcl.fi> + + * data.cc, debug.cc, dirfns.cc, error.cc, file-io.cc, help.cc, + load-save.cc, ov-fcn-inline.cc, parse.y, pr-output.cc, symtab.cc, + syscalls.cc, toplev.cc, variables.cc, DLD-FUNCTIONS/bsxfun.cc, + DLD-FUNCTIONS/cellfun.cc, DLD-FUNCTIONS/fft.cc, + DLD-FUNCTIONS/fft2.cc, DLD-FUNCTIONS/fftw.cc, + DLD-FUNCTIONS/gcd.cc, DLD-FUNCTIONS/lsode.cc, + DLD-FUNCTIONS/luinc.cc, DLD-FUNCTIONS/matrix_type.cc, + DLD-FUNCTIONS/rand.cc, DLD-FUNCTIONS/regexp.cc, + DLD-FUNCTIONS/sparse.cc, DLD-FUNCTIONS/spchol.cc, + DLD-FUNCTIONS/splu.cc, DLD-FUNCTIONS/spparms.cc: Spelling fixes. + 2007-10-10 Kim Hansen <kimhanse@gmail.com> * DLD-FUNCTIONS/lpsolve.cc: Delete.
--- a/src/DLD-FUNCTIONS/bsxfun.cc +++ b/src/DLD-FUNCTIONS/bsxfun.cc @@ -129,14 +129,14 @@ DEFUN_DLD (bsxfun, args, , " -*- texinfo -*-\n\ -@deftypefn {Lodable Function} {} bsxfun (@var{f}, @var{a}, @var{b})\n\ +@deftypefn {Loadable Function} {} bsxfun (@var{f}, @var{a}, @var{b})\n\ Applies a binary function @var{f} element-wise to two matrix arguments\n\ @var{a} and @var{b}. The function @var{f} must be capable of accepting\n\ two column vector arguments of equal length, or one column vector\n\ argument and a scalar.\n\ \n\ The dimensions of @var{a} and @var{b} must be equal or singleton. The\n\ -singleton dimensions of the matirces will be expanded to the same\n\ +singleton dimensions of the matrices will be expanded to the same\n\ dimensionality as the other matrix.\n\ \n\ @seealso{arrayfun, cellfun}\n\
--- a/src/DLD-FUNCTIONS/cellfun.cc +++ b/src/DLD-FUNCTIONS/cellfun.cc @@ -219,7 +219,7 @@ int d = args(2).nint_value () - 1; if (d < 0) - error ("cellfun: third argument must be a postive integer"); + error ("cellfun: third argument must be a positive integer"); if (! error_state) {
--- a/src/DLD-FUNCTIONS/fft.cc +++ b/src/DLD-FUNCTIONS/fft.cc @@ -204,7 +204,7 @@ smaller than the dimension along which the inverse FFT is calculated,\n\ then @var{a} is truncated.\n\ \n\ -If called with three agruments, @var{dim} is an integer specifying the\n\ +If called with three arguments, @var{dim} is an integer specifying the\n\ dimension of the matrix along which the inverse FFT is performed\n\ @seealso{fft, ifft2, ifftn, fftw}\n\ @end deftypefn")
--- a/src/DLD-FUNCTIONS/fft2.cc +++ b/src/DLD-FUNCTIONS/fft2.cc @@ -148,7 +148,7 @@ zeros.\n\ \n\ If @var{a} is a multi-dimensional matrix, each two-dimensional sub-matrix\n\ -of @var{a} is treated seperately\n\ +of @var{a} is treated separately\n\ @seealso {ifft2, fft, fftn, fftw}\n\ @end deftypefn") { @@ -167,7 +167,7 @@ zeros.\n\ \n\ If @var{a} is a multi-dimensional matrix, each two-dimensional sub-matrix\n\ -of @var{a} is treated seperately\n\ +of @var{a} is treated separately\n\ @seealso {fft2, ifft, ifftn, fftw}\n\ @end deftypefn") {
--- a/src/DLD-FUNCTIONS/fftw.cc +++ b/src/DLD-FUNCTIONS/fftw.cc @@ -42,7 +42,7 @@ @deftypefnx {Loadable Function} {@var{wisdom} =} fftw ('dwisdom', @var{wisdom})\n\ \n\ Manage FFTW wisdom data. Wisdom data can be used to significantly\n\ -accelerate the calculation of the FFTs but implies a initial cost\n\ +accelerate the calculation of the FFTs but implies an initial cost\n\ in its calculation. The wisdom used by Octave can be imported directly,\n\ usually from a file /etc/fftw/wisdom, or @dfn{fftw} can be used\n\ to import wisdom. For example\n\ @@ -81,13 +81,13 @@ @item 'patient'\n\ This is like 'measure', but a wider range of algorithms is considered.\n\ \n\ -@item 'exhasutive'\n\ -This is like 'meaure', but all possible algorithms that may be used to\n\ +@item 'exhaustive'\n\ +This is like 'measure', but all possible algorithms that may be used to\n\ treat the transform are considered.\n\ \n\ @item 'hybrid'\n\ As run-time measurement of the algorithm can be expensive, this is a\n\ -compromise where 'measure' is used for transforms upto the size of 8192\n\ +compromise where 'measure' is used for transforms up to the size of 8192\n\ and beyond that the 'estimate' method is used.\n\ @end table\n\ \n\
--- a/src/DLD-FUNCTIONS/gcd.cc +++ b/src/DLD-FUNCTIONS/gcd.cc @@ -81,8 +81,8 @@ @end tex\n\ @end iftex\n\ \n\ -For backward compatiability with previous versions of this function, when\n\ -all arguments are scalr, a single return argument @var{v1} containing\n\ +For backward compatibility with previous versions of this function, when\n\ +all arguments are scalar, a single return argument @var{v1} containing\n\ all of the values of @var{v1}, @dots{} is acceptable.\n\ @seealso{lcm, min, max, ceil, floor}\n\ @end deftypefn")
--- a/src/DLD-FUNCTIONS/lsode.cc +++ b/src/DLD-FUNCTIONS/lsode.cc @@ -252,7 +252,7 @@ \n\ @end ifinfo\n\ \n\ -The second and third arguments specify the intial state of the system,\n\ +The second and third arguments specify the initial state of the system,\n\ @math{x_0}, and the initial value of the independent variable @math{t_0}.\n\ \n\ The fourth argument is optional, and may be used to specify a set of\n\
--- a/src/DLD-FUNCTIONS/luinc.cc +++ b/src/DLD-FUNCTIONS/luinc.cc @@ -54,7 +54,7 @@ Alternatively, the fill-in of the incomplete LU factorization can\n\ be controlled through the variable @var{droptol} or the structure\n\ @var{opts}. The UMFPACK multifrontal factorization code by Tim A.\n\ -Davis is used for the incomplete LU factorication, (availability\n\ +Davis is used for the incomplete LU factorization, (availability\n\ @url{http://www.cise.ufl.edu/research/sparse/umfpack/})\n\ \n\ @var{droptol} determines the values below which the values in the LU\n\ @@ -74,7 +74,7 @@ @item milu\n\ A logical variable flagging whether to use the modified incomplete LU\n\ factorization. In the case that @code{milu} is true, the dropped values\n\ -are subtract from the diagonal of the matrix U of the factorization.\n\ +are subtracted from the diagonal of the matrix U of the factorization.\n\ The default is @code{false}.\n\ \n\ @item udiag\n\
--- a/src/DLD-FUNCTIONS/matrix_type.cc +++ b/src/DLD-FUNCTIONS/matrix_type.cc @@ -96,7 +96,7 @@ solve a linear equation involving @var{a}. Therefore @code{matrix_type} is only\n\ useful to give Octave hints of the matrix type. Incorrectly defining the\n\ matrix type will result in incorrect results from solutions of linear equations,\n\ -and so it is entirely the responsibility of the user to correctly indentify the\n\ +and so it is entirely the responsibility of the user to correctly identify the\n\ matrix type.\n\ @end deftypefn") {
--- a/src/DLD-FUNCTIONS/rand.cc +++ b/src/DLD-FUNCTIONS/rand.cc @@ -344,7 +344,7 @@ @code{rand} uses the Mersenne Twister with a period of 2^19937-1\n\ (See M. Matsumoto and T. Nishimura, ``Mersenne Twister: A 623-dimensionally\n\ equidistributed uniform pseudorandom number generator'', ACM Trans. on\n\ -Modeling and Computer Simulation Vol. 8, No. 1, Januray pp.3-30 1998,\n\ +Modeling and Computer Simulation Vol. 8, No. 1, January pp.3-30 1998,\n\ @url{http://www.math.keio.ac.jp/~matumoto/emt.html}).\n\ Do @strong{not} use for cryptography without securely hashing\n\ several returned values together, otherwise the generator state\n\
--- a/src/DLD-FUNCTIONS/regexp.cc +++ b/src/DLD-FUNCTIONS/regexp.cc @@ -748,7 +748,7 @@ Grouping operator\n\ @item |\n\ Alternation operator. Match one of a choice of regular expressions. The\n\ -alternatives must be delimited by the grouoing operator @code{()} above\n\ +alternatives must be delimited by the grouping operator @code{()} above\n\ @item ^ $\n\ Anchoring operator. @code{^} matches the start of the string @var{str} and\n\ @code{$} the end\n\ @@ -1407,7 +1407,7 @@ @table @samp\n\ \n\ @item once\n\ -Replace only the first occurance of @var{pat} in the result.\n\ +Replace only the first occurrence of @var{pat} in the result.\n\ \n\ @item warnings\n\ This option is present for compatibility but is ignored.\n\
--- a/src/DLD-FUNCTIONS/sparse.cc +++ b/src/DLD-FUNCTIONS/sparse.cc @@ -73,7 +73,7 @@ Create a sparse matrix given integer index vectors @var{i} and @var{j},\n\ a 1-by-@code{nnz} vector of real of complex values @var{sv}, overall\n\ dimensions @var{m} and @var{n} of the sparse matrix. The argument\n\ -@code{nzmax} is ignored but accepted for compatability with @sc{Matlab}.\n\ +@code{nzmax} is ignored but accepted for compatibility with @sc{Matlab}.\n\ \n\ @strong{Note}: if multiple values are specified with the same\n\ @var{i}, @var{j} indices, the corresponding values in @var{s} will\n\
--- a/src/DLD-FUNCTIONS/spchol.cc +++ b/src/DLD-FUNCTIONS/spchol.cc @@ -157,7 +157,7 @@ @end example\n\ @end ifinfo\n\ \n\ -Note that @code{splchol} factorizations is faster and use less memory.\n\ +Note that @code{splchol} factorization is faster and uses less memory.\n\ @seealso{spcholinv, spchol2inv, splchol}\n\ @end deftypefn") { @@ -205,7 +205,7 @@ @end example\n\ @end ifinfo\n\ \n\ -Note that @code{splchol} factorizations is faster and use less memory\n\ +Note that @code{splchol} factorization is faster and uses less memory\n\ than @code{spchol}. @code{splchol(@var{a})} is equivalent to\n\ @code{spchol(@var{a})'}.\n\ @seealso{spcholinv, spchol2inv, splchol}\n\ @@ -359,7 +359,7 @@ \n\ @item @var{mode}\n\ The default is to return the Cholesky factorization for @var{r}, and if\n\ -@var{mode} is 'L', the conjugate transpose of the Choleksy factorization\n\ +@var{mode} is 'L', the conjugate transpose of the Cholesky factorization\n\ is returned. The conjugate transpose version is faster and uses less\n\ memory, but returns the same values for @var{count}, @var{h}, @var{parent}\n\ and @var{post} outputs.\n\
--- a/src/DLD-FUNCTIONS/splu.cc +++ b/src/DLD-FUNCTIONS/splu.cc @@ -60,7 +60,7 @@ An additional input argument @var{thres}, that defines the pivoting\n\ threshold can be given. Alternatively, the desired sparsity preserving\n\ column permutations @var{Q} can be passed. Note that @var{Q} is assumed\n\ -to be fixed if three are fewer than four output arguments. Otherwise,\n\ +to be fixed if there are fewer than four output arguments. Otherwise,\n\ the updated column permutations are returned as the fourth argument.\n\ \n\ With two output arguments, returns the permuted forms of the upper and\n\
--- a/src/DLD-FUNCTIONS/spparms.cc +++ b/src/DLD-FUNCTIONS/spparms.cc @@ -52,17 +52,17 @@ @item spumoni\n\ Printing level of debugging information of the solvers (default 0)\n\ @item ths_rel\n\ -Included for compatiability. Bot used. (default 1)\n\ +Included for compatibility. Not used. (default 1)\n\ @item ths_abs\n\ -Included for compatiability. Bot used. (default 1)\n\ +Included for compatibility. Not used. (default 1)\n\ @item exact_d\n\ -Included for compatiability. Bot used. (default 0)\n\ +Included for compatibility. Not used. (default 0)\n\ @item supernd\n\ -Included for compatiability. Not used. (default 3)\n\ +Included for compatibility. Not used. (default 3)\n\ @item rreduce\n\ -Included for compatiability. Not used. (default 3)\n\ +Included for compatibility. Not used. (default 3)\n\ @item wh_frac\n\ -Inluded for compatiability. Not used. (default 0.5)\n\ +Included for compatibility. Not used. (default 0.5)\n\ @item autommd\n\ Flag whether the LU/QR and the '\\' and '/' operators will automatically\n\ use the sparsity preserving mmd functions (default 1)\n\ @@ -81,7 +81,7 @@ The value of individual keys can be set with @code{spparms (@var{key},\n\ @var{val})}. The default values can be restored with the special keyword\n\ 'defaults'. The special keyword 'tight' can be used to set the mmd solvers\n\ -to attempt for a sparser solution at the potetial cost of longer running\n\ +to attempt for a sparser solution at the potential cost of longer running\n\ time.\n\ @end deftypefn") {
--- a/src/data.cc +++ b/src/data.cc @@ -1148,7 +1148,7 @@ "-*- texinfo -*-\n\ @deftypefn {Built-in Function} {@var{scalar} =} nzmax (@var{SM})\n\ Return the amount of storage allocated to the sparse matrix @var{SM}.\n\ -Note that Octave tends to crop unused memory at the first oppurtunity\n\ +Note that Octave tends to crop unused memory at the first opportunity\n\ for sparse objects. There are some cases of user created sparse objects\n\ where the value returned by @dfn{nzmaz} will not be the same as @dfn{nnz},\n\ but in general they will give the same result.\n\ @@ -2057,7 +2057,7 @@ @ifinfo\n\ @code{sqrt (-1)}.\n\ @end ifinfo\n\ -Since I (also i, J, and J) is a function, you can use the name(s) for\n\ +Since I (also i, J, and j) is a function, you can use the name(s) for\n\ other purposes.\n\ @end deftypefn") {
--- a/src/debug.cc +++ b/src/debug.cc @@ -95,7 +95,7 @@ mode this should be left out and only the line should be given.\n\ @item line\n\ Line you would like the breakpoint to be set on. Multiple\n\ -lines might be given as seperate arguments or as a vector.\n\ +lines might be given as separate arguments or as a vector.\n\ @end table\n\ \n\ The rline returned is the real line that the breakpoint was set at.\n\ @@ -190,7 +190,7 @@ mode this should be left out and only the line should be given.\n\ @item line\n\ Line where you would like to remove the breakpoint. Multiple\n\ -lines might be given as seperate arguments or as a vector.\n\ +lines might be given as separate arguments or as a vector.\n\ @end table\n\ No checking is done to make sure that the line you requested is really\n\ a breakpoint. If you get the wrong line nothing will happen.\n\
--- a/src/dirfns.cc +++ b/src/dirfns.cc @@ -101,7 +101,7 @@ @deffn {Command} cd dir\n\ @deffnx {Command} chdir dir\n\ Change the current working directory to @var{dir}. If @var{dir} is\n\ -omitted, the current directory is changed to the users home\n\ +omitted, the current directory is changed to the user's home\n\ directory. For example,\n\ \n\ @example\n\
--- a/src/error.cc +++ b/src/error.cc @@ -1358,7 +1358,7 @@ @item 'identifier'\n\ The message identifier of this error message\n\ @item 'stack'\n\ -A structure containing information on where the message occured. This might\n\ +A structure containing information on where the message occurred. This might\n\ be an empty structure if this in the case where this information can not\n\ be obtained. The fields of this structure are:\n\ \n\ @@ -1366,9 +1366,9 @@ @item 'file'\n\ The name of the file where the error occurred\n\ @item 'name'\n\ -The name of function in which the error occured\n\ +The name of function in which the error occurred\n\ @item 'line'\n\ -The line number at which the error occured\n\ +The line number at which the error occurred\n\ @item 'column'\n\ An optional field with the column number at which the error occurred\n\ @end table\n\
--- a/src/file-io.cc +++ b/src/file-io.cc @@ -539,7 +539,7 @@ Open a file for reading.\n\ \n\ @item @samp{w}\n\ -Open a file for writing. The previous contents are discared.\n\ +Open a file for writing. The previous contents are discarded.\n\ \n\ @item @samp{a}\n\ Open or create a file for writing at the end of the file.\n\ @@ -1874,7 +1874,7 @@ the function @code{purge_tmp_files} is called.\n\ \n\ If successful, @var{fid} is a valid file ID, @var{name} is the name of\n\ -the file, and and @var{msg} is an empty string. Otherwise, @var{fid}\n\ +the file, and @var{msg} is an empty string. Otherwise, @var{fid}\n\ is -1, @var{name} is empty, and @var{msg} contains a system-dependent\n\ error message.\n\ @seealso{tmpfile, tmpnam, P_tmpdir}\n\
--- a/src/help.cc +++ b/src/help.cc @@ -1744,9 +1744,9 @@ @deffnx {Function} {[@var{fun}, @var{helpstring}] = } lookfor (@var{str})\n\ @deffnx {Function} {[@var{fun}, @var{helpstring}] = } lookfor ('-all', @var{str})\n\ Search for the string @var{str} in all of the functions found in the\n\ -function search path. By default @code{lookfor} searchs for @var{str}\n\ +function search path. By default @code{lookfor} searches for @var{str}\n\ in the first sentence of the help string of each function found. The entire\n\ -help string of each function found in the path can be search if\n\ +help string of each function found in the path can be searched if\n\ the '-all' argument is supplied. All searches are case insensitive.\n\ \n\ Called with no output arguments, @code{lookfor} prints the list of matching\n\ @@ -2161,7 +2161,7 @@ "-*- texinfo -*-\n\ @deftypefn {Built-in Function} {@var{val} =} suppress_verbose_help_message ()\n\ @deftypefnx {Built-in Function} {@var{old_val} =} suppress_verbose_help_message (@var{new_val})\n\ -Query or set the internal vaiable that controls whether Octave\n\ +Query or set the internal variable that controls whether Octave\n\ will add additional help information to the end of the output from\n\ the @code{help} command and usage messages for built-in commands.\n\ @end deftypefn")
--- a/src/load-save.cc +++ b/src/load-save.cc @@ -1802,7 +1802,7 @@ of memory (in kilobytes) of the top-level workspace that Octave will\n\ attempt to save when writing data to the crash dump file (the name of\n\ the file is specified by @var{octave_core_file_name}). If\n\ -@var{octave_core_file_options} flags specifies a binary format,\n\ +@var{octave_core_file_options} flags specify a binary format,\n\ then @var{octave_core_file_limit} will be approximately the maximum\n\ size of the file. If a text file format is used, then the file could\n\ be much larger than the limit. The default value is -1 (unlimited)\n\
--- a/src/ov-fcn-inline.cc +++ b/src/ov-fcn-inline.cc @@ -589,7 +589,7 @@ function arguments will then be in alphabetical order. It should\n\ be noted that i, and j are ignored as arguments due to the\n\ ambiguity between their use as a variable or their use as an inbuilt\n\ -constant. All arguments followed by a parentheses are considered\n\ +constant. All arguments followed by a parenthesis are considered\n\ to be functions.\n\ \n\ If the second and subsequent arguments are character strings,\n\
--- a/src/parse.y +++ b/src/parse.y @@ -3981,8 +3981,8 @@ \n\ @example\n\ eval ('error (\"This is a bad example\");',\n\ - 'printf (\"This error occured:\\n%s\", lasterr ());');\n\ - @print{} This error occured:\n\ + 'printf (\"This error occurred:\\n%s\", lasterr ());');\n\ + @print{} This error occurred:\n\ error: This is a bad example\n\ @end example\n\ @end deftypefn")
--- a/src/pr-output.cc +++ b/src/pr-output.cc @@ -3118,7 +3118,7 @@ @code{3.14159265358979E+00}.\n\ @item long g\n\ @itemx short g\n\ -Choose between normal @samp{long} (or @samp{short}) and and\n\ +Choose between normal @samp{long} (or @samp{short}) and\n\ @samp{long e} (or @samp{short e}) formats based on the magnitude\n\ of the number. For example, with the @samp{short g} format,\n\ @code{pi .^ [2; 4; 8; 16; 32]} is displayed as\n\ @@ -3288,7 +3288,7 @@ "-*- texinfo -*-\n\ @deftypefn {Built-in Function} {@var{val} =} print_empty_dimensions ()\n\ @deftypefnx {Built-in Function} {@var{old_val} =} print_empty_dimensions (@var{new_val})\n\ -Query or set the internal varaible that controls whether the\n\ +Query or set the internal variable that controls whether the\n\ dimensions of empty matrices are printed along with the empty matrix\n\ symbol, @samp{[]}. For example, the expression\n\ \n\
--- a/src/symtab.cc +++ b/src/symtab.cc @@ -1949,7 +1949,7 @@ @item %n\n\ Prints variable names.\n\ @item %p\n\ -Prints protection attributtes of variables.\n\ +Prints protection attributes of variables.\n\ @item %s\n\ Prints dimensions of variables.\n\ @item %t\n\
--- a/src/syscalls.cc +++ b/src/syscalls.cc @@ -689,7 +689,7 @@ If @var{sig} is 0, then no signal is sent, but error checking is still\n\ performed.\n\ \n\ -Return 0 if sucessful, otherwise return -1.\n\ +Return 0 if successful, otherwise return -1.\n\ @end deftypefn") { octave_value_list retval; @@ -932,7 +932,7 @@ corresponding system error message.\n\ \n\ If @var{file} is a symbolic link, @code{stat} will return information\n\ -about the actual file the is referenced by the link. Use @code{lstat}\n\ +about the actual file that is referenced by the link. Use @code{lstat}\n\ if you want information about the symbolic link itself.\n\ \n\ For example,\n\ @@ -1292,7 +1292,7 @@ If the returned value of @var{pid} is greater than 0, it is the process\n\ ID of the child process that exited. If an error occurs, @var{pid} will\n\ be less than zero and @var{msg} will contain a system-dependent error\n\ -message. The value of @var{status} contains additional system-depenent\n\ +message. The value of @var{status} contains additional system-dependent\n\ information about the subprocess that exited.\n\ @seealso{WNOHANG, WUNTRACED, WCONTINUED, WEXITSTATUS, WIFSIGNALED, WTERMSIG, WCOREDUMP, WIFSTOPPED, WSTOPSIG, WIFCONTINUED}\n\ @end deftypefn")
--- a/src/toplev.cc +++ b/src/toplev.cc @@ -690,7 +690,7 @@ will remove the function from the list and Octave will not call\n\ the function @code{bye_by} when it exits.\n\ \n\ -Note that @code{atexit} only removes the first occurence of a function\n\ +Note that @code{atexit} only removes the first occurrence of a function\n\ from the list, so if a function was placed in the list multiple\n\ times with @code{atexit}, it must also be removed from the list\n\ multiple times.\n\
--- a/src/variables.cc +++ b/src/variables.cc @@ -2631,7 +2631,7 @@ recompile any function files unless their definitions are removed with\n\ @code{clear}. If set to \"none\", Octave will always check time stamps\n\ on files to determine whether functions defined in function files\n\ -need to recompiled.\n\ +need to be recompiled.\n\ @end deftypefn") { octave_value retval;