1 | /*
|
---|
2 | ** random.c - Random module
|
---|
3 | **
|
---|
4 | ** See Copyright Notice in mruby.h
|
---|
5 | */
|
---|
6 |
|
---|
7 | #include "mruby.h"
|
---|
8 | #include "mruby/variable.h"
|
---|
9 | #include "mruby/class.h"
|
---|
10 | #include "mruby/data.h"
|
---|
11 | #include "mruby/array.h"
|
---|
12 | #include "mt19937ar.h"
|
---|
13 |
|
---|
14 | #include <time.h>
|
---|
15 |
|
---|
16 | static char const MT_STATE_KEY[] = "$mrb_i_mt_state";
|
---|
17 |
|
---|
18 | static const struct mrb_data_type mt_state_type = {
|
---|
19 | MT_STATE_KEY, mrb_free,
|
---|
20 | };
|
---|
21 |
|
---|
22 | static mrb_value mrb_random_rand(mrb_state *mrb, mrb_value self);
|
---|
23 | static mrb_value mrb_random_srand(mrb_state *mrb, mrb_value self);
|
---|
24 |
|
---|
25 | static void
|
---|
26 | mt_srand(mt_state *t, unsigned long seed)
|
---|
27 | {
|
---|
28 | mrb_random_init_genrand(t, seed);
|
---|
29 | }
|
---|
30 |
|
---|
31 | static unsigned long
|
---|
32 | mt_rand(mt_state *t)
|
---|
33 | {
|
---|
34 | return mrb_random_genrand_int32(t);
|
---|
35 | }
|
---|
36 |
|
---|
37 | static double
|
---|
38 | mt_rand_real(mt_state *t)
|
---|
39 | {
|
---|
40 | return mrb_random_genrand_real1(t);
|
---|
41 | }
|
---|
42 |
|
---|
43 | static mrb_value
|
---|
44 | mrb_random_mt_srand(mrb_state *mrb, mt_state *t, mrb_value seed)
|
---|
45 | {
|
---|
46 | if (mrb_nil_p(seed)) {
|
---|
47 | seed = mrb_fixnum_value((mrb_int)(time(NULL) + mt_rand(t)));
|
---|
48 | if (mrb_fixnum(seed) < 0) {
|
---|
49 | seed = mrb_fixnum_value(0 - mrb_fixnum(seed));
|
---|
50 | }
|
---|
51 | }
|
---|
52 |
|
---|
53 | mt_srand(t, (unsigned) mrb_fixnum(seed));
|
---|
54 |
|
---|
55 | return seed;
|
---|
56 | }
|
---|
57 |
|
---|
58 | static mrb_value
|
---|
59 | mrb_random_mt_rand(mrb_state *mrb, mt_state *t, mrb_value max)
|
---|
60 | {
|
---|
61 | mrb_value value;
|
---|
62 |
|
---|
63 | if (mrb_fixnum(max) == 0) {
|
---|
64 | value = mrb_float_value(mrb, mt_rand_real(t));
|
---|
65 | }
|
---|
66 | else {
|
---|
67 | value = mrb_fixnum_value(mt_rand(t) % mrb_fixnum(max));
|
---|
68 | }
|
---|
69 |
|
---|
70 | return value;
|
---|
71 | }
|
---|
72 |
|
---|
73 | static mrb_value
|
---|
74 | get_opt(mrb_state* mrb)
|
---|
75 | {
|
---|
76 | mrb_value arg;
|
---|
77 |
|
---|
78 | arg = mrb_nil_value();
|
---|
79 | mrb_get_args(mrb, "|o", &arg);
|
---|
80 |
|
---|
81 | if (!mrb_nil_p(arg)) {
|
---|
82 | if (!mrb_fixnum_p(arg)) {
|
---|
83 | mrb_raise(mrb, E_ARGUMENT_ERROR, "invalid argument type");
|
---|
84 | }
|
---|
85 | arg = mrb_check_convert_type(mrb, arg, MRB_TT_FIXNUM, "Fixnum", "to_int");
|
---|
86 | if (mrb_fixnum(arg) < 0) {
|
---|
87 | arg = mrb_fixnum_value(0 - mrb_fixnum(arg));
|
---|
88 | }
|
---|
89 | }
|
---|
90 | return arg;
|
---|
91 | }
|
---|
92 |
|
---|
93 | static mrb_value
|
---|
94 | get_random(mrb_state *mrb) {
|
---|
95 | return mrb_const_get(mrb,
|
---|
96 | mrb_obj_value(mrb_class_get(mrb, "Random")),
|
---|
97 | mrb_intern_lit(mrb, "DEFAULT"));
|
---|
98 | }
|
---|
99 |
|
---|
100 | static mt_state *
|
---|
101 | get_random_state(mrb_state *mrb)
|
---|
102 | {
|
---|
103 | mrb_value random_val = get_random(mrb);
|
---|
104 | return DATA_GET_PTR(mrb, random_val, &mt_state_type, mt_state);
|
---|
105 | }
|
---|
106 |
|
---|
107 | static mrb_value
|
---|
108 | mrb_random_g_rand(mrb_state *mrb, mrb_value self)
|
---|
109 | {
|
---|
110 | mrb_value random = get_random(mrb);
|
---|
111 | return mrb_random_rand(mrb, random);
|
---|
112 | }
|
---|
113 |
|
---|
114 | static mrb_value
|
---|
115 | mrb_random_g_srand(mrb_state *mrb, mrb_value self)
|
---|
116 | {
|
---|
117 | mrb_value random = get_random(mrb);
|
---|
118 | return mrb_random_srand(mrb, random);
|
---|
119 | }
|
---|
120 |
|
---|
121 | static mrb_value
|
---|
122 | mrb_random_init(mrb_state *mrb, mrb_value self)
|
---|
123 | {
|
---|
124 | mrb_value seed;
|
---|
125 | mt_state *t;
|
---|
126 |
|
---|
127 | /* avoid memory leaks */
|
---|
128 | t = (mt_state*)DATA_PTR(self);
|
---|
129 | if (t) {
|
---|
130 | mrb_free(mrb, t);
|
---|
131 | }
|
---|
132 | mrb_data_init(self, NULL, &mt_state_type);
|
---|
133 |
|
---|
134 | t = (mt_state *)mrb_malloc(mrb, sizeof(mt_state));
|
---|
135 | t->mti = N + 1;
|
---|
136 |
|
---|
137 | seed = get_opt(mrb);
|
---|
138 | seed = mrb_random_mt_srand(mrb, t, seed);
|
---|
139 | if (mrb_nil_p(seed)) {
|
---|
140 | t->has_seed = FALSE;
|
---|
141 | }
|
---|
142 | else {
|
---|
143 | mrb_assert(mrb_fixnum_p(seed));
|
---|
144 | t->has_seed = TRUE;
|
---|
145 | t->seed = mrb_fixnum(seed);
|
---|
146 | }
|
---|
147 |
|
---|
148 | mrb_data_init(self, t, &mt_state_type);
|
---|
149 |
|
---|
150 | return self;
|
---|
151 | }
|
---|
152 |
|
---|
153 | static void
|
---|
154 | mrb_random_rand_seed(mrb_state *mrb, mt_state *t)
|
---|
155 | {
|
---|
156 | if (!t->has_seed) {
|
---|
157 | mrb_random_mt_srand(mrb, t, mrb_nil_value());
|
---|
158 | }
|
---|
159 | }
|
---|
160 |
|
---|
161 | static mrb_value
|
---|
162 | mrb_random_rand(mrb_state *mrb, mrb_value self)
|
---|
163 | {
|
---|
164 | mrb_value max;
|
---|
165 | mt_state *t = DATA_GET_PTR(mrb, self, &mt_state_type, mt_state);
|
---|
166 |
|
---|
167 | max = get_opt(mrb);
|
---|
168 | mrb_random_rand_seed(mrb, t);
|
---|
169 | return mrb_random_mt_rand(mrb, t, max);
|
---|
170 | }
|
---|
171 |
|
---|
172 | static mrb_value
|
---|
173 | mrb_random_srand(mrb_state *mrb, mrb_value self)
|
---|
174 | {
|
---|
175 | mrb_value seed;
|
---|
176 | mrb_value old_seed;
|
---|
177 | mt_state *t = DATA_GET_PTR(mrb, self, &mt_state_type, mt_state);
|
---|
178 |
|
---|
179 | seed = get_opt(mrb);
|
---|
180 | seed = mrb_random_mt_srand(mrb, t, seed);
|
---|
181 | old_seed = t->has_seed? mrb_fixnum_value(t->seed) : mrb_nil_value();
|
---|
182 | if (mrb_nil_p(seed)) {
|
---|
183 | t->has_seed = FALSE;
|
---|
184 | }
|
---|
185 | else {
|
---|
186 | mrb_assert(mrb_fixnum_p(seed));
|
---|
187 | t->has_seed = TRUE;
|
---|
188 | t->seed = mrb_fixnum(seed);
|
---|
189 | }
|
---|
190 |
|
---|
191 | return old_seed;
|
---|
192 | }
|
---|
193 |
|
---|
194 | /*
|
---|
195 | * call-seq:
|
---|
196 | * ary.shuffle! -> ary
|
---|
197 | *
|
---|
198 | * Shuffles elements in self in place.
|
---|
199 | */
|
---|
200 |
|
---|
201 | static mrb_value
|
---|
202 | mrb_ary_shuffle_bang(mrb_state *mrb, mrb_value ary)
|
---|
203 | {
|
---|
204 | mrb_int i;
|
---|
205 | mt_state *random = NULL;
|
---|
206 |
|
---|
207 | if (RARRAY_LEN(ary) > 1) {
|
---|
208 | mrb_get_args(mrb, "|d", &random, &mt_state_type);
|
---|
209 |
|
---|
210 | if (random == NULL) {
|
---|
211 | random = get_random_state(mrb);
|
---|
212 | }
|
---|
213 | mrb_random_rand_seed(mrb, random);
|
---|
214 |
|
---|
215 | mrb_ary_modify(mrb, mrb_ary_ptr(ary));
|
---|
216 |
|
---|
217 | for (i = RARRAY_LEN(ary) - 1; i > 0; i--) {
|
---|
218 | mrb_int j;
|
---|
219 | mrb_value tmp;
|
---|
220 |
|
---|
221 | j = mrb_fixnum(mrb_random_mt_rand(mrb, random, mrb_fixnum_value(RARRAY_LEN(ary))));
|
---|
222 |
|
---|
223 | tmp = RARRAY_PTR(ary)[i];
|
---|
224 | mrb_ary_ptr(ary)->ptr[i] = RARRAY_PTR(ary)[j];
|
---|
225 | mrb_ary_ptr(ary)->ptr[j] = tmp;
|
---|
226 | }
|
---|
227 | }
|
---|
228 |
|
---|
229 | return ary;
|
---|
230 | }
|
---|
231 |
|
---|
232 | /*
|
---|
233 | * call-seq:
|
---|
234 | * ary.shuffle -> new_ary
|
---|
235 | *
|
---|
236 | * Returns a new array with elements of self shuffled.
|
---|
237 | */
|
---|
238 |
|
---|
239 | static mrb_value
|
---|
240 | mrb_ary_shuffle(mrb_state *mrb, mrb_value ary)
|
---|
241 | {
|
---|
242 | mrb_value new_ary = mrb_ary_new_from_values(mrb, RARRAY_LEN(ary), RARRAY_PTR(ary));
|
---|
243 | mrb_ary_shuffle_bang(mrb, new_ary);
|
---|
244 |
|
---|
245 | return new_ary;
|
---|
246 | }
|
---|
247 |
|
---|
248 | /*
|
---|
249 | * call-seq:
|
---|
250 | * ary.sample -> obj
|
---|
251 | * ary.sample(n) -> new_ary
|
---|
252 | *
|
---|
253 | * Choose a random element or +n+ random elements from the array.
|
---|
254 | *
|
---|
255 | * The elements are chosen by using random and unique indices into the array
|
---|
256 | * in order to ensure that an element doesn't repeat itself unless the array
|
---|
257 | * already contained duplicate elements.
|
---|
258 | *
|
---|
259 | * If the array is empty the first form returns +nil+ and the second form
|
---|
260 | * returns an empty array.
|
---|
261 | */
|
---|
262 |
|
---|
263 | static mrb_value
|
---|
264 | mrb_ary_sample(mrb_state *mrb, mrb_value ary)
|
---|
265 | {
|
---|
266 | mrb_int n = 0;
|
---|
267 | mrb_bool given;
|
---|
268 | mt_state *random = NULL;
|
---|
269 | mrb_int len = RARRAY_LEN(ary);
|
---|
270 |
|
---|
271 | mrb_get_args(mrb, "|i?d", &n, &given, &random, &mt_state_type);
|
---|
272 | if (random == NULL) {
|
---|
273 | random = get_random_state(mrb);
|
---|
274 | }
|
---|
275 | mrb_random_rand_seed(mrb, random);
|
---|
276 | mt_rand(random);
|
---|
277 | if (!given) { /* pick one element */
|
---|
278 | switch (len) {
|
---|
279 | case 0:
|
---|
280 | return mrb_nil_value();
|
---|
281 | case 1:
|
---|
282 | return RARRAY_PTR(ary)[0];
|
---|
283 | default:
|
---|
284 | return RARRAY_PTR(ary)[mt_rand(random) % len];
|
---|
285 | }
|
---|
286 | }
|
---|
287 | else {
|
---|
288 | mrb_value result;
|
---|
289 | mrb_int i, j;
|
---|
290 |
|
---|
291 | if (n < 0) mrb_raise(mrb, E_ARGUMENT_ERROR, "negative sample number");
|
---|
292 | if (n > len) n = len;
|
---|
293 | result = mrb_ary_new_capa(mrb, n);
|
---|
294 | for (i=0; i<n; i++) {
|
---|
295 | mrb_int r;
|
---|
296 |
|
---|
297 | for (;;) {
|
---|
298 | retry:
|
---|
299 | r = mt_rand(random) % len;
|
---|
300 |
|
---|
301 | for (j=0; j<i; j++) {
|
---|
302 | if (mrb_fixnum(RARRAY_PTR(result)[j]) == r) {
|
---|
303 | goto retry; /* retry if duplicate */
|
---|
304 | }
|
---|
305 | }
|
---|
306 | break;
|
---|
307 | }
|
---|
308 | mrb_ary_push(mrb, result, mrb_fixnum_value(r));
|
---|
309 | }
|
---|
310 | for (i=0; i<n; i++) {
|
---|
311 | mrb_ary_set(mrb, result, i, RARRAY_PTR(ary)[mrb_fixnum(RARRAY_PTR(result)[i])]);
|
---|
312 | }
|
---|
313 | return result;
|
---|
314 | }
|
---|
315 | }
|
---|
316 |
|
---|
317 |
|
---|
318 | void mrb_mruby_random_gem_init(mrb_state *mrb)
|
---|
319 | {
|
---|
320 | struct RClass *random;
|
---|
321 | struct RClass *array = mrb->array_class;
|
---|
322 |
|
---|
323 | mrb_define_method(mrb, mrb->kernel_module, "rand", mrb_random_g_rand, MRB_ARGS_OPT(1));
|
---|
324 | mrb_define_method(mrb, mrb->kernel_module, "srand", mrb_random_g_srand, MRB_ARGS_OPT(1));
|
---|
325 |
|
---|
326 | random = mrb_define_class(mrb, "Random", mrb->object_class);
|
---|
327 | MRB_SET_INSTANCE_TT(random, MRB_TT_DATA);
|
---|
328 | mrb_define_class_method(mrb, random, "rand", mrb_random_g_rand, MRB_ARGS_OPT(1));
|
---|
329 | mrb_define_class_method(mrb, random, "srand", mrb_random_g_srand, MRB_ARGS_OPT(1));
|
---|
330 |
|
---|
331 | mrb_define_method(mrb, random, "initialize", mrb_random_init, MRB_ARGS_OPT(1));
|
---|
332 | mrb_define_method(mrb, random, "rand", mrb_random_rand, MRB_ARGS_OPT(1));
|
---|
333 | mrb_define_method(mrb, random, "srand", mrb_random_srand, MRB_ARGS_OPT(1));
|
---|
334 |
|
---|
335 | mrb_define_method(mrb, array, "shuffle", mrb_ary_shuffle, MRB_ARGS_OPT(1));
|
---|
336 | mrb_define_method(mrb, array, "shuffle!", mrb_ary_shuffle_bang, MRB_ARGS_OPT(1));
|
---|
337 | mrb_define_method(mrb, array, "sample", mrb_ary_sample, MRB_ARGS_OPT(2));
|
---|
338 |
|
---|
339 | mrb_const_set(mrb, mrb_obj_value(random), mrb_intern_lit(mrb, "DEFAULT"),
|
---|
340 | mrb_obj_new(mrb, random, 0, NULL));
|
---|
341 | }
|
---|
342 |
|
---|
343 | void mrb_mruby_random_gem_final(mrb_state *mrb)
|
---|
344 | {
|
---|
345 | }
|
---|