changeset 20164:df437a52bcaf stable

doc: Update more docstrings to have one sentence summary as first line. Reviewed miscellaneous, sparse, strings in scripts directory. * scripts/miscellaneous/bzip2.m, scripts/miscellaneous/citation.m, scripts/miscellaneous/compare_versions.m, scripts/miscellaneous/computer.m, scripts/miscellaneous/debug.m, scripts/miscellaneous/dir.m, scripts/miscellaneous/edit.m, scripts/miscellaneous/error_ids.m, scripts/miscellaneous/fileattrib.m, scripts/miscellaneous/fullfile.m, scripts/miscellaneous/genvarname.m, scripts/miscellaneous/gzip.m, scripts/miscellaneous/mkoctfile.m, scripts/miscellaneous/news.m, scripts/miscellaneous/open.m, scripts/miscellaneous/parseparams.m, scripts/miscellaneous/recycle.m, scripts/miscellaneous/run.m, scripts/miscellaneous/swapbytes.m, scripts/miscellaneous/tar.m, scripts/miscellaneous/tmpnam.m, scripts/miscellaneous/unpack.m, scripts/miscellaneous/what.m, scripts/sparse/bicg.m, scripts/sparse/bicgstab.m, scripts/sparse/cgs.m, scripts/sparse/colperm.m, scripts/sparse/eigs.m, scripts/sparse/etreeplot.m, scripts/sparse/gmres.m, scripts/sparse/gplot.m, scripts/sparse/ichol.m, scripts/sparse/ilu.m, scripts/sparse/pcg.m, scripts/sparse/pcr.m, scripts/sparse/qmr.m, scripts/sparse/spaugment.m, scripts/sparse/spconvert.m, scripts/sparse/spdiags.m, scripts/sparse/spfun.m, scripts/sparse/spones.m, scripts/sparse/sprandsym.m, scripts/sparse/spstats.m, scripts/sparse/spy.m, scripts/sparse/svds.m, scripts/sparse/treelayout.m, scripts/sparse/treeplot.m, scripts/strings/base2dec.m, scripts/strings/bin2dec.m, scripts/strings/blanks.m, scripts/strings/cstrcat.m, scripts/strings/deblank.m, scripts/strings/dec2base.m, scripts/strings/dec2bin.m, scripts/strings/dec2hex.m, scripts/strings/findstr.m, scripts/strings/hex2dec.m, scripts/strings/index.m, scripts/strings/isletter.m, scripts/strings/isstrprop.m, scripts/strings/mat2str.m, scripts/strings/ostrsplit.m, scripts/strings/regexptranslate.m, scripts/strings/rindex.m, scripts/strings/str2num.m, scripts/strings/strcat.m, scripts/strings/strchr.m, scripts/strings/strjoin.m, scripts/strings/strjust.m, scripts/strings/strmatch.m, scripts/strings/strsplit.m, scripts/strings/strtok.m, scripts/strings/strtrim.m, scripts/strings/strtrunc.m, scripts/strings/substr.m, scripts/strings/untabify.m, scripts/time/datenum.m: Update more docstrings to have one sentence summary as first line.
author Rik <rik@octave.org>
date Mon, 04 May 2015 14:22:02 -0700
parents 075a5e2e1ba5
children f1d0f506ee78
files scripts/miscellaneous/bzip2.m scripts/miscellaneous/citation.m scripts/miscellaneous/compare_versions.m scripts/miscellaneous/computer.m scripts/miscellaneous/debug.m scripts/miscellaneous/dir.m scripts/miscellaneous/edit.m scripts/miscellaneous/error_ids.m scripts/miscellaneous/fileattrib.m scripts/miscellaneous/fullfile.m scripts/miscellaneous/genvarname.m scripts/miscellaneous/gzip.m scripts/miscellaneous/mkoctfile.m scripts/miscellaneous/news.m scripts/miscellaneous/open.m scripts/miscellaneous/parseparams.m scripts/miscellaneous/recycle.m scripts/miscellaneous/run.m scripts/miscellaneous/swapbytes.m scripts/miscellaneous/tar.m scripts/miscellaneous/tmpnam.m scripts/miscellaneous/unpack.m scripts/miscellaneous/what.m scripts/sparse/bicg.m scripts/sparse/bicgstab.m scripts/sparse/cgs.m scripts/sparse/colperm.m scripts/sparse/eigs.m scripts/sparse/etreeplot.m scripts/sparse/gmres.m scripts/sparse/gplot.m scripts/sparse/ichol.m scripts/sparse/ilu.m scripts/sparse/pcg.m scripts/sparse/pcr.m scripts/sparse/qmr.m scripts/sparse/spaugment.m scripts/sparse/spconvert.m scripts/sparse/spdiags.m scripts/sparse/spfun.m scripts/sparse/spones.m scripts/sparse/sprandsym.m scripts/sparse/spstats.m scripts/sparse/spy.m scripts/sparse/svds.m scripts/sparse/treelayout.m scripts/sparse/treeplot.m scripts/strings/base2dec.m scripts/strings/bin2dec.m scripts/strings/blanks.m scripts/strings/cstrcat.m scripts/strings/deblank.m scripts/strings/dec2base.m scripts/strings/dec2bin.m scripts/strings/dec2hex.m scripts/strings/findstr.m scripts/strings/hex2dec.m scripts/strings/index.m scripts/strings/isletter.m scripts/strings/isstrprop.m scripts/strings/mat2str.m scripts/strings/ostrsplit.m scripts/strings/regexptranslate.m scripts/strings/rindex.m scripts/strings/str2num.m scripts/strings/strcat.m scripts/strings/strchr.m scripts/strings/strjoin.m scripts/strings/strjust.m scripts/strings/strmatch.m scripts/strings/strsplit.m scripts/strings/strtok.m scripts/strings/strtrim.m scripts/strings/strtrunc.m scripts/strings/substr.m scripts/strings/untabify.m scripts/time/datenum.m
diffstat 77 files changed, 511 insertions(+), 451 deletions(-) [+]
line wrap: on
line diff
--- a/scripts/miscellaneous/bzip2.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/bzip2.m	Mon May 04 14:22:02 2015 -0700
@@ -22,11 +22,11 @@
 ## @deftypefnx {Function File} {@var{filelist} =} bzip2 (@var{files}, @var{dir})
 ## Compress the list of files specified in @var{files}.
 ##
-## @var{files} is a character array or cell array of strings.  Shell
-## wildcards in the filename such as @samp{*} or @samp{?} are accepted and
-## expanded.  Each file is compressed separately and a new file with a
-## @file{".bz2"} extension is created.  The original files are not modified,
-## but existing compressed files will be silently overwritten.
+## @var{files} is a character array or cell array of strings.  Shell wildcards
+## in the filename such as @samp{*} or @samp{?} are accepted and expanded.
+## Each file is compressed separately and a new file with a @file{".bz2"}
+## extension is created.  The original files are not modified, but existing
+## compressed files will be silently overwritten.
 ##
 ## If @var{dir} is defined the compressed files are placed in this directory,
 ## rather than the original directory where the uncompressed file resides.
--- a/scripts/miscellaneous/citation.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/citation.m	Mon May 04 14:22:02 2015 -0700
@@ -22,9 +22,11 @@
 ## Display instructions for citing GNU Octave or its packages in publications.
 ##
 ## When called without an argument, display information on how to cite the core
-## GNU Octave system.  When given a package name @var{package}, display
-## information on citing the specific named package.  Note that some packages
-## may not yet have instructions on how to cite them.
+## GNU Octave system.
+##
+## When given a package name @var{package}, display information on citing the
+## specific named package.  Note that some packages may not yet have
+## instructions on how to cite them.
 ##
 ## The GNU Octave developers and its active community of package authors have
 ## invested a lot of time and effort in creating GNU Octave as it is today.
--- a/scripts/miscellaneous/compare_versions.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/compare_versions.m	Mon May 04 14:22:02 2015 -0700
@@ -20,16 +20,15 @@
 ## @deftypefn {Function File} {} compare_versions (@var{v1}, @var{v2}, @var{operator})
 ## Compare two version strings using the given @var{operator}.
 ##
-## This function assumes that versions @var{v1} and @var{v2} are
-## arbitrarily long strings made of numeric and period characters
-## possibly followed by an arbitrary string (e.g., @qcode{"1.2.3"},
-## @qcode{"0.3"}, @qcode{"0.1.2+"}, or @qcode{"1.2.3.4-test1"}).
+## This function assumes that versions @var{v1} and @var{v2} are arbitrarily
+## long strings made of numeric and period characters possibly followed by an
+## arbitrary string (e.g., @qcode{"1.2.3"}, @qcode{"0.3"}, @qcode{"0.1.2+"},
+## or @qcode{"1.2.3.4-test1"}).
 ##
-## The version is first split into numeric and character portions
-## and then the parts are padded to be the same length (i.e., @qcode{"1.1"}
-## would be padded to be @qcode{"1.1.0"} when being compared with
-## @qcode{"1.1.1"}, and separately, the character parts of the strings are
-## padded with nulls).
+## The version is first split into numeric and character portions and then
+## the parts are padded to be the same length (i.e., @qcode{"1.1"} would be
+## padded to be @qcode{"1.1.0"} when being compared with @qcode{"1.1.1"}, and
+## separately, the character parts of the strings are padded with nulls).
 ##
 ## The operator can be any logical operator from the set
 ##
--- a/scripts/miscellaneous/computer.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/computer.m	Mon May 04 14:22:02 2015 -0700
@@ -22,8 +22,8 @@
 ## @deftypefnx {Function File} {[@var{c}, @var{maxsize}] =} computer ()
 ## @deftypefnx {Function File} {[@var{c}, @var{maxsize}, @var{endian}] =} computer ()
 ## @deftypefnx {Function File} {@var{arch} =} computer ("arch")
-## Print or return a string of the form @var{cpu}-@var{vendor}-@var{os}
-## that identifies the type of computer that Octave is running on.
+## Print or return a string of the form @var{cpu}-@var{vendor}-@var{os} that
+## identifies the type of computer that Octave is running on.
 ##
 ## If invoked with an output argument, the value is returned instead of
 ## printed.  For example:
@@ -38,13 +38,13 @@
 ## @end group
 ## @end example
 ##
-## If two output arguments are requested, also return the maximum number
-## of elements for an array.  This will depend on whether Octave has been
+## If two output arguments are requested, also return the maximum number of
+## elements for an array.  This will depend on whether Octave has been
 ## compiled with 32-bit or 64-bit index vectors.
 ##
-## If three output arguments are requested, also return the byte order
-## of the current system as a character (@qcode{"B"} for big-endian or
-## @qcode{"L"} for little-endian).
+## If three output arguments are requested, also return the byte order of the
+## current system as a character (@qcode{"B"} for big-endian or @qcode{"L"}
+## for little-endian).
 ##
 ## If the argument @qcode{"arch"} is specified, return a string indicating the
 ## architecture of the computer on which Octave is running.
--- a/scripts/miscellaneous/debug.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/debug.m	Mon May 04 14:22:02 2015 -0700
@@ -84,8 +84,8 @@
 ## @end table
 ##
 ## @noindent
-## When Octave encounters a breakpoint, or other reason to enter debug
-## mode, the prompt changes to @qcode{"debug>"}.  The workspace of the function
+## When Octave encounters a breakpoint, or other reason to enter debug mode,
+## the prompt changes to @qcode{"debug>"}.  The workspace of the function
 ## where the breakpoint was encountered becomes available and any Octave
 ## command that is valid in that workspace context may be executed.
 ##
--- a/scripts/miscellaneous/dir.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/dir.m	Mon May 04 14:22:02 2015 -0700
@@ -55,8 +55,8 @@
 ## wildcard character the wildcard must be escaped using the backslash operator
 ## @samp{\}.
 ##
