changeset 21547:ad0599a0acc6

doc: Wrap C++ docstrings to 79 characters + newline (80 total). * besselj.cc, bitfcns.cc, cellfun.cc, data.cc, debug.cc, error.cc, file-io.cc, graphics.cc, input.cc, lu.cc, matrix_type.cc, nproc.cc, pr-output.cc, quadcc.cc, regexp.cc, schur.cc, sparse.cc, strfind.cc, strfns.cc, syscalls.cc, urlwrite.cc, variables.cc, __osmesa_print__.cc, audiodevinfo.cc, audioread.cc, ccolamd.cc, chol.cc, colamd.cc, convhulln.cc, qr.cc, symbfact.cc, ov-java.cc, ov-struct.cc, ov-usr-fcn.cc, pt-arg-list.cc: doc: Wrap C++ docstrings to 79 characters + newline (80 total).
author Rik <rik@octave.org>
date Sun, 27 Mar 2016 20:39:19 -0700
parents f7f97d7e9294
children f044dc45b8b1
files libinterp/corefcn/besselj.cc libinterp/corefcn/bitfcns.cc libinterp/corefcn/cellfun.cc libinterp/corefcn/data.cc libinterp/corefcn/debug.cc libinterp/corefcn/error.cc libinterp/corefcn/file-io.cc libinterp/corefcn/graphics.cc libinterp/corefcn/input.cc libinterp/corefcn/lu.cc libinterp/corefcn/matrix_type.cc libinterp/corefcn/nproc.cc libinterp/corefcn/pr-output.cc libinterp/corefcn/quadcc.cc libinterp/corefcn/regexp.cc libinterp/corefcn/schur.cc libinterp/corefcn/sparse.cc libinterp/corefcn/strfind.cc libinterp/corefcn/strfns.cc libinterp/corefcn/syscalls.cc libinterp/corefcn/urlwrite.cc libinterp/corefcn/variables.cc libinterp/dldfcn/__osmesa_print__.cc libinterp/dldfcn/audiodevinfo.cc libinterp/dldfcn/audioread.cc libinterp/dldfcn/ccolamd.cc libinterp/dldfcn/chol.cc libinterp/dldfcn/colamd.cc libinterp/dldfcn/convhulln.cc libinterp/dldfcn/qr.cc libinterp/dldfcn/symbfact.cc libinterp/octave-value/ov-java.cc libinterp/octave-value/ov-struct.cc libinterp/octave-value/ov-usr-fcn.cc libinterp/parse-tree/pt-arg-list.cc
diffstat 35 files changed, 178 insertions(+), 157 deletions(-) [+]
line wrap: on
line diff
--- a/libinterp/corefcn/besselj.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/besselj.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -314,8 +314,8 @@
 the result is multiplied by @w{@code{exp (-abs (imag (@var{x})))}}.\n\
 \n\
 @item bessely\n\
-Bessel functions of the second kind.  If the argument @var{opt} is 1 or true,\n\
-the result is multiplied by @code{exp (-abs (imag (@var{x})))}.\n\
+Bessel functions of the second kind.  If the argument @var{opt} is 1 or\n\
+true, the result is multiplied by @code{exp (-abs (imag (@var{x})))}.\n\
 \n\
 @item besseli\n\
 \n\
@@ -324,8 +324,8 @@
 \n\
 @item besselk\n\
 \n\
