romanbsd-gsl 1.11.2.2

Sign up to get free protection for your applications and to get access to all the features.
Files changed (156) hide show
  1. data/README.rdoc +29 -0
  2. data/Rakefile +54 -0
  3. data/VERSION +1 -0
  4. data/ext/MANIFEST +116 -0
  5. data/ext/array.c +665 -0
  6. data/ext/array_complex.c +247 -0
  7. data/ext/blas.c +29 -0
  8. data/ext/blas1.c +729 -0
  9. data/ext/blas2.c +1093 -0
  10. data/ext/blas3.c +881 -0
  11. data/ext/block.c +44 -0
  12. data/ext/block_source.c +885 -0
  13. data/ext/bspline.c +116 -0
  14. data/ext/bundle.c +3 -0
  15. data/ext/cdf.c +754 -0
  16. data/ext/cheb.c +538 -0
  17. data/ext/combination.c +283 -0
  18. data/ext/common.c +310 -0
  19. data/ext/complex.c +1005 -0
  20. data/ext/const.c +668 -0
  21. data/ext/const_additional.c +120 -0
  22. data/ext/cqp.c +283 -0
  23. data/ext/deriv.c +194 -0
  24. data/ext/dht.c +360 -0
  25. data/ext/diff.c +165 -0
  26. data/ext/dirac.c +395 -0
  27. data/ext/eigen.c +2373 -0
  28. data/ext/error.c +194 -0
  29. data/ext/extconf.rb +272 -0
  30. data/ext/fcmp.c +66 -0
  31. data/ext/fft.c +1092 -0
  32. data/ext/fit.c +205 -0
  33. data/ext/fresnel.c +312 -0
  34. data/ext/function.c +522 -0
  35. data/ext/graph.c +1634 -0
  36. data/ext/gsl.c +265 -0
  37. data/ext/gsl_narray.c +652 -0
  38. data/ext/histogram.c +1717 -0
  39. data/ext/histogram2d.c +1067 -0
  40. data/ext/histogram3d.c +883 -0
  41. data/ext/histogram3d_source.c +750 -0
  42. data/ext/histogram_find.c +101 -0
  43. data/ext/histogram_oper.c +159 -0
  44. data/ext/ieee.c +98 -0
  45. data/ext/integration.c +1138 -0
  46. data/ext/interp.c +511 -0
  47. data/ext/jacobi.c +737 -0
  48. data/ext/linalg.c +4045 -0
  49. data/ext/linalg_complex.c +743 -0
  50. data/ext/math.c +724 -0
  51. data/ext/matrix.c +39 -0
  52. data/ext/matrix_complex.c +1731 -0
  53. data/ext/matrix_double.c +560 -0
  54. data/ext/matrix_int.c +256 -0
  55. data/ext/matrix_source.c +2678 -0
  56. data/ext/min.c +234 -0
  57. data/ext/monte.c +759 -0
  58. data/ext/multifit.c +1810 -0
  59. data/ext/multimin.c +793 -0
  60. data/ext/multimin_fsdf.c +156 -0
  61. data/ext/multiroots.c +952 -0
  62. data/ext/ndlinear.c +320 -0
  63. data/ext/nmf.c +159 -0
  64. data/ext/nmf_wrap.c +63 -0
  65. data/ext/ntuple.c +469 -0
  66. data/ext/odeiv.c +958 -0
  67. data/ext/ool.c +879 -0
  68. data/ext/oper_complex_source.c +253 -0
  69. data/ext/permutation.c +596 -0
  70. data/ext/poly.c +42 -0
  71. data/ext/poly2.c +265 -0
  72. data/ext/poly_source.c +1799 -0
  73. data/ext/qrng.c +171 -0
  74. data/ext/randist.c +1869 -0
  75. data/ext/rational.c +480 -0
  76. data/ext/rng.c +612 -0
  77. data/ext/root.c +408 -0
  78. data/ext/sf.c +1494 -0
  79. data/ext/sf_airy.c +200 -0
  80. data/ext/sf_bessel.c +867 -0
  81. data/ext/sf_clausen.c +28 -0
  82. data/ext/sf_coulomb.c +206 -0
  83. data/ext/sf_coupling.c +118 -0
  84. data/ext/sf_dawson.c +29 -0
  85. data/ext/sf_debye.c +157 -0
  86. data/ext/sf_dilog.c +42 -0
  87. data/ext/sf_elementary.c +44 -0
  88. data/ext/sf_ellint.c +206 -0
  89. data/ext/sf_elljac.c +29 -0
  90. data/ext/sf_erfc.c +93 -0
  91. data/ext/sf_exp.c +164 -0
  92. data/ext/sf_expint.c +211 -0
  93. data/ext/sf_fermi_dirac.c +148 -0
  94. data/ext/sf_gamma.c +344 -0
  95. data/ext/sf_gegenbauer.c +96 -0
  96. data/ext/sf_hyperg.c +197 -0
  97. data/ext/sf_laguerre.c +112 -0
  98. data/ext/sf_lambert.c +47 -0
  99. data/ext/sf_legendre.c +367 -0
  100. data/ext/sf_log.c +104 -0
  101. data/ext/sf_mathieu.c +238 -0
  102. data/ext/sf_power.c +46 -0
  103. data/ext/sf_psi.c +98 -0
  104. data/ext/sf_synchrotron.c +48 -0
  105. data/ext/sf_transport.c +76 -0
  106. data/ext/sf_trigonometric.c +207 -0
  107. data/ext/sf_zeta.c +119 -0
  108. data/ext/signal.c +310 -0
  109. data/ext/siman.c +718 -0
  110. data/ext/sort.c +208 -0
  111. data/ext/spline.c +393 -0
  112. data/ext/stats.c +799 -0
  113. data/ext/sum.c +168 -0
  114. data/ext/tamu_anova.c +56 -0
  115. data/ext/tensor.c +38 -0
  116. data/ext/tensor_source.c +1121 -0
  117. data/ext/vector.c +38 -0
  118. data/ext/vector_complex.c +2139 -0
  119. data/ext/vector_double.c +1445 -0
  120. data/ext/vector_int.c +204 -0
  121. data/ext/vector_source.c +3325 -0
  122. data/ext/wavelet.c +937 -0
  123. data/include/rb_gsl.h +140 -0
  124. data/include/rb_gsl_array.h +230 -0
  125. data/include/rb_gsl_cheb.h +21 -0
  126. data/include/rb_gsl_common.h +343 -0
  127. data/include/rb_gsl_complex.h +25 -0
  128. data/include/rb_gsl_const.h +29 -0
  129. data/include/rb_gsl_dirac.h +15 -0
  130. data/include/rb_gsl_eigen.h +17 -0
  131. data/include/rb_gsl_fft.h +62 -0
  132. data/include/rb_gsl_fit.h +25 -0
  133. data/include/rb_gsl_function.h +27 -0
  134. data/include/rb_gsl_graph.h +70 -0
  135. data/include/rb_gsl_histogram.h +65 -0
  136. data/include/rb_gsl_histogram3d.h +97 -0
  137. data/include/rb_gsl_integration.h +17 -0
  138. data/include/rb_gsl_interp.h +46 -0
  139. data/include/rb_gsl_linalg.h +25 -0
  140. data/include/rb_gsl_math.h +26 -0
  141. data/include/rb_gsl_odeiv.h +21 -0
  142. data/include/rb_gsl_poly.h +71 -0
  143. data/include/rb_gsl_rational.h +37 -0
  144. data/include/rb_gsl_rng.h +21 -0
  145. data/include/rb_gsl_root.h +22 -0
  146. data/include/rb_gsl_sf.h +119 -0
  147. data/include/rb_gsl_statistics.h +17 -0
  148. data/include/rb_gsl_tensor.h +45 -0
  149. data/include/rb_gsl_with_narray.h +22 -0
  150. data/include/templates_off.h +87 -0
  151. data/include/templates_on.h +241 -0
  152. data/lib/gsl/gnuplot.rb +41 -0
  153. data/lib/gsl/oper.rb +68 -0
  154. data/lib/ool.rb +22 -0
  155. data/lib/ool/conmin.rb +30 -0
  156. metadata +221 -0