-## Note that for symbolic links, @code{dir} returns information about
-## the file that the symbolic link points to rather than the link itself.
+## Note that for symbolic links, @code{dir} returns information about the
+## file that the symbolic link points to rather than the link itself. 
 ## However, if the link points to a nonexistent file, @code{dir} returns
 ## information about the link.
 ## @seealso{ls, readdir, glob, what, stat, lstat}
--- a/scripts/miscellaneous/edit.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/edit.m	Mon May 04 14:22:02 2015 -0700
@@ -22,24 +22,23 @@
 ## @deftypefnx {Command} {@var{value} =} edit get @var{field}
 ## Edit the named function, or change editor settings.
 ##
-## If @code{edit} is called with the name of a file or function as
-## its argument it will be opened in the text editor defined by @env{EDITOR}.
+## If @code{edit} is called with the name of a file or function as its
+## argument it will be opened in the text editor defined by @env{EDITOR}.
 ##
 ## @itemize @bullet
 ## @item
-## If the function @var{name} is available in a file on your path and
-## that file is modifiable, then it will be edited in place.  If it
-## is a system function, then it will first be copied to the directory
-## @env{HOME} (see below) and then edited.
-## If no file is found, then the m-file
-## variant, ending with ".m", will be considered.  If still no file
-## is found, then variants with a leading "@@" and then with both a
-## leading "@@" and trailing ".m" will be considered.
+## If the function @var{name} is available in a file on your path and that
+## file is modifiable, then it will be edited in place.  If it is a system
+## function, then it will first be copied to the directory @env{HOME} (see
+## below) and then edited.  If no file is found, then the m-file variant,
+## ending with @qcode{".m"}, will be considered.  If still no file is found,
+## then variants with a leading @qcode{"@@"} and then with both a leading
+## @qcode{"@@"} and trailing @qcode{".m"} will be considered.
 ##
 ## @item
-## If @var{name} is the name of a function defined in the interpreter but
-## not in an m-file, then an m-file will be created in @env{HOME}
-## to contain that function along with its current definition.
+## If @var{name} is the name of a function defined in the interpreter but not
+## in an m-file, then an m-file will be created in @env{HOME} to contain that
+## function along with its current definition.
 ##
 ## @item
 ## If @code{@var{name}.cc} is specified, then it will search for
@@ -55,34 +54,35 @@
 ## it will be copied to @env{HOME} before editing.
 ##
 ## @strong{Warning:} You may need to clear @var{name} before the new definition
-## is available.  If you are editing a .cc file, you will need
-## to execute @code{mkoctfile @file{@var{name}.cc}} before the definition
-## will be available.
+## is available.  If you are editing a .cc file, you will need to execute
+## @code{mkoctfile @file{@var{name}.cc}} before the definition will be
+## available.
 ## @end itemize
 ##
-## If @code{edit} is called with @var{field} and @var{value} variables,
-## the value of the control field @var{field} will be set to @var{value}.
-## If an output argument is requested and the first input argument is @code{get}
-## then @code{edit} will return the value of the control field @var{field}.
+## If @code{edit} is called with @var{field} and @var{value} variables, the
+## value of the control field @var{field} will be set to @var{value}.  If an
+## output argument is requested and the first input argument is @code{get}
+## then @code{edit} will return the value of the control field @var{field}. 
 ## If the control field does not exist, edit will return a structure
-## containing all fields and values.  Thus, @code{edit get all} returns
-## a complete control structure.
+## containing all fields and values.  Thus, @code{edit get all} returns a
+## complete control structure.
+##
 ## The following control fields are used:
 ##
 ## @table @samp
 ## @item home
-## This is the location of user local m-files.  Be sure it is in your
-## path.  The default is @file{~/octave}.
+## This is the location of user local m-files.  Be sure it is in your path. 
+## The default is @file{~/octave}.
 ##
 ## @item author
-## This is the name to put after the "## Author:" field of new functions.
-## By default it guesses from the @code{gecos} field of the password database.
+## This is the name to put after the "## Author:" field of new functions.  By
+## default it guesses from the @code{gecos} field of the password database.
 ##
 ## @item email
-## This is the e-mail address to list after the name in the author field.
-## By default it guesses @code{<$LOGNAME@@$HOSTNAME>}, and if @code{$HOSTNAME}
-## is not defined it uses @code{uname -n}.  You probably want to override this.
-## Be sure to use the format @code{<user@@host>}.
+## This is the e-mail address to list after the name in the author field.  By
+## default it guesses @code{<$LOGNAME@@$HOSTNAME>}, and if @code{$HOSTNAME}
+## is not defined it uses @code{uname -n}.  You probably want to override
+## this.  Be sure to use the format @code{@email{user@@host}}.
 ##
 ## @item license
 ##
--- a/scripts/miscellaneous/error_ids.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/error_ids.m	Mon May 04 14:22:02 2015 -0700
@@ -40,8 +40,8 @@
 ## Indicates that memory couldn't be allocated.
 ##
 ## @item Octave:undefined-function
-## Indicates a call to a function that is not defined.  The function may
-## exist but Octave is unable to find it in the search path.
+## Indicates a call to a function that is not defined.  The function may exist
+## but Octave is unable to find it in the search path.
 ##
 ## @end table
 ##
--- a/scripts/miscellaneous/fileattrib.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/fileattrib.m	Mon May 04 14:22:02 2015 -0700
@@ -20,8 +20,8 @@
 ## @deftypefn {Function File} {[@var{status}, @var{result}, @var{msgid}] =} fileattrib (@var{file})
 ## Return information about @var{file}.
 ##
-## If successful, @var{status} is 1, with @var{result} containing a
-## structure with the following fields:
+## If successful, @var{status} is 1, with @var{result} containing a structure
+## with the following fields:
 ##
 ## @table @code
 ## @item Name
@@ -42,30 +42,26 @@
 ## @item  UserRead
 ## @itemx GroupRead
 ## @itemx OtherRead
-## True if the user (group; other users) has read permission for
-## @var{file}.
+## True if the user (group; other users) has read permission for @var{file}.
 ##
 ## @item  UserWrite
 ## @itemx GroupWrite
 ## @itemx OtherWrite
-## True if the user (group; other users) has write permission for
-## @var{file}.
+## True if the user (group; other users) has write permission for @var{file}.
 ##
 ## @item  UserExecute
 ## @itemx GroupExecute
 ## @itemx OtherExecute
-## True if the user (group; other users) has execute permission for
-## @var{file}.
+## True if the user (group; other users) has execute permission for @var{file}.
 ## @end table
 ##
-## If an attribute does not apply (i.e., archive on a Unix system) then
-## the field is set to NaN.
+## If an attribute does not apply (i.e., archive on a Unix system) then the
+## field is set to NaN.
 ##
-## With no input arguments, return information about the current
-## directory.
+## With no input arguments, return information about the current directory.
 ##
-## If @var{file} contains globbing characters, return information about
-## all the matching files.
+## If @var{file} contains globbing characters, return information about all
+## the matching files.
 ## @seealso{glob}
 ## @end deftypefn
 
--- a/scripts/miscellaneous/fullfile.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/fullfile.m	Mon May 04 14:22:02 2015 -0700
@@ -21,8 +21,8 @@
 ## @deftypefnx {Function File} {@var{filenames} =} fullfile (@dots{}, @var{files})
 ## Build complete filename from separate parts.
 ##
-## Joins any number of path components intelligently.  The return value
-## is the concatenation of each component with exactly one file separator
+## Joins any number of path components intelligently.  The return value is
+## the concatenation of each component with exactly one file separator
 ## between each non empty part and at most one leading and/or trailing file
 ## separator.
 ##
@@ -38,9 +38,9 @@
 ## @end group
 ## @end example
 ##
-## On Windows systems, while forward slash file separators do work, they
-## are replaced by backslashes; in addition drive letters are stripped of
-## leading file separators to obtain a valid file path.
+## On Windows systems, while forward slash file separators do work, they are
+## replaced by backslashes; in addition drive letters are stripped of leading
+## file separators to obtain a valid file path.
 ##
 ## @seealso{fileparts, filesep}
 ## @end deftypefn
--- a/scripts/miscellaneous/genvarname.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/genvarname.m	Mon May 04 14:22:02 2015 -0700
@@ -21,8 +21,8 @@
 ## @deftypefnx {Function File} {@var{varname} =} genvarname (@var{str}, @var{exclusions})
 ## Create valid unique variable name(s) from @var{str}.
 ##
-## If @var{str} is a cellstr, then a unique variable is created for each
-## cell in @var{str}.
+## If @var{str} is a cellstr, then a unique variable is created for each cell
+## in @var{str}.
 ##
 ## @example
 ## @group
@@ -36,8 +36,8 @@
 ## @end example
 ##
 ## If @var{exclusions} is given, then the variable(s) will be unique to each
-## other and to @var{exclusions} (@var{exclusions} may be either a string or
-## a cellstr).
+## other and to @var{exclusions} (@var{exclusions} may be either a string or a
+## cellstr).
 ##
 ## @example
 ## @group
@@ -48,8 +48,8 @@
 ## @end example
 ##
 ## Note that the result is a char array or cell array of strings, not the
-## variables themselves.  To define a variable, @code{eval()} can be
-## used.  The following trivial example sets @code{x} to @code{42}.
+## variables themselves.  To define a variable, @code{eval()} can be used. 
+## The following trivial example sets @code{x} to @code{42}.
 ##
 ## @example
 ## @group
@@ -78,8 +78,8 @@
 ##
 ## Since variable names may only contain letters, digits, and underscores,
 ## @code{genvarname} will replace any sequence of disallowed characters with
-## an underscore.  Also, variables may not begin with a digit; in this
-## case an @samp{x} is added before the variable name.
+## an underscore.  Also, variables may not begin with a digit; in this case
+## an @samp{x} is added before the variable name.
 ##
 ## Variable names beginning and ending with two underscores @qcode{"__"} are
 ## valid, but they are used internally by Octave and should generally be
--- a/scripts/miscellaneous/gzip.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/gzip.m	Mon May 04 14:22:02 2015 -0700
@@ -21,16 +21,16 @@
 ## @deftypefnx {Function File} {@var{filelist} =} gzip (@var{files}, @var{dir})
 ## Compress the list of files and directories specified in @var{files}.
 ##
-## @var{files} is a character array or cell array of strings.  Shell
-## wildcards in the filename such as @samp{*} or @samp{?} are accepted and
-## expanded.  Each file is compressed separately and a new file with a
-## @file{".gz"} extension is created.  The original files are not modified,
-## but existing compressed files will be silently overwritten.  If a directory
-## is specified then @code{gzip} recursively compresses all files in the
+## @var{files} is a character array or cell array of strings.  Shell wildcards
+## in the filename such as @samp{*} or @samp{?} are accepted and expanded.
+## Each file is compressed separately and a new file with a @file{".gz"}
+## extension is created.  The original files are not modified, but existing
+## compressed files will be silently overwritten.  If a directory is
+## specified then @code{gzip} recursively compresses all files in the
 ## directory.
 ##
 ## If @var{dir} is defined the compressed files are placed in this directory,
-## rather than the original directory where the uncompressed file resides.
+## rather than the original directory where the uncompressed file resides. 
 ## If @var{dir} does not exist it is created.
 ##
 ## The optional output @var{filelist} is a list of the compressed files.
--- a/scripts/miscellaneous/mkoctfile.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/mkoctfile.m	Mon May 04 14:22:02 2015 -0700
@@ -20,15 +20,15 @@
 ## @deftypefn  {Command} {} mkoctfile [-options] file @dots{}
 ## @deftypefnx {Function File} {[@var{output}, @var{status}] =} mkoctfile (@dots{})
 ##
