# HG changeset patch # User Rik # Date 1599579268 25200 # Node ID 2bb050267d74612f5ed10f4116ea921193ecaf3b # Parent eb35003c3851866dc8409e2b4c1fb0ba50674c0d maint: Remove trailing spaces from code base. * NEWS, __ftp__.cc, graphics.in.h, rng.m, importdata.m, condest.m, fieldnames.m, uninstall.m, polyfit.m, dec2bin.m, dec2hex.m: Remove trailing spaces from code base. diff -r eb35003c3851 -r 2bb050267d74 NEWS --- a/NEWS Fri Sep 04 14:31:33 2020 -0400 +++ b/NEWS Tue Sep 08 08:34:28 2020 -0700 @@ -47,7 +47,7 @@ and if a function uses varargout then the check is skipped for function outputs. -- As part of GSoC 2020, Abdallah K. Elshamy implemented the +- As part of GSoC 2020, Abdallah K. Elshamy implemented the `jsondecode` and `jsonencode` functions to read and write JSON data. - The function `griddata` now implements the "v4" Biharmonic Spline diff -r eb35003c3851 -r 2bb050267d74 libinterp/corefcn/__ftp__.cc --- a/libinterp/corefcn/__ftp__.cc Fri Sep 04 14:31:33 2020 -0400 +++ b/libinterp/corefcn/__ftp__.cc Tue Sep 08 08:34:28 2020 -0700 @@ -425,7 +425,7 @@ else { // FIXME: Does ascii mode need to be flagged here? - std::ifstream ifile = + std::ifstream ifile = octave::sys::ifstream (file.c_str (), std::ios::in | std::ios::binary); diff -r eb35003c3851 -r 2bb050267d74 libinterp/corefcn/graphics.in.h --- a/libinterp/corefcn/graphics.in.h Fri Sep 04 14:31:33 2020 -0400 +++ b/libinterp/corefcn/graphics.in.h Tue Sep 08 08:34:28 2020 -0700 @@ -3483,7 +3483,7 @@ // Redirect calls to "activepositionproperty" to "positionconstraint". - std::string get_activepositionproperty (void) const + std::string get_activepositionproperty (void) const { std::string cur_val; diff -r eb35003c3851 -r 2bb050267d74 scripts/general/rng.m --- a/scripts/general/rng.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/general/rng.m Tue Sep 08 08:34:28 2020 -0700 @@ -58,7 +58,7 @@ ## variable with three fields: @qcode{"Type"}, @qcode{"Seed"}, and ## @qcode{"State"}. The random number generator can be restored to the state ## @var{s} using @code{rng (@var{s})}. This is useful when the identical -## sequence of pseudo-random numbers is required for an algorithm. +## sequence of pseudo-random numbers is required for an algorithm. ## ## By default, and with the @qcode{"twister"} option, pseudo-random sequences ## are computed using the Mersenne Twister with a period of @math{2^{19937}-1} diff -r eb35003c3851 -r 2bb050267d74 scripts/io/importdata.m --- a/scripts/io/importdata.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/io/importdata.m Tue Sep 08 08:34:28 2020 -0700 @@ -215,7 +215,7 @@ else output.colheaders = ostrsplit (output.textdata{end}, delimiter); endif - + nc_hdr = numel (output.colheaders); nc_dat = numel (row_data); if (! has_rowheaders) @@ -267,7 +267,7 @@ ## User has defined a number of header rows which disagrees with the ## auto-detected number. Print a warning. if (num_header_rows < header_rows) - warning ("Octave:importdata:headerrows_mismatch", + warning ("Octave:importdata:headerrows_mismatch", "importdata: detected %d header rows, but HEADER_ROWS input configured %d rows", header_rows, num_header_rows); endif else diff -r eb35003c3851 -r 2bb050267d74 scripts/linear-algebra/condest.m --- a/scripts/linear-algebra/condest.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/linear-algebra/condest.m Tue Sep 08 08:34:28 2020 -0700 @@ -264,7 +264,7 @@ case "transp" retval = Ainvt * x; case "init" - n = rows (x); + n = rows (x); isreal_op = isreal (x); [L, U, P, Q] = deal (varargin{1:4}); Ainv = Q * (U \ (L \ P)); @@ -288,7 +288,7 @@ case "transp" retval = Ainvt \ x; case "init" - n = rows (x); + n = rows (x); isreal_op = isreal (x); [L, U, P] = deal (varargin{1:3}); Ainv = U \ (L \ P); diff -r eb35003c3851 -r 2bb050267d74 scripts/miscellaneous/fieldnames.m --- a/scripts/miscellaneous/fieldnames.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/miscellaneous/fieldnames.m Tue Sep 08 08:34:28 2020 -0700 @@ -87,7 +87,7 @@ ## Test classdef object %!test -%! m = containers.Map (); +%! m = containers.Map (); %! f = fieldnames (m); %! assert (f, {"Count"; "KeyType"; "ValueType"; "map"; "numeric_keys"}); diff -r eb35003c3851 -r 2bb050267d74 scripts/pkg/private/uninstall.m --- a/scripts/pkg/private/uninstall.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/pkg/private/uninstall.m Tue Sep 08 08:34:28 2020 -0700 @@ -122,7 +122,7 @@ endif endif if (isfolder (desc.dir)) - ## FIXME: If first call to rmdir fails, then error() will + ## FIXME: If first call to rmdir fails, then error() will ## stop further processing of getarchdir & archprefix. ## If this is, in fact, correct, then calls should ## just be shortened to rmdir (...) and let rmdir() diff -r eb35003c3851 -r 2bb050267d74 scripts/polynomial/polyfit.m --- a/scripts/polynomial/polyfit.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/polynomial/polyfit.m Tue Sep 08 08:34:28 2020 -0700 @@ -144,7 +144,7 @@ pad_output = true; ## Keep the lowest m entries in polymask idx = find (polymask); - idx((end-m+1):end) = []; + idx((end-m+1):end) = []; polymask(idx) = false; endif @@ -195,7 +195,7 @@ p = zeros (n+1, 1); p(polymask) = q; endif - p = p.'; # Return a row vector. + p = p.'; # Return a row vector. endfunction diff -r eb35003c3851 -r 2bb050267d74 scripts/strings/dec2bin.m --- a/scripts/strings/dec2bin.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/strings/dec2bin.m Tue Sep 08 08:34:28 2020 -0700 @@ -66,7 +66,7 @@ endif ## Create column vector for algorithm (output is always col. vector anyways) d = d(:); - + lt_zero_idx = (d < 0); if (any (lt_zero_idx)) ## FIXME: Need an algorithm that works with larger values such as int64. diff -r eb35003c3851 -r 2bb050267d74 scripts/strings/dec2hex.m --- a/scripts/strings/dec2hex.m Fri Sep 04 14:31:33 2020 -0400 +++ b/scripts/strings/dec2hex.m Tue Sep 08 08:34:28 2020 -0700 @@ -63,7 +63,7 @@ endif ## Create column vector for algorithm (output is always col. vector anyways) d = d(:); - + lt_zero_idx = (d < 0); if (any (lt_zero_idx)) ## FIXME: Need an algorithm that works with larger values such as int64.