Mercurial > octave
changeset 27957:c20b7290c778
merge stable to default.
line wrap: on
line diff
--- a/build-aux/check-subst-vars.in.sh Fri Jan 17 08:51:24 2020 -0800 +++ b/build-aux/check-subst-vars.in.sh Fri Jan 17 13:27:27 2020 -0600 @@ -40,7 +40,7 @@ make_vars="$1" config_vars="$2" -## Generate awk script to check variable consitency. +## Generate awk script to check variable consistency. cat << EOF > $awk_script BEGIN {
--- a/build-aux/stl_algo.h-fixed Fri Jan 17 08:51:24 2020 -0800 +++ b/build-aux/stl_algo.h-fixed Fri Jan 17 13:27:27 2020 -0600 @@ -793,7 +793,7 @@ * @param __first An input iterator. * @param __last An input iterator. * @param __pred A predicate. - * @return True if the range @p [__first,__last) is partioned by @p __pred, + * @return True if the range @p [__first,__last) is partitioned by @p __pred, * i.e. if all elements that satisfy @p __pred appear before those that * do not. */ @@ -4255,7 +4255,7 @@ } /** - * @brief Checks whether a permutaion of the second sequence is equal + * @brief Checks whether a permutation of the second sequence is equal * to the first sequence. * @ingroup non_mutating_algorithms * @param __first1 Start of first range.
--- a/doc/interpreter/genpropdoc.m Fri Jan 17 08:51:24 2020 -0800 +++ b/doc/interpreter/genpropdoc.m Fri Jan 17 13:27:27 2020 -0600 @@ -537,11 +537,11 @@ s.valid = valid_4elvec; case "renderer" - s.doc = "Renderering engine used for printing when @code{renderermode} \ + s.doc = "Rendering engine used for printing when @code{renderermode} \ is \"manual\". __modemsg__."; case "renderermode" - s.doc = "Control whether the renderering engine used for printing is \ + s.doc = "Control whether the rendering engine used for printing is \ chosen automatically or specified by the @code{renderer} property. \ @xref{XREFprint, , @w{print function}}.";
--- a/doc/interpreter/geometry.txi Fri Jan 17 08:51:24 2020 -0800 +++ b/doc/interpreter/geometry.txi Fri Jan 17 13:27:27 2020 -0600 @@ -242,7 +242,7 @@ The @code{dsearch} and @code{dsearchn} find the closest point in a tessellation to the desired point. The desired point does not necessarily have to be in the tessellation, and even if it the returned -point of the tessellation does not have to be one of the vertexes of the +point of the tessellation does not have to be one of the vertices of the N-simplex within which the desired point is found. @DOCSTRING(dsearch) @@ -282,7 +282,7 @@ such that all points in @code{@var{v}(@var{p})}, a partitions of the tessellation where @var{p} is a member of @var{s}, are closer to @var{p} than any other point in @var{s}. The Voronoi diagram is related to the -Delaunay triangulation of a set of points, in that the vertexes of the +Delaunay triangulation of a set of points, in that the vertices of the Voronoi tessellation are the centers of the circum-circles of the simplices of the Delaunay tessellation.
--- a/doc/interpreter/testfun.txi Fri Jan 17 08:51:24 2020 -0800 +++ b/doc/interpreter/testfun.txi Fri Jan 17 13:27:27 2020 -0600 @@ -44,7 +44,7 @@ block evaluated separately. Blocks are introduced by valid keywords like @code{test}, @code{function}, or @code{assert} immediately following @samp{%!}. A block is defined by indentation as in Python. Lines beginning with -@samp{%!<whitespace>} are part of the preceeding block. +@samp{%!<whitespace>} are part of the preceding block. For example:
--- a/doc/refcard/refcard.tex Fri Jan 17 08:51:24 2020 -0800 +++ b/doc/refcard/refcard.tex Fri Jan 17 13:27:27 2020 -0600 @@ -1,3 +1,5 @@ +l +doc/refcard/refcard.tex % refcard.tex % % This file is TeX source for a reference card describing Octave. @@ -25,7 +27,7 @@ % % % Heavily modified by jwe from the source for the gdb reference card, -% which was orignally written by Roland Pesch <pesch@cygnus.com>. +% which was originally written by Roland Pesch <pesch@cygnus.com>. % % Copyright (C) 1991, 1992 Free Software Foundation, Inc. % Permission is granted to make and distribute verbatim copies of
--- a/etc/NEWS.2 Fri Jan 17 08:51:24 2020 -0800 +++ b/etc/NEWS.2 Fri Jan 17 13:27:27 2020 -0600 @@ -26,7 +26,7 @@ * When `format +' is in effect, Octave uses the following symbols to provide more information about the values in a matrix: - + postive real + + positive real - negative real i pure imaginary c complex
--- a/etc/NEWS.3 Fri Jan 17 08:51:24 2020 -0800 +++ b/etc/NEWS.3 Fri Jan 17 13:27:27 2020 -0600 @@ -1540,7 +1540,7 @@ and 1 for the R, G and B values. Invalid values are all mapped to the same color. - This also affects patch objects used in the bar, countour, meshc + This also affects patch objects used in the bar, contour, meshc and surfc functions, where the bars and contours will be monochrome. A workaround for this is to type "colormap gmap40" that loads a colormap that in many cases will be adequate for
--- a/libgui/src/m-editor/file-editor-tab.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/m-editor/file-editor-tab.cc Fri Jan 17 13:27:27 2020 -0600 @@ -729,10 +729,10 @@ if (m_is_octave_file) { - // Keywords and Builtins do not change, these informations can be - // stored in prepared form in a file. Informations on functions - // are changing frequently, then if functions should also be - // auto-completed, the date of any existing file is checked. + // Keywords and Builtins do not change, this information can be + // stored in prepared form in a file. Information on function are + // changing frequently, then if functions should also be auto- + // completed, the date of any existing file is checked. // Keywords are always used m_prep_apis_file = m_prep_apis_path + lexer->lexer () + "_k"; @@ -3098,7 +3098,7 @@ int col_space = col; int indentation = m_edit_area->indentation (line); - // Search the first occurence of space or tab backwards starting from + // Search the first occurrence of space or tab backwards starting from // the current column (col_space). while (c != ' ' && c != '\t' && col_space > indentation) {
--- a/libgui/src/m-editor/find-dialog.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/m-editor/find-dialog.cc Fri Jan 17 13:27:27 2020 -0600 @@ -545,7 +545,7 @@ _edit_area->lineIndexFromPosition (m_sel_end, &l2, &c2); _edit_area->show_selection_markers (l1, c1, l2, c2); - // Check if new start position is still wihtin the selection + // Check if new start position is still within the selection _find_result_available = pos >= m_sel_beg && pos <= m_sel_end; } }
--- a/libgui/src/m-editor/octave-qscintilla.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/m-editor/octave-qscintilla.cc Fri Jan 17 13:27:27 2020 -0600 @@ -317,7 +317,7 @@ } #endif - // finaly show the menu + // finally show the menu context_menu->exec (global_pos); #endif } @@ -513,7 +513,7 @@ return ST_NONE; } - // Do smart indendation after if, for, ... + // Do smart indentation after if, for, ... void octave_qscintilla::smart_indent (bool do_smart_indent, int do_auto_close, int line, int ind_char_width) {
--- a/libgui/src/main-window.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/main-window.cc Fri Jan 17 13:27:27 2020 -0600 @@ -1695,7 +1695,7 @@ #if defined (HAVE_QSCINTILLA) // Octave ready, determine whether to create an empty script. // This can not be done when the editor is created because all functions - // must be known for the lexer's auto completion informations + // must be known for the lexer's auto completion information m_editor_window->empty_script (true, false); m_editor_window->restore_session (settings); #endif
--- a/libgui/src/resource-manager.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/resource-manager.cc Fri Jan 17 13:27:27 2020 -0600 @@ -289,7 +289,7 @@ set_settings (m_settings_file); // Write the default monospace font into the settings for later use by - // console and editor as fallbacks of their font prefernces. + // console and editor as fallbacks of their font preferences. if (m_settings) m_settings->setValue (global_mono_font.key, default_family);
--- a/libgui/src/tab-bar.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libgui/src/tab-bar.cc Fri Jan 17 13:27:27 2020 -0600 @@ -136,7 +136,7 @@ QPoint click_pos; int clicked_idx = -1; - // detect the tab where the click occured + // detect the tab where the click occurred for (int i = 0; i < count (); i++) { click_pos = mapToGlobal (me->pos ());
--- a/libinterp/corefcn/Cell.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/Cell.cc Fri Jan 17 13:27:27 2020 -0600 @@ -158,7 +158,7 @@ octave_idx_type n = idx_arg.length (); // If we catch an indexing error in index_vector, we flag an error - // in index k. Ensure it is the right value befor each idx_vector + // in index k. Ensure it is the right value before each idx_vector // call. Same variable as used in for loop in default case. octave_idx_type k = 0;
--- a/libinterp/corefcn/__magick_read__.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/__magick_read__.cc Fri Jan 17 13:27:27 2020 -0600 @@ -711,7 +711,7 @@ = imvec[frameidx(frame)].getConstPixels (col_start, row_start, col_cache, row_cache); // Note that for CMYKColorspace + matte (CMYKA), the opacity is - // stored in the assocated IndexPacket. + // stored in the associated IndexPacket. const Magick::IndexPacket *apix = imvec[frameidx(frame)].getConstIndexes ();
--- a/libinterp/corefcn/cellfun.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/cellfun.cc Fri Jan 17 13:27:27 2020 -0600 @@ -785,7 +785,7 @@ %! y = true; %! A = cellfun (@(x) islogical (x) && y, {false, 0.3}); %! assert (A, [true, false]); -%!test # Three ouptut arguments of different type +%!test # Three output arguments of different type %! [A, B, C] = cellfun (@find, {10, 11; 0, 12}, "UniformOutput", false); %! assert (isequal (A, {true, true; [], true})); %! assert (isequal (B, {true, true; [], true})); @@ -802,7 +802,7 @@ %!test %! A = cellfun (@(x) x, {false, true; false, true}, "UniformOutput", false); %! assert (A, {false, true; false, true}); -%!test # Three ouptut arguments of same type +%!test # Three output arguments of same type %! [A, B, C] = cellfun (@find, {true, false; false, true}, ... %! "UniformOutput", false); %! assert (isequal (A, {true, []; [], true})); @@ -837,7 +837,7 @@ %! A = cellfun (@(x,y) x:y, {1.1, 4}, {3.1, 6}, "UniformOutput", false); %! assert (isequal (A{1}, [1.1, 2.1, 3.1])); %! assert (isequal (A{2}, [4, 5, 6])); -%!test # Three ouptut arguments of different type +%!test # Three output arguments of different type %! [A, B, C] = cellfun (@find, {10, 11; 0, 12}, "UniformOutput", false); %! assert (isequal (A, {true, true; [], true})); %! assert (isequal (B, {true, true; [], true})); @@ -1461,7 +1461,7 @@ %! y = true; %! A = arrayfun (@(x) islogical (x && y), false); %! assert (A, true); -%!test # Three ouptut arguments of different type +%!test # Three output arguments of different type %! [A, B, C] = arrayfun (@find, [10, 11; 0, 12], "UniformOutput", false); %! assert (isequal (A, {true, true; [], true})); %! assert (isequal (B, {true, true; [], true})); @@ -1477,7 +1477,7 @@ %!test %! A = arrayfun (@(x) x, [false, true, false, true], "UniformOutput", false); %! assert (A, {false, true, false, true}); -%!test # Three ouptut arguments of same type +%!test # Three output arguments of same type %! [A, B, C] = arrayfun (@find, [true, false; false, true], "UniformOutput", false); %! assert (isequal (A, {true, []; [], true})); %! assert (isequal (B, {true, []; [], true})); @@ -1510,7 +1510,7 @@ %! A = arrayfun (@(x,y) x:y, [1.1, 4], [3.1, 6], "UniformOutput", false); %! assert (isequal (A{1}, [1.1, 2.1, 3.1])); %! assert (isequal (A{2}, [4, 5, 6])); -%!test # Three ouptut arguments of different type +%!test # Three output arguments of different type %! [A, B, C] = arrayfun (@find, [10, 11; 0, 12], "UniformOutput", false); %! assert (isequal (A, {true, true; [], true})); %! assert (isequal (B, {true, true; [], true}));
--- a/libinterp/corefcn/defaults.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/defaults.cc Fri Jan 17 13:27:27 2020 -0600 @@ -80,7 +80,7 @@ std::string oh = sys::env::getenv ("OCTAVE_HOME"); - // If OCTAVE_HOME is set in the enviornment, use that. Otherwise, + // If OCTAVE_HOME is set in the environment, use that. Otherwise, // default to ${prefix} from configure. return oh.empty () ? op : oh; @@ -97,7 +97,7 @@ // If OCTAVE_EXEC_HOME is set in the environment, use that. // Otherwise, if ${prefix} and ${exec_prefix} from configure are set // to the same value, use OCTAVE_HOME from the environment if it is set. - // Othewise, default to ${exec_prefix} from configure. + // Otherwise, default to ${exec_prefix} from configure. if (! oeh.empty ()) return oeh;
--- a/libinterp/corefcn/defun-dld.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/defun-dld.h Fri Jan 17 13:27:27 2020 -0600 @@ -38,7 +38,7 @@ //! //! For detailed information, see \ref Macros. //! -//! @param name The **unqouted** name of the function that should be installed +//! @param name The **unquoted** name of the function that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the function name is prepended by an //! 'F'. @@ -72,7 +72,7 @@ //! //! For detailed information, see \ref Macros. //! -//! @param name The **unqouted** name of the method that should be installed +//! @param name The **unquoted** name of the method that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the method name is prepended by an //! 'F'.
--- a/libinterp/corefcn/defun.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/defun.h Fri Jan 17 13:27:27 2020 -0600 @@ -38,7 +38,7 @@ //! //! For detailed information, see \ref Macros. //! -//! @param name The **unqouted** name of the function that should be installed +//! @param name The **unquoted** name of the function that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the function name is prepended by an //! 'F'. @@ -67,9 +67,9 @@ //! quoted string (thus unaffected by macros), and the internal name of the //! function is given by @p fname. //! -//! @param name The **qouted** name of the function that should be callable +//! @param name The **quoted** name of the function that should be callable //! by the interpreter. -//! @param fname The internal **unqouted** name of the function. This internal +//! @param fname The internal **unquoted** name of the function. This internal //! name is by convention prepended by an 'F'. //! @param args_name The name of the octave_value_list variable used to pass //! the argument list to this function. If this value is @@ -94,7 +94,7 @@ //! The function gets installed to the 'octave::symbol_table' in a way, such //! that no variable is allowed to hide this function name. //! -//! @param name The **unqouted** name of the function that should be installed +//! @param name The **unquoted** name of the function that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the function name is prepended by an //! 'F'. @@ -116,7 +116,7 @@ //! //! For detailed information, see \ref Macros. //! -//! @param name The **unqouted** name of the method that should be installed +//! @param name The **unquoted** name of the method that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the method name is prepended by an //! 'F'. @@ -149,9 +149,9 @@ //! quoted string (thus unaffected by macros), and the internal name of the //! method is given by @p fname. //! -//! @param name The **qouted** name of the method that should be callable +//! @param name The **quoted** name of the method that should be callable //! by the interpreter. -//! @param fname The internal **unqouted** name of the method. This internal +//! @param fname The internal **unquoted** name of the method. This internal //! name is by convention prepended by an 'F'. //! @param interp_name The name of the 'octave::interpreter' reference that can //! be used by this method. If this value is omitted, @@ -180,7 +180,7 @@ //! The method gets installed to the 'octave::symbol_table' in a way, such //! that no variable is allowed to hide this method name. //! -//! @param name The **unqouted** name of the method that should be installed +//! @param name The **unquoted** name of the method that should be installed //! on the 'octave::symbol_table' and can be called by the //! interpreter. Internally, the method name is prepended by an //! 'F'.
--- a/libinterp/corefcn/file-io.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/file-io.cc Fri Jan 17 13:27:27 2020 -0600 @@ -1202,7 +1202,7 @@ if (args.length () == 1) { - // ommited format = %f. explicit "" = width from file + // omitted format = %f. explicit "" = width from file fmt = "%f"; } else if (args(1).is_string ()) @@ -1436,7 +1436,7 @@ example), then the default is zero. @item @qcode{"EndOfLine"} -@var{value} can be either an emtpy or one character specifying the +@var{value} can be either an empty or one character specifying the end-of-line character, or the pair @qcode{"@xbackslashchar{}r@xbackslashchar{}n"} (CRLF). In the latter case, any of
--- a/libinterp/corefcn/filter.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/filter.cc Fri Jan 17 13:27:27 2020 -0600 @@ -53,7 +53,7 @@ octave_idx_type ab_len = (a_len > b_len ? a_len : b_len); - // FIXME: The two lines below should be unecessary because + // FIXME: The two lines below should be unnecessary because // this template is called with a and b as column vectors // already. However the a.resize line is currently (2011/04/26) // necessary to stop bug #33164.
--- a/libinterp/corefcn/genprops.awk Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/genprops.awk Fri Jan 17 13:27:27 2020 -0600 @@ -838,7 +838,7 @@ if (index (quals, "f")) factory[idx] = 0; -## ## emmit an asignment set function +## ## emit an assignment set function ## if (index (quals, "a")) ## emit_ov_set[idx] = "assignment"; ##
--- a/libinterp/corefcn/gl2ps-print.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/gl2ps-print.cc Fri Jan 17 13:27:27 2020 -0600 @@ -362,7 +362,7 @@ // Default sort order optimizes for 3D plots GLint gl2ps_sort = GL2PS_BSP_SORT; - // FIXME: gl2ps does not provide a way to change the sorting algorythm + // FIXME: gl2ps does not provide a way to change the sorting algorithm // on a viewport basis, we thus disable sorting only if all axes are 2D if (has_2D_axes (go.get ("__myhandle__"))) gl2ps_sort = GL2PS_NO_SORT;
--- a/libinterp/corefcn/hash.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/hash.cc Fri Jan 17 13:27:27 2020 -0600 @@ -25,7 +25,7 @@ /* Implementation note (Dec, 2015): All supported cryptographic hash -functions are calling "low-level" inplementations of the GNULIB. +functions are calling "low-level" implementations of the GNULIB. The GNULIB, contains even more HMAC based algorithms, c.f. https://www.gnu.org/software/gnulib/MODULES.html#module=crypto/hmac-md5
--- a/libinterp/corefcn/input.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/input.h Fri Jan 17 13:27:27 2020 -0600 @@ -23,7 +23,7 @@ // //////////////////////////////////////////////////////////////////////// -// Use the GNU readline library for command line editing and hisory. +// Use the GNU readline library for command line editing and history. #if ! defined (octave_input_h) #define octave_input_h 1
--- a/libinterp/corefcn/interpreter.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/interpreter.cc Fri Jan 17 13:27:27 2020 -0600 @@ -517,7 +517,7 @@ if (m_app_context) { - // Embedded interpeters don't execute command line options. + // Embedded interpreters don't execute command line options. const cmdline_options& options = m_app_context->options (); // Make all command-line arguments available to startup files, @@ -694,7 +694,7 @@ // not stop executing PKG_ADD files at the first exception. // It's also better than changing the default execute_pkg_add // function to use safe_source file because that will normally - // be evaluated from the normal intepreter loop where exceptions + // be evaluated from the normal interpreter loop where exceptions // are already handled. unwind_protect frame;
--- a/libinterp/corefcn/ls-ascii-helper.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/ls-ascii-helper.cc Fri Jan 17 13:27:27 2020 -0600 @@ -75,7 +75,7 @@ } else { - // No newline charater peeked, so read it and proceed to next + // No newline character peeked, so read it and proceed to next // character. char d; is.get (d); @@ -121,7 +121,7 @@ } } -// Read charaters from stream IS until a newline is reached. +// Read characters from stream IS until a newline is reached. // Depending on KEEP_NEWLINE, either eat newline from stream or keep // it unread. Characters read are stored and returned as // std::string. @@ -164,7 +164,7 @@ } else { - // No newline charater peeked, so read it, store it, and + // No newline character peeked, so read it, store it, and // proceed to next. char d; is.get (d);
--- a/libinterp/corefcn/ls-mat5.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/ls-mat5.cc Fri Jan 17 13:27:27 2020 -0600 @@ -850,7 +850,7 @@ if (! is) goto data_read_error; - // Octave can handle both "/" and "\" as a directory seperator + // Octave can handle both "/" and "\" as a directory separator // and so can ignore the separator field of m0. I think the // sentinel field is also save to ignore. octave_scalar_map m0 = tc2.scalar_map_value ();
--- a/libinterp/corefcn/mappers.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/mappers.cc Fri Jan 17 13:27:27 2020 -0600 @@ -524,7 +524,7 @@ ## double precision %!assert (ceil ([2, 1.1, -1.1, -1]), [2, 2, -1, -1]) -## complex double precison +## complex double precision %!assert (ceil ([2+2i, 1.1+1.1i, -1.1-1.1i, -1-i]), [2+2i, 2+2i, -1-i, -1-i]) ## single precision
--- a/libinterp/corefcn/mxarray.in.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/mxarray.in.h Fri Jan 17 13:27:27 2020 -0600 @@ -228,8 +228,8 @@ virtual void set_class_name (const char *name_arg) = 0; - // The following functions aren't pure virtual becuase they are only - // valid for one type. Making them pure virtual would mean tha they + // The following functions aren't pure virtual because they are only + // valid for one type. Making them pure virtual would mean that they // have to be implemented for all derived types, and all of those // would need to throw errors instead of just doing it once here.
--- a/libinterp/corefcn/oct-hist.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/oct-hist.cc Fri Jan 17 13:27:27 2020 -0600 @@ -470,7 +470,7 @@ set_interrupt_handler (old_interrupt_handler); - // Check if text edition was successfull. Abort the operation + // Check if text edition was successful. Abort the operation // in case of failure. if (status != EXIT_SUCCESS) error ("edit_history: text editor command failed");
--- a/libinterp/corefcn/oct-map.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/corefcn/oct-map.cc Fri Jan 17 13:27:27 2020 -0600 @@ -924,7 +924,7 @@ octave_map retval; // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; @@ -1139,7 +1139,7 @@ octave_idx_type n_idx = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0;
--- a/libinterp/dldfcn/__glpk__.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/dldfcn/__glpk__.cc Fri Jan 17 13:27:27 2020 -0600 @@ -346,7 +346,7 @@ if (args.length () != 9) print_usage (); - // 1nd Input. A column array containing the objective function coefficients. + // 1st Input. A column array containing the objective function coefficients. int mrowsc = args(0).rows (); Matrix C = args(0).xmatrix_value ("__glpk__: invalid value of C");
--- a/libinterp/dldfcn/__init_fltk__.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/dldfcn/__init_fltk__.cc Fri Jan 17 13:27:27 2020 -0600 @@ -2015,7 +2015,7 @@ static figure_manager *instance; - // Singelton -- hide all of the above. + // Singleton -- hide all of the above. static int curr_index;
--- a/libinterp/dldfcn/colamd.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/dldfcn/colamd.cc Fri Jan 17 13:27:27 2020 -0600 @@ -738,7 +738,7 @@ NDArray tree (dim_vector (1, n_col)); for (octave_idx_type i = 0; i < n_col; i++) // We flag a root with n_col while Matlab does it with zero - // Convert for matlab compatiable output + // Convert for matlab compatible output if (etree[i] == n_col) tree(i) = 0; else
--- a/libinterp/dldfcn/gzip.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/dldfcn/gzip.cc Fri Jan 17 13:27:27 2020 -0600 @@ -561,7 +561,7 @@ }; // We don't care if mkdir fails. Maybe it failed because it already - // exists, or maybe it can't bre created. If the first, then there's + // exists, or maybe it can't be created. If the first, then there's // nothing to do, if the later, then it will be handled later. Any // is to be handled by not listing files in the output. sys::mkdir (out_dir, 0777);
--- a/libinterp/dldfcn/symrcm.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/dldfcn/symrcm.cc Fri Jan 17 13:27:27 2020 -0600 @@ -175,7 +175,7 @@ while (i > 0); } -// Heap operation remove-min. Removes the smalles element in O(1) and +// Heap operation remove-min. Removes the smallest element in O(1) and // reorganizes the heap optionally in O(log(n)) inline static CMK_Node @@ -660,7 +660,7 @@ // entered the BFS a new level? if (v.dist > level) { - // adjustment of bandwith: + // adjustment of bandwidth: // "[...] the minimum bandwidth that // can be obtained [...] is the // maximum number of nodes per level"
--- a/libinterp/octave-value/ov-base-diag.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-base-diag.cc Fri Jan 17 13:27:27 2020 -0600 @@ -107,7 +107,7 @@ if (idx.length () == 2 && ! resize_ok) { - int k = 0; // index we're accesing when index_vector throws + int k = 0; // index we're accessing when index_vector throws try { idx_vector idx0 = idx(0).index_vector ();
--- a/libinterp/octave-value/ov-base-mat.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-base-mat.cc Fri Jan 17 13:27:27 2020 -0600 @@ -141,7 +141,7 @@ const MT& cmatrix = matrix; // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; @@ -227,7 +227,7 @@ octave_idx_type n_idx = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; @@ -301,7 +301,7 @@ MT mrhs (dim_vector (1, 1), rhs); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0;
--- a/libinterp/octave-value/ov-base-sparse.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-base-sparse.cc Fri Jan 17 13:27:27 2020 -0600 @@ -60,7 +60,7 @@ octave_idx_type n_idx = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; @@ -187,7 +187,7 @@ octave_idx_type len = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0; @@ -239,7 +239,7 @@ octave_idx_type len = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0;
--- a/libinterp/octave-value/ov-fcn-inline.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-fcn-inline.cc Fri Jan 17 13:27:27 2020 -0600 @@ -340,7 +340,7 @@ OCTAVE_LOCAL_BUFFER (char, s, m_args.numel () * (len + 1)); - // Save the args as a null teminated list + // Save the args as a null terminated list for (int i = 0; i < m_args.numel (); i++) { const char *cptr = m_args(i).c_str ();
--- a/libinterp/octave-value/ov-re-diag.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-re-diag.cc Fri Jan 17 13:27:27 2020 -0600 @@ -95,7 +95,7 @@ // vectors. if (! resize_ok && idx.length () == 2 && matrix.is_multiple_of_identity (1)) { - int k = 0; // index we're accesing when index_vector throws + int k = 0; // index we're accessing when index_vector throws try { idx_vector idx0 = idx(0).index_vector ();
--- a/libinterp/octave-value/ov-str-mat.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/octave-value/ov-str-mat.cc Fri Jan 17 13:27:27 2020 -0600 @@ -95,7 +95,7 @@ octave_idx_type len = idx.length (); // If we catch an indexing error in index_vector, we flag an error in - // index k. Ensure it is the right value befor each idx_vector call. + // index k. Ensure it is the right value before each idx_vector call. // Same variable as used in the for loop in the default case. octave_idx_type k = 0;
--- a/libinterp/operators/op-int-concat.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/operators/op-int-concat.cc Fri Jan 17 13:27:27 2020 -0600 @@ -50,7 +50,7 @@ #include "op-int.h" #include "ops.h" -// Concatentation of mixed integer types: +// Concatenation of mixed integer types: OCTAVE_CONCAT_FN2 (int8, int16) OCTAVE_CONCAT_FN2 (int8, int32)
--- a/libinterp/operators/op-range.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/operators/op-range.cc Fri Jan 17 13:27:27 2020 -0600 @@ -133,7 +133,7 @@ INSTALL_CATOP_TI (ti, octave_bool_matrix, octave_range, bm_r); INSTALL_CATOP_TI (ti, octave_char_matrix, octave_range, chm_r); - // FIXME: this would be unneccessary if + // FIXME: this would be unnecessary if // octave_base_value::numeric_assign always tried converting lhs // before rhs.
--- a/libinterp/options-usage.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/options-usage.h Fri Jan 17 13:27:27 2020 -0600 @@ -175,7 +175,7 @@ exit (0); } -// Terse usage messsage. +// Terse usage message. static void octave_print_terse_usage_and_exit (void)
--- a/libinterp/parse-tree/jit-ir.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/jit-ir.h Fri Jan 17 13:27:27 2020 -0600 @@ -103,8 +103,8 @@ class jit_use; // Creates and tracks memory for jit_value and subclasses. - // Memory managment is simple, all values that are created live as long as the - // factory. + // Memory management is simple, all values that are created live as + // long as the factory. class jit_factory { @@ -290,7 +290,7 @@ public: // some compilers don't allow us to use jit_internal_node without template - // paremeters + // parameters typedef jit_internal_node<jit_value, jit_use> PARENT_T; jit_use (void) : m_user (0), m_index (0) { }
--- a/libinterp/parse-tree/jit-typeinfo.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/jit-typeinfo.cc Fri Jan 17 13:27:27 2020 -0600 @@ -263,12 +263,12 @@ } extern "C" double - octave_jit_paren_scalar (jit_matrix *mat, double *indicies, + octave_jit_paren_scalar (jit_matrix *mat, double *indices, octave_idx_type idx_count) { // FIXME: Replace this with a more optimal version Array<idx_vector> idx; - make_indices (indicies, idx_count, idx); + make_indices (indices, idx_count, idx); Array<double> ret = mat->m_array->index (idx); @@ -1395,7 +1395,7 @@ m_binary_ops[octave_value::op_el_pow].add_overload (fn); // now for unary scalar operations - // FIXME: Impelment not + // FIXME: Implement not fn = create_internal ("octave_jit_++", m_scalar, m_scalar); body = fn.new_block (); m_builder.SetInsertPoint (body); @@ -1598,7 +1598,7 @@ } m_for_check_fn.add_overload (fn); - // index variabe for for loop + // index variable for for loop fn = create_internal ("octave_jit_for_range_idx", m_scalar, m_range, m_index); body = fn.new_block (); @@ -1650,7 +1650,7 @@ m_logically_true_fn.add_overload (fn); // make_range - // FIXME: May be benificial to implement all in LLVM + // FIXME: May be beneficial to implement all in LLVM jit_function compute_nelem = create_external (JIT_FN (octave_jit_compute_nelem), m_index, m_scalar, m_scalar, m_scalar);
--- a/libinterp/parse-tree/jit-typeinfo.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/jit-typeinfo.h Fri Jan 17 13:27:27 2020 -0600 @@ -225,7 +225,7 @@ llvm::Type *m_packed_type[jit_convention::length]; }; - // seperate print function to allow easy printing if type is null + // separate print function to allow easy printing if type is null std::ostream& jit_print (std::ostream& os, jit_type *atype); // Find common type @@ -258,7 +258,7 @@ jit_function (const jit_function& fn); - // erase the interal LLVM function (if it exists). Will become invalid. + // erase the internal LLVM function (if it exists). Will become invalid. void erase (void); bool valid (void) const { return m_llvm_function; } @@ -348,8 +348,8 @@ std::ostream& operator << (std::ostream& os, const jit_function& fn); - // Keeps track of information about how to implement operations (+, -, *, ect) - // and their resulting types. + // Keeps track of information about how to implement operations (+, -, + // *, etc.) and their resulting types. class jit_operation {
--- a/libinterp/parse-tree/oct-parse.yy Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/oct-parse.yy Fri Jan 17 13:27:27 2020 -0600 @@ -305,7 +305,7 @@ %left '(' '.' '{' // How to clean up if there is a parse error. We handle deleting tokens -// and comments seperately and separators are just characters. The +// and comments separately and separators are just characters. The // remaining items are dynamically allocated parse tree objects that // must be deleted. Use the wildcard case (<*>) to detect unhandled // cases (for example, a new semantic type is added but not handled @@ -1058,9 +1058,9 @@ { $$ = $1; } ; -// ===================== -// Declaration statemnts -// ===================== +// ====================== +// Declaration statements +// ====================== declaration : GLOBAL decl1 { @@ -2360,7 +2360,7 @@ m_parser_state = yypstate_new (); } - // Error mesages for mismatched end tokens. + // Error messages for mismatched end tokens. static std::string end_token_as_string (token::end_tok_type ettype)
--- a/libinterp/parse-tree/parse.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/parse.h Fri Jan 17 13:27:27 2020 -0600 @@ -201,7 +201,7 @@ return m_endfunction_found; } - // Error mesages for mismatched end tokens. + // Error messages for mismatched end tokens. void end_token_error (token *tok, token::end_tok_type expected); // Check to see that end tokens are properly matched.
--- a/libinterp/parse-tree/profiler.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/profiler.h Fri Jan 17 13:27:27 2020 -0600 @@ -210,7 +210,7 @@ // Add the time elapsed since last_time to the function we're currently in. // This is called from two different positions, thus it is useful to have - // it as a seperate function. + // it as a separate function. void add_current_time (void); }; }
--- a/libinterp/parse-tree/pt-eval.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/pt-eval.h Fri Jan 17 13:27:27 2020 -0600 @@ -813,7 +813,7 @@ int m_echo; // Are we currently echoing commands? This state is set by the - // functions that execute fucntions and scripts. + // functions that execute functions and scripts. bool m_echo_state; std::string m_echo_file_name;
--- a/libinterp/parse-tree/pt-jit.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/pt-jit.cc Fri Jan 17 13:27:27 2020 -0600 @@ -378,7 +378,7 @@ void jit_convert::visit_colon_expression (tree_colon_expression& expr) { - // in the futher we need to add support for classes and deal with rvalues + // in the further we need to add support for classes and deal with rvalues jit_value *base = visit (expr.base ()); jit_value *limit = visit (expr.limit ()); jit_value *increment; @@ -421,7 +421,7 @@ void jit_convert::visit_simple_for_command (tree_simple_for_command& cmd) { - // Note we do an initial check to see if the loop will run atleast once. + // Note we do an initial check to see if the loop will run at least once. // This allows us to get better type inference bounds on variables defined // and used only inside the for loop (e.g., the index variable) @@ -1275,7 +1275,7 @@ jit_value *new_object = resolve (*idx, rhs, true); do_assign (idx->expression (), new_object, true); - // FIXME: Will not work for values that must be release/grabed + // FIXME: Will not work for values that must be released/grabbed return rhs; } else @@ -2339,7 +2339,7 @@ jit::ModuleOwner module_owner = tree_jit::open_new_module (module_name); // FIXME: what if this fails? exception? - // Get a pointer to the module before ownership is transfered to engine + // Get a pointer to the module before ownership is transferred to engine m_module = module_owner.get (); jit::EngineOwner engine_owner = std::move
--- a/libinterp/parse-tree/pt-pr-code.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/pt-pr-code.cc Fri Jan 17 13:27:27 2020 -0600 @@ -1179,7 +1179,7 @@ } } - // For ressetting print_code state. + // For resetting print_code state. void tree_print_code::reset (void)
--- a/libinterp/parse-tree/pt-stmt.h Fri Jan 17 08:51:24 2020 -0800 +++ b/libinterp/parse-tree/pt-stmt.h Fri Jan 17 13:27:27 2020 -0600 @@ -112,7 +112,7 @@ bool is_end_of_file (void) const; // Allow modification of this statement. Note that there is no - // checking. If you use these, are you sure you knwo what you are + // checking. If you use these, are you sure you know what you are // doing? void set_command (tree_command *c) { m_command = c; }
--- a/liboctave/array/Array.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/array/Array.cc Fri Jan 17 13:27:27 2020 -0600 @@ -2680,7 +2680,7 @@ break; } - // Don't skip any initial aguments if they are all empty. + // Don't skip any initial arguments if they are all empty. if (istart >= n) istart = 0; }
--- a/liboctave/array/Array.h Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/array/Array.h Fri Jan 17 13:27:27 2020 -0600 @@ -100,7 +100,7 @@ //! length should it return? Octave length() function returns the length //! of the longest dimension which is an odd definition, only useful for //! vectors and square matrices. The alternatives numel(), rows(), -//! columns(), and size(d) are more explict and recommended. +//! columns(), and size(d) are more explicit and recommended. //! //! ### size_type //!
--- a/liboctave/array/CSparse.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/array/CSparse.cc Fri Jan 17 13:27:27 2020 -0600 @@ -64,8 +64,8 @@ #include "Sparse-perm-op-defs.h" // Define whether to use a basic QR solver or one that uses a Dulmange -// Mendelsohn factorization to seperate the problem into under-determined, -// well-determined and over-determined parts and solves them seperately +// Mendelsohn factorization to separate the problem into under-determined, +// well-determined and over-determined parts and solves them separately #if ! defined (USE_QRSOLVE) # include "sparse-dmsolve.h" #endif @@ -580,7 +580,7 @@ SparseComplexMatrix::concat (const SparseComplexMatrix& rb, const Array<octave_idx_type>& ra_idx) { - // Don't use numel to avoid all possiblity of an overflow + // Don't use numel to avoid all possibility of an overflow if (rb.rows () > 0 && rb.cols () > 0) insert (rb, ra_idx(0), ra_idx(1)); return *this; @@ -792,7 +792,7 @@ retval.xdata (cx) = 1.0; cx++; - // iterate accross columns of input matrix + // iterate across columns of input matrix for (octave_idx_type j = i+1; j < nr; j++) { Complex v = 0.; @@ -898,7 +898,7 @@ // place the 1 in the identity position work[iidx] = 1.0; - // iterate accross columns of input matrix + // iterate across columns of input matrix for (octave_idx_type j = iidx+1; j < nr; j++) { Complex v = 0.;
--- a/liboctave/array/boolSparse.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/array/boolSparse.cc Fri Jan 17 13:27:27 2020 -0600 @@ -93,7 +93,7 @@ SparseBoolMatrix::concat (const SparseBoolMatrix& rb, const Array<octave_idx_type>& ra_idx) { - // Don't use numel to avoid all possiblity of an overflow + // Don't use numel to avoid all possibility of an overflow if (rb.rows () > 0 && rb.cols () > 0) insert (rb, ra_idx(0), ra_idx(1)); return *this;
--- a/liboctave/array/dSparse.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/array/dSparse.cc Fri Jan 17 13:27:27 2020 -0600 @@ -56,8 +56,8 @@ #include "Sparse-perm-op-defs.h" // Define whether to use a basic QR solver or one that uses a Dulmange -// Mendelsohn factorization to seperate the problem into under-determined, -// well-determined and over-determined parts and solves them seperately +// Mendelsohn factorization to separate the problem into under-determined, +// well-determined and over-determined parts and solves them separately #if ! defined (USE_QRSOLVE) # include "sparse-dmsolve.h" #endif @@ -534,7 +534,7 @@ SparseMatrix::concat (const SparseMatrix& rb, const Array<octave_idx_type>& ra_idx) { - // Don't use numel to avoid all possiblity of an overflow + // Don't use numel to avoid all possibility of an overflow if (rb.rows () > 0 && rb.cols () > 0) insert (rb, ra_idx(0), ra_idx(1)); return *this; @@ -735,7 +735,7 @@ retval.xdata (cx) = 1.0; cx++; - // iterate accross columns of input matrix + // iterate across columns of input matrix for (octave_idx_type j = i+1; j < nr; j++) { double v = 0.; @@ -841,7 +841,7 @@ // place the 1 in the identity position work[iidx] = 1.0; - // iterate accross columns of input matrix + // iterate across columns of input matrix for (octave_idx_type j = iidx+1; j < nr; j++) { double v = 0.;
--- a/liboctave/numeric/lo-specfun.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/numeric/lo-specfun.cc Fri Jan 17 13:27:27 2020 -0600 @@ -1662,7 +1662,7 @@ return FloatComplex (ret.real (), ret.imag ()); } - // The algorthim for erfcinv is an adaptation of the erfinv algorithm + // The algorithm for erfcinv is an adaptation of the erfinv algorithm // above from P. J. Acklam. It has been modified to run over the // different input domain of erfcinv. See the notes for erfinv for an // explanation.
--- a/liboctave/numeric/sparse-lu.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/numeric/sparse-lu.cc Fri Jan 17 13:27:27 2020 -0600 @@ -694,7 +694,7 @@ double *info = Info.fortran_vec (); int status; - // Null loop so that qinit is imediately deallocated when not needed + // Null loop so that qinit is immediately deallocated when not needed do { OCTAVE_LOCAL_BUFFER (octave_idx_type, qinit, nc);
--- a/liboctave/util/blaswrap.c Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/util/blaswrap.c Fri Jan 17 13:27:27 2020 -0600 @@ -235,7 +235,7 @@ DEFINE_LAPACK_ENUM(lapack, LAPACK_LIST) /* - * BLAS wrappers, F2C convention passes retuned complex as an extra first + * BLAS wrappers, F2C convention passes returned complex as an extra first * argument */ typedef struct { float r, i; } complex;
--- a/liboctave/util/lo-traits.h Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/util/lo-traits.h Fri Jan 17 13:27:27 2020 -0600 @@ -88,7 +88,7 @@ static const bool value = true; }; -// Determine whether a template paramter is a class type. +// Determine whether a template parameter is a class type. template <typename T1> class is_class_type
--- a/liboctave/util/oct-binmap.h Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/util/oct-binmap.h Fri Jan 17 13:27:27 2020 -0600 @@ -34,7 +34,7 @@ #include "bsxfun.h" -// This source file implements a general binary maping function for arrays. +// This source file implements a general binary mapping function for arrays. // The syntax is binmap<type> (a, b, f,[name]). // type denotes the expected return type of the operation. // a, b, should be one of the 6 combinations:
--- a/liboctave/util/url-transfer.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/util/url-transfer.cc Fri Jan 17 13:27:27 2020 -0600 @@ -634,7 +634,7 @@ retval = buf.str (); - // Can I assume that the path is alway in "" on the last line + // Can I assume that the path is always in "" on the last line size_t pos2 = retval.rfind ('"'); size_t pos1 = retval.rfind ('"', pos2 - 1); retval = retval.substr (pos1 + 1, pos2 - pos1 - 1);
--- a/liboctave/wrappers/fpucw-wrappers.c Fri Jan 17 08:51:24 2020 -0800 +++ b/liboctave/wrappers/fpucw-wrappers.c Fri Jan 17 13:27:27 2020 -0600 @@ -65,7 +65,7 @@ octave_begin_long_double_rounding (void) { // Don't use DECL_LONG_DOUBLE_ROUNDING here because on some systems, - // it is defind to be empty. + // it is defined to be empty. fpucw_t oldcw = 0;
--- a/m4/acinclude.m4 Fri Jan 17 08:51:24 2020 -0800 +++ b/m4/acinclude.m4 Fri Jan 17 13:27:27 2020 -0600 @@ -1814,7 +1814,7 @@ ## If some modules were found for $ver, then warn about possible ## incomplete or broken Qt installation instead of checking for ## next version in the list. Don't attempt a similar check for - ## tools here becuase Qt4 and Qt5 tools may be installed with + ## tools here because Qt4 and Qt5 tools may be installed with ## the same name so determining whether there is a mix of versions ## will require more work than just looking which tools are installed. warn_qt_modules="Your installation of Qt version $ver appears incomplete or broken in some way. Fix that or use --with-qt=VER to use another version."
--- a/scripts/general/interp1.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/general/interp1.m Fri Jan 17 13:27:27 2020 -0600 @@ -449,7 +449,7 @@ %! ddyc = diff (diff (interp1 (t,y,ti, 'cubic')) ./dti)./dti; %! plot (ti(2:end-1),ddys,'b*', ti(2:end-1),ddyp,'c^', ti(2:end-1),ddyc,'g+'); %! title ({'Second derivative of interpolated "sin (4*t + 0.3) .* cos (3*t - 0.1)"', ... -%! 'Note: "spline" has continous 2nd derivative, others do not'}); +%! 'Note: "spline" has continuous 2nd derivative, others do not'}); %! legend ('spline', 'pchip', 'cubic'); %!demo
--- a/scripts/general/interpft.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/general/interpft.m Fri Jan 17 13:27:27 2020 -0600 @@ -47,7 +47,7 @@ ## 2002-03-17 aadler ## * added code to work on matrices as well ## 2006-05-25 dbateman -## * Make it matlab compatiable, cutting out the 2-D interpolation +## * Make it matlab compatible, cutting out the 2-D interpolation function z = interpft (x, n, dim)
--- a/scripts/general/quad2d.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/general/quad2d.m Fri Jan 17 13:27:27 2020 -0600 @@ -255,7 +255,7 @@ ## dx = - (a - b) * sin(t) / 2 dt ## Now our integral is ## \int_a^b \int_0^1 f(x,y) dydx - ## as we already subsitute for "y", so + ## as we already substitute for "y", so ## gx(tx) = ((a - b) * cos(tx) + (a + b)) / 2 ## gy(ty) = (1 - cos(ty)) / 2 ## dydx = (b - a) * sin(tx) * sin(ty) / 4 dtydtx
--- a/scripts/gui/inputdlg.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/gui/inputdlg.m Fri Jan 17 13:27:27 2020 -0600 @@ -145,7 +145,7 @@ if (numel (linespec) == numel (prompt)) ## only one column in lineTo, copy from vector linespec and add defaults rowscols = zeros (numel (prompt), 2); - ## rows from colum vector linespec, columns are set to default + ## rows from column vector linespec, columns are set to default rowscols(:,2) = 25; rowscols(:,1) = linespec(:); else
--- a/scripts/image/cmunique.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/image/cmunique.m Fri Jan 17 13:27:27 2020 -0600 @@ -27,7 +27,7 @@ ## @deftypefn {} {[@var{Y}, @var{newmap}] =} cmunique (@var{X}, @var{map}) ## @deftypefnx {} {[@var{Y}, @var{newmap}] =} cmunique (@var{RGB}) ## @deftypefnx {} {[@var{Y}, @var{newmap}] =} cmunique (@var{I}) -## Convert an input image @var{X} to an ouput indexed image @var{Y} which uses +## Convert an input image @var{X} to an output indexed image @var{Y} which uses ## the smallest colormap possible @var{newmap}. ## ## When the input is an indexed image (@var{X} with colormap @var{map}) the
--- a/scripts/image/imread.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/image/imread.m Fri Jan 17 13:27:27 2020 -0600 @@ -183,7 +183,7 @@ %! assert (error_thrown, true); ## make one of the formats read, return what it received as input to -## confirm that the input parsing is working correcly +## confirm that the input parsing is working correctly %!testif HAVE_MAGICK %! fname = [tempname() ".jpg"]; %! def_fmt = imformats ();
--- a/scripts/legacy/strread.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/legacy/strread.m Fri Jan 17 13:27:27 2020 -0600 @@ -813,7 +813,7 @@ ## skip the word otherwise ## Ensure descriptive content is consistent. - ## Test made a bit lax to accomodate for incomplete last lines + ## Test made a bit lax to accommodate for incomplete last lines n = find (! cellfun ("isempty", data)); if (numel (unique (data(n))) > 1 || ! strcmpi (unique (data), fmt_words{m}))
--- a/scripts/linear-algebra/housh.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/linear-algebra/housh.m Fri Jan 17 13:27:27 2020 -0600 @@ -74,7 +74,7 @@ if (! isvector (x) && ! isscalar (x)) error ("housh: first input must be a vector"); elseif (! isscalar (j)) - error ("housh: second argment must be an integer scalar"); + error ("housh: second argument must be an integer scalar"); else housv = x; m = max (abs (housv));
--- a/scripts/linear-algebra/normest1.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/linear-algebra/normest1.m Fri Jan 17 13:27:27 2020 -0600 @@ -149,7 +149,7 @@ ## There are at most 2^(n-1) unparallel columns, see later. while (i <= imax) if (any (abs (X(:,i)' * X(:,1:i-1)) == n)) - ## column i is parallel to a colum 1:i-1. Change it. + ## column i is parallel to a column 1:i-1. Change it. X(:,i) = sign (2 * rand (n, 1) - 1); else i++;
--- a/scripts/miscellaneous/nargchk.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/miscellaneous/nargchk.m Fri Jan 17 13:27:27 2020 -0600 @@ -64,7 +64,7 @@ if (strcmpi (outtype, "string")) msg = msg.message; elseif (isempty (msg.message)) - ## Compatability: Matlab returns a 0x1 empty struct when nargchk passes + ## Compatibility: Matlab returns a 0x1 empty struct when nargchk passes msg = resize (msg, 0, 1); endif
--- a/scripts/miscellaneous/private/__publish_latex_output__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/miscellaneous/private/__publish_latex_output__.m Fri Jan 17 13:27:27 2020 -0600 @@ -278,7 +278,7 @@ ## Escape \, {, }, &, %, #, _, ~, ^, <, > str = regexprep (str, '\\', "\\ensuremath{\\backslash}"); str = regexprep (str, '(?<!\\)(\{|\}|&|%|#|_)', '\\$1'); - ## Revert accidential {} replacements for backslashes + ## Revert accidental {} replacements for backslashes str = strrep (str, '\ensuremath\{\backslash\}', '\ensuremath{\backslash}'); str = regexprep (str, '(?<!\\)~', "\\ensuremath{\\tilde{\\;}}"); str = regexprep (str, '(?<!\\)\^', "\\^{}");
--- a/scripts/ode/ode15i.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/ode/ode15i.m Fri Jan 17 13:27:27 2020 -0600 @@ -381,7 +381,7 @@ %! [t, y] = ode15i ("rob", [0, 100, 200], [1; 0; 0], [-1e-4; 1e-4; 0]); %! assert ([t(2), y(2,:)], fref, 1e-3); -## solve in intermidiate step +## solve in intermediate step %!testif HAVE_SUNDIALS %! [t, y] = ode15i (@rob, [0, 100, 200], [1; 0; 0], [-1e-4; 1e-4; 0]); %! assert ([t(2), y(2,:)], fref, 1e-3);
--- a/scripts/plot/appearance/specular.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/appearance/specular.m Fri Jan 17 13:27:27 2020 -0600 @@ -93,7 +93,7 @@ ## Set reflectance to zero if light is on the other side retval(l_dot_n < 0) = 0; - ## Allow postive values only + ## Allow positive values only retval(retval < 0) = 0; retval .^= se;
--- a/scripts/plot/draw/compass.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/draw/compass.m Fri Jan 17 13:27:27 2020 -0600 @@ -94,7 +94,7 @@ endif endif - ## Matlab draws compass plots with the arrow head as one continous line, + ## Matlab draws compass plots with the arrow head as one continuous line, ## and each arrow separately. This is completely different from quiver ## and quite ugly. n = length (u);
--- a/scripts/plot/draw/fill.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/draw/fill.m Fri Jan 17 13:27:27 2020 -0600 @@ -188,7 +188,7 @@ endif elseif (isnumeric (arg)) ## Assume any numeric argument is correctly formatted cdata. - ## Let patch worry about the multple different input formats. + ## Let patch worry about the multiple different input formats. retval = true; endif
--- a/scripts/plot/draw/private/__marching_cube__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/draw/private/__marching_cube__.m Fri Jan 17 13:27:27 2020 -0600 @@ -32,7 +32,7 @@ ## @var{iso}. It is considered that the volume data @var{val} is given at ## the points @var{x}, @var{y} and @var{z} which are of type ## three-dimensional numeric arrays. The orientation of the triangles is -## choosen such that the normals point from the higher values to the lower +## chosen such that the normals point from the higher values to the lower ## values. ## ## Optionally the color data @var{col} can be passed to this function
--- a/scripts/plot/draw/reducepatch.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/draw/reducepatch.m Fri Jan 17 13:27:27 2020 -0600 @@ -324,7 +324,7 @@ vertices(end_point_idx,:) = Inf; # mark vertex for later removal endif - ## Pretty print a row of dots while performing calulation + ## Pretty print a row of dots while performing calculation if (verbose && ++verbose_counter > verbose_stepwidth) printf ("."); verbose_counter = 0;
--- a/scripts/plot/util/__gnuplot_drawnow__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/util/__gnuplot_drawnow__.m Fri Jan 17 13:27:27 2020 -0600 @@ -255,7 +255,7 @@ warning ("gnuplot_set_term: size is zero"); endif else - ## A specified size take priority over the figure properies. + ## A specified size take priority over the figure properties. size_str = ""; endif else
--- a/scripts/plot/util/private/__gnuplot_draw_axes__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/util/private/__gnuplot_draw_axes__.m Fri Jan 17 13:27:27 2020 -0600 @@ -914,7 +914,7 @@ if (isfield (obj, "edgecolor")) ## FIXME: This is the wrong thing to do as edgecolor, ## markeredgecolor and markerfacecolor can have different values - ## and we should treat them seperately. However, the code below + ## and we should treat them separately. However, the code below ## allows the scatter functions to work as expected, where only ## one of these values is set. if (strcmp (obj.edgecolor, "none"))
--- a/scripts/plot/util/private/__opengl_print__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/plot/util/private/__opengl_print__.m Fri Jan 17 13:27:27 2020 -0600 @@ -33,7 +33,7 @@ dos_shell = (ispc () && ! isunix ()); if (! isempty (opts.fig2dev_binary)) - ## fig2dev is prefered for conversion to emf + ## fig2dev is preferred for conversion to emf fig2dev_devices = {"pstex", "mf", "emf"}; else fig2dev_devices = {"pstex", "mf"};
--- a/scripts/polynomial/mpoles.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/polynomial/mpoles.m Fri Jan 17 13:27:27 2020 -0600 @@ -91,7 +91,7 @@ ordr = 1:Np; endif - ## Find pole multiplicty by comparing the relative differnce in the + ## Find pole multiplicity by comparing the relative difference in the ## poles. multp = zeros (Np, 1);
--- a/scripts/polynomial/residue.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/polynomial/residue.m Fri Jan 17 13:27:27 2020 -0600 @@ -290,7 +290,7 @@ ## N is the order of the resulting numerator ## pnum(1:(N+1)) is the numerator's polynomial ## pden(1:(D+1)) is the denominator's polynomial - ## pm is the multible pole for the nth residue + ## pm is the multiple pole for the nth residue ## pn is the numerator contribution for the nth residue D = numel (pden) - 1;
--- a/scripts/sparse/private/__default__input__.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/sparse/private/__default__input__.m Fri Jan 17 13:27:27 2020 -0600 @@ -41,7 +41,7 @@ ## ## @itemize @minus ## @item @var{varargout} all the input argument with filled the empty -## or missing paramenters. +## or missing parameters. ## ## @end itemize ##
--- a/scripts/strings/strtok.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/strings/strtok.m Fri Jan 17 13:27:27 2020 -0600 @@ -201,7 +201,7 @@ %! assert (t{7}, ""); %! assert (r{7}, ""); -## Simple check for 2, 3, and 4 delimeters +## Simple check for 2, 3, and 4 delimiters %!assert (strtok ("this is", "i "), "th") %!assert (strtok ("this is", "ij "), "th") %!assert (strtok ("this is", "ijk "), "th")
--- a/scripts/testfun/private/html_plot_demos_template.html Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/testfun/private/html_plot_demos_template.html Fri Jan 17 13:27:27 2020 -0600 @@ -1,7 +1,7 @@ <!DOCTYPE html> <html lang="en-US"> <head> -<title>Comparision of plots</title> +<title>Comparison of plots</title> <meta charset="utf-8"> <style> table, td, th {
--- a/scripts/time/addtodate.m Fri Jan 17 08:51:24 2020 -0800 +++ b/scripts/time/addtodate.m Fri Jan 17 13:27:27 2020 -0600 @@ -103,7 +103,7 @@ %!assert (addtodate (d, 1, "minute"), d+1/1440) %!assert (addtodate (d, 1, "second"), d+1/86400) %!assert (addtodate (d, 1, "millisecond"), d+1/86400000) -## substract one of each +## subtract one of each %!assert (addtodate (d, -1, "year"), d-365) %!assert (addtodate (d, -1, "month"), d-31) %!assert (addtodate (d, -1, "day"), d-1)
--- a/src/octave-svgconvert.cc Fri Jan 17 08:51:24 2020 -0800 +++ b/src/octave-svgconvert.cc Fri Jan 17 13:27:27 2020 -0600 @@ -491,7 +491,7 @@ QPen pen; pen.setColor (c); - // Line properies + // Line properties str = elt.attribute ("stroke-width"); if (! str.isEmpty ()) { @@ -534,7 +534,7 @@ } else if (elt.tagName () == "image") { - // Images are represented as a base64 stream of png formated data + // Images are represented as a base64 stream of png formatted data QString href_att = elt.attribute ("xlink:href"); QString prefix ("data:image/png;base64,"); QByteArray data @@ -718,7 +718,7 @@ * fmt: format of the output file. May be one of pdf or svg\n\ * dpi: device dependent resolution in screen pixel per inch\n\ * font: specify a file name for the default FreeSans font\n\ -* reconstruct: specify wether to reconstruct triangle to polygons (0 or 1)\n\ +* reconstruct: specify whether to reconstruct triangle to polygons (0 or 1)\n\ * outfile: output file name\n"; if (strcmp (argv[1], "-h") == 0)
--- a/src/shared-fcns.h Fri Jan 17 08:51:24 2020 -0800 +++ b/src/shared-fcns.h Fri Jan 17 13:27:27 2020 -0600 @@ -115,7 +115,7 @@ oh = w32_get_octave_home (); #endif - // If OCTAVE_HOME is set in the enviornment, use that. Otherwise, + // If OCTAVE_HOME is set in the environment, use that. Otherwise, // default to ${prefix} from configure. Voctave_home = (oh.empty () ? op : oh); @@ -123,7 +123,7 @@ // If OCTAVE_EXEC_HOME is set in the environment, use that. // Otherwise, if ${prefix} and ${exec_prefix} from configure are set // to the same value, use OCTAVE_HOME from the environment if it is set. - // Othewise, default to ${exec_prefix} from configure. + // Otherwise, default to ${exec_prefix} from configure. if (! oeh.empty ()) Voctave_exec_home = oeh;
--- a/test/publish/test_script.m Fri Jan 17 08:51:24 2020 -0800 +++ b/test/publish/test_script.m Fri Jan 17 13:27:27 2020 -0600 @@ -63,7 +63,7 @@ % TEXT(TM) % TEXT(R) % -% Good inlining shoud work +% Good inlining should work % *BOLD _ITALIC |MONOSPACED| TEXT_* % _ITALIC *BOLD |MONOSPACED| TEXT*_ % |MONOSPACED *BOLD _ITALIC_ TEXT*| @@ -86,7 +86,7 @@ # TEXT(TM) # TEXT(R) # -# Good inlining shoud work +# Good inlining should work # *BOLD _ITALIC |MONOSPACED| TEXT_* # _ITALIC *BOLD |MONOSPACED| TEXT*_ # |MONOSPACED *BOLD _ITALIC_ TEXT*|
--- a/test/try.tst Fri Jan 17 08:51:24 2020 -0800 +++ b/test/try.tst Fri Jan 17 13:27:27 2020 -0600 @@ -26,7 +26,7 @@ %!test %! try %! catch -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! end # "end" is part of test, check not using "end_try_catch" %!test @@ -63,7 +63,7 @@ %! try %! clear a; %! a; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! assert (lasterr()(1:13), "'a' undefined"); %! end_try_catch @@ -84,7 +84,7 @@ %! try %! clear a; %! a; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! assert (mangle (lasterr)(1:14), "<'a' undefined"); %! end_try_catch @@ -94,13 +94,13 @@ %! try %! clear a; %! a; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! assert (lasterr()(1:13), "'a' undefined"); %! end_try_catch %! clear b; %! b; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! assert (lasterr()(1:13), "'b' undefined"); %! end_try_catch @@ -109,13 +109,13 @@ %! try %! clear a; %! a; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! try %! assert (lasterr()(1:13), "'a' undefined"); %! clear b; %! b; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! assert (lasterr()(1:13), "'b' undefined"); %! end_try_catch @@ -126,7 +126,7 @@ %! try %! clear a; %! a; -%! error ("Shoudn't get here"); +%! error ("Shouldn't get here"); %! catch %! error (["rethrow: " lasterr]); %! end_try_catch