-## The @code{mkoctfile} function compiles source code written in C,
-## C++, or Fortran.  Depending on the options used with @code{mkoctfile}, the
+## The @code{mkoctfile} function compiles source code written in C, C++, or
+## Fortran.  Depending on the options used with @code{mkoctfile}, the
 ## compiled code can be called within Octave or can be used as a stand-alone
 ## application.
 ##
 ## @code{mkoctfile} can be called from the shell prompt or from the Octave
-## prompt.  Calling it from the Octave prompt simply delegates the
-## call to the shell prompt.  The output is stored in the @var{output}
-## variable and the exit status in the @var{status} variable.
+## prompt.  Calling it from the Octave prompt simply delegates the call to
+## the shell prompt.  The output is stored in the @var{output} variable and
+## the exit status in the @var{status} variable.
 ##
 ## @code{mkoctfile} accepts the following options, all of which are optional
 ## except for the file name of the code you wish to compile:
@@ -69,9 +69,8 @@
 ##
 ## @item  -o FILE
 ## @itemx --output FILE
-## Output file name.  Default extension is .oct
-## (or .mex if @samp{--mex} is specified) unless linking
-## a stand-alone executable.
+## Output file name.  Default extension is .oct (or .mex if @samp{--mex} is
+## specified) unless linking a stand-alone executable.
 ##
 ## @item  -p VAR
 ## @itemx --print VAR
@@ -111,8 +110,8 @@
 ## Link a stand-alone executable file.
 ##
 ## @item --mex
-## Assume we are creating a MEX file.  Set the default output extension
-## to ".mex".
+## Assume we are creating a MEX file.  Set the default output extension to
+## ".mex".
 ##
 ## @item  -s
 ## @itemx --strip
--- a/scripts/miscellaneous/news.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/news.m	Mon May 04 14:22:02 2015 -0700
@@ -22,6 +22,7 @@
 ## Display the current NEWS file for Octave or an installed package.
 ##
 ## When called without an argument, display the NEWS file for Octave.
+##
 ## When given a package name @var{package}, display the current NEWS file for
 ## that package.
 ## @seealso{ver, pkg}
--- a/scripts/miscellaneous/open.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/open.m	Mon May 04 14:22:02 2015 -0700
@@ -19,8 +19,8 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {@var{output} =} open @var{file}
 ## @deftypefnx {Function File} {@var{output} =} open (@var{file})
-## Open the file @var{file} in Octave or in an external application
-## based on the file type as determined by the file name extension.
+## Open the file @var{file} in Octave or in an external application based on
+## the file type as determined by the file name extension.
 ##
 ## Recognized file types are
 ##
--- a/scripts/miscellaneous/parseparams.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/parseparams.m	Mon May 04 14:22:02 2015 -0700
@@ -21,8 +21,10 @@
 ## @deftypefn  {Function File} {[@var{reg}, @var{prop}] =} parseparams (@var{params})
 ## @deftypefnx {Function File} {[@var{reg}, @var{var1}, @dots{}] =} parseparams (@var{params}, @var{name1}, @var{default1}, @dots{})
 ## Return in @var{reg} the cell elements of @var{param} up to the first
-## string element and in @var{prop} all remaining elements beginning
-## with the first string element.  For example:
+## string element and in @var{prop} all remaining elements beginning with the
+## first string element.
+##
+## For example:
 ##
 ## @example
 ## @group
@@ -40,16 +42,18 @@
 ## @end group
 ## @end example
 ##
-## The parseparams function may be used to separate regular numeric
-## arguments from additional arguments given as property/value pairs of
-## the @var{varargin} cell array.
+## The parseparams function may be used to separate regular numeric arguments
+## from additional arguments given as property/value pairs of the
+## @var{varargin} cell array.
 ##
 ## In the second form of the call, available options are specified directly
-## with their default values given as name-value pairs.
-## If @var{params} do not form name-value pairs, or if an option occurs
-## that does not match any of the available options, an error occurs.
-## When called from an m-file function, the error is prefixed with the
-## name of the caller function.
+## with their default values given as name-value pairs.  If @var{params} do
+## not form name-value pairs, or if an option occurs that does not match any
+## of the available options, an error occurs.
+##
+## When called from an m-file function, the error is prefixed with the name
+## of the caller function.
+##
 ## The matching of options is case-insensitive.
 ##
 ## @seealso{varargin, inputParser}
--- a/scripts/miscellaneous/recycle.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/recycle.m	Mon May 04 14:22:02 2015 -0700
@@ -27,8 +27,7 @@
 ##
 ## Programming Note: This function is provided for @sc{matlab} compatibility,
 ## but recycling is not implemented in Octave.  To help avoid accidental data
-## loss an error will be raised if an attempt is made to enable file
-## recycling.
+## loss an error will be raised if an attempt is made to enable file recycling.
 ## @seealso{delete, rmdir}
 ## @end deftypefn
 
--- a/scripts/miscellaneous/run.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/run.m	Mon May 04 14:22:02 2015 -0700
@@ -21,9 +21,9 @@
 ## @deftypefnx {Function File} {} run ("@var{script}")
 ## Run @var{script} in the current workspace.
 ##
-## Scripts which reside in directories specified in Octave's load
-## path, and which end with the extension @file{".m"}, can be run simply by
-## typing their name.  For scripts not located on the load path, use @code{run}.
+## Scripts which reside in directories specified in Octave's load path, and
+## which end with the extension @file{".m"}, can be run simply by typing
+## their name.  For scripts not located on the load path, use @code{run}.
 ##
 ## The file name @var{script} can be a bare, fully qualified, or relative
 ## filename and with or without a file extension.  If no extension is specified,
--- a/scripts/miscellaneous/swapbytes.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/swapbytes.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,8 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} swapbytes (@var{x})
-## Swap the byte order on values, converting from little endian to big
-## endian and vice versa.
+## Swap the byte order on values, converting from little endian to big endian
+## and vice versa.
 ##
 ## For example:
 ##
--- a/scripts/miscellaneous/tar.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/tar.m	Mon May 04 14:22:02 2015 -0700
@@ -22,10 +22,10 @@
 ## Pack the list of files and directories specified in @var{files} into the
 ## TAR archive @var{tarfile}.
 ##
-## @var{files} is a character array or cell array of strings.  Shell
-## wildcards in the filename such as @samp{*} or @samp{?} are accepted and
-## expanded.  Directories are recursively traversed and all files are added to
-## the archive.
+## @var{files} is a character array or cell array of strings.  Shell wildcards
+## in the filename such as @samp{*} or @samp{?} are accepted and expanded.
+## Directories are recursively traversed and all files are added to the
+## archive.
 ##
 ## If @var{rootdir} is defined then any files without absolute pathnames are
 ## located relative to @var{rootdir} rather than the current directory.
--- a/scripts/miscellaneous/tmpnam.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/tmpnam.m	Mon May 04 14:22:02 2015 -0700
@@ -23,6 +23,7 @@
 ## Return a unique temporary file name as a string.
 ##
 ## If @var{prefix} is omitted, a value of @qcode{"oct-"} is used.
+##
 ## If @var{dir} is also omitted, the default directory for temporary files
 ## (@code{P_tmpdir} is used.  If @var{dir} is provided, it must exist,
 ## otherwise the default directory for temporary files is used.
--- a/scripts/miscellaneous/unpack.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/unpack.m	Mon May 04 14:22:02 2015 -0700
@@ -24,8 +24,8 @@
 ## @var{dir}.
 ##
 ## If @var{file} is a list of strings, then each file is unpacked
-## individually.  Shell wildcards in the filename such as @samp{*} or @samp{?}
-## are accepted and expanded.
+## individually.  Shell wildcards in the filename such as @samp{*} or
+## @samp{?} are accepted and expanded.
 ##
 ## If @var{dir} is not specified or is empty (@code{[]}), it defaults to the
 ## current directory.  If a directory is in the file list, then @var{filetype}
--- a/scripts/miscellaneous/what.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/miscellaneous/what.m	Mon May 04 14:22:02 2015 -0700
@@ -59,9 +59,9 @@
 ## Cell array of package directories (@file{+@var{pkgname}/})
 ## @end table
 ##
-## Compatibility Note: Octave does not support mdl, slx, and p files; nor
-## does it support package directories.  @code{what} will always return an
-## empty list for these categories.
+## Compatibility Note: Octave does not support mdl, slx, and p files; nor does
+## it support package directories.  @code{what} will always return an empty
+## list for these categories.
 ## @seealso{which, ls, exist}
 ## @end deftypefn
 
--- a/scripts/sparse/bicg.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/bicg.m	Mon May 04 14:22:02 2015 -0700
@@ -23,26 +23,25 @@
 ## Solve @code{A x = b} using the Bi-conjugate gradient iterative method.
 ##
 ## @itemize @minus
-## @item @var{rtol} is the relative tolerance, if not given
-## or set to [] the default value 1e-6 is used.
+## @item @var{rtol} is the relative tolerance, if not given or set to [] the
+## default value 1e-6 is used.
 ##
-## @item @var{maxit} the maximum number of outer iterations,
-## if not given or set to [] the default value
-## @code{min (20, numel (b))} is used.
+## @item @var{maxit} the maximum number of outer iterations, if not given or
+## set to [] the default value @code{min (20, numel (b))} is used.
 ##
-## @item @var{x0} the initial guess, if not given or set to []
-## the default value @code{zeros (size (b))} is used.
+## @item @var{x0} the initial guess, if not given or set to [] the default
+## value @code{zeros (size (b))} is used.
 ## @end itemize
 ##
-## @var{A} can be passed as a matrix or as a function handle or
-## inline function @code{f} such that @code{f(x, "notransp") = A*x}
-## and @code{f(x, "transp") = A'*x}.
+## @var{A} can be passed as a matrix or as a function handle or inline function
+## @code{f} such that @code{f(x, "notransp") = A*x} and
+## @code{f(x, "transp") = A'*x}.
 ##
-## The preconditioner @var{P} is given as @code{P = M1 * M2}.
-## Both @var{M1} and @var{M2} can be passed as a matrix or as
-## a function handle or inline function @code{g} such that
-## @code{g(x, "notransp") = M1 \ x} or @code{g(x, "notransp") = M2 \ x} and
-## @code{g(x, "transp") = M1' \ x} or @code{g(x, "transp") = M2' \ x}.
+## The preconditioner @var{P} is given as @code{P = M1 * M2}.  Both @var{M1}
+## and @var{M2} can be passed as a matrix or as a function handle or inline
+## function @code{g} such that @code{g(x, "notransp") = M1 \ x} or
+## @code{g(x, "notransp") = M2 \ x} and @code{g(x, "transp") = M1' \ x} or
+## @code{g(x, "transp") = M2' \ x}.
 ##
 ## If called with more than one output parameter
 ##
--- a/scripts/sparse/bicgstab.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/bicgstab.m	Mon May 04 14:22:02 2015 -0700
@@ -25,24 +25,22 @@
 ## method.
 ##
 ## @itemize @minus
-## @item @var{rtol} is the relative tolerance, if not given or set to
-## [] the default value 1e-6 is used.
+## @item @var{rtol} is the relative tolerance, if not given or set to [] the
+## default value 1e-6 is used.
 ##
-## @item @var{maxit} the maximum number of outer iterations, if not
-## given or set to [] the default value @code{min (20, numel (b))} is
-## used.
+## @item @var{maxit} the maximum number of outer iterations, if not given or
+## set to [] the default value @code{min (20, numel (b))} is used.
 ##
-## @item @var{x0} the initial guess, if not given or set to [] the
-## default value @code{zeros (size (b))} is used.
+## @item @var{x0} the initial guess, if not given or set to [] the default
+## value @code{zeros (size (b))} is used.
 ## @end itemize
 ##
-## @var{A} can be passed as a matrix or as a function handle or
-## inline function @code{f} such that @code{f(x) = A*x}.
+## @var{A} can be passed as a matrix or as a function handle or inline
+## function @code{f} such that @code{f(x) = A*x}.
 ##