-Modified Bessel functions of the second kind.  If the argument @var{opt} is 1\n\
-or true, the result is multiplied by @code{exp (@var{x})}.\n\
+Modified Bessel functions of the second kind.  If the argument @var{opt} is\n\
+1 or true, the result is multiplied by @code{exp (@var{x})}.\n\
 \n\
 @item besselh\n\
 Compute Hankel functions of the first (@var{k} = 1) or second (@var{k}\n\
--- a/libinterp/corefcn/bitfcns.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/bitfcns.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -663,8 +663,9 @@
 floating point value.\n\
 \n\
 The default class is @qcode{\"double\"}, but @qcode{\"single\"} is a valid\n\
-option.  On IEEE 754 compatible systems, @code{flintmax} is @w{@math{2^{53}}}\n\
-for @qcode{\"double\"} and @w{@math{2^{24}}} for @qcode{\"single\"}.\n\
+option.  On IEEE 754 compatible systems, @code{flintmax} is\n\
+@w{@math{2^{53}}} for @qcode{\"double\"} and @w{@math{2^{24}}} for\n\
+@qcode{\"single\"}.\n\
 @seealso{intmax, realmax, realmin}\n\
 @end deftypefn")
 {
--- a/libinterp/corefcn/cellfun.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/cellfun.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -320,9 +320,9 @@
 @end group\n\
 @end example\n\
 \n\
-The number of output arguments of @code{cellfun} matches the number of output\n\
-arguments of the function.  The outputs of the function will be collected\n\
-into the output arguments of @code{cellfun} like this:\n\
+The number of output arguments of @code{cellfun} matches the number of\n\
+output arguments of the function.  The outputs of the function will be\n\
+collected into the output arguments of @code{cellfun} like this:\n\
 \n\
 @example\n\
 @group\n\
@@ -367,7 +367,7 @@
 @noindent\n\
 where there is an additional input argument to @var{errfunc} relative to\n\
 @var{func}, given by @var{s}.  This is a structure with the elements\n\
-@qcode{\"identifier\"}, @qcode{\"message\"} and @qcode{\"index\"}, giving\n\
+@qcode{\"identifier\"}, @qcode{\"message\"}, and @qcode{\"index\"} giving\n\
 respectively the error identifier, the error message, and the index into the\n\
 input arguments of the element that caused the error.  For example:\n\
 \n\
--- a/libinterp/corefcn/data.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/data.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -586,8 +586,8 @@
 An error message is printed if the dimensions of the arguments do not agree,\n\
 or if either argument is complex.\n\
 \n\
-Programming Notes: Floating point numbers within a few eps of an integer will\n\
-be rounded to an integer before computation for compatibility with\n\
+Programming Notes: Floating point numbers within a few eps of an integer\n\
+will be rounded to an integer before computation for compatibility with\n\
 @sc{matlab}.\n\
 \n\
 By convention,\n\
@@ -769,8 +769,8 @@
 An error results if the dimensions of the arguments do not agree, or if\n\
 either of the arguments is complex.\n\
 \n\
-Programming Notes: Floating point numbers within a few eps of an integer will\n\
-be rounded to an integer before computation for compatibility with\n\
+Programming Notes: Floating point numbers within a few eps of an integer\n\
+will be rounded to an integer before computation for compatibility with\n\
 @sc{matlab}.\n\
 \n\
 By convention,\n\
@@ -4324,8 +4324,8 @@
 \n\
 When called with no arguments, return a scalar with the value @samp{Inf}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4372,8 +4372,9 @@
 Return a scalar, matrix, or N-dimensional array whose elements are all equal\n\
 to the IEEE symbol NaN (Not a Number).\n\
 \n\
-NaN is the result of operations which do not produce a well defined numerical\n\
-result.  Common operations which produce a NaN are arithmetic with infinity\n\
+NaN is the result of operations which do not produce a well defined\n\
+numerical result.  Common operations which produce a NaN are arithmetic\n\
+with infinity\n\
 @tex\n\
 ($\\infty - \\infty$), zero divided by zero ($0/0$),\n\
 @end tex\n\
@@ -4388,8 +4389,8 @@
 \n\
 When called with no arguments, return a scalar with the value @samp{NaN}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4444,8 +4445,8 @@
 \n\
 When called with no arguments, return a scalar with the value @math{e}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4612,8 +4613,8 @@
 pi.\n\
 @end ifnottex\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4656,8 +4657,8 @@
 When called with no arguments, return a scalar with the value\n\
 @code{realmax (@qcode{\"double\"})}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4695,8 +4696,8 @@
 When called with no arguments, return a scalar with the value\n\
 @code{realmin (@qcode{\"double\"})}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4737,8 +4738,8 @@
 \n\
 When called with no arguments, return a scalar with the value @math{i}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -4771,8 +4772,8 @@
 \n\
 When called with no arguments, return a scalar with the value @samp{NA}.\n\
 \n\
-When called with a single argument, return a square matrix with the dimension\n\
-specified.\n\
+When called with a single argument, return a square matrix with the\n\
+dimension specified.\n\
 \n\
 When called with more than one scalar argument the first two arguments are\n\
 taken as the number of rows and columns and any further arguments specify\n\
@@ -7661,12 +7662,13 @@
 @deftypefn {} {} repelems (@var{x}, @var{r})\n\
 Construct a vector of repeated elements from @var{x}.\n\
 \n\
-@var{r} is a 2x@var{N} integer matrix specifying which elements to repeat and\n\
-how often to repeat each element.  Entries in the first row, @var{r}(1,j),\n\
-select an element to repeat.  The corresponding entry in the second row,\n\
-@var{r}(2,j), specifies the repeat count.  If @var{x} is a matrix then the\n\
-columns of @var{x} are imagined to be stacked on top of each other for\n\
-purposes of the selection index.  A row vector is always returned.\n\
+@var{r} is a 2x@var{N} integer matrix specifying which elements to repeat\n\
+and how often to repeat each element.  Entries in the first row,\n\
+@var{r}(1,j), select an element to repeat.  The corresponding entry in the\n\
+second row, @var{r}(2,j), specifies the repeat count.  If @var{x} is a\n\
+matrix then the columns of @var{x} are imagined to be stacked on top of\n\
+each other for purposes of the selection index.  A row vector is always\n\
+returned.\n\
 \n\
 Conceptually the result is calculated as follows:\n\
 \n\
--- a/libinterp/corefcn/debug.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/debug.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -973,7 +973,7 @@
 variables, and should generally be avoided.  Conditions containing quotes\n\
 (@samp{\"}, @samp{'}) or comment characters (@samp{#}, @samp{%}) must be\n\
 enclosed in quotes.  (This does not apply to conditions entered from the\n\
-editor's context menu.)  For example: \n\
+editor's context menu.)  For example:\n\
 \n\
 @example\n\
 dbstop in strread at 209 if 'any (format == \"%f\")'\n\
@@ -1125,8 +1125,8 @@
 \n\
 @table @var\n\
 @item func\n\
-Function name as a string variable.  When already in debug mode this argument\n\
-can be omitted and the current function will be used.\n\
+Function name as a string variable.  When already in debug mode this\n\
+argument can be omitted and the current function will be used.\n\
 \n\
 @item line\n\
 Line number from which to remove a breakpoint.  Multiple lines may be given\n\
--- a/libinterp/corefcn/error.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/error.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -1140,8 +1140,8 @@
 \n\
 A null string (\"\") input to @code{error} will be ignored and the code\n\
 will continue running as if the statement were a NOP@.  This is for\n\
-compatibility with @sc{matlab}.  It also makes it possible to write code such\n\
-as\n\
+compatibility with @sc{matlab}.  It also makes it possible to write code\n\
+such as\n\
 \n\
 @example\n\
 @group\n\
@@ -1405,7 +1405,8 @@
 @deftypefnx {} {} warning (\"error\", @var{id})\n\
 @deftypefnx {} {} warning (@var{state}, \"backtrace\")\n\
 @deftypefnx {} {} warning (@var{state}, @var{id}, \"local\")\n\
-Display a warning message or control the behavior of Octave's warning system.\n\
+Display a warning message or control the behavior of Octave's warning\n\
+system.\n\
 \n\
 Format the optional arguments under the control of the template string\n\
 @var{template} using the same rules as the @code{printf} family of\n\
@@ -1418,9 +1419,9 @@
 \n\
 The optional message identifier allows users to enable or disable\n\
 warnings tagged by @var{id}.  A message identifier is of the form\n\
-\"NAMESPACE:WARNING-NAME\".  Octave's own warnings use the @qcode{\"Octave\"}\n\
-namespace (@pxref{XREFwarning_ids}).  The special identifier @qcode{\"all\"}\n\
-may be used to set the state of all warnings.\n\
+\"NAMESPACE:WARNING-NAME\".  Octave's own warnings use the\n\
+@qcode{\"Octave\"} namespace (@pxref{XREFwarning_ids}).  The special\n\
+identifier @qcode{\"all\"} may be used to set the state of all warnings.\n\
 \n\
 If the first argument is @qcode{\"on\"} or @qcode{\"off\"},\n\
 set the state of a particular warning using the identifier @var{id}.  If the\n\
@@ -1831,9 +1832,9 @@
 @end table\n\
 @end table\n\
 \n\
-The last error structure may be set by passing a scalar structure, @var{err},\n\
-as input.  Any fields of @var{err} that match those above are set while any\n\
-unspecified fields are initialized with default values.\n\
+The last error structure may be set by passing a scalar structure,\n\
+@var{err}, as input.  Any fields of @var{err} that match those above are\n\
+set while any unspecified fields are initialized with default values.\n\
 \n\
 If @code{lasterror} is called with the argument @qcode{\"reset\"}, all\n\
 fields are set to their default values.\n\
--- a/libinterp/corefcn/file-io.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/file-io.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -322,7 +322,8 @@
 The characters read, excluding the possible trailing newline, are returned\n\
 as a string.\n\
 \n\
-If @var{len} is omitted, @code{fgetl} reads until the next newline character.\n\
+If @var{len} is omitted, @code{fgetl} reads until the next newline\n\
+character.\n\
 \n\
 If there are no more characters to read, @code{fgetl} returns @minus{}1.\n\
 \n\
@@ -361,7 +362,8 @@
 The characters read, including the possible trailing newline, are returned\n\
 as a string.\n\
 \n\
-If @var{len} is omitted, @code{fgets} reads until the next newline character.\n\
+If @var{len} is omitted, @code{fgets} reads until the next newline\n\
+character.\n\
 \n\
 If there are no more characters to read, @code{fgets} returns @minus{}1.\n\
 \n\
@@ -398,8 +400,8 @@
 Read and skip @var{count} lines from the file specified by the file\n\
 descriptor @var{fid}.\n\
 \n\
-@code{fskipl} discards characters until an end-of-line is encountered exactly\n\
-@var{count}-times, or until the end-of-file marker is found.\n\
+@code{fskipl} discards characters until an end-of-line is encountered\n\
+exactly @var{count}-times, or until the end-of-file marker is found.\n\
 \n\
 If @var{count} is omitted, it defaults to 1.  @var{count} may also be\n\
 @code{Inf}, in which case lines are skipped until the end of the file.\n\
@@ -574,10 +576,10 @@
 @end table\n\
 \n\
 Append a @qcode{\"t\"} to the mode string to open the file in text mode or a\n\
-@qcode{\"b\"} to open in binary mode.  On Windows and Macintosh systems, text\n\
-mode reading and writing automatically converts linefeeds to the\n\
-appropriate line end character for the system (carriage-return linefeed\n\
-on Windows, carriage-return on Macintosh).  The default when no mode is\n\
+@qcode{\"b\"} to open in binary mode.  On Windows and Macintosh systems,\n\
+text mode reading and writing automatically converts linefeeds to the\n\
+appropriate line end character for the system (carriage-return linefeed on\n\
+Windows, carriage-return on Macintosh).  The default when no mode is\n\
 specified is binary mode.\n\
 \n\
 Additionally, you may append a @qcode{\"z\"} to the mode string to open a\n\
@@ -2863,8 +2865,8 @@
 The last six characters of @var{template} must be @qcode{\"XXXXXX\"} and\n\
 these are replaced with a string that makes the filename unique.  The file\n\
 is then created with mode read/write and permissions that are system\n\
-dependent (on GNU/Linux systems, the permissions will be 0600 for versions of\n\
-glibc 2.0.7 and later).  The file is opened in binary mode and with the\n\
+dependent (on GNU/Linux systems, the permissions will be 0600 for versions\n\
+of glibc 2.0.7 and later).  The file is opened in binary mode and with the\n\
 @w{@code{O_EXCL}} flag.\n\
 \n\
 If the optional argument @var{delete} is supplied and is true, the file will\n\
@@ -2872,7 +2874,8 @@
 \n\
 If successful, @var{fid} is a valid file ID, @var{name} is the name of the\n\
 file, and @var{msg} is an empty string.  Otherwise, @var{fid} is -1,\n\
-@var{name} is empty, and @var{msg} contains a system-dependent error message.\n\
+@var{name} is empty, and @var{msg} contains a system-dependent error\n\
+message.\n\
 @seealso{tempname, tempdir, P_tmpdir, tmpfile, fopen}\n\
 @end deftypefn")
 {
--- a/libinterp/corefcn/graphics.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/graphics.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -9775,10 +9775,10 @@
 \n\
 @item as a structure array @var{pv}\n\
 \n\
-Here, the field names of @var{pv} represent the property names, and the field\n\
-values give the property values.  In contrast to the previous case, all\n\
-elements of @var{pv} will be set in all handles in @var{h} independent of\n\
-the dimensions of @var{pv}.\n\
+Here, the field names of @var{pv} represent the property names, and the\n\
+field values give the property values.  In contrast to the previous case,\n\
+all elements of @var{pv} will be set in all handles in @var{h} independent\n\
+of the dimensions of @var{pv}.\n\
 @end itemize\n\
 \n\
 @code{set} is also used to query the list of values a named property will\n\
--- a/libinterp/corefcn/input.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/input.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -1469,8 +1469,8 @@
 @deftypefn  {} {@var{val} =} filemarker ()\n\
 @deftypefnx {} {@var{old_val} =} filemarker (@var{new_val})\n\
 @deftypefnx {} {} filemarker (@var{new_val}, \"local\")\n\
-Query or set the character used to separate the filename from the subfunction\n\
-names contained within the file.\n\
+Query or set the character used to separate the filename from the\n\
+subfunction names contained within the file.\n\
 \n\
 By default this is the character @samp{>}.\n\
 This can be used in a generic manner to interact with subfunctions.\n\
--- a/libinterp/corefcn/lu.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/lu.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -130,11 +130,11 @@
 \n\
 With two output arguments, returns the permuted forms of the upper and\n\
 lower triangular matrices, such that @code{@var{A} = @var{L} * @var{U}}.\n\
-With one output argument @var{y}, then the matrix returned by the @sc{lapack}\n\
-routines is returned.  If the input matrix is sparse then the matrix @var{L}\n\
-is embedded into @var{U} to give a return value similar to the full case.\n\
-For both full and sparse matrices, @code{lu} loses the permutation\n\
-information.\n\
+With one output argument @var{y}, then the matrix returned by the\n\
+@sc{lapack} routines is returned.  If the input matrix is sparse then the\n\
+matrix @var{L} is embedded into @var{U} to give a return value similar to\n\
+the full case.  For both full and sparse matrices, @code{lu} loses the\n\
+permutation information.\n\
 @seealso{luupdate, ilu, chol, hess, qr, qz, schur, svd}\n\
 @end deftypefn")
 {
--- a/libinterp/corefcn/matrix_type.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/matrix_type.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -59,8 +59,8 @@
 to guess the type if it is still unknown.  This is useful for debugging\n\
 purposes.\n\
 \n\
-The possible matrix types depend on whether the matrix is full or sparse, and\n\
-can be one of the following\n\
+The possible matrix types depend on whether the matrix is full or sparse,\n\
+and can be one of the following\n\
 \n\
 @table @asis\n\
 @item @qcode{\"unknown\"}\n\
@@ -93,8 +93,8 @@
 @item  @qcode{\"banded\"}\n\
 @itemx @qcode{\"banded positive definite\"}\n\
 Banded matrix with the band size of @var{nl} below the diagonal and @var{nu}\n\
-above it.  If @var{nl} and @var{nu} are 1, then the matrix is tridiagonal and\n\
-treated with specialized code.  In addition the matrix can be marked as\n\
+above it.  If @var{nl} and @var{nu} are 1, then the matrix is tridiagonal\n\
+and treated with specialized code.  In addition the matrix can be marked as\n\
 probably a positive definite.  (Sparse matrices only)\n\
 \n\
 @item @qcode{\"singular\"}\n\
--- a/libinterp/corefcn/nproc.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/nproc.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -44,8 +44,8 @@
 processors available to the current process.\n\
 \n\
 @item overridable\n\
-same as @code{current}, but overridable through the @w{@env{OMP_NUM_THREADS}}\n\
-environment variable.\n\
+same as @code{current}, but overridable through the\n\
+@w{@env{OMP_NUM_THREADS}} environment variable.\n\
 @end table\n\
 @end deftypefn")
 {
--- a/libinterp/corefcn/pr-output.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/pr-output.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -3894,10 +3894,10 @@
 \n\
 @item  short e\n\
 @itemx long e\n\
-Exponential format.  The number to be represented is split between a mantissa\n\
-and an exponent (power of 10).  The mantissa has 5 significant digits in the\n\
-short format and 15 digits in the long format.\n\
-For example, with the @samp{short e} format, @code{pi} is displayed as\n\
+Exponential format.  The number to be represented is split between a\n\
+mantissa and an exponent (power of 10).  The mantissa has 5 significant\n\
+digits in the short format and 15 digits in the long format.  For example,\n\
+with the @samp{short e} format, @code{pi} is displayed as\n\
 @code{3.1416e+00}.\n\
 \n\
 @item  short E\n\
@@ -4000,8 +4000,8 @@
 @end example\n\
 \n\
 (shown here in two 32 bit sections for typesetting purposes) when\n\
-printed in native-bit format on a workstation which stores 8 byte real values\n\
-in IEEE format with the least significant byte first.\n\
+printed in native-bit format on a workstation which stores 8 byte real\n\
+values in IEEE format with the least significant byte first.\n\
 \n\
 @item bit\n\
 The same as @code{native-bit}, but always print the most significant\n\
--- a/libinterp/corefcn/quadcc.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/quadcc.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -1519,7 +1519,8 @@
 \n\
 @var{err} is an estimate of the absolute integration error.\n\
 \n\
-@var{nr_points} is the number of points at which the integrand was evaluated.\n\
+@var{nr_points} is the number of points at which the integrand was\n\
+evaluated.\n\
 \n\
 If the adaptive integration did not converge, the value of @var{err} will be\n\
 larger than the requested tolerance.  Therefore, it is recommended to verify\n\
--- a/libinterp/corefcn/regexp.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/regexp.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -832,8 +832,8 @@
 Alternatively, use (?-x) in the pattern.\n\
 \n\
 @item freespacing\n\
-The pattern may include arbitrary whitespace and also comments beginning with\n\
-the character @samp{#}.\n\
+The pattern may include arbitrary whitespace and also comments beginning\n\
+with the character @samp{#}.\n\
 \n\
 Alternatively, use (?x) in the pattern.\n\
 \n\
--- a/libinterp/corefcn/schur.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/schur.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -268,8 +268,8 @@
 DEFUN (rsf2csf, args, nargout,
        "-*- texinfo -*-\n\
 @deftypefn {} {[@var{U}, @var{T}] =} rsf2csf (@var{UR}, @var{TR})\n\
-Convert a real, upper quasi-triangular Schur@tie{}form @var{TR} to a complex,\n\
-upper triangular Schur@tie{}form @var{T}.\n\
+Convert a real, upper quasi-triangular Schur@tie{}form @var{TR} to a\n\
+complex, upper triangular Schur@tie{}form @var{T}.\n\
 \n\
 Note that the following relations hold:\n\
 \n\
--- a/libinterp/corefcn/sparse.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/sparse.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -79,8 +79,8 @@
 \n\
 @strong{Note}: if multiple values are specified with the same @var{i},\n\
 @var{j} indices, the corresponding value in @var{s} will be the sum of the\n\
-values at the repeated location.  See @code{accumarray} for an example of how\n\
-to produce different behavior, such as taking the minimum instead.\n\
+values at the repeated location.  See @code{accumarray} for an example of\n\
+how to produce different behavior, such as taking the minimum instead.\n\
 \n\
 If the option @qcode{\"unique\"} is given, and more than one value is\n\
 specified at the same @var{i}, @var{j} indices, then the last specified\n\
--- a/libinterp/corefcn/strfind.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/strfind.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -363,8 +363,8 @@
 can match at every position in @var{str} (true), or only for unique\n\
 occurrences of the complete pattern (false).  The default is true.\n\
 \n\
-@var{s} may also be a cell array of strings, in which case the replacement is\n\
-done for each element and a cell array is returned.\n\
+@var{s} may also be a cell array of strings, in which case the replacement\n\
+is done for each element and a cell array is returned.\n\
 \n\
 Example:\n\
 \n\
--- a/libinterp/corefcn/strfns.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/strfns.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -630,8 +630,8 @@
 DEFUN (strncmp, args, ,
        "-*- texinfo -*-\n\
 @deftypefn {} {} strncmp (@var{s1}, @var{s2}, @var{n})\n\
-Return 1 if the first @var{n} characters of strings @var{s1} and @var{s2} are\n\
-the same, and 0 otherwise.\n\
+Return 1 if the first @var{n} characters of strings @var{s1} and @var{s2}\n\
+are the same, and 0 otherwise.\n\
 \n\
 @example\n\
 @group\n\
--- a/libinterp/corefcn/syscalls.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/syscalls.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -233,8 +233,8 @@
    @print{} are\n\
 @end example\n\
 \n\
-Note that @code{popen2}, unlike @code{popen}, will not @nospell{\"reap\"} the\n\
-child process.  If you don't use @code{waitpid} to check the child's\n\
+Note that @code{popen2}, unlike @code{popen}, will not @nospell{\"reap\"}\n\
+the child process.  If you don't use @code{waitpid} to check the child's\n\
 exit status, it will linger until Octave exits.\n\
 @seealso{popen, waitpid}\n\
 @end deftypefn")
@@ -873,7 +873,8 @@
 @deftypefn {} {} S_ISREG (@var{mode})\n\
 Return true if @var{mode} corresponds to a regular file.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -890,7 +891,8 @@
 @deftypefn {} {} S_ISDIR (@var{mode})\n\
 Return true if @var{mode} corresponds to a directory.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -907,7 +909,8 @@
 @deftypefn {} {} S_ISCHR (@var{mode})\n\
 Return true if @var{mode} corresponds to a character device.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -924,7 +927,8 @@
 @deftypefn {} {} S_ISBLK (@var{mode})\n\
 Return true if @var{mode} corresponds to a block device.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -941,7 +945,8 @@
 @deftypefn {} {} S_ISFIFO (@var{mode})\n\
 Return true if @var{mode} corresponds to a fifo.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -958,7 +963,8 @@
 @deftypefn {} {} S_ISLNK (@var{mode})\n\
 Return true if @var{mode} corresponds to a symbolic link.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -975,7 +981,8 @@
 @deftypefn {} {} S_ISSOCK (@var{mode})\n\
 Return true if @var{mode} corresponds to a socket.\n\
 \n\
-The value of @var{mode} is assumed to be returned from a call to @code{stat}.\n\
+The value of @var{mode} is assumed to be returned from a call to\n\
+@code{stat}.\n\
 @seealso{stat, lstat}\n\
 @end deftypefn")
 {
@@ -1493,7 +1500,8 @@
         "-*- texinfo -*-\n\
 @deftypefn {} {} O_SYNC ()\n\
 Return the numerical value of the file status flag that may be\n\
-returned by @code{fcntl} to indicate that a file is open for synchronous I/O.\n\
+returned by @code{fcntl} to indicate that a file is open for synchronous\n\
+I/O.\n\
 @seealso{fcntl, O_APPEND, O_ASYNC, O_CREAT, O_EXCL, O_NONBLOCK, O_RDONLY, O_RDWR, O_TRUNC, O_WRONLY}\n\
 @end deftypefn")
 {
--- a/libinterp/corefcn/urlwrite.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/urlwrite.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -303,7 +303,7 @@
 If no output argument is specified and an error occurs, then the error is\n\
 signaled through Octave's error handling mechanism.\n\
 \n\
-This function uses libcurl.  Curl supports, among others, the HTTP, FTP and\n\
+This function uses libcurl.  Curl supports, among others, the HTTP, FTP, and\n\
 FILE protocols.  Username and password may be specified in the URL, for\n\
 example:\n\
 \n\
@@ -420,7 +420,7 @@
 If no output argument is specified and an error occurs, then the error is\n\
 signaled through Octave's error handling mechanism.\n\
 \n\
-This function uses libcurl.  Curl supports, among others, the HTTP, FTP and\n\
+This function uses libcurl.  Curl supports, among others, the HTTP, FTP, and\n\
 FILE protocols.  Username and password may be specified in the URL@.  For\n\
 example:\n\
 \n\
--- a/libinterp/corefcn/variables.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/corefcn/variables.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -2594,12 +2594,12 @@
 number of columns used for printing.  No maximum is needed as the field will\n\
 auto-expand as required.\n\
 \n\
-The parameters @code{left-min} and @code{balance} are only available when the\n\
-column-aligned modifier is used with the command @samp{%s}.\n\
-@code{balance} specifies the column number within the field width which will\n\
-be aligned between entries.  Numbering starts from 0 which indicates the\n\
-leftmost column.  @code{left-min} specifies the minimum field width to the\n\
-left of the specified balance column.\n\
+The parameters @code{left-min} and @code{balance} are only available when\n\
+the column-aligned modifier is used with the command @samp{%s}.\n\
+@code{balance} specifies the column number within the field width which\n\
+will be aligned between entries.  Numbering starts from 0 which indicates\n\
+the leftmost column.  @code{left-min} specifies the minimum field width to\n\
+the left of the specified balance column.\n\
 \n\
 The default format is:\n\
 \n\
--- a/libinterp/dldfcn/__osmesa_print__.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/__osmesa_print__.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -73,7 +73,8 @@
 Select output format.\n\
 \n\
 @item @qcode{is2D}\n\
-Use GL2PS_SIMPLE_SORT instead of GL2PS_BSP_SORT as Z-depth sorting algorithm.\n\
+Use GL2PS_SIMPLE_SORT instead of GL2PS_BSP_SORT as Z-depth sorting\n\
+algorithm.\n\
 \n\
 @item @qcode{notext}\n\
 Don't render text.\n\
--- a/libinterp/dldfcn/audiodevinfo.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/audiodevinfo.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -80,9 +80,9 @@
 Return a structure describing the available audio input and output devices.\n\
 \n\
 The @var{devinfo} structure has two fields @qcode{\"input\"} and\n\
-@qcode{\"output\"}.  The value of each field is a structure array with fields\n\
-@qcode{\"Name\"}, @nospell{\"DriverVersion\"} and @qcode{\"ID\"} describing\n\
-an audio device.\n\
+@qcode{\"output\"}.  The value of each field is a structure array with\n\
+fields @qcode{\"Name\"}, @nospell{\"DriverVersion\"} and @qcode{\"ID\"}\n\
+describing an audio device.\n\
 \n\
 If the optional argument @var{io} is 1, return information about input\n\
 devices only.  If it is 0, return information about output devices only.\n\
--- a/libinterp/dldfcn/audioread.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/audioread.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -237,7 +237,8 @@
 \n\
 @table @samp\n\
 @item BitsPerSample\n\
-Number of bits per sample, valid values are 8, 16, 24 and 32.  Default is 16.\n\
+Number of bits per sample.  Valid values are 8, 16, 24, and 32.  Default is\n\
+16.\n\
 \n\
 @item BitRate\n\
 Valid argument name, but ignored.  Left for compatibility with @sc{matlab}.\n\
--- a/libinterp/dldfcn/ccolamd.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/ccolamd.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -62,9 +62,9 @@
 Constrained column approximate minimum degree permutation.\n\
 \n\
 @code{@var{p} = ccolamd (@var{S})} returns the column approximate minimum\n\
-degree permutation vector for the sparse matrix @var{S}.  For a non-symmetric\n\
-matrix @var{S}, @code{@var{S}(:, @var{p})} tends to have sparser\n\
-LU@tie{}factors than @var{S}.\n\
+degree permutation vector for the sparse matrix @var{S}.  For a\n\
+non-symmetric matrix @var{S}, @code{@var{S}(:, @var{p})} tends to have\n\
+sparser LU@tie{}factors than @var{S}.\n\
 @code{chol (@var{S}(:, @var{p})' * @var{S}(:, @var{p}))} also tends to be\n\
 sparser than @code{chol (@var{S}' * @var{S})}.\n\
 @code{@var{p} = ccolamd (@var{S}, 1)} optimizes the ordering for\n\
@@ -345,7 +345,7 @@
 vector @var{p} such that @code{@var{S}(@var{p},@var{p})} tends to have a\n\
 sparser Cholesky@tie{}factor than @var{S}.\n\
 \n\
-Sometimes @code{csymamd} works well for symmetric indefinite matrices too. \n\
+Sometimes @code{csymamd} works well for symmetric indefinite matrices too.\n\
 The matrix @var{S} is assumed to be symmetric; only the strictly lower\n\
 triangular part is referenced.  @var{S} must be square.  The ordering is\n\
 followed by an elimination tree post-ordering.\n\
@@ -373,7 +373,8 @@
 in constraint set @var{c} (@var{c} must be in the range 1 to n).  In the\n\
 output permutation @var{p}, rows/columns in set 1 appear first, followed\n\
 by all rows/columns in set 2, and so on.  @code{@var{cmember} = ones (1,n)}\n\
-if not present or empty.  @code{csymamd (@var{S},[],1:n)} returns @code{1:n}.\n\
+if not present or empty.  @code{csymamd (@var{S},[],1:n)} returns\n\
+@code{1:n}.\n\
 \n\
 @code{@var{p} = csymamd (@var{S})} is about the same as\n\
 @code{@var{p} = symamd (@var{S})}.  @var{knobs} and its default values\n\
--- a/libinterp/dldfcn/chol.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/chol.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -72,8 +72,8 @@
 @deftypefnx {} {[@var{L}, @dots{}] =} chol (@dots{}, \"lower\")\n\
 @deftypefnx {} {[@var{L}, @dots{}] =} chol (@dots{}, \"upper\")\n\
 @cindex Cholesky factorization\n\
-Compute the Cholesky@tie{}factor, @var{R}, of the symmetric positive definite\n\
-matrix @var{A}.\n\
+Compute the Cholesky@tie{}factor, @var{R}, of the symmetric positive\n\
+definite matrix @var{A}.\n\
 \n\
 The Cholesky@tie{}factor is defined by\n\
 @tex\n\
--- a/libinterp/dldfcn/colamd.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/colamd.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -224,8 +224,8 @@
 @code{@var{S}(:,@var{p})' * @var{S}(:,@var{p})} also tends to be sparser\n\
 than that of @code{@var{S}' * @var{S}}.\n\
 \n\
-@var{knobs} is an optional one- to three-element input vector.  If @var{S} is\n\
-m-by-n, then rows with more than @code{max(16,@var{knobs}(1)*sqrt(n))}\n\
+@var{knobs} is an optional one- to three-element input vector.  If @var{S}\n\
+is m-by-n, then rows with more than @code{max(16,@var{knobs}(1)*sqrt(n))}\n\
 entries are ignored.  Columns with more than\n\
 @code{max (16,@var{knobs}(2)*sqrt(min(m,n)))} entries are removed prior to\n\
 ordering, and ordered last in the output permutation @var{p}.  Only\n\
@@ -250,11 +250,12 @@
 and so on.  If a matrix is invalid, then @sc{colamd} may or may not be able\n\
 to continue.  If there are duplicate entries (a row index appears two or\n\
 more times in the same column) or if the row indices in a column are out\n\
-of order, then @sc{colamd} can correct these errors by ignoring the duplicate\n\
-entries and sorting each column of its internal copy of the matrix\n\
-@var{S} (the input matrix @var{S} is not repaired, however).  If a matrix\n\
-is invalid in other ways then @sc{colamd} cannot continue, an error message\n\
-is printed, and no output arguments (@var{p} or @var{stats}) are returned.\n\
+of order, then @sc{colamd} can correct these errors by ignoring the\n\
+duplicate entries and sorting each column of its internal copy of the\n\
+matrix @var{S} (the input matrix @var{S} is not repaired, however).  If a\n\
+matrix is invalid in other ways then @sc{colamd} cannot continue, an error\n\
+message is printed, and no output arguments (@var{p} or @var{stats}) are\n\
+returned.\n\
 @sc{colamd} is thus a simple way to check a sparse matrix to see if it's\n\
 valid.\n\
 \n\
@@ -455,18 +456,18 @@
 vector p such that @code{@var{S}(@var{p}, @var{p})} tends to have a\n\
 sparser Cholesky@tie{}factor than @var{S}.\n\
 \n\
-Sometimes @code{symamd} works well for symmetric indefinite matrices too. \n\
+Sometimes @code{symamd} works well for symmetric indefinite matrices too.\n\
 The matrix @var{S} is assumed to be symmetric; only the strictly lower\n\
 triangular part is referenced.  @var{S} must be square.\n\
 \n\
 @var{knobs} is an optional one- to two-element input vector.  If @var{S} is\n\
 n-by-n, then rows and columns with more than\n\
-@code{max (16,@var{knobs}(1)*sqrt(n))} entries are removed prior to ordering,\n\
-and ordered last in the output permutation @var{p}.  No rows/columns are\n\
-removed if @code{@var{knobs}(1) < 0}.  If @code{@var{knobs} (2)} is nonzero,\n\
-@code{stats} and @var{knobs} are printed.  The default is\n\
-@code{@var{knobs} = [10 0]}.  Note that @var{knobs} differs from earlier\n\
-versions of @code{symamd}.\n\
+@code{max (16,@var{knobs}(1)*sqrt(n))} entries are removed prior to\n\
+ordering, and ordered last in the output permutation @var{p}.  No\n\
+rows/columns are removed if @code{@var{knobs}(1) < 0}.  If\n\
+@code{@var{knobs} (2)} is nonzero, @code{stats} and @var{knobs} are\n\
+printed.  The default is @code{@var{knobs} = [10 0]}.  Note that\n\
+@var{knobs} differs from earlier versions of @code{symamd}.\n\
 \n\
 @var{stats} is an optional 20-element output vector that provides data\n\
 about the ordering and the validity of the input matrix @var{S}.  Ordering\n\
--- a/libinterp/dldfcn/convhulln.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/convhulln.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -83,9 +83,9 @@
 The hull @var{h} is an index vector into the set of points and specifies\n\
 which points form the enclosing hull.\n\
 \n\
-An optional second argument, which must be a string or cell array of strings,\n\
-contains options passed to the underlying qhull command.\n\
-See the documentation for the Qhull library for details\n\
+An optional second argument, which must be a string or cell array of\n\
+strings, contains options passed to the underlying qhull command.  See the\n\
+documentation for the Qhull library for details\n\
 @url{http://www.qhull.org/html/qh-quick.htm#options}.\n\
 The default options depend on the dimension of the input:\n\
 \n\
--- a/libinterp/dldfcn/qr.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/qr.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -137,9 +137,9 @@
 @var{R} is upper triangular.\n\
 @end ifnottex\n\
 \n\
-If given a second argument of @qcode{'0'}, @code{qr} returns an economy-sized\n\
-QR@tie{}factorization, omitting zero rows of @var{R} and the corresponding\n\
-columns of @var{Q}.\n\
+If given a second argument of @qcode{'0'}, @code{qr} returns an\n\
+economy-sized QR@tie{}factorization, omitting zero rows of @var{R} and the\n\
+corresponding columns of @var{Q}.\n\
 \n\
 If the matrix @var{A} is full, the permuted QR@tie{}factorization\n\
 @code{[@var{Q}, @var{R}, @var{P}] = qr (@var{A})} forms the\n\
@@ -734,9 +734,9 @@
 @var{R}@tie{}upper trapezoidal, return the QR@tie{}factorization of\n\
 @w{@var{A} + @var{u}*@var{v}'}, where @var{u} and @var{v} are column vectors\n\
 (rank-1 update) or matrices with equal number of columns\n\
-(rank-k update).  Notice that the latter case is done as a sequence of rank-1\n\
-updates; thus, for k large enough, it will be both faster and more accurate\n\
-to recompute the factorization from scratch.\n\
+(rank-k update).  Notice that the latter case is done as a sequence of\n\
+rank-1 updates; thus, for k large enough, it will be both faster and more\n\
+accurate to recompute the factorization from scratch.\n\
 \n\
 The QR@tie{}factorization supplied may be either full (Q is square) or\n\
 economized (R is square).\n\
--- a/libinterp/dldfcn/symbfact.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/dldfcn/symbfact.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -82,7 +82,8 @@
 \n\
 @table @var\n\
 @item count\n\
-The row counts of the Cholesky@tie{}factorization as determined by @var{typ}.\n\
+The row counts of the Cholesky@tie{}factorization as determined by\n\
+@var{typ}.\n\
 \n\
 @item h\n\
 The height of the elimination tree.\n\
--- a/libinterp/octave-value/ov-java.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/octave-value/ov-java.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -2726,8 +2726,8 @@
 @deftypefn {} {@var{val} =} __java_get__ (@var{obj}, @var{name})\n\
 Get the value of the field @var{name} of the Java object @var{obj}.\n\
 \n\
-For static fields, @var{obj} can be a string representing the fully qualified\n\
-name of the corresponding class.\n\
+For static fields, @var{obj} can be a string representing the fully\n\
+qualified name of the corresponding class.\n\
 \n\
 When @var{obj} is a regular Java object, structure-like indexing can be used\n\
 as a shortcut syntax.  For instance, the two following statements are\n\
--- a/libinterp/octave-value/ov-struct.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/octave-value/ov-struct.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -1628,7 +1628,7 @@
 \n\
 If the values are cell arrays, create a structure array and initialize its\n\
 values.  The dimensions of each cell array of values must match.  Singleton\n\
-cells and non-cell values are repeated so that they fill the entire array. \n\
+cells and non-cell values are repeated so that they fill the entire array.\n\
 If the cells are empty, create an empty structure array with the specified\n\
 field names.\n\
 \n\
--- a/libinterp/octave-value/ov-usr-fcn.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/octave-value/ov-usr-fcn.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -871,9 +871,9 @@
 @deftypefnx {} {} nargout (@var{fcn})\n\
 Report the number of output arguments from a function.\n\
 \n\
-Called from within a function, return the number of values the caller expects\n\
-to receive.  At the top level, @code{nargout} with no argument is undefined\n\
-and will produce an error.\n\
+Called from within a function, return the number of values the caller\n\
+expects to receive.  At the top level, @code{nargout} with no argument is\n\
+undefined and will produce an error.\n\
 \n\
 If called with the optional argument @var{fcn}---a function name or\n\
 handle---return the number of declared output values that the function can\n\
--- a/libinterp/parse-tree/pt-arg-list.cc	Sun Mar 27 15:50:01 2016 -0700
+++ b/libinterp/parse-tree/pt-arg-list.cc	Sun Mar 27 20:39:19 2016 -0700
@@ -129,8 +129,8 @@
 DEFCONSTFUN (end, , ,
              "-*- texinfo -*-\n\
 @deftypefn {} {} end\n\
-The magic index @qcode{\"end\"} refers to the last valid entry in an indexing\n\
-operation.\n\
+The magic index @qcode{\"end\"} refers to the last valid entry in an\n\
+indexing operation.\n\
 \n\
 Example:\n\
 \n\