1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
## Copyright (C) 2004-2013 Paul Kienzle
## Copyright (C) 2012 Jordi Gutiérrez Hermoso
##
## 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
## <http://www.gnu.org/licenses/>.
##
## Original version by Paul Kienzle distributed as free software in the
## public domain.
## -*- texinfo -*-
## @deftypefn {Function File} {} __sprand_impl__ (@var{s}, @var{randfun})
## @deftypefnx {Function File} {} __sprand_impl__ (@var{m}, @var{n}, @var{d}, @var{funname}, @var{randfun})
## Undocumented internal function.
## @end deftypefn
## Actual implementation of sprand and sprandn happens here.
function S = __sprand_impl__ (varargin)
if (nargin == 2)
m = varargin{1};
randfun = varargin{2};
[i, j] = find (m);
[nr, nc] = size (m);
S = sparse (i, j, randfun (size (i)), nr, nc);
return;
endif
[m, n, d, funname, randfun] = deal (varargin{:});
if (!(isscalar (m) && m == fix (m) && m > 0))
error ("%s: M must be an integer greater than 0", funname);
endif
if (!(isscalar (n) && n == fix (n) && n > 0))
error ("%s: N must be an integer greater than 0", funname);
endif
if (d < 0 || d > 1)
error ("%s: density D must be between 0 and 1", funname);
endif
mn = m*n;
k = round (d*mn);
if (mn > sizemax ())
## randperm will overflow, so use alternative methods
idx = unique (fix (rand (min (k*1.01, k+10), 1) * mn)) + 1;
## idx contains random numbers in [1,mn]
## generate 1% or 10 more random values than necessary in order to
## reduce the probability that there are less than k distinct
## values; maybe a better strategy could be used but I don't think
## it's worth the price
## actual number of entries in S
k = min (length (idx), k);
j = floor ((idx(1:k) - 1) / m);
i = idx(1:k) - j * m;
j++;
else
idx = randperm (mn, k);
[i, j] = ind2sub ([m, n], idx);
endif
S = sparse (i, j, randfun (k, 1), m, n);
endfunction
|