-## The preconditioner @var{P} is given as @code{P = M1 * M2}.
-## Both @var{M1} and @var{M2} can be passed as a matrix or as a function
-## handle or inline function @code{g} such that @code{g(x) = M1 \ x} or
-## @code{g(x) = M2 \ x}.
+## The preconditioner @var{P} is given as @code{P = M1 * M2}.  Both @var{M1}
+## and @var{M2} can be passed as a matrix or as a function handle or inline
+## function @code{g} such that @code{g(x) = M1 \ x} or @code{g(x) = M2 \ x}.
 ##
 ## If called with more than one output parameter
 ##
--- a/scripts/sparse/cgs.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/cgs.m	Mon May 04 14:22:02 2015 -0700
@@ -25,24 +25,22 @@
 ## Conjugate Gradients Squared method.
 ##
 ## @itemize @minus
-## @item @var{rtol} is the relative tolerance, if not given or set to []
-## the default value 1e-6 is used.
+## @item @var{rtol} is the relative tolerance, if not given or set to [] the
+## default value 1e-6 is used.
 ##
-## @item @var{maxit} the maximum number of outer iterations, if not
-## given or set to [] the default value @code{min (20, numel (b))} is
-## used.
+## @item @var{maxit} the maximum number of outer iterations, if not given or
+## set to [] the default value @code{min (20, numel (b))} is used.
 ##
-## @item @var{x0} the initial guess, if not given or set to [] the
-## default value @code{zeros (size (b))} is used.
+## @item @var{x0} the initial guess, if not given or set to [] the default
+## value @code{zeros (size (b))} is used.
 ## @end itemize
 ##
-## @var{A} can be passed as a matrix or as a function handle or
-## inline function @code{f} such that @code{f(x) = A*x}.
+## @var{A} can be passed as a matrix or as a function handle or inline
+## function @code{f} such that @code{f(x) = A*x}.
 ##
-## The preconditioner @var{P} is given as @code{P = M1 * M2}.
-## Both @var{M1} and @var{M2} can be passed as a matrix or as a function
-## handle or inline function @code{g} such that @code{g(x) = M1 \ x} or
-## @code{g(x) = M2 \ x}.
+## The preconditioner @var{P} is given as @code{P = M1 * M2}.  Both @var{M1}
+## and @var{M2} can be passed as a matrix or as a function handle or inline
+## function @code{g} such that @code{g(x) = M1 \ x} or @code{g(x) = M2 \ x}.
 ##
 ## If called with more than one output parameter
 ##
--- a/scripts/sparse/colperm.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/colperm.m	Mon May 04 14:22:02 2015 -0700
@@ -19,10 +19,12 @@
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {@var{p} =} colperm (@var{s})
 ## Return the column permutations such that the columns of
-## @code{@var{s} (:, @var{p})} are ordered in terms of increase number
-## of nonzero elements.  If @var{s} is symmetric, then @var{p} is chosen
-## such that @code{@var{s} (@var{p}, @var{p})} orders the rows and
-## columns with increasing number of nonzeros elements.
+## @code{@var{s} (:, @var{p})} are ordered in terms of increasing number of
+## nonzero elements.
+##
+## If @var{s} is symmetric, then @var{p} is chosen such that
+## @code{@var{s} (@var{p}, @var{p})} orders the rows and columns with
+## increasing number of nonzeros elements.
 ## @end deftypefn
 
 function p = colperm (s)
--- a/scripts/sparse/eigs.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/eigs.m	Mon May 04 14:22:02 2015 -0700
@@ -38,8 +38,10 @@
 ## @deftypefnx {Function File} {[@var{V}, @var{d}, @var{flag}] =} eigs (@var{A}, @dots{})
 ## @deftypefnx {Function File} {[@var{V}, @var{d}, @var{flag}] =} eigs (@var{af}, @var{n}, @dots{})
 ## Calculate a limited number of eigenvalues and eigenvectors of @var{A},
-## based on a selection criteria.  The number of eigenvalues and eigenvectors to
-## calculate is given by @var{k} and defaults to 6.
+## based on a selection criteria.
+##
+## The number of eigenvalues and eigenvectors to calculate is given by
+## @var{k} and defaults to 6.
 ##
 ## By default, @code{eigs} solve the equation
 ## @tex
@@ -147,13 +149,13 @@
 ##
 ## It is also possible to represent @var{A} by a function denoted @var{af}.
 ## @var{af} must be followed by a scalar argument @var{n} defining the length
-## of the vector argument accepted by @var{af}.  @var{af} can be
-## a function handle, an inline function, or a string.  When @var{af} is a
-## string it holds the name of the function to use.
+## of the vector argument accepted by @var{af}.  @var{af} can be a function
+## handle, an inline function, or a string.  When @var{af} is a string it
+## holds the name of the function to use.
 ##
-## @var{af} is a function of the form @code{y = af (x)}
-## where the required return value of @var{af} is determined by
-## the value of @var{sigma}.  The four possible forms are
+## @var{af} is a function of the form @code{y = af (x)} where the required
+## return value of @var{af} is determined by the value of @var{sigma}.  The
+## four possible forms are
 ##
 ## @table @code
 ## @item A * x
@@ -163,8 +165,8 @@
 ## if @var{sigma} is 0 or "sm".
 ##
 ## @item (A - sigma * I) \ x
-## for the standard eigenvalue problem, where @code{I} is the identity matrix of
-## the same size as @var{A}.
+## for the standard eigenvalue problem, where @code{I} is the identity matrix
+## of the same size as @var{A}.
 ##
 ## @item (A - sigma * B) \ x
 ## for the general eigenvalue problem.
--- a/scripts/sparse/etreeplot.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/etreeplot.m	Mon May 04 14:22:02 2015 -0700
@@ -20,9 +20,10 @@
 ## @deftypefn  {Function File} {} etreeplot (@var{A})
 ## @deftypefnx {Function File} {} etreeplot (@var{A}, @var{node_style}, @var{edge_style})
 ## Plot the elimination tree of the matrix @var{A} or
-## @tcode{@var{A}+@var{A}'} if @var{A} in not symmetric.  The optional
-## parameters @var{node_style} and @var{edge_style} define the output
-## style.
+## @tcode{@var{A}+@var{A}'} if @var{A} in not symmetric.
+##
+## The optional parameters @var{node_style} and @var{edge_style} define the
+## output style.
 ## @seealso{treeplot, gplot}
 ## @end deftypefn
 
--- a/scripts/sparse/gmres.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/gmres.m	Mon May 04 14:22:02 2015 -0700
@@ -20,16 +20,15 @@
 ## @deftypefn  {Function File} {@var{x} =} gmres (@var{A}, @var{b}, @var{m}, @var{rtol}, @var{maxit}, @var{M1}, @var{M2}, @var{x0})
 ## @deftypefnx {Function File} {@var{x} =} gmres (@var{A}, @var{b}, @var{m}, @var{rtol}, @var{maxit}, @var{P})
 ## @deftypefnx {Function File} {[@var{x}, @var{flag}, @var{relres}, @var{iter}, @var{resvec}] =} gmres (@dots{})
-## Solve @code{A x = b} using the Preconditioned GMRES iterative method
-## with restart, a.k.a. PGMRES(m).
+## Solve @code{A x = b} using the Preconditioned GMRES iterative method with
+## restart, a.k.a. PGMRES(m).
 ##
 ## @itemize @minus
 ## @item @var{rtol} is the relative tolerance,
 ## if not given or set to [] the default value 1e-6 is used.
 ##
-## @item @var{maxit} is the maximum number of outer iterations,
-## if not given or set to [] the default value
-## @code{min (10, numel (b) / restart)} is used.
+## @item @var{maxit} is the maximum number of outer iterations, if not given or
+## set to [] the default value @code{min (10, numel (b) / restart)} is used.
 ##
 ## @item @var{x0} is the initial guess,
 ## if not given or set to [] the default value @code{zeros (size (b))} is used.
@@ -38,12 +37,12 @@
 ## if not given or set to [] the default value @code{numel (b)} is used.
 ## @end itemize
 ##
-## Argument @var{A} can be passed as a matrix, function handle, or
-## inline function @code{f} such that @code{f(x) = A*x}.
+## Argument @var{A} can be passed as a matrix, function handle, or inline
+## function @code{f} such that @code{f(x) = A*x}.
 ##
-## The preconditioner @var{P} is given as @code{P = M1 * M2}.
-## Both @var{M1} and @var{M2} can be passed as a matrix, function handle, or
-## inline function @code{g} such that @code{g(x) = M1\x} or @code{g(x) = M2\x}.
+## The preconditioner @var{P} is given as @code{P = M1 * M2}.  Both @var{M1}
+## and @var{M2} can be passed as a matrix, function handle, or inline function
+## @code{g} such that @code{g(x) = M1\x} or @code{g(x) = M2\x}.
 ##
 ## Besides the vector @var{x}, additional outputs are:
 ##
--- a/scripts/sparse/gplot.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/gplot.m	Mon May 04 14:22:02 2015 -0700
@@ -20,15 +20,14 @@
 ## @deftypefn  {Function File} {} gplot (@var{A}, @var{xy})
 ## @deftypefnx {Function File} {} gplot (@var{A}, @var{xy}, @var{line_style})
 ## @deftypefnx {Function File} {[@var{x}, @var{y}] =} gplot (@var{A}, @var{xy})
-## Plot a graph defined by @var{A} and @var{xy} in the graph theory
-## sense.  @var{A} is the adjacency matrix of the array to be plotted
-## and @var{xy} is an @var{n}-by-2 matrix containing the coordinates of
-## the nodes of the graph.
+## Plot a graph defined by @var{A} and @var{xy} in the graph theory sense.
 ##
-## The optional parameter @var{line_style} defines the output style for
-## the plot.  Called with no output arguments the graph is plotted
-## directly.  Otherwise, return the coordinates of the plot in @var{x}
-## and @var{y}.
+## @var{A} is the adjacency matrix of the array to be plotted and @var{xy} is
+## an @var{n}-by-2 matrix containing the coordinates of the nodes of the graph.
+##
+## The optional parameter @var{line_style} defines the output style for the
+## plot.  Called with no output arguments the graph is plotted directly. 
+## Otherwise, return the coordinates of the plot in @var{x} and @var{y}.
 ## @seealso{treeplot, etreeplot, spy}
 ## @end deftypefn
 
--- a/scripts/sparse/ichol.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/ichol.m	Mon May 04 14:22:02 2015 -0700
@@ -81,12 +81,12 @@
 ##
 ## @table @asis
 ## @item @qcode{"lower"} (default)
-## Use only the lower triangle of @var{A} and return a lower triangular
-## factor @var{L} such that @tcode{L*L'} approximates @var{A}.
+## Use only the lower triangle of @var{A} and return a lower triangular factor
+## @var{L} such that @tcode{L*L'} approximates @var{A}.
 ##
 ## @item @qcode{"upper"}
-## Use only the upper triangle of @var{A} and return an upper triangular
-## factor @var{U} such that @code{U'*U} approximates @var{A}.
+## Use only the upper triangle of @var{A} and return an upper triangular factor
+## @var{U} such that @code{U'*U} approximates @var{A}.
 ## @end table
 ## @end table
 ##
--- a/scripts/sparse/ilu.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/ilu.m	Mon May 04 14:22:02 2015 -0700
@@ -134,8 +134,8 @@
 ## @end group
 ## @end example
 ##
-## This shows that @var{A} has 7,840 nonzeros, the complete LU factorization has
-## 126,478 nonzeros, and the incomplete LU factorization, with 0 level of
+## This shows that @var{A} has 7,840 nonzeros, the complete LU factorization
+## has 126,478 nonzeros, and the incomplete LU factorization, with 0 level of
 ## fill-in, has 7,840 nonzeros, the same amount as @var{A}.  Taken from:
 ## http://www.mathworks.com/help/matlab/ref/ilu.html
 ##
