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
|
#include "rb_lapack.h"
extern VOID dlaruv_(integer* iseed, integer* n, doublereal* x);
static VALUE
rblapack_dlaruv(int argc, VALUE *argv, VALUE self){
VALUE rblapack_iseed;
integer *iseed;
VALUE rblapack_n;
integer n;
VALUE rblapack_x;
doublereal *x;
VALUE rblapack_iseed_out__;
integer *iseed_out__;
VALUE rblapack_options;
if (argc > 0 && TYPE(argv[argc-1]) == T_HASH) {
argc--;
rblapack_options = argv[argc];
if (rb_hash_aref(rblapack_options, sHelp) == Qtrue) {
printf("%s\n", "USAGE:\n x, iseed = NumRu::Lapack.dlaruv( iseed, n, [:usage => usage, :help => help])\n\n\nFORTRAN MANUAL\n SUBROUTINE DLARUV( ISEED, N, X )\n\n* Purpose\n* =======\n*\n* DLARUV returns a vector of n random real numbers from a uniform (0,1)\n* distribution (n <= 128).\n*\n* This is an auxiliary routine called by DLARNV and ZLARNV.\n*\n\n* Arguments\n* =========\n*\n* ISEED (input/output) INTEGER array, dimension (4)\n* On entry, the seed of the random number generator; the array\n* elements must be between 0 and 4095, and ISEED(4) must be\n* odd.\n* On exit, the seed is updated.\n*\n* N (input) INTEGER\n* The number of random numbers to be generated. N <= 128.\n*\n* X (output) DOUBLE PRECISION array, dimension (N)\n* The generated random numbers.\n*\n\n* Further Details\n* ===============\n*\n* This routine uses a multiplicative congruential method with modulus\n* 2**48 and multiplier 33952834046453 (see G.S.Fishman,\n* 'Multiplicative congruential random number generators with modulus\n* 2**b: an exhaustive analysis for b = 32 and a partial analysis for\n* b = 48', Math. Comp. 189, pp 331-344, 1990).\n*\n* 48-bit integers are stored in 4 integer array elements with 12 bits\n* per element. Hence the routine is portable across machines with\n* integers of 32 bits or more.\n*\n* =====================================================================\n*\n\n");
return Qnil;
}
if (rb_hash_aref(rblapack_options, sUsage) == Qtrue) {
printf("%s\n", "USAGE:\n x, iseed = NumRu::Lapack.dlaruv( iseed, n, [:usage => usage, :help => help])\n");
return Qnil;
}
} else
rblapack_options = Qnil;
if (argc != 2 && argc != 2)
rb_raise(rb_eArgError,"wrong number of arguments (%d for 2)", argc);
rblapack_iseed = argv[0];
rblapack_n = argv[1];
if (argc == 2) {
} else if (rblapack_options != Qnil) {
} else {
}
if (!NA_IsNArray(rblapack_iseed))
rb_raise(rb_eArgError, "iseed (1th argument) must be NArray");
if (NA_RANK(rblapack_iseed) != 1)
rb_raise(rb_eArgError, "rank of iseed (1th argument) must be %d", 1);
if (NA_SHAPE0(rblapack_iseed) != (4))
rb_raise(rb_eRuntimeError, "shape 0 of iseed must be %d", 4);
if (NA_TYPE(rblapack_iseed) != NA_LINT)
rblapack_iseed = na_change_type(rblapack_iseed, NA_LINT);
iseed = NA_PTR_TYPE(rblapack_iseed, integer*);
n = NUM2INT(rblapack_n);
{
na_shape_t shape[1];
shape[0] = MAX(1,n);
rblapack_x = na_make_object(NA_DFLOAT, 1, shape, cNArray);
}
x = NA_PTR_TYPE(rblapack_x, doublereal*);
{
na_shape_t shape[1];
shape[0] = 4;
rblapack_iseed_out__ = na_make_object(NA_LINT, 1, shape, cNArray);
}
iseed_out__ = NA_PTR_TYPE(rblapack_iseed_out__, integer*);
MEMCPY(iseed_out__, iseed, integer, NA_TOTAL(rblapack_iseed));
rblapack_iseed = rblapack_iseed_out__;
iseed = iseed_out__;
dlaruv_(iseed, &n, x);
return rb_ary_new3(2, rblapack_x, rblapack_iseed);
}
void
init_lapack_dlaruv(VALUE mLapack, VALUE sH, VALUE sU, VALUE zero){
sHelp = sH;
sUsage = sU;
rblapack_ZERO = zero;
rb_define_module_function(mLapack, "dlaruv", rblapack_dlaruv, -1);
}
|
