gsl 1.12.108

Sign up to get free protection for your applications and to get access to all the features.
Files changed (158) hide show
  1. data/README.rdoc +29 -0
  2. data/Rakefile +54 -0
  3. data/VERSION +2 -0
  4. data/ext/MANIFEST +119 -0
  5. data/ext/alf.c +206 -0
  6. data/ext/array.c +666 -0
  7. data/ext/array_complex.c +247 -0
  8. data/ext/blas.c +29 -0
  9. data/ext/blas1.c +731 -0
  10. data/ext/blas2.c +1093 -0
  11. data/ext/blas3.c +881 -0
  12. data/ext/block.c +44 -0
  13. data/ext/block_source.c +886 -0
  14. data/ext/bspline.c +130 -0
  15. data/ext/bundle.c +3 -0
  16. data/ext/cdf.c +754 -0
  17. data/ext/cheb.c +542 -0
  18. data/ext/combination.c +283 -0
  19. data/ext/common.c +325 -0
  20. data/ext/complex.c +1004 -0
  21. data/ext/const.c +673 -0
  22. data/ext/const_additional.c +120 -0
  23. data/ext/cqp.c +283 -0
  24. data/ext/deriv.c +195 -0
  25. data/ext/dht.c +361 -0
  26. data/ext/diff.c +166 -0
  27. data/ext/dirac.c +395 -0
  28. data/ext/eigen.c +2373 -0
  29. data/ext/error.c +194 -0
  30. data/ext/extconf.rb +281 -0
  31. data/ext/fcmp.c +66 -0
  32. data/ext/fft.c +1092 -0
  33. data/ext/fit.c +205 -0
  34. data/ext/fresnel.c +312 -0
  35. data/ext/function.c +524 -0
  36. data/ext/geometry.c +139 -0
  37. data/ext/graph.c +1638 -0
  38. data/ext/gsl.c +271 -0
  39. data/ext/gsl_narray.c +653 -0
  40. data/ext/histogram.c +1995 -0
  41. data/ext/histogram2d.c +1068 -0
  42. data/ext/histogram3d.c +884 -0
  43. data/ext/histogram3d_source.c +750 -0
  44. data/ext/histogram_find.c +101 -0
  45. data/ext/histogram_oper.c +159 -0
  46. data/ext/ieee.c +98 -0
  47. data/ext/integration.c +1138 -0
  48. data/ext/interp.c +512 -0
  49. data/ext/jacobi.c +739 -0
  50. data/ext/linalg.c +4047 -0
  51. data/ext/linalg_complex.c +741 -0
  52. data/ext/math.c +725 -0
  53. data/ext/matrix.c +39 -0
  54. data/ext/matrix_complex.c +1732 -0
  55. data/ext/matrix_double.c +560 -0
  56. data/ext/matrix_int.c +256 -0
  57. data/ext/matrix_source.c +2733 -0
  58. data/ext/min.c +250 -0
  59. data/ext/monte.c +992 -0
  60. data/ext/multifit.c +1879 -0
  61. data/ext/multimin.c +808 -0
  62. data/ext/multimin_fsdf.c +156 -0
  63. data/ext/multiroots.c +955 -0
  64. data/ext/ndlinear.c +321 -0
  65. data/ext/nmf.c +167 -0
  66. data/ext/nmf_wrap.c +72 -0
  67. data/ext/ntuple.c +469 -0
  68. data/ext/odeiv.c +959 -0
  69. data/ext/ool.c +879 -0
  70. data/ext/oper_complex_source.c +253 -0
  71. data/ext/permutation.c +596 -0
  72. data/ext/poly.c +42 -0
  73. data/ext/poly2.c +265 -0
  74. data/ext/poly_source.c +1885 -0
  75. data/ext/qrng.c +171 -0
  76. data/ext/randist.c +1873 -0
  77. data/ext/rational.c +480 -0
  78. data/ext/rng.c +612 -0
  79. data/ext/root.c +408 -0
  80. data/ext/sf.c +1494 -0
  81. data/ext/sf_airy.c +200 -0
  82. data/ext/sf_bessel.c +867 -0
  83. data/ext/sf_clausen.c +28 -0
  84. data/ext/sf_coulomb.c +206 -0
  85. data/ext/sf_coupling.c +118 -0
  86. data/ext/sf_dawson.c +29 -0
  87. data/ext/sf_debye.c +157 -0
  88. data/ext/sf_dilog.c +42 -0
  89. data/ext/sf_elementary.c +44 -0
  90. data/ext/sf_ellint.c +206 -0
  91. data/ext/sf_elljac.c +29 -0
  92. data/ext/sf_erfc.c +93 -0
  93. data/ext/sf_exp.c +164 -0
  94. data/ext/sf_expint.c +211 -0
  95. data/ext/sf_fermi_dirac.c +148 -0
  96. data/ext/sf_gamma.c +344 -0
  97. data/ext/sf_gegenbauer.c +96 -0
  98. data/ext/sf_hyperg.c +197 -0
  99. data/ext/sf_laguerre.c +112 -0
  100. data/ext/sf_lambert.c +47 -0
  101. data/ext/sf_legendre.c +367 -0
  102. data/ext/sf_log.c +104 -0
  103. data/ext/sf_mathieu.c +238 -0
  104. data/ext/sf_power.c +46 -0
  105. data/ext/sf_psi.c +98 -0
  106. data/ext/sf_synchrotron.c +48 -0
  107. data/ext/sf_transport.c +76 -0
  108. data/ext/sf_trigonometric.c +207 -0
  109. data/ext/sf_zeta.c +119 -0
  110. data/ext/signal.c +310 -0
  111. data/ext/siman.c +718 -0
  112. data/ext/sort.c +208 -0
  113. data/ext/spline.c +395 -0
  114. data/ext/stats.c +799 -0
  115. data/ext/sum.c +168 -0
  116. data/ext/tamu_anova.c +56 -0
  117. data/ext/tensor.c +38 -0
  118. data/ext/tensor_source.c +1123 -0
  119. data/ext/vector.c +38 -0
  120. data/ext/vector_complex.c +2236 -0
  121. data/ext/vector_double.c +1433 -0
  122. data/ext/vector_int.c +204 -0
  123. data/ext/vector_source.c +3329 -0
  124. data/ext/wavelet.c +937 -0
  125. data/include/rb_gsl.h +151 -0
  126. data/include/rb_gsl_array.h +238 -0
  127. data/include/rb_gsl_cheb.h +21 -0
  128. data/include/rb_gsl_common.h +343 -0
  129. data/include/rb_gsl_complex.h +25 -0
  130. data/include/rb_gsl_const.h +29 -0
  131. data/include/rb_gsl_dirac.h +13 -0
  132. data/include/rb_gsl_eigen.h +17 -0
  133. data/include/rb_gsl_fft.h +62 -0
  134. data/include/rb_gsl_fit.h +25 -0
  135. data/include/rb_gsl_function.h +27 -0
  136. data/include/rb_gsl_graph.h +70 -0
  137. data/include/rb_gsl_histogram.h +63 -0
  138. data/include/rb_gsl_histogram3d.h +97 -0
  139. data/include/rb_gsl_integration.h +17 -0
  140. data/include/rb_gsl_interp.h +46 -0
  141. data/include/rb_gsl_linalg.h +25 -0
  142. data/include/rb_gsl_math.h +26 -0
  143. data/include/rb_gsl_odeiv.h +21 -0
  144. data/include/rb_gsl_poly.h +71 -0
  145. data/include/rb_gsl_rational.h +37 -0
  146. data/include/rb_gsl_rng.h +21 -0
  147. data/include/rb_gsl_root.h +22 -0
  148. data/include/rb_gsl_sf.h +119 -0
  149. data/include/rb_gsl_statistics.h +17 -0
  150. data/include/rb_gsl_tensor.h +45 -0
  151. data/include/rb_gsl_with_narray.h +22 -0
  152. data/include/templates_off.h +87 -0
  153. data/include/templates_on.h +241 -0
  154. data/lib/gsl/gnuplot.rb +41 -0
  155. data/lib/gsl/oper.rb +68 -0
  156. data/lib/ool.rb +22 -0
  157. data/lib/ool/conmin.rb +30 -0
  158. metadata +224 -0