--- a/scripts/sparse/pcg.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/pcg.m	Mon May 04 14:22:02 2015 -0700
@@ -21,8 +21,9 @@
 ## @deftypefnx {Function File} {[@var{x}, @var{flag}, @var{relres}, @var{iter}, @var{resvec}, @var{eigest}] =} pcg (@dots{})
 ##
 ## Solve the linear system of equations @w{@code{@var{A} * @var{x} = @var{b}}}
-## by means of the Preconditioned Conjugate Gradient iterative method.  The
-## input arguments are
+## by means of the Preconditioned Conjugate Gradient iterative method.
+##
+## The input arguments are
 ##
 ## @itemize
 ## @item
@@ -52,14 +53,13 @@
 ## the iteration is (theoretically) equivalent to solving by @code{pcg}
 ## @w{@code{@var{P} * @var{x} = @var{m} \ @var{b}}}, with
 ## @w{@code{@var{P} = @var{m} \ @var{A}}}.
-## Note that a proper choice of the preconditioner may dramatically
-## improve the overall performance of the method.  Instead of matrices
-## @var{m1} and @var{m2}, the user may pass two functions which return
-## the results of applying the inverse of @var{m1} and @var{m2} to
-## a vector (usually this is the preferred way of using the preconditioner).
-## If @var{m1} is omitted or empty @code{[]} then no preconditioning is
-## applied.  If @var{m2} is omitted, @var{m} = @var{m1} will be used as
-## a preconditioner.
+## Note that a proper choice of the preconditioner may dramatically improve
+## the overall performance of the method.  Instead of matrices @var{m1} and
+## @var{m2}, the user may pass two functions which return the results of
+## applying the inverse of @var{m1} and @var{m2} to a vector (usually this is
+## the preferred way of using the preconditioner).  If @var{m1} is omitted or
+## empty @code{[]} then no preconditioning is applied.  If @var{m2} is
+## omitted, @var{m} = @var{m1} will be used as a preconditioner.
 ##
 ## @item
 ## @var{x0} is the initial guess.  If @var{x0} is omitted or empty then the
@@ -154,16 +154,16 @@
 ## @end example
 ##
 ## @sc{Example 4:} @code{pcg} with a preconditioner: @var{l} * @var{u}.
-## Faster than @sc{Example 3} since lower and upper triangular matrices
-## are easier to invert
+## Faster than @sc{Example 3} since lower and upper triangular matrices are
+## easier to invert
 ##
 ## @example
 ## x = pcg (A, b, 1.e-6, 500, l, u)
 ## @end example
 ##
 ## @sc{Example 5:} Preconditioned iteration, with full diagnostics.  The
-## preconditioner (quite strange, because even the original matrix
-## @var{A} is trivial) is defined as a function
+## preconditioner (quite strange, because even the original matrix @var{A} is
+## trivial) is defined as a function
 ##
 ## @example
 ## @group
@@ -179,8 +179,8 @@
 ## @end group
 ## @end example
 ##
-## @sc{Example 6:} Finally, a preconditioner which depends on a
-## parameter @var{k}.
+## @sc{Example 6:} Finally, a preconditioner which depends on a parameter
+## @var{k}.
 ##
 ## @example
 ## @group
--- a/scripts/sparse/pcr.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/pcr.m	Mon May 04 14:22:02 2015 -0700
@@ -20,18 +20,19 @@
 ## @deftypefn  {Function File} {@var{x} =} pcr (@var{A}, @var{b}, @var{tol}, @var{maxit}, @var{m}, @var{x0}, @dots{})
 ## @deftypefnx {Function File} {[@var{x}, @var{flag}, @var{relres}, @var{iter}, @var{resvec}] =} pcr (@dots{})
 ##
-## Solve the linear system of equations @code{@var{A} * @var{x} = @var{b}}
-## by means of the Preconditioned Conjugate Residuals iterative
-## method.  The input arguments are
+## Solve the linear system of equations @code{@var{A} * @var{x} = @var{b}} by
+## means of the Preconditioned Conjugate Residuals iterative method.
+##
+## The input arguments are
 ##
 ## @itemize
 ## @item
-## @var{A} can be either a square (preferably sparse) matrix or a
-## function handle, inline function or string containing the name
-## of a function which computes @code{@var{A} * @var{x}}.  In principle
-## @var{A} should be symmetric and non-singular; if @code{pcr}
-## finds @var{A} to be numerically singular, you will get a warning
-## message and the @var{flag} output parameter will be set.
+## @var{A} can be either a square (preferably sparse) matrix or a function
+## handle, inline function or string containing the name of a function which
+## computes @code{@var{A} * @var{x}}.  In principle @var{A} should be
+## symmetric and non-singular; if @code{pcr} finds @var{A} to be numerically
+## singular, you will get a warning message and the @var{flag} output
+## parameter will be set.
 ##
 ## @item
 ## @var{b} is the right hand side vector.
@@ -45,30 +46,32 @@
 ## @code{@var{tol} = 1e-6} by default.
 ##
 ## @item
-## @var{maxit} is the maximum allowable number of iterations; if
-## @code{[]} is supplied for @code{maxit}, or @code{pcr} has less
-## arguments, a default value equal to 20 is used.
+## @var{maxit} is the maximum allowable number of iterations; if @code{[]} is
+## supplied for @code{maxit}, or @code{pcr} has less arguments, a default
+## value equal to 20 is used.
 ##
 ## @item
 ## @var{m} is the (left) preconditioning matrix, so that the iteration is
-## (theoretically) equivalent to solving by @code{pcr} @code{@var{P} *
-## @var{x} = @var{m} \ @var{b}}, with @code{@var{P} = @var{m} \ @var{A}}.
-## Note that a proper choice of the preconditioner may dramatically
-## improve the overall performance of the method.  Instead of matrix
-## @var{m}, the user may pass a function which returns the results of
-## applying the inverse of @var{m} to a vector (usually this is the
-## preferred way of using the preconditioner).  If @code{[]} is supplied
-## for @var{m}, or @var{m} is omitted, no preconditioning is applied.
+## (theoretically) equivalent to solving by
+## @code{pcr} @code{@var{P} * @var{x} = @var{m} \ @var{b}}, with
+## @code{@var{P} = @var{m} \ @var{A}}.  Note that a proper choice of the
+## preconditioner may dramatically improve the overall performance of the
+## method.  Instead of matrix @var{m}, the user may pass a function which
+## returns the results of applying the inverse of @var{m} to a vector
+## (usually this is the preferred way of using the preconditioner).  If
+## @code{[]} is supplied for @var{m}, or @var{m} is omitted, no
+## preconditioning is applied.
 ##
 ## @item
 ## @var{x0} is the initial guess.  If @var{x0} is empty or omitted, the
 ## function sets @var{x0} to a zero vector by default.
 ## @end itemize
 ##
-## The arguments which follow @var{x0} are treated as parameters, and
-## passed in a proper way to any of the functions (@var{A} or @var{m})
-## which are passed to @code{pcr}.  See the examples below for further
-## details.  The output arguments are
+## The arguments which follow @var{x0} are treated as parameters, and passed
+## in a proper way to any of the functions (@var{A} or @var{m}) which are
+## passed to @code{pcr}.  See the examples below for further details.
+##
+## The output arguments are
 ##
 ## @itemize
 ## @item
@@ -76,11 +79,11 @@
 ## @code{@var{A} * @var{x} = @var{b}}.
 ##
 ## @item
-## @var{flag} reports on the convergence.  @code{@var{flag} = 0} means
-## the solution converged and the tolerance criterion given by @var{tol}
-## is satisfied.  @code{@var{flag} = 1} means that the @var{maxit} limit
-## for the iteration count was reached.  @code{@var{flag} = 3} reports t
-## @code{pcr} breakdown, see [1] for details.
+## @var{flag} reports on the convergence.  @code{@var{flag} = 0} means the
+## solution converged and the tolerance criterion given by @var{tol} is
+## satisfied.  @code{@var{flag} = 1} means that the @var{maxit} limit for the
+## iteration count was reached.  @code{@var{flag} = 3} reports a @code{pcr}
+## breakdown, see [1] for details.
 ##
 ## @item
 ## @var{relres} is the ratio of the final residual to its initial value,
@@ -90,10 +93,9 @@
 ## @var{iter} is the actual number of iterations performed.
 ##
 ## @item
-## @var{resvec} describes the convergence history of the method,
-## so that @code{@var{resvec} (i)} contains the Euclidean norms of the
-## residual after the (@var{i}-1)-th iteration, @code{@var{i} =
-## 1,2, @dots{}, @var{iter}+1}.
+## @var{resvec} describes the convergence history of the method, so that
+## @code{@var{resvec} (i)} contains the Euclidean norms of the residual after
+## the (@var{i}-1)-th iteration, @code{@var{i} = 1,2, @dots{}, @var{iter}+1}.
 ## @end itemize
 ##
 ## Let us consider a trivial problem with a diagonal matrix (we exploit the
--- a/scripts/sparse/qmr.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/qmr.m	Mon May 04 14:22:02 2015 -0700
@@ -19,30 +19,29 @@
 ## @deftypefn  {Function File} {@var{x} =} qmr (@var{A}, @var{b}, @var{rtol}, @var{maxit}, @var{M1}, @var{M2}, @var{x0})
 ## @deftypefnx {Function File} {@var{x} =} qmr (@var{A}, @var{b}, @var{rtol}, @var{maxit}, @var{P})
 ## @deftypefnx {Function File} {[@var{x}, @var{flag}, @var{relres}, @var{iter}, @var{resvec}] =} qmr (@var{A}, @var{b}, @dots{})
-## Solve @code{A x = b} using the Quasi-Minimal Residual iterative
-## method (without look-ahead).
+## Solve @code{A x = b} using the Quasi-Minimal Residual iterative method
+## (without look-ahead).
 ##
 ## @itemize @minus
-## @item @var{rtol} is the relative tolerance, if not given
-## or set to [] the default value 1e-6 is used.
+## @item @var{rtol} is the relative tolerance, if not given or set to [] the
+## default value 1e-6 is used.
 ##
-## @item @var{maxit} the maximum number of outer iterations,
-## if not given or set to [] the default value
-## @code{min (20, numel (b))} is used.
+## @item @var{maxit} the maximum number of outer iterations, if not given or
+## set to [] the default value @code{min (20, numel (b))} is used.
 ##
-## @item @var{x0} the initial guess, if not given or set to []
-## the default value @code{zeros (size (b))} is used.
+## @item @var{x0} the initial guess, if not given or set to [] the default
+## value @code{zeros (size (b))} is used.
 ## @end itemize
 ##
-## @var{A} can be passed as a matrix or as a function handle or
-## inline function @code{f} such that @code{f(x, "notransp") = A*x}
-## and @code{f(x, "transp") = A'*x}.
+## @var{A} can be passed as a matrix or as a function handle or inline
+## function @code{f} such that @code{f(x, "notransp") = A*x} and
+## @code{f(x, "transp") = A'*x}.
 ##
-## The preconditioner @var{P} is given as @code{P = M1 * M2}.
-## Both @var{M1} and @var{M2} can be passed as a matrix or as
-## a function handle or inline function @code{g} such that
-## @code{g(x, "notransp") = M1 \ x} or @code{g(x, "notransp") = M2 \ x} and
-## @code{g(x, "transp") = M1' \ x} or @code{g(x, "transp") = M2' \ x}.
+## The preconditioner @var{P} is given as @code{P = M1 * M2}.  Both @var{M1}
+## and @var{M2} can be passed as a matrix or as a function handle or inline
+## function @code{g} such that @code{g(x, "notransp") = M1 \ x} or
+## @code{g(x, "notransp") = M2 \ x} and @code{g(x, "transp") = M1' \ x} or
+## @code{g(x, "transp") = M2' \ x}.
 ##
 ## If called with more than one output parameter
 ##
