Mercurial > octave
view scripts/sparse/sprand.m @ 28886:d8318c12d903
test: remove unnecessary BIST tests in m-files checking for excessive number of inputs.
Remove BIST tests now that interpreter enforces calling function with no more than
the number of arguments defined in the function prototype.
* makeUniqueStrings.m, makeValidName.m, base64decode.m, base64encode.m,
record.m, sound.m, soundsc.m, acosd.m, acot.m, acotd.m, acoth.m, acsc.m,
acscd.m, acsch.m, asec.m, asecd.m, asech.m, asind.m, atan2d.m, atand.m, cosd.m,
cot.m, cotd.m, coth.m, csc.m, cscd.m, csch.m, sec.m, secd.m, sech.m, sind.m,
tand.m, accumdim.m, bincoeff.m, bitget.m, bitset.m, cell2mat.m, circshift.m,
cplxpair.m, cumtrapz.m, deg2rad.m, flip.m, fliplr.m, flipud.m, int2str.m,
interpft.m, logspace.m, num2str.m, postpad.m, prepad.m, rad2deg.m, rot90.m,
rotdim.m, shift.m, subsindex.m, trapz.m, rotx.m, roty.m, rotz.m, getappdata.m,
getpixelposition.m, guidata.m, isappdata.m, waitforbuttonpress.m,
__gripe_missing_component__.m, bessel.m, hsv2rgb.m, ind2gray.m, rgb2gray.m,
rgb2hsv.m, rgbplot.m, fileread.m, javachk.m, usejava.m, findstr.m,
genvarname.m, isdir.m, vectorize.m, cond.m, cross.m, duplication_matrix.m,
expm.m, isbanded.m, isdefinite.m, isdiag.m, ishermitian.m, issymmetric.m,
istril.m, istriu.m, trace.m, vech.m, vecnorm.m, cast.m, citation.m,
compare_versions.m, grabcode.m, inputname.m, isfile.m, isfolder.m, ismac.m,
ispc.m, isunix.m, list_primes.m, methods.m, news.m, open.m, run.m, swapbytes.m,
tar.m, verLessThan.m, zip.m, odeget.m, optimget.m, stemleaf.m, allchild.m,
ancestor.m, close.m, groot.m, hgsave.m, isaxes.m, isfigure.m, isgraphics.m,
ishandle.m, isprop.m, linkaxes.m, rotate.m, saveas.m, conv.m, poly.m,
polyint.m, polyreduce.m, ppval.m, roots.m, addpref.m, getpref.m, ispref.m,
rmpref.m, setpref.m, profile.m, profshow.m, powerset.m, autoreg_matrix.m,
bartlett.m, blackman.m, detrend.m, fftconv.m, fftfilt.m, fftshift.m, hamming.m,
hanning.m, ifftshift.m, sinewave.m, spectral_adf.m, spectral_xdf.m, unwrap.m,
nonzeros.m, spconvert.m, sprand.m, sprandn.m, beta.m, betainc.m, betaln.m,
cosint.m, expint.m, factorial.m, legendre.m, nchoosek.m, nthroot.m, perms.m,
pow2.m, primes.m, reallog.m, realpow.m, realsqrt.m, sinint.m, hankel.m, hilb.m,
invhilb.m, magic.m, pascal.m, toeplitz.m, vander.m, wilkinson.m, center.m,
corr.m, cov.m, discrete_cdf.m, discrete_inv.m, discrete_pdf.m, empirical_cdf.m,
empirical_inv.m, empirical_pdf.m, iqr.m, kendall.m, kurtosis.m, mad.m,
meansq.m, median.m, moment.m, prctile.m, quantile.m, range.m, run_count.m,
skewness.m, spearman.m, statistics.m, std.m, var.m, base2dec.m, bin2dec.m,
blanks.m, dec2base.m, dec2bin.m, dec2hex.m, endsWith.m, erase.m, hex2dec.m,
index.m, isletter.m, isstring.m, isstrprop.m, mat2str.m, ostrsplit.m, rindex.m,
startsWith.m, strtrunc.m, substr.m, fail.m, addtodate.m, asctime.m, ctime.m,
date.m, datestr.m, eomday.m, etime.m, is_leap_year.m, now.m:
remove unnecessary BIST tests in m-files checking for excessive number of inputs.
author | Rik <rik@octave.org> |
---|---|
date | Fri, 09 Oct 2020 13:28:53 -0700 |
parents | 28de41192f3c |
children | 7854d5752dd2 |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2004-2020 The Octave Project Developers ## ## See the file COPYRIGHT.md in the top-level directory of this ## distribution or <https://octave.org/copyright/>. ## ## This file is part of Octave. ## ## Octave is free software: you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation, either version 3 of the License, or ## (at your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <https://www.gnu.org/licenses/>. ## ######################################################################## ## ## Original version by Paul Kienzle distributed as free software in the ## public domain. ## -*- texinfo -*- ## @deftypefn {} {} sprand (@var{m}, @var{n}, @var{d}) ## @deftypefnx {} {} sprand (@var{m}, @var{n}, @var{d}, @var{rc}) ## @deftypefnx {} {} sprand (@var{s}) ## Generate a sparse matrix with uniformly distributed random values. ## ## The size of the matrix is @var{m}x@var{n} with a density of values @var{d}. ## @var{d} must be between 0 and 1. Values will be uniformly distributed on ## the interval (0, 1). ## ## If called with a single matrix argument, a sparse matrix is generated with ## random values wherever the matrix @var{s} is nonzero. ## ## If called with a scalar fourth argument @var{rc}, a random sparse matrix ## with reciprocal condition number @var{rc} is generated. If @var{rc} is ## a vector, then it specifies the first singular values of the generated ## matrix (@code{length (@var{rc}) <= min (@var{m}, @var{n})}). ## ## @seealso{sprandn, sprandsym, rand} ## @end deftypefn function s = sprand (m, n, d, rc) if (nargin == 1) s = __sprand__ (m, @rand); elseif (nargin == 3) s = __sprand__ (m, n, d, "sprand", @rand); elseif (nargin == 4) s = __sprand__ (m, n, d, rc, "sprand", @rand); else print_usage (); endif endfunction ## Test 3-input calling form %!test %! s = sprand (4, 10, 0.1); %! assert (size (s), [4, 10]); %! assert (nnz (s) / numel (s), 0.1); ## Test 4-input calling form %!test %! d = rand (); %! s1 = sprand (100, 100, d, 0.4); %! rc = [5, 4, 3, 2, 1, 0.1]; %! s2 = sprand (100, 100, d, rc); %! s3 = sprand (6, 4, d, rc); %! assert (svd (s2)'(1:length (rc)), rc, sqrt (eps)); %! assert (1/cond (s1), 0.4, sqrt (eps)); %! assert (nnz (s1) / (100*100), d, 0.02); %! assert (nnz (s2) / (100*100), d, 0.02); %! assert (svd (s3)', [5 4 3 2], sqrt (eps)); ## Test 1-input calling form %!test %! s = sprand (sparse ([1 2 3], [3 2 3], [2 2 2])); %! [i, j, v] = find (s); %! assert (sort (i), [1 2 3]'); %! assert (sort (j), [2 3 3]'); %! assert (all (v > 0 & v < 1)); ## Test very large, very low density matrix doesn't fail %!test %! s = sprand (1e6, 1e6, 1e-7); ## Test empty array creation %!assert (size (sprand (0, 0, 0.5)), [0, 0]) %!assert (size (sprand (0, 3, 0.5)), [0, 3]) %!assert (size (sprand (3, 0, 0.5)), [3, 0]) ## Test input validation %!error <Invalid call> sprand () %!error <Invalid call> sprand (1, 2) %!error <M must be a non-negative integer> sprand (-1, -1, 0.5) %!error <M must be a non-negative integer> sprand (ones (3), 3, 0.5) %!error <M must be a non-negative integer> sprand (3.5, 3, 0.5) %!error <M must be a non-negative integer> sprand (-1, 3, 0.5) %!error <N must be a non-negative integer> sprand (3, ones (3), 0.5) %!error <N must be a non-negative integer> sprand (3, 3.5, 0.5) %!error <N must be a non-negative integer> sprand (3, -1, 0.5) %!error <D must be between 0 and 1> sprand (3, 3, -1) %!error <D must be between 0 and 1> sprand (3, 3, 2) %!error <RC must be a scalar or vector> sprand (2, 2, 0.2, ones (3,3)) %!error <RC must be between 0 and 1> sprand (2, 2, 0.2, -1) %!error <RC must be between 0 and 1> sprand (2, 2, 0.2, 2)