data/ext/block.c ADDED
@@ -0,0 +1,44 @@
1
+ /*
2
+ block.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
+ /*
13
+ This code uses "templates_on.h" and "templates_off.h",
14
+ which are provided by the GSL source.
15
+ */
16
+
17
+ #include "rb_gsl_config.h"
18
+ #include "rb_gsl_array.h"
19
+ #include "rb_gsl_histogram.h"
20
+ #include "rb_gsl_complex.h"
21
+ #include "rb_gsl_poly.h"
22
+
23
+ #ifdef HAVE_NARRAY_H
24
+ #include "rb_gsl_with_narray.h"
25
+ #endif
26
+
27
+ #define BASE_DOUBLE
28
+ #include "templates_on.h"
29
+ #include "block_source.c"
30
+ #include "templates_off.h"
31
+ #undef BASE_DOUBLE
32
+
33
+ #define BASE_INT
34
+ #include "templates_on.h"
35
+ #include "block_source.c"
36
+ #include "templates_off.h"
37
+ #undef BASE_INT
38
+
39
+ #define BASE_UCHAR
40
+ #include "templates_on.h"
41
+ #include "block_source.c"
42
+ #include "templates_off.h"
43
+ #undef BASE_UCHAR
44
+
@@ -0,0 +1,885 @@
1
+ /*
2
+ block_source.c
3
+ Ruby/GSL: Ruby extension library for GSL (GNU Scientific Library)
4
+ (C) Copyright 2001-2005 by Yoshiki Tsunesada
5
+ Cameron McBride
6
+
7
+ Ruby/GSL is free software: you can redistribute it and/or modify it
8
+ under the terms of the GNU General Public License.
9
+ This library is distributed in the hope that it will be useful, but
10
+ WITHOUT ANY WARRANTY.
11
+ */
12
+
13
+ #ifdef BASE_DOUBLE
14
+ #define CHECK_BL CHECK_BLOCK
15
+ #define C_TO_VALUE rb_float_new
16
+ #define BL_P BLOCK_P
17
+ #elif defined(BASE_INT)
18
+ #define C_TO_VALUE INT2FIX
19
+ #define CHECK_BL CHECK_BLOCK_INT
20
+ #define BL_P BLOCK_INT_P
21
+ #else
22
+ #define C_TO_VALUE INT2FIX
23
+ #define CHECK_BL CHECK_BLOCK_UCHAR
24
+ #define BL_P BLOCK_UCHAR_P
25
+ #endif
26
+
27
+ static VALUE FUNCTION(rb_gsl_block,new)(VALUE klass, VALUE nn)
28
+ {
29
+ GSL_TYPE(gsl_block) *block = NULL;
30
+ CHECK_FIXNUM(nn);
31
+ block = FUNCTION(gsl_block,alloc)(FIX2INT(nn));
32
+ return Data_Wrap_Struct(klass, 0, FUNCTION(gsl_block,free), block);
33
+ }
34
+
35
+ static VALUE FUNCTION(rb_gsl_block,calloc)(VALUE klass, VALUE nn)
36
+ {
37
+ GSL_TYPE(gsl_block) *block = NULL;
38
+ CHECK_FIXNUM(nn);
39
+ block = FUNCTION(gsl_block,calloc)(FIX2INT(nn));
40
+ return Data_Wrap_Struct(klass, 0, FUNCTION(gsl_block,free), block);
41
+ }
42
+
43
+ static VALUE FUNCTION(rb_gsl_block,size)(VALUE obj)
44
+ {
45
+ GSL_TYPE(gsl_block) *block = NULL;
46
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), block);
47
+ return INT2FIX(block->size);
48
+ }
49
+
50
+ static VALUE FUNCTION(rb_gsl_block,fwrite)(VALUE obj, VALUE io)
51
+ {
52
+ GSL_TYPE(gsl_block) *h = NULL;
53
+ FILE *f = NULL;
54
+ int status, flag = 0;
55
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), h);
56
+ f = rb_gsl_open_writefile(io, &flag);
57
+ status = FUNCTION(gsl_block,fwrite)(f, h);
58
+ if (flag == 1) fclose(f);
59
+ return INT2FIX(status);
60
+ }
61
+
62
+ static VALUE FUNCTION(rb_gsl_block,fread)(VALUE obj, VALUE io)
63
+ {
64
+ GSL_TYPE(gsl_block) *h = NULL;
65
+ FILE *f = NULL;
66
+ int status, flag = 0;
67
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), h);
68
+ f = rb_gsl_open_readfile(io, &flag);
69
+ status = FUNCTION(gsl_block,fread)(f, h);
70
+ if (flag == 1) fclose(f);
71
+ return INT2FIX(status);
72
+ }
73
+
74
+ #ifdef BASE_DOUBLE
75
+ #define FORMAT_DEFAULT "%g"
76
+ #else
77
+ #define FORMAT_DEFAULT "%d"
78
+ #endif
79
+
80
+ static VALUE FUNCTION(rb_gsl_block,fprintf)(int argc, VALUE *argv, VALUE obj)
81
+ {
82
+ GSL_TYPE(gsl_block) *h = NULL;
83
+ FILE *fp = NULL;
84
+ int status, flag = 0;
85
+ if (argc != 1 && argc != 2)
86
+ rb_raise(rb_eArgError,
87
+ "wrong number of arguments (%d for 1 or 2)", argc);
88
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), h);
89
+ fp = rb_gsl_open_writefile(argv[0], &flag);
90
+ if (argc == 2) {
91
+ Check_Type(argv[1], T_STRING);
92
+ status = FUNCTION(gsl_block,fprintf)(fp, h, STR2CSTR(argv[1]));
93
+ } else {
94
+ status = FUNCTION(gsl_block,fprintf)(fp, h, FORMAT_DEFAULT);
95
+ }
96
+ if (flag == 1) fclose(fp);
97
+ return INT2FIX(status);
98
+ }
99
+
100
+ static VALUE FUNCTION(rb_gsl_block,printf)(int argc, VALUE *argv, VALUE obj)
101
+ {
102
+ GSL_TYPE(gsl_block) *h = NULL;
103
+ int status;
104
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), h);
105
+ if (argc == 1) {
106
+ Check_Type(argv[0], T_STRING);
107
+ status = FUNCTION(gsl_block,fprintf)(stdout, h, STR2CSTR(argv[0]));
108
+ } else {
109
+ status = FUNCTION(gsl_block,fprintf)(stdout, h, FORMAT_DEFAULT);
110
+ }
111
+ return INT2FIX(status);
112
+ }
113
+
114
+ #undef FORMAT_DEFAULT
115
+
116
+ static VALUE FUNCTION(rb_gsl_block,fscanf)(VALUE obj, VALUE io)
117
+ {
118
+ GSL_TYPE(gsl_block) *h = NULL;
119
+ FILE *fp = NULL;
120
+ int status, flag = 0;
121
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), h);
122
+ fp = rb_gsl_open_readfile(io, &flag);
123
+ status = FUNCTION(gsl_block,fscanf)(fp, h);
124
+ if (flag == 1) fclose(fp);
125
+ return INT2FIX(status);
126
+ }
127
+
128
+ #ifdef BASE_DOUBLE
129
+ #define SHOW_ELM 6
130
+ #define PRINTF_FORMAT "%4.3e "
131
+ #define TYPE2 double
132
+ #else
133
+ #define SHOW_ELM 15
134
+ #define PRINTF_FORMAT "%d "
135
+ #define TYPE2 int
136
+ #endif
137
+
138
+ static VALUE FUNCTION(rb_gsl_block,to_s)(VALUE obj)
139
+ {
140
+ GSL_TYPE(gsl_block) *v = NULL;
141
+ char buf[32];
142
+ size_t i, n;
143
+ VALUE str;
144
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
145
+ str = rb_str_new2("[ ");
146
+ n = v->size;
147
+ if (rb_obj_is_kind_of(obj, cgsl_block_complex)) n *= 2;
148
+ for (i = 0; i < n; i++) {
149
+ sprintf(buf, PRINTF_FORMAT, (TYPE2) v->data[i]);
150
+ rb_str_cat(str, buf, strlen(buf));
151
+ if (i == SHOW_ELM && i != v->size-1) {
152
+ strcpy(buf, "... ");
153
+ rb_str_cat(str, buf, strlen(buf));
154
+ break;
155
+ }
156
+ }
157
+ sprintf(buf, "]");
158
+ rb_str_cat(str, buf, strlen(buf));
159
+ return str;
160
+ }
161
+ #undef SHOW_ELM
162
+ #undef PRINTF_FORMAT
163
+
164
+ static VALUE FUNCTION(rb_gsl_block,inspect)(VALUE obj)
165
+ {
166
+ VALUE str;
167
+ char buf[64];
168
+ sprintf(buf, "%s\n", rb_class2name(CLASS_OF(obj)));
169
+ str = rb_str_new2(buf);
170
+ return rb_str_concat(str, FUNCTION(rb_gsl_block,to_s)(obj));
171
+ }
172
+
173
+ #ifdef BASE_DOUBLE
174
+ #define C_TO_VALUE rb_float_new
175
+ #define NUMCONV NUM2DBL
176
+ #else
177
+ #define C_TO_VALUE INT2FIX
178
+ #define NUMCONV FIX2INT
179
+ #endif
180
+
181
+ void get_range_int_beg_en_n(VALUE range, int *beg, int *en, size_t *n, int *step);
182
+ static VALUE FUNCTION(rb_gsl_block,get)(int argc, VALUE *argv, VALUE obj)
183
+ {
184
+ GSL_TYPE(gsl_block) *b, *bnew;
185
+ gsl_index *p;
186
+ int beg, en, i, step;
187
+ size_t n, j, k;
188
+
189
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
190
+ switch (argc) {
191
+ case 0:
192
+ rb_raise(rb_eArgError, "too few arguments (%d for >= 1)", argc);
193
+ break;
194
+ case 1:
195
+ switch (TYPE(argv[0])) {
196
+ case T_FIXNUM:
197
+ i = FIX2INT(argv[0]);
198
+ if (i < 0) j = b->size + i; else j = (size_t) i;
199
+ return C_TO_VALUE(b->data[j]);
200
+ break;
201
+ case T_ARRAY:
202
+ n = RARRAY(argv[0])->len;
203
+ bnew = FUNCTION(gsl_block,alloc)(n);
204
+ for (j = 0; j < n; j++) {
205
+ i = FIX2INT(rb_ary_entry(argv[0], j));
206
+ if (i < 0) k = b->size + i; else k = i;
207
+ bnew->data[j] = b->data[k];
208
+ }
209
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_block), 0, FUNCTION(gsl_block,free), bnew);
210
+ break;
211
+ default:
212
+ if (PERMUTATION_P(argv[0])) {
213
+ Data_Get_Struct(argv[0], gsl_index, p);
214
+ bnew = FUNCTION(gsl_block,alloc)(p->size);
215
+ for (j = 0; j < p->size; j++) bnew->data[j] = b->data[p->data[j]];
216
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_block), 0, FUNCTION(gsl_block,free), bnew);
217
+ } else if (CLASS_OF(argv[0]) == rb_cRange) {
218
+ get_range_int_beg_en_n(argv[0], &beg, &en, &n, &step);
219
+ bnew = FUNCTION(gsl_block,alloc)(n);
220
+ for (j = 0; j < n; j++)
221
+ bnew->data[j] = b->data[beg+j];
222
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_block), 0, FUNCTION(gsl_block,free),
223
+ bnew);
224
+ } else {
225
+ rb_raise(rb_eArgError, "wrong argument type %s (Fixnum, Array, or Range expected)", rb_class2name(CLASS_OF(argv[0])));
226
+ break;
227
+ }
228
+ }
229
+ break;
230
+ default:
231
+ bnew = FUNCTION(gsl_block,alloc)(argc);
232
+ for (j = 0; j < argc; j++) {
233
+ i = FIX2INT(argv[j]);
234
+ if (i < 0) k = b->size + i; else k = i;
235
+ bnew->data[j] = b->data[k];
236
+ }
237
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_block), 0, FUNCTION(gsl_block,free), bnew);
238
+
239
+
240
+ break;
241
+ }
242
+ return Qnil;
243
+ }
244
+
245
+ static VALUE FUNCTION(rb_gsl_block,set)(VALUE obj, VALUE ii, VALUE xx)
246
+ {
247
+ GSL_TYPE(gsl_block) *b;
248
+ BASE x;
249
+ size_t i;
250
+ CHECK_FIXNUM(ii);
251
+ i = FIX2INT(ii);
252
+ x = (BASE) NUMCONV(xx);
253
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
254
+ b->data[i] = x;
255
+ return obj;
256
+ }
257
+
258
+
259
+ static int FUNCTION(gsl_block,eq)(const GSL_TYPE(gsl_block) *a,
260
+ const GSL_TYPE(gsl_block) *b,
261
+ gsl_block_uchar *c)
262
+ {
263
+ size_t i;
264
+ BASE x, y;
265
+ if (a->size != b->size) return -1;
266
+ if (a->size != c->size) return -2;
267
+ for (i = 0; i < a->size; i++) {
268
+ x = a->data[i];
269
+ y = b->data[i];
270
+ c->data[i] = (x > y || x < y) ? 0 : 1;
271
+ }
272
+ return 0;
273
+ }
274
+
275
+ static int FUNCTION(gsl_block,ne)(const GSL_TYPE(gsl_block) *a,
276
+ const GSL_TYPE(gsl_block) *b,
277
+ gsl_block_uchar *c)
278
+ {
279
+ size_t i;
280
+ BASE x, y;
281
+ if (a->size != b->size) return -1;
282
+ if (a->size != c->size) return -2;
283
+ for (i = 0; i < a->size; i++) {
284
+ x = a->data[i];
285
+ y = b->data[i];
286
+ c->data[i] = (x > y || x < y) ? 1 : 0;
287
+ }
288
+ return 0;
289
+ }
290
+
291
+ static int FUNCTION(gsl_block,gt)(const GSL_TYPE(gsl_block) *a,
292
+ const GSL_TYPE(gsl_block) *b,
293
+ gsl_block_uchar *c)
294
+ {
295
+ size_t i;
296
+ BASE x, y;
297
+ if (a->size != b->size) return -1;
298
+ if (a->size != c->size) return -2;
299
+ for (i = 0; i < a->size; i++) {
300
+ x = a->data[i];
301
+ y = b->data[i];
302
+ c->data[i] = (x > y) ? 1 : 0;
303
+ }
304
+ return 0;
305
+ }
306
+
307
+ static int FUNCTION(gsl_block,ge)(const GSL_TYPE(gsl_block) *a,
308
+ const GSL_TYPE(gsl_block) *b,
309
+ gsl_block_uchar *c)
310
+ {
311
+ size_t i;
312
+ BASE x, y;
313
+ if (a->size != b->size) return -1;
314
+ if (a->size != c->size) return -2;
315
+ for (i = 0; i < a->size; i++) {
316
+ x = a->data[i];
317
+ y = b->data[i];
318
+ c->data[i] = (x >= y) ? 1 : 0;
319
+ }
320
+ return 0;
321
+ }
322
+
323
+ static int FUNCTION(gsl_block,lt)(const GSL_TYPE(gsl_block) *a,
324
+ const GSL_TYPE(gsl_block) *b,
325
+ gsl_block_uchar *c)
326
+ {
327
+ size_t i;
328
+ BASE x, y;
329
+ if (a->size != b->size) return -1;
330
+ if (a->size != c->size) return -2;
331
+ for (i = 0; i < a->size; i++) {
332
+ x = a->data[i];
333
+ y = b->data[i];
334
+ c->data[i] = (x < y) ? 1 : 0;
335
+ }
336
+ return 0;
337
+ }
338
+
339
+ static int FUNCTION(gsl_block,le)(const GSL_TYPE(gsl_block) *a,
340
+ const GSL_TYPE(gsl_block) *b,
341
+ gsl_block_uchar *c)
342
+ {
343
+ size_t i;
344
+ BASE x, y;
345
+ if (a->size != b->size) return -1;
346
+ if (a->size != c->size) return -2;
347
+ for (i = 0; i < a->size; i++) {
348
+ x = a->data[i];
349
+ y = b->data[i];
350
+ c->data[i] = (x <= y) ? 1 : 0;
351
+ }
352
+ return 0;
353
+ }
354
+
355
+ static int FUNCTION(gsl_block,and)(const GSL_TYPE(gsl_block) *a,
356
+ const GSL_TYPE(gsl_block) *b,
357
+ gsl_block_uchar *c)
358
+ {
359
+ size_t i;
360
+ BASE x, y;
361
+ if (a->size != b->size) return -1;
362
+ if (a->size != c->size) return -2;
363
+ for (i = 0; i < a->size; i++) {
364
+ x = a->data[i];
365
+ y = b->data[i];
366
+ c->data[i] = (x != 0 && y != 0) ? 1 : 0;
367
+ }
368
+ return 0;
369
+ }
370
+
371
+ static int FUNCTION(gsl_block,or)(const GSL_TYPE(gsl_block) *a,
372
+ const GSL_TYPE(gsl_block) *b,
373
+ gsl_block_uchar *c)
374
+ {
375
+ size_t i;
376
+ BASE x, y;
377
+ if (a->size != b->size) return -1;
378
+ if (a->size != c->size) return -2;
379
+ for (i = 0; i < a->size; i++) {
380
+ x = a->data[i];
381
+ y = b->data[i];
382
+ c->data[i] = (x != 0 || y != 0) ? 1 : 0;
383
+ }
384
+ return 0;
385
+ }
386
+
387
+ static int FUNCTION(gsl_block,xor)(const GSL_TYPE(gsl_block) *a,
388
+ const GSL_TYPE(gsl_block) *b,
389
+ gsl_block_uchar *c)
390
+ {
391
+ size_t i;
392
+ BASE x, y;
393
+ if (a->size != b->size) return -1;
394
+ if (a->size != c->size) return -2;
395
+ for (i = 0; i < a->size; i++) {
396
+ x = a->data[i];
397
+ y = b->data[i];
398
+ c->data[i] = ((x != 0) == (y != 0)) ? 0 : 1;
399
+ }
400
+ return 0;
401
+ }
402
+
403
+ static int FUNCTION(gsl_block,eq2)(const GSL_TYPE(gsl_block) *a,
404
+ BASE b, gsl_block_uchar *c)
405
+ {
406
+ size_t i;
407
+ BASE x, y;
408
+ if (a->size != c->size) return -2;
409
+ for (i = 0; i < a->size; i++) {
410
+ x = a->data[i];
411
+ y = b;
412
+ c->data[i] = (x > y || x < y) ? 0 : 1;
413
+ }
414
+ return 0;
415
+ }
416
+
417
+ static int FUNCTION(gsl_block,ne2)(const GSL_TYPE(gsl_block) *a,
418
+ BASE b,
419
+ gsl_block_uchar *c)
420
+ {
421
+ size_t i;
422
+ BASE x, y;
423
+ if (a->size != c->size) return -2;
424
+ for (i = 0; i < a->size; i++) {
425
+ x = a->data[i];
426
+ y = b;
427
+ c->data[i] = (x > y || x < y) ? 1 : 0;
428
+ }
429
+ return 0;
430
+ }
431
+
432
+ static int FUNCTION(gsl_block,gt2)(const GSL_TYPE(gsl_block) *a,
433
+ BASE b,
434
+ gsl_block_uchar *c)
435
+ {
436
+ size_t i;
437
+ BASE x, y;
438
+ if (a->size != c->size) return -2;
439
+ for (i = 0; i < a->size; i++) {
440
+ x = a->data[i];
441
+ y = b;
442
+ c->data[i] = (x > y) ? 1 : 0;
443
+ }
444
+ return 0;
445
+ }
446
+
447
+ static int FUNCTION(gsl_block,ge2)(const GSL_TYPE(gsl_block) *a,
448
+ BASE b,
449
+ gsl_block_uchar *c)
450
+ {
451
+ size_t i;
452
+ BASE x, y;
453
+ if (a->size != c->size) return -2;
454
+ for (i = 0; i < a->size; i++) {
455
+ x = a->data[i];
456
+ y = b;
457
+ c->data[i] = (x >= y) ? 1 : 0;
458
+ }
459
+ return 0;
460
+ }
461
+
462
+ static int FUNCTION(gsl_block,lt2)(const GSL_TYPE(gsl_block) *a,
463
+ BASE b,
464
+ gsl_block_uchar *c)
465
+ {
466
+ size_t i;
467
+ BASE x, y;
468
+ if (a->size != c->size) return -2;
469
+ for (i = 0; i < a->size; i++) {
470
+ x = a->data[i];
471
+ y = b;
472
+ c->data[i] = (x < y) ? 1 : 0;
473
+ }
474
+ return 0;
475
+ }
476
+
477
+ static int FUNCTION(gsl_block,le2)(const GSL_TYPE(gsl_block) *a,
478
+ BASE b,
479
+ gsl_block_uchar *c)
480
+ {
481
+ size_t i;
482
+ BASE x, y;
483
+ if (a->size != c->size) return -2;
484
+ for (i = 0; i < a->size; i++) {
485
+ x = a->data[i];
486
+ y = b;
487
+ c->data[i] = (x <= y) ? 1 : 0;
488
+ }
489
+ return 0;
490
+ }
491
+
492
+ static int FUNCTION(gsl_block,and2)(const GSL_TYPE(gsl_block) *a,
493
+ BASE b,
494
+ gsl_block_uchar *c)
495
+ {
496
+ size_t i;
497
+ BASE x, y;
498
+ if (a->size != c->size) return -2;
499
+ for (i = 0; i < a->size; i++) {
500
+ x = a->data[i];
501
+ y = b;
502
+ c->data[i] = (x != 0 && y != 0) ? 1 : 0;
503
+ }
504
+ return 0;
505
+ }
506
+
507
+ static int FUNCTION(gsl_block,or2)(const GSL_TYPE(gsl_block) *a,
508
+ BASE b,
509
+ gsl_block_uchar *c)
510
+ {
511
+ size_t i;
512
+ BASE x, y;
513
+ if (a->size != c->size) return -2;
514
+ for (i = 0; i < a->size; i++) {
515
+ x = a->data[i];
516
+ y = b;
517
+ c->data[i] = (x != 0 || y != 0) ? 1 : 0;
518
+ }
519
+ return 0;
520
+ }
521
+
522
+ static int FUNCTION(gsl_block,xor2)(const GSL_TYPE(gsl_block) *a,
523
+ BASE b,
524
+ gsl_block_uchar *c)
525
+ {
526
+ size_t i;
527
+ BASE x, y;
528
+ if (a->size != c->size) return -2;
529
+ for (i = 0; i < a->size; i++) {
530
+ x = a->data[i];
531
+ y = b;
532
+ c->data[i] = ((x != 0) == (y != 0)) ? 0 : 1;
533
+ }
534
+ return 0;
535
+ }
536
+
537
+
538
+ static VALUE FUNCTION(rb_gsl_block,compare)(VALUE aa, VALUE bb,
539
+ int (*cmp)(const GSL_TYPE(gsl_block)*,
540
+ const GSL_TYPE(gsl_block)*,
541
+ gsl_block_uchar*),
542
+ int (*cmp2)(const GSL_TYPE(gsl_block)*,
543
+ BASE,
544
+ gsl_block_uchar*))
545
+ {
546
+ GSL_TYPE(gsl_block) *a, *b;
547
+ /* gsl_block_int *c;*/
548
+ gsl_block_uchar *c;
549
+ int status;
550
+ Data_Get_Struct(aa, GSL_TYPE(gsl_block), a);
551
+ c = gsl_block_uchar_alloc(a->size);
552
+ if (BL_P(bb)) {
553
+ Data_Get_Struct(bb, GSL_TYPE(gsl_block), b);
554
+ if (a->size != b->size)
555
+ rb_raise(rb_eRuntimeError, "Block size mismatch, %d and %d", (int) a->size,
556
+ (int) b->size);
557
+ status = (*cmp)(a, b, c);
558
+ } else {
559
+ status = (*cmp2)(a, NUMCONV(bb), c);
560
+ }
561
+ return Data_Wrap_Struct(cgsl_block_uchar, 0, gsl_block_uchar_free, c);
562
+ }
563
+
564
+ static VALUE FUNCTION(rb_gsl_block,eq)(VALUE aa, VALUE bb)
565
+ {
566
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,eq),
567
+ FUNCTION(gsl_block,eq2));
568
+ }
569
+
570
+ static VALUE FUNCTION(rb_gsl_block,ne)(VALUE aa, VALUE bb)
571
+ {
572
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,ne),
573
+ FUNCTION(gsl_block,ne2));
574
+ }
575
+
576
+ static VALUE FUNCTION(rb_gsl_block,gt)(VALUE aa, VALUE bb)
577
+ {
578
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,gt),
579
+ FUNCTION(gsl_block,gt2));
580
+ }
581
+
582
+ static VALUE FUNCTION(rb_gsl_block,ge)(VALUE aa, VALUE bb)
583
+ {
584
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,ge),
585
+ FUNCTION(gsl_block,ge2));
586
+ }
587
+
588
+ static VALUE FUNCTION(rb_gsl_block,lt)(VALUE aa, VALUE bb)
589
+ {
590
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,lt),
591
+ FUNCTION(gsl_block,lt2));
592
+ }
593
+
594
+ static VALUE FUNCTION(rb_gsl_block,le)(VALUE aa, VALUE bb)
595
+ {
596
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,le),
597
+ FUNCTION(gsl_block,le2));
598
+ }
599
+
600
+ static VALUE FUNCTION(rb_gsl_block,and)(VALUE aa, VALUE bb)
601
+ {
602
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,and),
603
+ FUNCTION(gsl_block,and2));
604
+ }
605
+
606
+ static VALUE FUNCTION(rb_gsl_block,or)(VALUE aa, VALUE bb)
607
+ {
608
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,or),
609
+ FUNCTION(gsl_block,or2));
610
+ }
611
+
612
+ static VALUE FUNCTION(rb_gsl_block,xor)(VALUE aa, VALUE bb)
613
+ {
614
+ return FUNCTION(rb_gsl_block,compare)(aa, bb, FUNCTION(gsl_block,xor),
615
+ FUNCTION(gsl_block,xor2));
616
+ }
617
+
618
+ static VALUE FUNCTION(rb_gsl_block,not)(VALUE obj)
619
+ {
620
+ GSL_TYPE(gsl_block) *v;
621
+ gsl_block_uchar *vv;
622
+ size_t i;
623
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
624
+ vv = gsl_block_uchar_alloc(v->size);
625
+ for (i = 0; i < v->size; i++) vv->data[i] = (v->data[i] != 0) ? 0 : 1;
626
+ return Data_Wrap_Struct(cgsl_block_uchar, 0, gsl_block_uchar_free, vv);
627
+ }
628
+
629
+ static VALUE FUNCTION(rb_gsl_block,any)(VALUE obj)
630
+ {
631
+ GSL_TYPE(gsl_block) *v = NULL;
632
+ size_t i;
633
+
634
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
635
+ if (rb_block_given_p()) {
636
+ for (i = 0; i < v->size; i++) {
637
+ if (rb_yield(C_TO_VALUE(v->data[i]))) return INT2FIX(1);
638
+ }
639
+ return INT2FIX(0);
640
+ } else {
641
+ for (i = 0; i < v->size; i++) if (v->data[i]) return INT2FIX(1);
642
+ return INT2FIX(0);
643
+ }
644
+ }
645
+
646
+ static VALUE FUNCTION(rb_gsl_block,any2)(VALUE obj)
647
+ {
648
+ GSL_TYPE(gsl_block) *v = NULL;
649
+ size_t i;
650
+
651
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
652
+ if (rb_block_given_p()) {
653
+ for (i = 0; i < v->size; i++) {
654
+ if (rb_yield(C_TO_VALUE(v->data[i]))) return Qtrue;
655
+ }
656
+ return Qfalse;
657
+ } else {
658
+ for (i = 0; i < v->size; i++) if (v->data[i]) return Qtrue;
659
+ return Qfalse;
660
+ }
661
+ }
662
+
663
+ static VALUE FUNCTION(rb_gsl_block,all)(VALUE obj)
664
+ {
665
+ GSL_TYPE(gsl_block) *v;
666
+ size_t i;
667
+
668
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
669
+ if (rb_block_given_p()) {
670
+ for (i = 0; i < v->size; i++)
671
+ if (!rb_yield(C_TO_VALUE(v->data[i]))) return Qfalse;
672
+ return Qtrue;
673
+ } else {
674
+ for (i = 0; i < v->size; i++)
675
+ if (!v->data[i]) return Qfalse;
676
+ return Qtrue;
677
+ }
678
+ }
679
+
680
+ static VALUE FUNCTION(rb_gsl_block,none)(VALUE obj)
681
+ {
682
+ GSL_TYPE(gsl_block) *v;
683
+ size_t i;
684
+
685
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
686
+ if (rb_block_given_p()) {
687
+ for (i = 0; i < v->size; i++)
688
+ if (rb_yield(C_TO_VALUE(v->data[i]))) return Qfalse;
689
+ return Qtrue;
690
+ } else {
691
+ for (i = 0; i < v->size; i++)
692
+ if (v->data[i]) return Qfalse;
693
+ return Qtrue;
694
+ }
695
+ }
696
+
697
+ static VALUE FUNCTION(rb_gsl_block,where)(VALUE obj)
698
+ {
699
+ GSL_TYPE(gsl_block) *v;
700
+ gsl_index *vv;
701
+ gsl_block_uchar *btmp = NULL;
702
+ size_t i, j, n = 0;
703
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
704
+ /* count true elements */
705
+ if (rb_block_given_p()) {
706
+ btmp = gsl_block_uchar_alloc(v->size);
707
+ for (i = 0; i < v->size; i++) {
708
+ if (rb_yield(C_TO_VALUE(v->data[i]))) {
709
+ btmp->data[i] = 1;
710
+ n++;
711
+ } else {
712
+ btmp->data[i] = 0;
713
+ }
714
+ } /* for */
715
+ } else { /* block is not given */
716
+ for (i = 0; i < v->size; i++) { if (v->data[i]) n++; }
717
+ }
718
+ if (n == 0) {
719
+ if (btmp) gsl_block_uchar_free(btmp);
720
+ return Qnil;
721
+ }
722
+ vv = gsl_permutation_alloc(n);
723
+ for (i = 0, j = 0; i < v->size; i++) {
724
+ if ((!btmp && v->data[i]) || (btmp && btmp->data[i])) {
725
+ vv->data[j++] = i;
726
+ }
727
+ }
728
+ if (btmp) gsl_block_uchar_free(btmp);
729
+ return Data_Wrap_Struct(cgsl_index, 0, gsl_permutation_free, vv);
730
+ }
731
+
732
+ static VALUE FUNCTION(rb_gsl_block,where2)(VALUE obj)
733
+ {
734
+ GSL_TYPE(gsl_block) *v;
735
+ gsl_index *v1, *v2;
736
+ gsl_block_uchar *btmp = NULL;
737
+ VALUE vv1, vv2;
738
+ size_t i, j, k, n = 0;
739
+
740
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), v);
741
+ if (rb_block_given_p()) {
742
+ btmp = gsl_block_uchar_alloc(v->size);
743
+ for (i = 0; i < v->size; i++) {
744
+ if (rb_yield(C_TO_VALUE(v->data[i]))) {
745
+ btmp->data[i] = 1;
746
+ n++;
747
+ } else {
748
+ btmp->data[i] = 0;
749
+ }
750
+ } /* for */
751
+ } else { /* block is not given */
752
+ for (i = 0; i < v->size; i++) { if (v->data[i]) n++; }
753
+ }
754
+ /* true and false logic. need to handle both */
755
+ if (n == 0) {
756
+ v2 = gsl_permutation_calloc(v->size); /* calloc() initializes v2 */
757
+ vv1 = Qnil;
758
+ vv2 = Data_Wrap_Struct(cgsl_index, 0, gsl_permutation_free, v2);
759
+ } else if (v->size-n == 0) {
760
+ v1 = gsl_permutation_calloc(n); /* calloc() initializes v1 */
761
+ vv1 = Data_Wrap_Struct(cgsl_index, 0, gsl_permutation_free, v1);
762
+ vv2 = Qnil;
763
+ } else {
764
+ /* same case as 'where' */
765
+ v1 = gsl_permutation_alloc(n);
766
+ v2 = gsl_permutation_alloc(v->size-n);
767
+ for (i = 0, j = 0, k = 0; i < v->size; i++) {
768
+ if ((!btmp && v->data[i]) || (btmp && btmp->data[i])) v1->data[j++] = i;
769
+ else v2->data[k++] = i;
770
+ }
771
+ vv1 = Data_Wrap_Struct(cgsl_index, 0, gsl_permutation_free, v1);
772
+ vv2 = Data_Wrap_Struct(cgsl_index, 0, gsl_permutation_free, v2);
773
+ }
774
+ if (btmp) gsl_block_uchar_free(btmp);
775
+ return rb_ary_new3(2, vv1, vv2);
776
+ }
777
+
778
+ static VALUE FUNCTION(rb_gsl_block,each)(VALUE obj)
779
+ {
780
+ GSL_TYPE(gsl_block) *b = NULL;
781
+ size_t i;
782
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
783
+ for (i = 0; i < b->size; i++) {
784
+ rb_yield(C_TO_VALUE(b->data[i]));
785
+ }
786
+ return obj;
787
+ }
788
+
789
+ static VALUE FUNCTION(rb_gsl_block,each_index)(VALUE obj)
790
+ {
791
+ GSL_TYPE(gsl_block) *b = NULL;
792
+ size_t i;
793
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
794
+ for (i = 0; i < b->size; i++) {
795
+ rb_yield(INT2FIX(i));
796
+ }
797
+ return obj;
798
+ }
799
+
800
+ static VALUE FUNCTION(rb_gsl_block,collect)(VALUE obj)
801
+ {
802
+ GSL_TYPE(gsl_block) *b = NULL, *bnew;
803
+ size_t i;
804
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
805
+ bnew = FUNCTION(gsl_block,alloc)(b->size);
806
+ for (i = 0; i < b->size; i++) {
807
+ bnew->data[i] = NUMCONV(rb_yield(C_TO_VALUE(b->data[i])));
808
+ }
809
+ return Data_Wrap_Struct(GSL_TYPE(cgsl_block), 0, FUNCTION(gsl_block,free), bnew);
810
+ }
811
+
812
+ static VALUE FUNCTION(rb_gsl_block,collect_bang)(VALUE obj)
813
+ {
814
+ GSL_TYPE(gsl_block) *b = NULL;
815
+ size_t i;
816
+ Data_Get_Struct(obj, GSL_TYPE(gsl_block), b);
817
+ for (i = 0; i < b->size; i++) {
818
+ b->data[i] = NUMCONV(rb_yield(C_TO_VALUE(b->data[i])));
819
+ }
820
+ return obj;
821
+ }
822
+
823
+ #undef C_TO_VALUE
824
+ #undef NUMCONV
825
+ #undef TYPE2
826
+ #undef CHECK_BL
827
+ #undef BL_P
828
+
829
+ void FUNCTION(Init_gsl_block,init)(VALUE module)
830
+ {
831
+ rb_define_singleton_method(GSL_TYPE(cgsl_block), "new",
832
+ FUNCTION(rb_gsl_block,new), 1);
833
+ rb_define_singleton_method(GSL_TYPE(cgsl_block), "alloc",
834
+ FUNCTION(rb_gsl_block,new), 1);
835
+ rb_define_singleton_method(GSL_TYPE(cgsl_block), "calloc",
836
+ FUNCTION(rb_gsl_block,calloc), 1);
837
+
838
+ rb_define_method(GSL_TYPE(cgsl_block), "size", FUNCTION(rb_gsl_block,size), 0);
839
+ rb_define_alias(GSL_TYPE(cgsl_block), "length", "size");
840
+ rb_define_method(GSL_TYPE(cgsl_block), "fwrite", FUNCTION(rb_gsl_block,fwrite), 1);
841
+ rb_define_method(GSL_TYPE(cgsl_block), "fread", FUNCTION(rb_gsl_block,fread), 1);
842
+ rb_define_method(GSL_TYPE(cgsl_block), "fprintf", FUNCTION(rb_gsl_block,fprintf), -1);
843
+ rb_define_method(GSL_TYPE(cgsl_block), "printf", FUNCTION(rb_gsl_block,printf), -1);
844
+ rb_define_method(GSL_TYPE(cgsl_block), "fscanf", FUNCTION(rb_gsl_block,fscanf), 1);
845
+
846
+ rb_define_method(GSL_TYPE(cgsl_block), "inspect", FUNCTION(rb_gsl_block,inspect), 0);
847
+ rb_define_method(GSL_TYPE(cgsl_block), "to_s", FUNCTION(rb_gsl_block,to_s), 0);
848
+ rb_define_method(GSL_TYPE(cgsl_block), "get", FUNCTION(rb_gsl_block,get), -1);
849
+ rb_define_alias(GSL_TYPE(cgsl_block), "[]", "get");
850
+ rb_define_method(GSL_TYPE(cgsl_block), "set", FUNCTION(rb_gsl_block,set), 2);
851
+ rb_define_alias(GSL_TYPE(cgsl_block), "[]=", "set");
852
+ /*****/
853
+ rb_define_method(GSL_TYPE(cgsl_block), "eq", FUNCTION(rb_gsl_block,eq), 1);
854
+ rb_define_method(GSL_TYPE(cgsl_block), "ne", FUNCTION(rb_gsl_block,ne), 1);
855
+ rb_define_method(GSL_TYPE(cgsl_block), "gt", FUNCTION(rb_gsl_block,gt), 1);
856
+ rb_define_alias(GSL_TYPE(cgsl_block), ">", "gt");
857
+ rb_define_method(GSL_TYPE(cgsl_block), "ge", FUNCTION(rb_gsl_block,ge), 1);
858
+ rb_define_alias(GSL_TYPE(cgsl_block), ">=", "ge");
859
+ rb_define_method(GSL_TYPE(cgsl_block), "lt", FUNCTION(rb_gsl_block,lt), 1);
860
+ rb_define_alias(GSL_TYPE(cgsl_block), "<", "lt");
861
+ rb_define_method(GSL_TYPE(cgsl_block), "le", FUNCTION(rb_gsl_block,le), 1);
862
+ rb_define_alias(GSL_TYPE(cgsl_block), "<=", "le");
863
+
864
+ rb_define_method(GSL_TYPE(cgsl_block), "and", FUNCTION(rb_gsl_block,and), 1);
865
+ rb_define_method(GSL_TYPE(cgsl_block), "or", FUNCTION(rb_gsl_block,or), 1);
866
+ rb_define_method(GSL_TYPE(cgsl_block), "xor", FUNCTION(rb_gsl_block,xor), 1);
867
+ rb_define_method(GSL_TYPE(cgsl_block), "not", FUNCTION(rb_gsl_block,not), 0);
868
+
869
+ rb_define_method(GSL_TYPE(cgsl_block), "all?", FUNCTION(rb_gsl_block,all), 0);
870
+ rb_define_method(GSL_TYPE(cgsl_block), "none?", FUNCTION(rb_gsl_block,none), 0);
871
+ rb_define_method(GSL_TYPE(cgsl_block), "any",
872
+ FUNCTION(rb_gsl_block,any), 0);
873
+ rb_define_method(GSL_TYPE(cgsl_block), "any?",
874
+ FUNCTION(rb_gsl_block,any2), 0);
875
+
876
+ rb_define_method(GSL_TYPE(cgsl_block), "where", FUNCTION(rb_gsl_block,where), 0);
877
+ rb_define_method(GSL_TYPE(cgsl_block), "where2", FUNCTION(rb_gsl_block,where2), 0);
878
+
879
+ rb_define_method(GSL_TYPE(cgsl_block), "each", FUNCTION(rb_gsl_block,each), 0);
880
+ rb_define_method(GSL_TYPE(cgsl_block), "each_index", FUNCTION(rb_gsl_block,each_index), 0);
881
+ rb_define_method(GSL_TYPE(cgsl_block), "collect", FUNCTION(rb_gsl_block,collect), 0);
882
+ rb_define_method(GSL_TYPE(cgsl_block), "collect!", FUNCTION(rb_gsl_block,collect_bang), 0);
883
+ rb_define_alias(GSL_TYPE(cgsl_block), "map", "collect");
884
+ rb_define_alias(GSL_TYPE(cgsl_block), "map!", "collect!");
885
+ }