--- a/scripts/sparse/spaugment.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spaugment.m	Mon May 04 14:22:02 2015 -0700
@@ -46,11 +46,11 @@
 ## @var{r} = @var{b} - @var{A} * @var{x}
 ## @end example
 ##
-## As the matrix @var{s} is symmetric indefinite it can be factorized
-## with @code{lu}, and the minimum norm solution can therefore be found
-## without the need for a @code{qr} factorization.  As the residual
-## error will be @code{zeros (@var{m}, @var{m})} for underdetermined
-## problems, and example can be
+## As the matrix @var{s} is symmetric indefinite it can be factorized with
+## @code{lu}, and the minimum norm solution can therefore be found without the
+## need for a @code{qr} factorization.  As the residual error will be
+## @code{zeros (@var{m}, @var{m})} for underdetermined problems, and example
+## can be
 ##
 ## @example
 ## @group
@@ -65,12 +65,12 @@
 ## @end group
 ## @end example
 ##
-## To find the solution of an overdetermined problem needs an estimate
-## of the residual error @var{r} and so it is more complex to formulate
-## a minimum norm solution using the @code{spaugment} function.
+## To find the solution of an overdetermined problem needs an estimate of the
+## residual error @var{r} and so it is more complex to formulate a minimum norm
+## solution using the @code{spaugment} function.
 ##
-## In general the left division operator is more stable and faster than
-## using the @code{spaugment} function.
+## In general the left division operator is more stable and faster than using
+## the @code{spaugment} function.
 ## @seealso{mldivide}
 ## @end deftypefn
 
--- a/scripts/sparse/spconvert.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spconvert.m	Mon May 04 14:22:02 2015 -0700
@@ -21,10 +21,10 @@
 ## Convert a simple sparse matrix format easily generated by other programs
 ## into Octave's internal sparse format.
 ##
-## The input @var{m} 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 imaginary part can
-## be used to force a particular matrix size.
+## The input @var{m} 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 imaginary part can be used to
+## force a particular matrix size.
 ## @seealso{sparse}
 ## @end deftypefn
 
--- a/scripts/sparse/spdiags.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spdiags.m	Mon May 04 14:22:02 2015 -0700
@@ -22,21 +22,22 @@
 ## @deftypefnx {Function File} {@var{B} =} spdiags (@var{A}, @var{d})
 ## @deftypefnx {Function File} {@var{A} =} spdiags (@var{v}, @var{d}, @var{A})
 ## @deftypefnx {Function File} {@var{A} =} spdiags (@var{v}, @var{d}, @var{m}, @var{n})
-## A generalization of the function @code{diag}.  Called with a single
-## input argument, the nonzero diagonals @var{d} of @var{A} are extracted.
-## With two arguments the diagonals to extract are given by the vector
-## @var{d}.
+## A generalization of the function @code{diag}.
+##
+## Called with a single input argument, the nonzero diagonals @var{d} of
+## @var{A} are extracted.
+##
+## With two arguments the diagonals to extract are given by the vector @var{d}.
 ##
-## The other two forms of @code{spdiags} modify the input matrix by
-## replacing the diagonals.  They use the columns of @var{v} to replace
-## the diagonals represented by the vector @var{d}.  If the sparse matrix
-## @var{A} is defined then the diagonals of this matrix are replaced.
-## Otherwise a matrix of @var{m} by @var{n} is created with the
-## diagonals given by the columns of @var{v}.
+## The other two forms of @code{spdiags} modify the input matrix by replacing
+## the diagonals.  They use the columns of @var{v} to replace the diagonals
+## represented by the vector @var{d}.  If the sparse matrix @var{A} is
+## defined then the diagonals of this matrix are replaced.  Otherwise a
+## matrix of @var{m} by @var{n} is created with the diagonals given by the
+## columns of @var{v}.
 ##
-## Negative values of @var{d} represent diagonals below the main
-## diagonal, and positive values of @var{d} diagonals above the main
-## diagonal.
+## Negative values of @var{d} represent diagonals below the main diagonal, and
+## positive values of @var{d} diagonals above the main diagonal.
 ##
 ## For example:
 ##
--- a/scripts/sparse/spfun.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spfun.m	Mon May 04 14:22:02 2015 -0700
@@ -19,9 +19,10 @@
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {@var{y} =} spfun (@var{f}, @var{S})
 ## Compute @code{f(@var{S})} for the nonzero values of @var{S}.
-## This results in a sparse matrix with the same structure as
-## @var{S}.  The function @var{f} can be passed as a string, a
-## function handle, or an inline function.
+##
+## This results in a sparse matrix with the same structure as @var{S}.  The
+## function @var{f} can be passed as a string, a function handle, or an
+## inline function.
 ## @seealso{arrayfun, cellfun, structfun}
 ## @end deftypefn
 
--- a/scripts/sparse/spones.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spones.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,9 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {@var{r} =} spones (@var{S})
-## Replace the nonzero entries of @var{S} with ones.  This creates a
-## sparse matrix with the same structure as @var{S}.
+## Replace the nonzero entries of @var{S} with ones.
+##
+## This creates a sparse matrix with the same structure as @var{S}.
 ## @seealso{sparse, sprand, sprandn, sprandsym, spfun, spy}
 ## @end deftypefn
 
--- a/scripts/sparse/sprandsym.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/sprandsym.m	Mon May 04 14:22:02 2015 -0700
@@ -27,7 +27,7 @@
 ## be normally distributed with a mean of zero and a variance of 1.
 ##
 ## If called with a single matrix argument, a random sparse matrix is generated
-## wherever the matrix @var{S} is nonzero in its lower triangular part.
+## wherever the matrix @var{s} is nonzero in its lower triangular part.
 ## @seealso{sprand, sprandn, spones, sparse}
 ## @end deftypefn
 
--- a/scripts/sparse/spstats.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spstats.m	Mon May 04 14:22:02 2015 -0700
@@ -20,13 +20,14 @@
 ## @deftypefn  {Function File} {[@var{count}, @var{mean}, @var{var}] =} spstats (@var{S})
 ## @deftypefnx {Function File} {[@var{count}, @var{mean}, @var{var}] =} spstats (@var{S}, @var{j})
 ## Return the stats for the nonzero elements of the sparse matrix @var{S}.
-## @var{count} is the number of nonzeros in each column, @var{mean}
-## is the mean of the nonzeros in each column, and @var{var} is the
-## variance of the nonzeros in each column.
 ##
-## Called with two input arguments, if @var{S} is the data and @var{j}
-## is the bin number for the data, compute the stats for each bin.  In
-## this case, bins can contain data values of zero, whereas with
+## @var{count} is the number of nonzeros in each column, @var{mean} is the mean
+## of the nonzeros in each column, and @var{var} is the variance of the
+## nonzeros in each column.
+##
+## Called with two input arguments, if @var{S} is the data and @var{j} is the
+## bin number for the data, compute the stats for each bin.  In this case,
+## bins can contain data values of zero, whereas with
 ## @code{spstats (@var{S})} the zeros may disappear.
 ## @end deftypefn
 
--- a/scripts/sparse/spy.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/spy.m	Mon May 04 14:22:02 2015 -0700
@@ -23,8 +23,10 @@
 ## Plot the sparsity pattern of the sparse matrix @var{x}.
 ##
 ## If the argument @var{markersize} is given as a scalar value, it is used to
-## determine the point size in the plot.  If the string @var{line_spec} is
-## given it is passed to @code{plot} and determines the appearance of the plot.
+## determine the point size in the plot.
+##
+## If the string @var{line_spec} is given it is passed to @code{plot} and
+## determines the appearance of the plot.
 ## @seealso{plot, gplot}
 ## @end deftypefn
 
--- a/scripts/sparse/svds.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/svds.m	Mon May 04 14:22:02 2015 -0700
@@ -24,8 +24,9 @@
 ## @deftypefnx {Function File} {[@var{u}, @var{s}, @var{v}] =} svds (@dots{})
 ## @deftypefnx {Function File} {[@var{u}, @var{s}, @var{v}, @var{flag}] =} svds (@dots{})
 ##
-## Find a few singular values of the matrix @var{A}.  The singular values
-## are calculated using
+## Find a few singular values of the matrix @var{A}.
+##
+## The singular values are calculated using
 ##
 ## @example
 ## @group
--- a/scripts/sparse/treelayout.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/treelayout.m	Mon May 04 14:22:02 2015 -0700
@@ -19,12 +19,14 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {} treelayout (@var{tree})
 ## @deftypefnx {Function File} {} treelayout (@var{tree}, @var{permutation})
-## treelayout lays out a tree or a forest.  The first argument @var{tree} is a
-## vector of
-## predecessors, optional parameter @var{permutation} is an optional postorder
-## permutation.
-## The complexity of the algorithm is O(n) in
-## terms of time and memory requirements.
+## treelayout lays out a tree or a forest.
+##
+## The first argument @var{tree} is a vector of predecessors.
+##
+## The parameter @var{permutation} is an optional postorder permutation.
+##
+## The complexity of the algorithm is O(n) in terms of time and memory
+## requirements.
 ## @seealso{etreeplot, gplot, treeplot}
 ## @end deftypefn
 
--- a/scripts/sparse/treeplot.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/sparse/treeplot.m	Mon May 04 14:22:02 2015 -0700
@@ -19,10 +19,15 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {} treeplot (@var{tree})
 ## @deftypefnx {Function File} {} treeplot (@var{tree}, @var{node_style}, @var{edge_style})
-## Produce a graph of tree or forest.  The first argument is vector of
-## predecessors, optional parameters @var{node_style} and @var{edge_style}
-## define the output style.  The complexity of the algorithm is O(n) in
-## terms of is time and memory requirements.
+## Produce a graph of tree or forest.
+##
+## The first argument is vector of predecessors.
+##
+## The optional parameters @var{node_style} and @var{edge_style} define the
+## output plot style.
+##
+## The complexity of the algorithm is O(n) in terms of is time and memory
+## requirements.
 ## @seealso{etreeplot, gplot}
 ## @end deftypefn
 
--- a/scripts/strings/base2dec.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/base2dec.m	Mon May 04 14:22:02 2015 -0700
@@ -29,15 +29,14 @@
 ## @end example
 ##
 ## If @var{s} is a string matrix, return a column vector with one value per
-## row of @var{s}.  If a row contains invalid symbols then the
-## corresponding value will be NaN@.
+## row of @var{s}.  If a row contains invalid symbols then the corresponding
+## value will be NaN@.
 ##
 ## If @var{s} is a cell array of strings, return a column vector with one
 ## value per cell element in @var{s}.
 ##
 ## If @var{base} is a string, the characters of @var{base} are used as the
-## symbols for the digits of @var{s}.  Space (' ') may not be used as a
-## symbol.
+## symbols for the digits of @var{s}.  Space (' ') may not be used as a symbol.
 ##
 ## @example
 ## @group
--- a/scripts/strings/bin2dec.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/bin2dec.m	Mon May 04 14:22:02 2015 -0700
@@ -19,7 +19,9 @@
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} bin2dec (@var{s})
 ## Return the decimal number corresponding to the binary number represented