@@ -0,0 +1,361 @@
1
+ /*
2
+ dht.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2001-2006 by Yoshiki Tsunesada
5
+
6
+ Ruby/GSL is free software: you can redistribute it and/or modify it
7
+ under the terms of the GNU General Public License.
8
+ This library is distributed in the hope that it will be useful, but
9
+ WITHOUT ANY WARRANTY.
10
+ */
11
+
12
+ #include "rb_gsl.h"
13
+ #include "rb_gsl_array.h"
14
+ #include "rb_gsl_common.h"
15
+ #include <gsl/gsl_dht.h>
16
+ #ifdef HAVE_NARRAY_H
17
+ #include "narray.h"
18
+ #endif
19
+
20
+ static VALUE rb_gsl_dht_alloc(int argc, VALUE *argv, VALUE klass)
21
+ {
22
+ gsl_dht *t = NULL;
23
+ switch (argc) {
24
+ case 1:
25
+ CHECK_FIXNUM(argv[0]);
26
+ t = gsl_dht_alloc(FIX2INT(argv[0]));
27
+ break;
28
+ case 3:
29
+ CHECK_FIXNUM(argv[0]);
30
+ Need_Float(argv[1]); Need_Float(argv[2]);
31
+ t = gsl_dht_new(FIX2INT(argv[0]), NUM2DBL(argv[1]), NUM2DBL(argv[2]));
32
+ break;
33
+ default:
34
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 1 or 3)", argc);
35
+ break;
36
+ }
37
+ return Data_Wrap_Struct(klass, 0, gsl_dht_free, t);
38
+ }
39
+
40
+ static VALUE rb_gsl_dht_init(VALUE obj, VALUE nu, VALUE xmax)
41
+ {
42
+ gsl_dht *t = NULL;
43
+ Need_Float(nu); Need_Float(xmax);
44
+ Data_Get_Struct(obj, gsl_dht, t);
45
+ gsl_dht_init(t, NUM2DBL(nu), NUM2DBL(xmax));
46
+ return obj;
47
+ }
48
+
49
+ static VALUE rb_gsl_dht_apply(int argc, VALUE *argv, VALUE obj)
50
+ {
51
+ gsl_dht *t = NULL;
52
+ double *ptr1, *ptr2;
53
+ gsl_vector *vin, *vout;
54
+ size_t size, stride;
55
+ #ifdef HAVE_NARRAY_H
56
+ struct NARRAY *na;
57
+ #endif
58
+ VALUE ary;
59
+ switch (argc) {
60
+ case 2:
61
+ Data_Get_Struct(obj, gsl_dht, t);
62
+ ptr1 = get_vector_ptr(argv[0], &stride, &size);
63
+ ptr2 = get_vector_ptr(argv[1], &stride, &size);
64
+ return INT2FIX(gsl_dht_apply(t, ptr1, ptr2));
65
+ break;
66
+ case 1:
67
+ Data_Get_Struct(obj, gsl_dht, t);
68
+ if (VECTOR_P(argv[0])) {
69
+ Data_Get_Struct(argv[0], gsl_vector, vin);
70
+ ptr1 = vin->data;
71
+ vout = gsl_vector_alloc(vin->size);
72
+ ptr2 = vout->data;
73
+ ary = Data_Wrap_Struct(VECTOR_ROW_COL(argv[0]), 0, gsl_vector_free, vout);
74
+ #ifdef HAVE_NARRAY_H
75
+ } else if (NA_IsNArray(argv[0])) {
76
+ GetNArray(argv[0], na);
77
+ ptr1 = (double*)na->ptr;
78
+ ary = na_make_object(NA_DFLOAT, na->rank, na->shape, CLASS_OF(argv[0]));
79
+ ptr2 = NA_PTR_TYPE(ary, double*);
80
+ #endif
81
+ } else {
82
+ rb_raise(rb_eTypeError, "wrong argument type %s (Vector expected)",
83
+ rb_class2name(CLASS_OF(argv[0])));
84
+ }
85
+ gsl_dht_apply(t, ptr1, ptr2);
86
+ return ary;
87
+ break;
88
+ default:
89
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 1 or 2)", argc);
90
+ break;
91
+ }
92
+ return Qnil; /* never reach here */
93
+ }
94
+
95
+ static VALUE rb_gsl_dht_xk_sample(VALUE obj, VALUE n,
96
+ double (*sample)(const gsl_dht*, int))
97
+ {
98
+ gsl_dht *t = NULL;
99
+ gsl_vector_int *vi;
100
+ gsl_vector *v;
101
+ size_t i, size;
102
+ int nn;
103
+ VALUE ary;
104
+ double val;
105
+ #ifdef HAVE_NARRAY_H
106
+ struct NARRAY *na;
107
+ int *ptr;
108
+ double *ptr2;
109
+ #endif
110
+ Data_Get_Struct(obj, gsl_dht, t);
111
+ if (CLASS_OF(n) == rb_cRange) n = rb_gsl_range2ary(n);
112
+ switch (TYPE(n)) {
113
+ case T_FIXNUM:
114
+ return rb_float_new((*sample)(t, FIX2INT(n)));
115
+ break;
116
+ case T_ARRAY:
117
+ // size = RARRAY(n)->len;
118
+ size = RARRAY_LEN(n);
119
+ ary = rb_ary_new2(size);
120
+ for (i = 0; i < size; i++) {
121
+ nn = FIX2INT(rb_ary_entry(n, i));
122
+ val = (*sample)(t, nn);
123
+ rb_ary_store(ary, i, rb_float_new(val));
124
+ }
125
+ return ary;
126
+ break;
127
+ default:
128
+ if (VECTOR_INT_P(n)) {
129
+ Data_Get_Struct(n, gsl_vector_int, vi);
130
+ v = gsl_vector_alloc(vi->size);
131
+ for (i = 0; i < v->size; i++) {
132
+ nn = gsl_vector_int_get(vi, i);
133
+ val = (*sample)(t, nn);
134
+ gsl_vector_set(v, i, val);
135
+ }
136
+ return Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, v);
137
+ #ifdef HAVE_NARRAY_H
138
+ } else if (NA_IsNArray(n)) {
139
+ GetNArray(n, na);
140
+ ptr = (int*) na->ptr;
141
+ size = na->total;
142
+ ary = na_make_object(NA_DFLOAT, na->rank, na->shape, cNArray);
143
+ ptr2 = NA_PTR_TYPE(ary, double*);
144
+ for (i = 0; i < size; i++) {
145
+ ptr2[i] = (*sample)(t, ptr[i]);
146
+ }
147
+ return ary;
148
+ #endif
149
+ } else {
150
+ rb_raise(rb_eTypeError, "wrong argument type %s (Vector::Int expected)",
151
+ rb_class2name(CLASS_OF(n)));
152
+ }
153
+
154
+ }
155
+ return Qnil;
156
+ }
157
+
158
+ static VALUE rb_gsl_dht_x_sample(VALUE obj, VALUE n)
159
+ {
160
+ return rb_gsl_dht_xk_sample(obj, n, gsl_dht_x_sample);
161
+ }
162
+
163
+ static VALUE rb_gsl_dht_k_sample(VALUE obj, VALUE n)
164
+ {
165
+ return rb_gsl_dht_xk_sample(obj, n, gsl_dht_k_sample);
166
+ }
167
+
168
+ static VALUE rb_gsl_dht_j(VALUE obj)
169
+ {
170
+ gsl_dht *t = NULL;
171
+ gsl_vector_view *v = NULL;
172
+ Data_Get_Struct(obj, gsl_dht, t);
173
+ v = rb_gsl_make_vector_view(t->j, (t->size+2), 1);
174
+ return Data_Wrap_Struct(cgsl_vector_view_ro, 0, free, v);
175
+ }
176
+
177
+ static VALUE rb_gsl_dht_zero(VALUE obj)
178
+ {
179
+ gsl_dht *t = NULL;
180
+ gsl_vector_view *v = NULL;
181
+ Data_Get_Struct(obj, gsl_dht, t);
182
+ v = rb_gsl_make_vector_view(t->j+1, (t->size+1), 1);
183
+ return Data_Wrap_Struct(cgsl_vector_view_ro, 0, free, v);
184
+ }
185
+
186
+ static VALUE rb_gsl_dht_Jjj(VALUE obj)
187
+ {
188
+ gsl_dht *t = NULL;
189
+ gsl_vector_view *v = NULL;
190
+ Data_Get_Struct(obj, gsl_dht, t);
191
+ v = rb_gsl_make_vector_view(t->Jjj, t->size*(t->size+1)/2, 1);
192
+ return Data_Wrap_Struct(cgsl_vector_view_ro, 0, free, v);
193
+ }
194
+
195
+ static VALUE rb_gsl_dht_sample(int argc, VALUE *argv, VALUE obj)
196
+ {
197
+ gsl_dht *t = NULL;
198
+ gsl_matrix *mm = NULL;
199
+ size_t n, m;
200
+ double val;
201
+ Data_Get_Struct(obj, gsl_dht, t);
202
+ switch (argc) {
203
+ case 0:
204
+ mm = gsl_matrix_alloc(t->size, t->size);
205
+ for (n = 0; n < t->size; n++) {
206
+ for (m = 0; m < t->size; m++) {
207
+ val = t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax;
208
+ gsl_matrix_set(mm, n, m, val);
209
+ }
210
+ }
211
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mm);
212
+ break;
213
+ case 2:
214
+ n = FIX2INT(argv[0]);
215
+ m = FIX2INT(argv[1]);
216
+ val = t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax;
217
+ return rb_float_new(val);
218
+ break;
219
+ default:
220
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 0 or 2)", argc);
221
+ break;
222
+ }
223
+ return Qnil;
224
+ }
225
+
226
+ static VALUE rb_gsl_dht_num(int argc, VALUE *argv, VALUE obj)
227
+ {
228
+ gsl_dht *t = NULL;
229
+ gsl_matrix *mm = NULL;
230
+ size_t n, m;
231
+ double val;
232
+ Data_Get_Struct(obj, gsl_dht, t);
233
+ switch (argc) {
234
+ case 0:
235
+ mm = gsl_matrix_alloc(t->size, t->size);
236
+ for (n = 0; n < t->size; n++) {
237
+ for (m = 0; m < t->size; m++) {
238
+ val = gsl_sf_bessel_Jnu(t->nu, t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax);
239
+ gsl_matrix_set(mm, n, m, val);
240
+ }
241
+ }
242
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mm);
243
+ break;
244
+ case 2:
245
+ n = FIX2INT(argv[0]);
246
+ m = FIX2INT(argv[1]);
247
+ val = gsl_sf_bessel_Jnu(t->nu, t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax);
248
+ return rb_float_new(val);
249
+ break;
250
+ default:
251
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 0 or 2)", argc);
252
+ break;
253
+ }
254
+ return Qnil;
255
+ }
256
+
257
+ static VALUE rb_gsl_dht_J2(VALUE obj)
258
+ {
259
+ gsl_dht *t = NULL;
260
+ gsl_vector_view *v = NULL;
261
+ Data_Get_Struct(obj, gsl_dht, t);
262
+ v = rb_gsl_make_vector_view(t->J2, t->size+1, 1);
263
+ return Data_Wrap_Struct(cgsl_vector_view_ro, 0, free, v);
264
+ }
265
+
266
+ static VALUE rb_gsl_dht_den(VALUE obj)
267
+ {
268
+ gsl_dht *t = NULL;
269
+ gsl_vector_view *v = NULL;
270
+ Data_Get_Struct(obj, gsl_dht, t);
271
+ v = rb_gsl_make_vector_view(t->J2+1, t->size, 1);
272
+ return Data_Wrap_Struct(cgsl_vector_view_ro, 0, free, v);
273
+ }
274
+
275
+ static VALUE rb_gsl_dht_size(VALUE obj)
276
+ {
277
+ gsl_dht *t = NULL;
278
+ Data_Get_Struct(obj, gsl_dht, t);
279
+ return INT2FIX(t->size);
280
+ }
281
+
282
+ static VALUE rb_gsl_dht_nu(VALUE obj)
283
+ {
284
+ gsl_dht *t = NULL;
285
+ Data_Get_Struct(obj, gsl_dht, t);
286
+ return rb_float_new(t->nu);
287
+ }
288
+
289
+ static VALUE rb_gsl_dht_xmax(VALUE obj)
290
+ {
291
+ gsl_dht *t = NULL;
292
+ Data_Get_Struct(obj, gsl_dht, t);
293
+ return rb_float_new(t->xmax);
294
+ }
295
+
296
+ static VALUE rb_gsl_dht_kmax(VALUE obj)
297
+ {
298
+ gsl_dht *t = NULL;
299
+ Data_Get_Struct(obj, gsl_dht, t);
300
+ return rb_float_new(t->kmax);
301
+ }
302
+
303
+ static VALUE rb_gsl_dht_coef(int argc, VALUE *argv, VALUE obj)
304
+ {
305
+ gsl_dht *t = NULL;
306
+ gsl_matrix *mm = NULL;
307
+ size_t n, m;
308
+ double val;
309
+ Data_Get_Struct(obj, gsl_dht, t);
310
+ switch (argc) {
311
+ case 0:
312
+ mm = gsl_matrix_alloc(t->size, t->size);
313
+ for (n = 0; n < t->size; n++) {
314
+ for (m = 0; m < t->size; m++) {
315
+ val = gsl_sf_bessel_Jnu(t->nu, t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax);
316
+ val *= (2.0/t->xmax/t->xmax)/t->J2[m+1];
317
+ gsl_matrix_set(mm, n, m, val);
318
+ }
319
+ }
320
+ return Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mm);
321
+ break;
322
+ case 2:
323
+ n = FIX2INT(argv[0]);
324
+ m = FIX2INT(argv[1]);
325
+ val = gsl_sf_bessel_Jnu(t->nu, t->j[n+1]*gsl_dht_x_sample(t, m)/t->xmax);
326
+ val *= (2.0/t->xmax/t->xmax)/t->J2[m+1];
327
+ return rb_float_new(val);
328
+ break;
329
+ default:
330
+ rb_raise(rb_eArgError, "wrong number of arguments (%d for 0 or 2)", argc);
331
+ break;
332
+ }
333
+ return Qnil;
334
+ }
335
+
336
+ void Init_gsl_dht(VALUE module)
337
+ {
338
+ VALUE cgsl_dht;
339
+ cgsl_dht = rb_define_class_under(module, "Dht", cGSL_Object);
340
+ rb_define_singleton_method(cgsl_dht, "alloc", rb_gsl_dht_alloc, -1);
341
+ rb_define_method(cgsl_dht, "init", rb_gsl_dht_init, 2);
342
+ rb_define_method(cgsl_dht, "apply", rb_gsl_dht_apply, -1);
343
+ rb_define_method(cgsl_dht, "x_sample", rb_gsl_dht_x_sample, 1);
344
+ rb_define_method(cgsl_dht, "k_sample", rb_gsl_dht_k_sample, 1);
345
+
346
+ rb_define_method(cgsl_dht, "size", rb_gsl_dht_size, 0);
347
+ rb_define_method(cgsl_dht, "nu", rb_gsl_dht_nu, 0);
348
+ rb_define_method(cgsl_dht, "xmax", rb_gsl_dht_xmax, 0);
349
+ rb_define_method(cgsl_dht, "kmax", rb_gsl_dht_kmax, 0);
350
+
351
+ rb_define_method(cgsl_dht, "j", rb_gsl_dht_j, 0);
352
+ rb_define_method(cgsl_dht, "Jjj", rb_gsl_dht_Jjj, 0);
353
+ rb_define_method(cgsl_dht, "J2", rb_gsl_dht_J2, 0);
354
+
355
+ rb_define_method(cgsl_dht, "zero", rb_gsl_dht_zero, 0);
356
+ rb_define_alias(cgsl_dht, "zeros", "zero");
357
+ rb_define_method(cgsl_dht, "sample", rb_gsl_dht_sample, -1);
358
+ rb_define_method(cgsl_dht, "num", rb_gsl_dht_num, -1);
359
+ rb_define_method(cgsl_dht, "den", rb_gsl_dht_den, 0);
360
+ rb_define_method(cgsl_dht, "coef", rb_gsl_dht_coef, -1);
361
+ }
@@ -0,0 +1,166 @@
1
+ /*
2
+ diff.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2001-2006 by Yoshiki Tsunesada
5
+
6
+ Ruby/GSL is free software: you can redistribute it and/or modify it
7
+ under the terms of the GNU General Public License.
8
+ This library is distributed in the hope that it will be useful, but
9
+ WITHOUT ANY WARRANTY.
10
+ */
11
+ #include "rb_gsl_config.h"
12
+ #include "rb_gsl_common.h"
13
+ #include "rb_gsl_function.h"
14
+ #include <gsl/gsl_math.h>
15
+ #include <gsl/gsl_diff.h>
16
+
17
+ static int get_func(int argc, VALUE *argv, VALUE obj, VALUE *ff, VALUE *xx);
18
+
19
+ static int get_func(int argc, VALUE *argv, VALUE obj, VALUE *ff, VALUE *xx)
20
+ {
21
+ switch (TYPE(obj)) {
22
+ case T_MODULE:
23
+ case T_CLASS:
24
+ case T_OBJECT:
25
+ if (argc != 2) rb_raise(rb_eArgError, "wrong number of arguments (%d for 2)",
26
+ argc);
27
+ CHECK_FUNCTION(argv[0]);
28
+ *ff = argv[0];
29
+ *xx = argv[1];
30
+ break;
31
+ default:
32
+ if (argc != 1) rb_raise(rb_eArgError, "wrong number of arguments (%d for 1)",
33
+ argc);
34
+ *ff = obj;
35
+ *xx = argv[0];
36
+ break;
37
+ }
38
+ return 0;
39
+ }
40
+
41
+ static VALUE rb_gsl_diff_eval(VALUE obj, VALUE xx,
42
+ int (*diff)(const gsl_function *, double, double *, double *))
43
+ {
44
+ gsl_function *f = NULL;
45
+ double result, abserr;
46
+ VALUE x, ary, aerr;
47
+ gsl_vector *v = NULL, *vnew = NULL, *verr = NULL;
48
+ gsl_matrix *m = NULL, *mnew = NULL, *merr = NULL;
49
+ size_t n, i, j;
50
+ int status;
51
+ #ifdef HAVE_NARRAY_H
52
+ double *ptr1, *ptr2, *ptr3;
53
+ struct NARRAY *na;
54
+ VALUE ary2, ary3;
55
+ #endif
56
+ Data_Get_Struct(obj, gsl_function, f);
57
+ if (CLASS_OF(xx) == rb_cRange) xx = rb_gsl_range2ary(xx);
58
+ switch (TYPE(xx)) {
59
+ case T_FIXNUM:
60
+ case T_BIGNUM:
61
+ case T_FLOAT:
62
+ status = (*diff)(f, NUM2DBL(xx), &result, &abserr);
63
+ return rb_ary_new3(3, rb_float_new(result), rb_float_new(abserr), INT2FIX(status));
64
+ break;
65
+ case T_ARRAY:
66
+ // n = RARRAY(xx)->len;
67
+ n = RARRAY_LEN(xx);
68
+ ary = rb_ary_new2(n);
69
+ aerr = rb_ary_new2(n);
70
+ for (i = 0; i < n; i++) {
71
+ x = rb_ary_entry(xx, i);
72
+ Need_Float(x);
73
+ (*diff)(f, NUM2DBL(x), &result, &abserr);
74
+ rb_ary_store(ary, i, rb_float_new(result));
75
+ rb_ary_store(aerr, i, rb_float_new(abserr));
76
+ }
77
+ return rb_ary_new3(2, ary, aerr);
78
+ break;
79
+ default:
80
+ #ifdef HAVE_NARRAY_H
81
+ if (NA_IsNArray(xx)) {
82
+ GetNArray(xx, na);
83
+ n = na->total;
84
+ ptr1 = (double*) na->ptr;
85
+ ary2 = na_make_object(NA_DFLOAT, na->rank, na->shape, CLASS_OF(xx));
86
+ ary3 = na_make_object(NA_DFLOAT, na->rank, na->shape, CLASS_OF(xx));
87
+ ptr2 = NA_PTR_TYPE(ary2, double*);
88
+ ptr3 = NA_PTR_TYPE(ary3, double*);
89
+ for (i = 0; i < n; i++) {
90
+ (*diff)(f, ptr1[i], &result, &abserr);
91
+ ptr2[i] = result;
92
+ ptr3[i] = abserr;
93
+ }
94
+ return rb_ary_new3(2, ary2, ary3);
95
+ }
96
+ #endif
97
+ if (VECTOR_P(xx)) {
98
+ Data_Get_Struct(xx, gsl_vector, v);
99
+ vnew = gsl_vector_alloc(v->size);
100
+ verr = gsl_vector_alloc(v->size);
101
+ for (i = 0; i < v->size; i++) {
102
+ (*diff)(f, gsl_vector_get(v, i), &result, &abserr);
103
+ gsl_vector_set(vnew, i, result);
104
+ gsl_vector_set(verr, i, abserr);
105
+ }
106
+ return rb_ary_new3(2,
107
+ Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, vnew),
108
+ Data_Wrap_Struct(cgsl_vector, 0, gsl_vector_free, verr));
109
+ } else if (MATRIX_P(xx)) {
110
+ Data_Get_Struct(xx, gsl_matrix, m);
111
+ mnew = gsl_matrix_alloc(m->size1, m->size2);
112
+ merr = gsl_matrix_alloc(m->size1, m->size2);
113
+ for (i = 0; i < m->size1; i++) {
114
+ for (j = 0; j < m->size2; j++) {
115
+ (*diff)(f, gsl_matrix_get(m, i, j), &result, &abserr);
116
+ gsl_matrix_set(mnew, i, j, result);
117
+ gsl_matrix_set(merr, i, j, abserr);
118
+ }
119
+ }
120
+ return rb_ary_new3(2,
121
+ Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, mnew),
122
+ Data_Wrap_Struct(cgsl_matrix, 0, gsl_matrix_free, merr));
123
+ } else {
124
+ rb_raise(rb_eTypeError, "wrong argument type");
125
+ }
126
+ break;
127
+ }
128
+ return Qnil; /* never reach here */
129
+ }
130
+
131
+ static VALUE rb_gsl_diff_central(int argc, VALUE *argv, VALUE obj)
132
+ {
133
+ VALUE ff, xx;
134
+ get_func(argc, argv, obj, &ff, &xx);
135
+ return rb_gsl_diff_eval(ff, xx, gsl_diff_central);
136
+ }
137
+
138
+ static VALUE rb_gsl_diff_forward(int argc, VALUE *argv, VALUE obj)
139
+ {
140
+ VALUE ff, xx;
141
+ get_func(argc, argv, obj, &ff, &xx);
142
+ return rb_gsl_diff_eval(ff, xx, gsl_diff_forward);
143
+ }
144
+
145
+ static VALUE rb_gsl_diff_backward(int argc, VALUE *argv, VALUE obj)
146
+ {
147
+ VALUE ff, xx;
148
+ get_func(argc, argv, obj, &ff, &xx);
149
+ return rb_gsl_diff_eval(ff, xx, gsl_diff_backward);
150
+ }
151
+
152
+ void Init_gsl_diff(VALUE module)
153
+ {
154
+ VALUE mgsl_diff;
155
+
156
+ mgsl_diff = rb_define_module_under(module, "Diff");
157
+
158
+ rb_define_method(cgsl_function, "diff_central", rb_gsl_diff_central, -1);
159
+ rb_define_method(cgsl_function, "diff_forward", rb_gsl_diff_forward, -1);
160
+ rb_define_method(cgsl_function, "diff_backward", rb_gsl_diff_backward, -1);
161
+
162
+ rb_define_singleton_method(mgsl_diff, "central", rb_gsl_diff_central, -1);
163
+ rb_define_singleton_method(mgsl_diff, "forward", rb_gsl_diff_forward, -1);
164
+ rb_define_singleton_method(mgsl_diff, "backward", rb_gsl_diff_backward, -1);
165
+ }
166
+