-## by the string @var{s}.  For example:
+## by the string @var{s}.
+##
+## For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/blanks.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/blanks.m	Mon May 04 14:22:02 2015 -0700
@@ -18,7 +18,9 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} blanks (@var{n})
-## Return a string of @var{n} blanks, for example:
+## Return a string of @var{n} blanks.
+##
+## For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/cstrcat.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/cstrcat.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,10 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} cstrcat (@var{s1}, @var{s2}, @dots{})
-## Return a string containing all the arguments concatenated
-## horizontally.  Trailing white space is preserved.  For example:
+## Return a string containing all the arguments concatenated horizontally
+## with trailing white space preserved.
+##
+## For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/deblank.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/deblank.m	Mon May 04 14:22:02 2015 -0700
@@ -18,10 +18,11 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} deblank (@var{s})
-## Remove trailing whitespace and nulls from @var{s}.  If @var{s}
-## is a matrix, @var{deblank} trims each row to the length of longest
-## string.  If @var{s} is a cell array of strings, operate recursively on each
-## string element.
+## Remove trailing whitespace and nulls from @var{s}.
+##
+## If @var{s} is a matrix, @var{deblank} trims each row to the length of
+## longest string.  If @var{s} is a cell array of strings, operate
+## recursively on each string element.
 ##
 ## Examples:
 ##
--- a/scripts/strings/dec2base.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/dec2base.m	Mon May 04 14:22:02 2015 -0700
@@ -19,8 +19,8 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {} dec2base (@var{d}, @var{base})
 ## @deftypefnx {Function File} {} dec2base (@var{d}, @var{base}, @var{len})
-## Return a string of symbols in base @var{base} corresponding to
-## the non-negative integer @var{d}.
+## Return a string of symbols in base @var{base} corresponding to the
+## non-negative integer @var{d}.
 ##
 ## @example
 ## @group
@@ -29,13 +29,13 @@
 ## @end group
 ## @end example
 ##
-## If @var{d} is a matrix or cell array, return a string matrix with one
-## row per element in @var{d}, padded with leading zeros to the width of
-## the largest value.
+## If @var{d} is a matrix or cell array, return a string matrix with one row
+## per element in @var{d}, padded with leading zeros to the width of the
+## largest value.
 ##
 ## If @var{base} is a string then the characters of @var{base} are used as
-## the symbols for the digits of @var{d}.  Space (' ') may not be used
-## as a symbol.
+## the symbols for the digits of @var{d}.  Space (' ') may not be used as a
+## symbol.
 ##
 ## @example
 ## @group
@@ -44,8 +44,8 @@
 ## @end group
 ## @end example
 ##
-## The optional third argument, @var{len}, specifies the minimum
-## number of digits in the result.
+## The optional third argument, @var{len}, specifies the minimum number of
+## digits in the result.
 ## @seealso{base2dec, dec2bin, dec2hex}
 ## @end deftypefn
 
--- a/scripts/strings/dec2bin.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/dec2bin.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,10 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} dec2bin (@var{d}, @var{len})
-## Return a binary number corresponding to the non-negative integer
-## @var{d}, as a string of ones and zeros.  For example:
+## Return a binary number corresponding to the non-negative integer @var{d},
+## as a string of ones and zeros.
+##
+## For example:
 ##
 ## @example
 ## @group
@@ -28,12 +30,12 @@
 ## @end group
 ## @end example
 ##
-## If @var{d} is a matrix or cell array, return a string matrix with one
-## row per element in @var{d}, padded with leading zeros to the width of
-## the largest value.
+## If @var{d} is a matrix or cell array, return a string matrix with one row
+## per element in @var{d}, padded with leading zeros to the width of the
+## largest value.
 ##
-## The optional second argument, @var{len}, specifies the minimum
-## number of digits in the result.
+## The optional second argument, @var{len}, specifies the minimum number of
+## digits in the result.
 ## @seealso{bin2dec, dec2base, dec2hex}
 ## @end deftypefn
 
--- a/scripts/strings/dec2hex.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/dec2hex.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,10 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} dec2hex (@var{d}, @var{len})
-## Return the hexadecimal string corresponding to the non-negative
-## integer @var{d}.  For example:
+## Return the hexadecimal string corresponding to the non-negative integer
+## @var{d}.
+##
+## For example:
 ##
 ## @example
 ## @group
@@ -28,12 +30,12 @@
 ## @end group
 ## @end example
 ##
-## If @var{d} is a matrix or cell array, return a string matrix with one
-## row per element in @var{d}, padded with leading zeros to the width of
-## the largest value.
+## If @var{d} is a matrix or cell array, return a string matrix with one row
+## per element in @var{d}, padded with leading zeros to the width of the
+## largest value.
 ##
-## The optional second argument, @var{len}, specifies the minimum
-## number of digits in the result.
+## The optional second argument, @var{len}, specifies the minimum number of
+## digits in the result.
 ## @seealso{hex2dec, dec2base, dec2bin}
 ## @end deftypefn
 
--- a/scripts/strings/findstr.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/findstr.m	Mon May 04 14:22:02 2015 -0700
@@ -19,10 +19,11 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {} findstr (@var{s}, @var{t})
 ## @deftypefnx {Function File} {} findstr (@var{s}, @var{t}, @var{overlap})
-## Return the vector of all positions in the longer of the two strings
-## @var{s} and @var{t} where an occurrence of the shorter of the two starts.
-## If the optional argument @var{overlap} is true, the returned vector
-## can include overlapping positions (this is the default).  For example:
+## Return the vector of all positions in the longer of the two strings @var{s}
+## and @var{t} where an occurrence of the shorter of the two starts.
+##
+## If the optional argument @var{overlap} is true (default), the returned
+## vector can include overlapping positions.  For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/hex2dec.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/hex2dec.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,10 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} hex2dec (@var{s})
-## Return the integer corresponding to the hexadecimal number represented
-## by the string @var{s}.  For example:
+## Return the integer corresponding to the hexadecimal number represented by
+## the string @var{s}.
+##
+## For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/index.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/index.m	Mon May 04 14:22:02 2015 -0700
@@ -20,8 +20,9 @@
 ## @deftypefn  {Function File} {} index (@var{s}, @var{t})
 ## @deftypefnx {Function File} {} index (@var{s}, @var{t}, @var{direction})
 ## Return the position of the first occurrence of the string @var{t} in the
-## string @var{s}, or 0 if no occurrence is found.  @var{s} may also be a
-## string array or cell array of strings.
+## string @var{s}, or 0 if no occurrence is found.
+##
+## @var{s} may also be a string array or cell array of strings.
 ##
 ## For example:
 ##
--- a/scripts/strings/isletter.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/isletter.m	Mon May 04 14:22:02 2015 -0700
@@ -19,8 +19,9 @@
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} isletter (@var{s})
 ## Return a logical array which is true where the elements of @var{s}
-## are letters and false where they are not.  This is an alias for
-## the @code{isalpha} function.
+## are letters and false where they are not.
+##
+## This is an alias for the @code{isalpha} function.
 ## @seealso{isalpha, isdigit, ispunct, isspace, iscntrl, isalnum}
 ## @end deftypefn
 
--- a/scripts/strings/isstrprop.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/isstrprop.m	Mon May 04 14:22:02 2015 -0700
@@ -18,7 +18,9 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} isstrprop (@var{str}, @var{prop})
-## Test character string properties.  For example:
+## Test character string properties.
+##
+## For example:
 ##
 ## @example
 ## @group
@@ -27,8 +29,8 @@
 ## @end group
 ## @end example
 ##
-## If @var{str} is a cell array, @code{isstrpop} is applied recursively
-## to each element of the cell array.
+## If @var{str} is a cell array, @code{isstrpop} is applied recursively to
+## each element of the cell array.
 ##
 ## Numeric arrays are converted to character strings.
 ##
@@ -56,12 +58,12 @@
 ##
 ## @item  @qcode{"space"}
 ## @itemx @qcode{"wspace"}
-## True for whitespace characters (space, formfeed, newline, carriage
-## return, tab, vertical tab).
+## True for whitespace characters (space, formfeed, newline, carriage return,
+## tab, vertical tab).
 ##
 ## @item @qcode{"punct"}
-## True for punctuation characters (printing characters except space
-## or letter or digit).
+## True for punctuation characters (printing characters except space or
+## letter or digit).
 ##
 ## @item @qcode{"cntrl"}
 ## True for control characters.
--- a/scripts/strings/mat2str.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/mat2str.m	Mon May 04 14:22:02 2015 -0700
@@ -19,15 +19,16 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {@var{s} =} mat2str (@var{x}, @var{n})
 ## @deftypefnx {Function File} {@var{s} =} mat2str (@var{x}, @var{n}, "class")
-## Format real, complex, and logical matrices as strings.  The
-## returned string may be used to reconstruct the original matrix by using
+## Format real, complex, and logical matrices as strings.
+##
+## The returned string may be used to reconstruct the original matrix by using
 ## the @code{eval} function.
 ##
-## The precision of the values is given by @var{n}.  If @var{n} is a
-## scalar then both real and imaginary parts of the matrix are printed
-## to the same precision.  Otherwise @code{@var{n}(1)} defines the
-## precision of the real part and @code{@var{n}(2)} defines the
-## precision of the imaginary part.  The default for @var{n} is 15.
+## The precision of the values is given by @var{n}.  If @var{n} is a scalar
+## then both real and imaginary parts of the matrix are printed to the same
+## precision.  Otherwise @code{@var{n}(1)} defines the precision of the real
+## part and @code{@var{n}(2)} defines the precision of the imaginary part. 
+## The default for @var{n} is 15.
 ##
 ## If the argument @qcode{"class"} is given then the class of @var{x} is
 ## included in the string in such a way that @code{eval} will result in the
--- a/scripts/strings/ostrsplit.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/ostrsplit.m	Mon May 04 14:22:02 2015 -0700
@@ -20,9 +20,11 @@
 ## @deftypefn  {Function File} {[@var{cstr}] =} ostrsplit (@var{s}, @var{sep})
 ## @deftypefnx {Function File} {[@var{cstr}] =} ostrsplit (@var{s}, @var{sep}, @var{strip_empty})
 ## Split the string @var{s} using one or more separators @var{sep} and return
-## a cell array of strings.  Consecutive separators and separators at
-## boundaries result in empty strings, unless @var{strip_empty} is true.
-## The default value of @var{strip_empty} is false.
+## a cell array of strings.
+##
+## Consecutive separators and separators at boundaries result in empty
+## strings, unless @var{strip_empty} is true.  The default value of
+## @var{strip_empty} is false.
 ##
 ## 2-D character arrays are split at separators and at the original column
 ## boundaries.
--- a/scripts/strings/regexptranslate.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/regexptranslate.m	Mon May 04 14:22:02 2015 -0700
@@ -18,16 +18,17 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} regexptranslate (@var{op}, @var{s})
-## Translate a string for use in a regular expression.  This may
-## include either wildcard replacement or special character escaping.
+## Translate a string for use in a regular expression.
+##
+## This may include either wildcard replacement or special character escaping.
+##
 ## The behavior is controlled by @var{op} which can take the following
 ## values
 ##
 ## @table @asis
 ## @item @qcode{"wildcard"}
-## The wildcard characters @code{.}, @code{*}, and @code{?} are replaced
-## with wildcards that are appropriate for a regular expression.
-## For example:
+## The wildcard characters @code{.}, @code{*}, and @code{?} are replaced with
+## wildcards that are appropriate for a regular expression.  For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/rindex.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/rindex.m	Mon May 04 14:22:02 2015 -0700
@@ -20,7 +20,9 @@
 ## @deftypefn {Function File} {} rindex (@var{s}, @var{t})
 ## Return the position of the last occurrence of the character string
 ## @var{t} in the character string @var{s}, or 0 if no occurrence is
-## found.  @var{s} may also be a string array or cell array of strings.
+## found.
+##
+## @var{s} may also be a string array or cell array of strings.
 ##
 ## For example:
 ##
--- a/scripts/strings/str2num.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/str2num.m	Mon May 04 14:22:02 2015 -0700
@@ -19,8 +19,9 @@
 ## -*- texinfo -*-
 ## @deftypefn  {Function File} {@var{x} =} str2num (@var{s})
 ## @deftypefnx {Function File} {[@var{x}, @var{state}] =} str2num (@var{s})
-## Convert the string (or character array) @var{s} to a number (or an
-## array).  Examples:
+## Convert the string (or character array) @var{s} to a number (or an array).
+##
+## Examples:
 ##
 ## @example
 ## @group
@@ -37,10 +38,9 @@
 ## conversion is successful.  If the conversion fails the numeric output,
 ## @var{x}, is empty and @var{state} is false.
 ##
-## @strong{Caution:} As @code{str2num} uses the @code{eval} function
-## to do the conversion, @code{str2num} will execute any code contained
-## in the string @var{s}.  Use @code{str2double} for a safer and faster
-## conversion.
+## @strong{Caution:} As @code{str2num} uses the @code{eval} function to do the
+## conversion, @code{str2num} will execute any code contained in the string
+## @var{s}.  Use @code{str2double} for a safer and faster conversion.
 ##
 ## For cell array of strings use @code{str2double}.
 ## @seealso{str2double, eval}
--- a/scripts/strings/strcat.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strcat.m	Mon May 04 14:22:02 2015 -0700
@@ -20,11 +20,12 @@
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} strcat (@var{s1}, @var{s2}, @dots{})
 ## Return a string containing all the arguments concatenated
-## horizontally.  If the arguments are cell strings, @code{strcat}
-## returns a cell string with the individual cells concatenated.
-## For numerical input, each element is converted to the
-## corresponding ASCII character.  Trailing white space for any
-## character string input is eliminated before the strings are
+## horizontally.
+##
+## If the arguments are cell strings, @code{strcat} returns a cell string
+## with the individual cells concatenated.  For numerical input, each element
+## is converted to the corresponding ASCII character.  Trailing white space
+## for any character string input is eliminated before the strings are
 ## concatenated.  Note that cell string values do @strong{not} have
 ## whitespace trimmed.
 ##
--- a/scripts/strings/strchr.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strchr.m	Mon May 04 14:22:02 2015 -0700
@@ -22,8 +22,10 @@
 ## @deftypefnx {Function File} {@var{idx} =} strchr (@var{str}, @var{chars}, @var{n}, @var{direction})
 ## @deftypefnx {Function File} {[@var{i}, @var{j}] =} strchr (@dots{})
 ## Search for the string @var{str} for occurrences of characters from
-## the set @var{chars}.  The return value(s), as well as the @var{n} and
-## @var{direction} arguments behave identically as in @code{find}.
+## the set @var{chars}.
+##
+## The return value(s), as well as the @var{n} and @var{direction} arguments
+## behave identically as in @code{find}.
 ##
 ## This will be faster than using regexp in most cases.
 ##
--- a/scripts/strings/strjoin.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strjoin.m	Mon May 04 14:22:02 2015 -0700
@@ -23,16 +23,16 @@
 ## Join the elements of the cell string array, @var{cstr}, into a single
 ## string.
 ##
-## If no @var{delimiter} is specified, the elements of @var{cstr}
+## If no @var{delimiter} is specified, the elements of @var{cstr} are
 ## separated by a space.
 ##
 ## If @var{delimiter} is specified as a string, the cell string array is
 ## joined using the string.  Escape sequences are supported.
 ##
-## If @var{delimiter} is a cell string array whose length is one less
-## than @var{cstr}, then the elements of @var{cstr} are joined by
-## interleaving the cell string elements of @var{delimiter}.  Escape
-## sequences are not supported.
+## If @var{delimiter} is a cell string array whose length is one less than
+## @var{cstr}, then the elements of @var{cstr} are joined by interleaving the
+## cell string elements of @var{delimiter}.  Escape sequences are not
+## supported.
 ##
 ## @example
 ## @group
--- a/scripts/strings/strjust.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strjust.m	Mon May 04 14:22:02 2015 -0700
@@ -21,11 +21,12 @@
 ## @deftypefn  {Function File} {} strjust (@var{s})
 ## @deftypefnx {Function File} {} strjust (@var{s}, @var{pos})
 ## Return the text, @var{s}, justified according to @var{pos}, which may
-## be @qcode{"left"}, @qcode{"center"}, or @qcode{"right"}.  If @var{pos}
-## is omitted it defaults to @qcode{"right"}.
+## be @qcode{"left"}, @qcode{"center"}, or @qcode{"right"}.
 ##
-## Null characters are replaced by spaces.  All other character
-## data are treated as non-white space.
+## If @var{pos} is omitted it defaults to @qcode{"right"}.
+##
+## Null characters are replaced by spaces.  All other character data are
+## treated as non-white space.
 ##
 ## Example:
 ##
--- a/scripts/strings/strmatch.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strmatch.m	Mon May 04 14:22:02 2015 -0700
@@ -22,10 +22,13 @@
 ## @deftypefn  {Function File} {} strmatch (@var{s}, @var{A})
 ## @deftypefnx {Function File} {} strmatch (@var{s}, @var{A}, "exact")
 ## Return indices of entries of @var{A} which begin with the string @var{s}.
+##
 ## The second argument @var{A} must be a string, character matrix, or a cell
-## array of strings.  If the third argument @qcode{"exact"} is not given, then
-## @var{s} only needs to match @var{A} up to the length of @var{s}.
-## Trailing spaces and nulls in @var{s} and @var{A} are ignored when matching.
+## array of strings.
+##
+## If the third argument @qcode{"exact"} is not given, then @var{s} only
+## needs to match @var{A} up to the length of @var{s}.  Trailing spaces and
+## nulls in @var{s} and @var{A} are ignored when matching.
 ##
 ## For example:
 ##
--- a/scripts/strings/strsplit.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strsplit.m	Mon May 04 14:22:02 2015 -0700
@@ -21,8 +21,8 @@
 ## @deftypefnx {Function File} {[@var{cstr}] =} strsplit (@var{str}, @var{del})
 ## @deftypefnx {Function File} {[@var{cstr}] =} strsplit (@dots{}, @var{name}, @var{value})
 ## @deftypefnx {Function File} {[@var{cstr}, @var{matches}] =} strsplit (@dots{})
-## Split the string @var{str} using the delimiters specified by @var{del}
-## and return a cell string array of substrings.
+## Split the string @var{str} using the delimiters specified by @var{del} and
+## return a cell string array of substrings.
 ##
 ## If a delimiter is not specified the string is split at whitespace
 ## @code{@{" ", "\f", "\n", "\r", "\t", "\v"@}}.  Otherwise, the delimiter,
--- a/scripts/strings/strtok.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strtok.m	Mon May 04 14:22:02 2015 -0700
@@ -21,12 +21,17 @@
 ## @deftypefnx {Function File} {[@var{tok}, @var{rem}] =} strtok (@var{str}, @var{delim})
 ##
 ## Find all characters in the string @var{str} up to, but not including, the
-## first character which is in the string @var{delim}.  If @var{rem} is
-## requested, it contains the remainder of the string, starting at the first
-## delimiter.  Leading delimiters are ignored.  If @var{delim} is not
-## specified, whitespace is assumed.  @var{str} may also be a cell array of
-## strings in which case the function executes on every individual string
-## and returns a cell array of tokens and remainders.
+## first character which is in the string @var{delim}.
+##
+## @var{str} may also be a cell array of strings in which case the function
+## executes on every individual string and returns a cell array of tokens and
+## remainders.
+##
+## Leading delimiters are ignored.  If @var{delim} is not specified,
+## whitespace is assumed.
+##
+## If @var{rem} is requested, it contains the remainder of the string, starting
+## at the first delimiter.
 ##
 ## Examples:
 ##
--- a/scripts/strings/strtrim.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strtrim.m	Mon May 04 14:22:02 2015 -0700
@@ -18,10 +18,13 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} strtrim (@var{s})
-## Remove leading and trailing whitespace from @var{s}.  If
-## @var{s} is a matrix, @var{strtrim} trims each row to the length of
+## Remove leading and trailing whitespace from @var{s}.
+##
+## If @var{s} is a matrix, @var{strtrim} trims each row to the length of
 ## longest string.  If @var{s} is a cell array of strings, operate recursively
-## on each string element.  For example:
+## on each string element.
+##
+## For example:
 ##
 ## @example
 ## @group
--- a/scripts/strings/strtrunc.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/strtrunc.m	Mon May 04 14:22:02 2015 -0700
@@ -18,8 +18,10 @@
 
 ## -*- texinfo -*-
 ## @deftypefn {Function File} {} strtrunc (@var{s}, @var{n})
-## Truncate the character string @var{s} to length @var{n}.  If @var{s}
-## is a character matrix, then the number of columns is adjusted.
+## Truncate the character string @var{s} to length @var{n}.
+##
+## If @var{s} is a character matrix, then the number of columns is adjusted.
+## 
 ## If @var{s} is a cell array of strings, then the operation is performed
 ## on each cell element and the new cell array is returned.
 ## @end deftypefn
--- a/scripts/strings/substr.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/substr.m	Mon May 04 14:22:02 2015 -0700
@@ -25,7 +25,7 @@
 ## Position numbering for offsets begins with 1.  If @var{offset} is negative,
 ## extraction starts that far from the end of the string.
 ##
-## If @var{len} is omitted, the substring extends to the end of @var{S}.  A
+## If @var{len} is omitted, the substring extends to the end of @var{s}.  A
 ## negative value for @var{len} extracts to within @var{len} characters of
 ## the end of the string
 ##
--- a/scripts/strings/untabify.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/strings/untabify.m	Mon May 04 14:22:02 2015 -0700
@@ -20,17 +20,18 @@
 ## @deftypefn  {Function File} {} untabify (@var{t})
 ## @deftypefnx {Function File} {} untabify (@var{t}, @var{tw})
 ## @deftypefnx {Function File} {} untabify (@var{t}, @var{tw}, @var{deblank})
-## Replace TAB characters in @var{t}, with spaces.
-## The tab width is specified by @var{tw}, or defaults to eight.
-## The input, @var{t}, may be either a 2-D character array, or a cell
-## array of character strings.  The output is the same class
-## as the input.
+## Replace TAB characters in @var{t} with spaces.
 ##
-## If the optional argument @var{deblank} is true, then the spaces will
-## be removed from the end of the character data.
+## The input, @var{t}, may be either a 2-D character array, or a cell array of
+## character strings.  The output is the same class as the input.
+## 
+## The tab width is specified by @var{tw}, and defaults to eight.
 ##
-## The following example reads a file and writes an untabified version
-## of the same file with trailing spaces stripped.
+## If the optional argument @var{deblank} is true, then the spaces will be
+## removed from the end of the character data.
+##
+## The following example reads a file and writes an untabified version of the
+## same file with trailing spaces stripped.
 ##
 ## @example
 ## @group
--- a/scripts/time/datenum.m	Sun May 03 21:52:42 2015 -0700
+++ b/scripts/time/datenum.m	Mon May 04 14:22:02 2015 -0700
@@ -75,9 +75,14 @@
 ## Days can be fractional.
 ## @end itemize
 ##
-## @strong{Caution:} this function does not attempt to handle Julian calendars so dates before October 15, 1582 are wrong by as much as eleven days.  Also, be aware that only Roman Catholic countries adopted the calendar in 1582.  It took until 1924 for it to be adopted everywhere.  See the Wikipedia entry on the Gregorian calendar for more details.
+## @strong{Caution:} this function does not attempt to handle Julian calendars
+## so dates before October 15, 1582 are wrong by as much as eleven days.  Also,
+## be aware that only Roman Catholic countries adopted the calendar in 1582.
+## It took until 1924 for it to be adopted everywhere.  See the Wikipedia entry
+## on the Gregorian calendar for more details.
 ##
-## @strong{Warning:} leap seconds are ignored.  A table of leap seconds is available on the Wikipedia entry for leap seconds.
+## @strong{Warning:} leap seconds are ignored.  A table of leap seconds is
+## available on the Wikipedia entry for leap seconds.
 ## @seealso{datestr, datevec, now, clock, date}
 ## @end deftypefn