1 /*
2 ** array.c - Array class
3 **
4 ** See Copyright Notice in mruby.h
5 */
6
7 #include <mruby.h>
8 #include <mruby/array.h>
9 #include <mruby/class.h>
10 #include <mruby/string.h>
11 #include <mruby/range.h>
12 #include "value_array.h"
13
14 #define ARY_DEFAULT_LEN 4
15 #define ARY_SHRINK_RATIO 5 /* must be larger than 2 */
16 #define ARY_C_MAX_SIZE (SIZE_MAX / sizeof(mrb_value))
17 #define ARY_MAX_SIZE ((mrb_int)((ARY_C_MAX_SIZE < (size_t)MRB_INT_MAX) ? ARY_C_MAX_SIZE : MRB_INT_MAX-1))
18
19 static struct RArray*
ary_new_capa(mrb_state * mrb,mrb_int capa)20 ary_new_capa(mrb_state *mrb, mrb_int capa)
21 {
22 struct RArray *a;
23 size_t blen;
24
25 if (capa > ARY_MAX_SIZE) {
26 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
27 }
28 blen = capa * sizeof(mrb_value);
29
30 a = (struct RArray*)mrb_obj_alloc(mrb, MRB_TT_ARRAY, mrb->array_class);
31 if (capa <= MRB_ARY_EMBED_LEN_MAX) {
32 ARY_SET_EMBED_LEN(a, 0);
33 }
34 else {
35 a->as.heap.ptr = (mrb_value *)mrb_malloc(mrb, blen);
36 a->as.heap.aux.capa = capa;
37 a->as.heap.len = 0;
38 }
39
40 return a;
41 }
42
43 MRB_API mrb_value
mrb_ary_new_capa(mrb_state * mrb,mrb_int capa)44 mrb_ary_new_capa(mrb_state *mrb, mrb_int capa)
45 {
46 struct RArray *a = ary_new_capa(mrb, capa);
47 return mrb_obj_value(a);
48 }
49
50 MRB_API mrb_value
mrb_ary_new(mrb_state * mrb)51 mrb_ary_new(mrb_state *mrb)
52 {
53 return mrb_ary_new_capa(mrb, 0);
54 }
55
56 /*
57 * to copy array, use this instead of memcpy because of portability
58 * * gcc on ARM may fail optimization of memcpy
59 * http://infocenter.arm.com/help/index.jsp?topic=/com.arm.doc.faqs/ka3934.html
60 * * gcc on MIPS also fail
61 * http://gcc.gnu.org/bugzilla/show_bug.cgi?id=39755
62 * * memcpy doesn't exist on freestanding environment
63 *
64 * If you optimize for binary size, use memcpy instead of this at your own risk
65 * of above portability issue.
66 *
67 * see also http://togetter.com/li/462898
68 *
69 */
70 static inline void
array_copy(mrb_value * dst,const mrb_value * src,mrb_int size)71 array_copy(mrb_value *dst, const mrb_value *src, mrb_int size)
72 {
73 mrb_int i;
74
75 for (i = 0; i < size; i++) {
76 dst[i] = src[i];
77 }
78 }
79
80 static struct RArray*
ary_new_from_values(mrb_state * mrb,mrb_int size,const mrb_value * vals)81 ary_new_from_values(mrb_state *mrb, mrb_int size, const mrb_value *vals)
82 {
83 struct RArray *a = ary_new_capa(mrb, size);
84
85 array_copy(ARY_PTR(a), vals, size);
86 ARY_SET_LEN(a, size);
87
88 return a;
89 }
90
91 MRB_API mrb_value
mrb_ary_new_from_values(mrb_state * mrb,mrb_int size,const mrb_value * vals)92 mrb_ary_new_from_values(mrb_state *mrb, mrb_int size, const mrb_value *vals)
93 {
94 struct RArray *a = ary_new_from_values(mrb, size, vals);
95 return mrb_obj_value(a);
96 }
97
98 MRB_API mrb_value
mrb_assoc_new(mrb_state * mrb,mrb_value car,mrb_value cdr)99 mrb_assoc_new(mrb_state *mrb, mrb_value car, mrb_value cdr)
100 {
101 struct RArray *a;
102
103 a = ary_new_capa(mrb, 2);
104 ARY_PTR(a)[0] = car;
105 ARY_PTR(a)[1] = cdr;
106 ARY_SET_LEN(a, 2);
107 return mrb_obj_value(a);
108 }
109
110 static void
ary_fill_with_nil(mrb_value * ptr,mrb_int size)111 ary_fill_with_nil(mrb_value *ptr, mrb_int size)
112 {
113 mrb_value nil = mrb_nil_value();
114
115 while (size--) {
116 *ptr++ = nil;
117 }
118 }
119
120 static void
ary_modify_check(mrb_state * mrb,struct RArray * a)121 ary_modify_check(mrb_state *mrb, struct RArray *a)
122 {
123 if (MRB_FROZEN_P(a)) {
124 mrb_raise(mrb, E_FROZEN_ERROR, "can't modify frozen array");
125 }
126 }
127
128 static void
ary_modify(mrb_state * mrb,struct RArray * a)129 ary_modify(mrb_state *mrb, struct RArray *a)
130 {
131 ary_modify_check(mrb, a);
132
133 if (ARY_SHARED_P(a)) {
134 mrb_shared_array *shared = a->as.heap.aux.shared;
135
136 if (shared->refcnt == 1 && a->as.heap.ptr == shared->ptr) {
137 a->as.heap.ptr = shared->ptr;
138 a->as.heap.aux.capa = a->as.heap.len;
139 mrb_free(mrb, shared);
140 }
141 else {
142 mrb_value *ptr, *p;
143 mrb_int len;
144
145 p = a->as.heap.ptr;
146 len = a->as.heap.len * sizeof(mrb_value);
147 ptr = (mrb_value *)mrb_malloc(mrb, len);
148 if (p) {
149 array_copy(ptr, p, a->as.heap.len);
150 }
151 a->as.heap.ptr = ptr;
152 a->as.heap.aux.capa = a->as.heap.len;
153 mrb_ary_decref(mrb, shared);
154 }
155 ARY_UNSET_SHARED_FLAG(a);
156 }
157 }
158
159 MRB_API void
mrb_ary_modify(mrb_state * mrb,struct RArray * a)160 mrb_ary_modify(mrb_state *mrb, struct RArray* a)
161 {
162 mrb_write_barrier(mrb, (struct RBasic*)a);
163 ary_modify(mrb, a);
164 }
165
166 static void
ary_make_shared(mrb_state * mrb,struct RArray * a)167 ary_make_shared(mrb_state *mrb, struct RArray *a)
168 {
169 if (!ARY_SHARED_P(a) && !ARY_EMBED_P(a)) {
170 mrb_shared_array *shared = (mrb_shared_array *)mrb_malloc(mrb, sizeof(mrb_shared_array));
171 mrb_value *ptr = a->as.heap.ptr;
172 mrb_int len = a->as.heap.len;
173
174 shared->refcnt = 1;
175 if (a->as.heap.aux.capa > len) {
176 a->as.heap.ptr = shared->ptr = (mrb_value *)mrb_realloc(mrb, ptr, sizeof(mrb_value)*len+1);
177 }
178 else {
179 shared->ptr = ptr;
180 }
181 shared->len = len;
182 a->as.heap.aux.shared = shared;
183 ARY_SET_SHARED_FLAG(a);
184 }
185 }
186
187 static void
ary_expand_capa(mrb_state * mrb,struct RArray * a,mrb_int len)188 ary_expand_capa(mrb_state *mrb, struct RArray *a, mrb_int len)
189 {
190 mrb_int capa = ARY_CAPA(a);
191
192 if (len > ARY_MAX_SIZE || len < 0) {
193 size_error:
194 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
195 }
196
197 if (capa < ARY_DEFAULT_LEN) {
198 capa = ARY_DEFAULT_LEN;
199 }
200 while (capa < len) {
201 if (capa <= ARY_MAX_SIZE / 2) {
202 capa *= 2;
203 }
204 else {
205 capa = len;
206 }
207 }
208 if (capa < len || capa > ARY_MAX_SIZE) {
209 goto size_error;
210 }
211
212 if (ARY_EMBED_P(a)) {
213 mrb_value *ptr = ARY_EMBED_PTR(a);
214 mrb_int len = ARY_EMBED_LEN(a);
215 mrb_value *expanded_ptr = (mrb_value *)mrb_malloc(mrb, sizeof(mrb_value)*capa);
216
217 ARY_UNSET_EMBED_FLAG(a);
218 array_copy(expanded_ptr, ptr, len);
219 a->as.heap.len = len;
220 a->as.heap.aux.capa = capa;
221 a->as.heap.ptr = expanded_ptr;
222 }
223 else if (capa > a->as.heap.aux.capa) {
224 mrb_value *expanded_ptr = (mrb_value *)mrb_realloc(mrb, a->as.heap.ptr, sizeof(mrb_value)*capa);
225
226 a->as.heap.aux.capa = capa;
227 a->as.heap.ptr = expanded_ptr;
228 }
229 }
230
231 static void
ary_shrink_capa(mrb_state * mrb,struct RArray * a)232 ary_shrink_capa(mrb_state *mrb, struct RArray *a)
233 {
234
235 mrb_int capa;
236
237 if (ARY_EMBED_P(a)) return;
238
239 capa = a->as.heap.aux.capa;
240 if (capa < ARY_DEFAULT_LEN * 2) return;
241 if (capa <= a->as.heap.len * ARY_SHRINK_RATIO) return;
242
243 do {
244 capa /= 2;
245 if (capa < ARY_DEFAULT_LEN) {
246 capa = ARY_DEFAULT_LEN;
247 break;
248 }
249 } while (capa > a->as.heap.len * ARY_SHRINK_RATIO);
250
251 if (capa > a->as.heap.len && capa < a->as.heap.aux.capa) {
252 a->as.heap.aux.capa = capa;
253 a->as.heap.ptr = (mrb_value *)mrb_realloc(mrb, a->as.heap.ptr, sizeof(mrb_value)*capa);
254 }
255 }
256
257 MRB_API mrb_value
mrb_ary_resize(mrb_state * mrb,mrb_value ary,mrb_int new_len)258 mrb_ary_resize(mrb_state *mrb, mrb_value ary, mrb_int new_len)
259 {
260 mrb_int old_len;
261 struct RArray *a = mrb_ary_ptr(ary);
262
263 ary_modify(mrb, a);
264 old_len = RARRAY_LEN(ary);
265 if (old_len != new_len) {
266 if (new_len < old_len) {
267 ary_shrink_capa(mrb, a);
268 }
269 else {
270 ary_expand_capa(mrb, a, new_len);
271 ary_fill_with_nil(ARY_PTR(a) + old_len, new_len - old_len);
272 }
273 ARY_SET_LEN(a, new_len);
274 }
275
276 return ary;
277 }
278
279 static mrb_value
mrb_ary_s_create(mrb_state * mrb,mrb_value klass)280 mrb_ary_s_create(mrb_state *mrb, mrb_value klass)
281 {
282 mrb_value ary;
283 mrb_value *vals;
284 mrb_int len;
285 struct RArray *a;
286
287 mrb_get_args(mrb, "*!", &vals, &len);
288 ary = mrb_ary_new_from_values(mrb, len, vals);
289 a = mrb_ary_ptr(ary);
290 a->c = mrb_class_ptr(klass);
291
292 return ary;
293 }
294
295 static void ary_replace(mrb_state*, struct RArray*, struct RArray*);
296
297 static void
ary_concat(mrb_state * mrb,struct RArray * a,struct RArray * a2)298 ary_concat(mrb_state *mrb, struct RArray *a, struct RArray *a2)
299 {
300 mrb_int len;
301
302 if (ARY_LEN(a) == 0) {
303 ary_replace(mrb, a, a2);
304 return;
305 }
306 if (ARY_LEN(a2) > ARY_MAX_SIZE - ARY_LEN(a)) {
307 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
308 }
309 len = ARY_LEN(a) + ARY_LEN(a2);
310
311 ary_modify(mrb, a);
312 if (ARY_CAPA(a) < len) {
313 ary_expand_capa(mrb, a, len);
314 }
315 array_copy(ARY_PTR(a)+ARY_LEN(a), ARY_PTR(a2), ARY_LEN(a2));
316 mrb_write_barrier(mrb, (struct RBasic*)a);
317 ARY_SET_LEN(a, len);
318 }
319
320 MRB_API void
mrb_ary_concat(mrb_state * mrb,mrb_value self,mrb_value other)321 mrb_ary_concat(mrb_state *mrb, mrb_value self, mrb_value other)
322 {
323 struct RArray *a2 = mrb_ary_ptr(other);
324
325 ary_concat(mrb, mrb_ary_ptr(self), a2);
326 }
327
328 static mrb_value
mrb_ary_concat_m(mrb_state * mrb,mrb_value self)329 mrb_ary_concat_m(mrb_state *mrb, mrb_value self)
330 {
331 mrb_value ary;
332
333 mrb_get_args(mrb, "A", &ary);
334 mrb_ary_concat(mrb, self, ary);
335 return self;
336 }
337
338 static mrb_value
mrb_ary_plus(mrb_state * mrb,mrb_value self)339 mrb_ary_plus(mrb_state *mrb, mrb_value self)
340 {
341 struct RArray *a1 = mrb_ary_ptr(self);
342 struct RArray *a2;
343 mrb_value *ptr;
344 mrb_int blen, len1;
345
346 mrb_get_args(mrb, "a", &ptr, &blen);
347 if (ARY_MAX_SIZE - blen < ARY_LEN(a1)) {
348 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
349 }
350 len1 = ARY_LEN(a1);
351 a2 = ary_new_capa(mrb, len1 + blen);
352 array_copy(ARY_PTR(a2), ARY_PTR(a1), len1);
353 array_copy(ARY_PTR(a2) + len1, ptr, blen);
354 ARY_SET_LEN(a2, len1+blen);
355
356 return mrb_obj_value(a2);
357 }
358
359 #define ARY_REPLACE_SHARED_MIN 20
360
361 static void
ary_replace(mrb_state * mrb,struct RArray * a,struct RArray * b)362 ary_replace(mrb_state *mrb, struct RArray *a, struct RArray *b)
363 {
364 mrb_int len = ARY_LEN(b);
365
366 ary_modify_check(mrb, a);
367 if (a == b) return;
368 if (ARY_SHARED_P(a)) {
369 mrb_ary_decref(mrb, a->as.heap.aux.shared);
370 a->as.heap.aux.capa = 0;
371 a->as.heap.len = 0;
372 a->as.heap.ptr = NULL;
373 ARY_UNSET_SHARED_FLAG(a);
374 }
375 if (ARY_SHARED_P(b)) {
376 shared_b:
377 if (ARY_EMBED_P(a)) {
378 ARY_UNSET_EMBED_FLAG(a);
379 }
380 else {
381 mrb_free(mrb, a->as.heap.ptr);
382 }
383 a->as.heap.ptr = b->as.heap.ptr;
384 a->as.heap.len = len;
385 a->as.heap.aux.shared = b->as.heap.aux.shared;
386 a->as.heap.aux.shared->refcnt++;
387 ARY_SET_SHARED_FLAG(a);
388 mrb_write_barrier(mrb, (struct RBasic*)a);
389 return;
390 }
391 if (!MRB_FROZEN_P(b) && len > ARY_REPLACE_SHARED_MIN) {
392 ary_make_shared(mrb, b);
393 goto shared_b;
394 }
395 if (ARY_CAPA(a) < len)
396 ary_expand_capa(mrb, a, len);
397 array_copy(ARY_PTR(a), ARY_PTR(b), len);
398 mrb_write_barrier(mrb, (struct RBasic*)a);
399 ARY_SET_LEN(a, len);
400 }
401
402 MRB_API void
mrb_ary_replace(mrb_state * mrb,mrb_value self,mrb_value other)403 mrb_ary_replace(mrb_state *mrb, mrb_value self, mrb_value other)
404 {
405 struct RArray *a1 = mrb_ary_ptr(self);
406 struct RArray *a2 = mrb_ary_ptr(other);
407
408 if (a1 != a2) {
409 ary_replace(mrb, a1, a2);
410 }
411 }
412
413 static mrb_value
mrb_ary_replace_m(mrb_state * mrb,mrb_value self)414 mrb_ary_replace_m(mrb_state *mrb, mrb_value self)
415 {
416 mrb_value other;
417
418 mrb_get_args(mrb, "A", &other);
419 mrb_ary_replace(mrb, self, other);
420
421 return self;
422 }
423
424 static mrb_value
mrb_ary_times(mrb_state * mrb,mrb_value self)425 mrb_ary_times(mrb_state *mrb, mrb_value self)
426 {
427 struct RArray *a1 = mrb_ary_ptr(self);
428 struct RArray *a2;
429 mrb_value *ptr;
430 mrb_int times, len1;
431
432 mrb_get_args(mrb, "i", ×);
433 if (times < 0) {
434 mrb_raise(mrb, E_ARGUMENT_ERROR, "negative argument");
435 }
436 if (times == 0) return mrb_ary_new(mrb);
437 if (ARY_MAX_SIZE / times < ARY_LEN(a1)) {
438 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
439 }
440 len1 = ARY_LEN(a1);
441 a2 = ary_new_capa(mrb, len1 * times);
442 ARY_SET_LEN(a2, len1 * times);
443 ptr = ARY_PTR(a2);
444 while (times--) {
445 array_copy(ptr, ARY_PTR(a1), len1);
446 ptr += len1;
447 }
448
449 return mrb_obj_value(a2);
450 }
451
452 static mrb_value
mrb_ary_reverse_bang(mrb_state * mrb,mrb_value self)453 mrb_ary_reverse_bang(mrb_state *mrb, mrb_value self)
454 {
455 struct RArray *a = mrb_ary_ptr(self);
456 mrb_int len = ARY_LEN(a);
457
458 if (len > 1) {
459 mrb_value *p1, *p2;
460
461 ary_modify(mrb, a);
462 p1 = ARY_PTR(a);
463 p2 = p1 + len - 1;
464
465 while (p1 < p2) {
466 mrb_value tmp = *p1;
467 *p1++ = *p2;
468 *p2-- = tmp;
469 }
470 }
471 return self;
472 }
473
474 static mrb_value
mrb_ary_reverse(mrb_state * mrb,mrb_value self)475 mrb_ary_reverse(mrb_state *mrb, mrb_value self)
476 {
477 struct RArray *a = mrb_ary_ptr(self), *b = ary_new_capa(mrb, ARY_LEN(a));
478 mrb_int len = ARY_LEN(a);
479
480 if (len > 0) {
481 mrb_value *p1, *p2, *e;
482
483 p1 = ARY_PTR(a);
484 e = p1 + len;
485 p2 = ARY_PTR(b) + len - 1;
486 while (p1 < e) {
487 *p2-- = *p1++;
488 }
489 ARY_SET_LEN(b, len);
490 }
491 return mrb_obj_value(b);
492 }
493
494 MRB_API void
mrb_ary_push(mrb_state * mrb,mrb_value ary,mrb_value elem)495 mrb_ary_push(mrb_state *mrb, mrb_value ary, mrb_value elem)
496 {
497 struct RArray *a = mrb_ary_ptr(ary);
498 mrb_int len = ARY_LEN(a);
499
500 ary_modify(mrb, a);
501 if (len == ARY_CAPA(a))
502 ary_expand_capa(mrb, a, len + 1);
503 ARY_PTR(a)[len] = elem;
504 ARY_SET_LEN(a, len+1);
505 mrb_field_write_barrier_value(mrb, (struct RBasic*)a, elem);
506 }
507
508 static mrb_value
mrb_ary_push_m(mrb_state * mrb,mrb_value self)509 mrb_ary_push_m(mrb_state *mrb, mrb_value self)
510 {
511 mrb_value *argv;
512 mrb_int len, len2, alen;
513 struct RArray *a;
514
515 mrb_get_args(mrb, "*!", &argv, &alen);
516 a = mrb_ary_ptr(self);
517 ary_modify(mrb, a);
518 len = ARY_LEN(a);
519 len2 = len + alen;
520 if (ARY_CAPA(a) < len2) {
521 ary_expand_capa(mrb, a, len2);
522 }
523 array_copy(ARY_PTR(a)+len, argv, alen);
524 ARY_SET_LEN(a, len2);
525 mrb_write_barrier(mrb, (struct RBasic*)a);
526
527 return self;
528 }
529
530 MRB_API mrb_value
mrb_ary_pop(mrb_state * mrb,mrb_value ary)531 mrb_ary_pop(mrb_state *mrb, mrb_value ary)
532 {
533 struct RArray *a = mrb_ary_ptr(ary);
534 mrb_int len = ARY_LEN(a);
535
536 ary_modify_check(mrb, a);
537 if (len == 0) return mrb_nil_value();
538 ARY_SET_LEN(a, len-1);
539 return ARY_PTR(a)[len-1];
540 }
541
542 #define ARY_SHIFT_SHARED_MIN 10
543
544 MRB_API mrb_value
mrb_ary_shift(mrb_state * mrb,mrb_value self)545 mrb_ary_shift(mrb_state *mrb, mrb_value self)
546 {
547 struct RArray *a = mrb_ary_ptr(self);
548 mrb_int len = ARY_LEN(a);
549 mrb_value val;
550
551 ary_modify_check(mrb, a);
552 if (len == 0) return mrb_nil_value();
553 if (ARY_SHARED_P(a)) {
554 L_SHIFT:
555 val = a->as.heap.ptr[0];
556 a->as.heap.ptr++;
557 a->as.heap.len--;
558 return val;
559 }
560 if (len > ARY_SHIFT_SHARED_MIN) {
561 ary_make_shared(mrb, a);
562 goto L_SHIFT;
563 }
564 else {
565 mrb_value *ptr = ARY_PTR(a);
566 mrb_int size = len;
567
568 val = *ptr;
569 while (--size) {
570 *ptr = *(ptr+1);
571 ++ptr;
572 }
573 ARY_SET_LEN(a, len-1);
574 }
575 return val;
576 }
577
578 /* self = [1,2,3]
579 item = 0
580 self.unshift item
581 p self #=> [0, 1, 2, 3] */
582 MRB_API mrb_value
mrb_ary_unshift(mrb_state * mrb,mrb_value self,mrb_value item)583 mrb_ary_unshift(mrb_state *mrb, mrb_value self, mrb_value item)
584 {
585 struct RArray *a = mrb_ary_ptr(self);
586 mrb_int len = ARY_LEN(a);
587
588 if (ARY_SHARED_P(a)
589 && a->as.heap.aux.shared->refcnt == 1 /* shared only referenced from this array */
590 && a->as.heap.ptr - a->as.heap.aux.shared->ptr >= 1) /* there's room for unshifted item */ {
591 a->as.heap.ptr--;
592 a->as.heap.ptr[0] = item;
593 }
594 else {
595 mrb_value *ptr;
596
597 ary_modify(mrb, a);
598 if (ARY_CAPA(a) < len + 1)
599 ary_expand_capa(mrb, a, len + 1);
600 ptr = ARY_PTR(a);
601 value_move(ptr + 1, ptr, len);
602 ptr[0] = item;
603 }
604 ARY_SET_LEN(a, len+1);
605 mrb_field_write_barrier_value(mrb, (struct RBasic*)a, item);
606
607 return self;
608 }
609
610 static mrb_value
mrb_ary_unshift_m(mrb_state * mrb,mrb_value self)611 mrb_ary_unshift_m(mrb_state *mrb, mrb_value self)
612 {
613 struct RArray *a = mrb_ary_ptr(self);
614 mrb_value *vals, *ptr;
615 mrb_int alen, len;
616
617 mrb_get_args(mrb, "*!", &vals, &alen);
618 if (alen == 0) {
619 ary_modify_check(mrb, a);
620 return self;
621 }
622 len = ARY_LEN(a);
623 if (alen > ARY_MAX_SIZE - len) {
624 mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");
625 }
626 if (ARY_SHARED_P(a)
627 && a->as.heap.aux.shared->refcnt == 1 /* shared only referenced from this array */
628 && a->as.heap.ptr - a->as.heap.aux.shared->ptr >= alen) /* there's room for unshifted item */ {
629 ary_modify_check(mrb, a);
630 a->as.heap.ptr -= alen;
631 ptr = a->as.heap.ptr;
632 }
633 else {
634 ary_modify(mrb, a);
635 if (ARY_CAPA(a) < len + alen)
636 ary_expand_capa(mrb, a, len + alen);
637 ptr = ARY_PTR(a);
638 value_move(ptr + alen, ptr, len);
639 }
640 array_copy(ptr, vals, alen);
641 ARY_SET_LEN(a, len+alen);
642 while (alen--) {
643 mrb_field_write_barrier_value(mrb, (struct RBasic*)a, vals[alen]);
644 }
645
646 return self;
647 }
648
649 MRB_API mrb_value
mrb_ary_ref(mrb_state * mrb,mrb_value ary,mrb_int n)650 mrb_ary_ref(mrb_state *mrb, mrb_value ary, mrb_int n)
651 {
652 struct RArray *a = mrb_ary_ptr(ary);
653 mrb_int len = ARY_LEN(a);
654
655 /* range check */
656 if (n < 0) n += len;
657 if (n < 0 || len <= n) return mrb_nil_value();
658
659 return ARY_PTR(a)[n];
660 }
661
662 MRB_API void
mrb_ary_set(mrb_state * mrb,mrb_value ary,mrb_int n,mrb_value val)663 mrb_ary_set(mrb_state *mrb, mrb_value ary, mrb_int n, mrb_value val)
664 {
665 struct RArray *a = mrb_ary_ptr(ary);
666 mrb_int len = ARY_LEN(a);
667
668 ary_modify(mrb, a);
669 /* range check */
670 if (n < 0) {
671 n += len;
672 if (n < 0) {
673 mrb_raisef(mrb, E_INDEX_ERROR, "index %S out of array", mrb_fixnum_value(n - len));
674 }
675 }
676 if (len <= n) {
677 if (ARY_CAPA(a) <= n)
678 ary_expand_capa(mrb, a, n + 1);
679 ary_fill_with_nil(ARY_PTR(a) + len, n + 1 - len);
680 ARY_SET_LEN(a, n+1);
681 }
682
683 ARY_PTR(a)[n] = val;
684 mrb_field_write_barrier_value(mrb, (struct RBasic*)a, val);
685 }
686
687 static struct RArray*
ary_dup(mrb_state * mrb,struct RArray * a)688 ary_dup(mrb_state *mrb, struct RArray *a)
689 {
690 return ary_new_from_values(mrb, ARY_LEN(a), ARY_PTR(a));
691 }
692
693 MRB_API mrb_value
mrb_ary_splice(mrb_state * mrb,mrb_value ary,mrb_int head,mrb_int len,mrb_value rpl)694 mrb_ary_splice(mrb_state *mrb, mrb_value ary, mrb_int head, mrb_int len, mrb_value rpl)
695 {
696 struct RArray *a = mrb_ary_ptr(ary);
697 mrb_int alen = ARY_LEN(a);
698 const mrb_value *argv;
699 mrb_int argc;
700 mrb_int tail;
701
702 ary_modify(mrb, a);
703
704 /* len check */
705 if (len < 0) mrb_raisef(mrb, E_INDEX_ERROR, "negative length (%S)", mrb_fixnum_value(len));
706
707 /* range check */
708 if (head < 0) {
709 head += alen;
710 if (head < 0) {
711 mrb_raise(mrb, E_INDEX_ERROR, "index is out of array");
712 }
713 }
714 tail = head + len;
715 if (alen < len || alen < tail) {
716 len = alen - head;
717 }
718
719 /* size check */
720 if (mrb_array_p(rpl)) {
721 argc = RARRAY_LEN(rpl);
722 argv = RARRAY_PTR(rpl);
723 if (argv == ARY_PTR(a)) {
724 struct RArray *r;
725
726 if (argc > 32767) {
727 mrb_raise(mrb, E_ARGUMENT_ERROR, "too big recursive splice");
728 }
729 r = ary_dup(mrb, a);
730 argv = ARY_PTR(r);
731 }
732 }
733 else {
734 argc = 1;
735 argv = &rpl;
736 }
737 if (head >= alen) {
738 if (head > ARY_MAX_SIZE - argc) {
739 mrb_raisef(mrb, E_INDEX_ERROR, "index %S too big", mrb_fixnum_value(head));
740 }
741 len = head + argc;
742 if (len > ARY_CAPA(a)) {
743 ary_expand_capa(mrb, a, head + argc);
744 }
745 ary_fill_with_nil(ARY_PTR(a) + alen, head - alen);
746 if (argc > 0) {
747 array_copy(ARY_PTR(a) + head, argv, argc);
748 }
749 ARY_SET_LEN(a, len);
750 }
751 else {
752 mrb_int newlen;
753
754 if (alen - len > ARY_MAX_SIZE - argc) {
755 mrb_raisef(mrb, E_INDEX_ERROR, "index %S too big", mrb_fixnum_value(alen + argc - len));
756 }
757 newlen = alen + argc - len;
758 if (newlen > ARY_CAPA(a)) {
759 ary_expand_capa(mrb, a, newlen);
760 }
761
762 if (len != argc) {
763 mrb_value *ptr = ARY_PTR(a);
764 tail = head + len;
765 value_move(ptr + head + argc, ptr + tail, alen - tail);
766 ARY_SET_LEN(a, newlen);
767 }
768 if (argc > 0) {
769 value_move(ARY_PTR(a) + head, argv, argc);
770 }
771 }
772 mrb_write_barrier(mrb, (struct RBasic*)a);
773 return ary;
774 }
775
776 void
mrb_ary_decref(mrb_state * mrb,mrb_shared_array * shared)777 mrb_ary_decref(mrb_state *mrb, mrb_shared_array *shared)
778 {
779 shared->refcnt--;
780 if (shared->refcnt == 0) {
781 mrb_free(mrb, shared->ptr);
782 mrb_free(mrb, shared);
783 }
784 }
785
786 static mrb_value
ary_subseq(mrb_state * mrb,struct RArray * a,mrb_int beg,mrb_int len)787 ary_subseq(mrb_state *mrb, struct RArray *a, mrb_int beg, mrb_int len)
788 {
789 struct RArray *b;
790
791 if (!ARY_SHARED_P(a) && len <= ARY_SHIFT_SHARED_MIN) {
792 return mrb_ary_new_from_values(mrb, len, ARY_PTR(a)+beg);
793 }
794 ary_make_shared(mrb, a);
795 b = (struct RArray*)mrb_obj_alloc(mrb, MRB_TT_ARRAY, mrb->array_class);
796 b->as.heap.ptr = a->as.heap.ptr + beg;
797 b->as.heap.len = len;
798 b->as.heap.aux.shared = a->as.heap.aux.shared;
799 b->as.heap.aux.shared->refcnt++;
800 ARY_SET_SHARED_FLAG(b);
801
802 return mrb_obj_value(b);
803 }
804
805 static mrb_int
aget_index(mrb_state * mrb,mrb_value index)806 aget_index(mrb_state *mrb, mrb_value index)
807 {
808 if (mrb_fixnum_p(index)) {
809 return mrb_fixnum(index);
810 }
811 #ifndef MRB_WITHOUT_FLOAT
812 else if (mrb_float_p(index)) {
813 return (mrb_int)mrb_float(index);
814 }
815 #endif
816 else {
817 mrb_int i, argc;
818 mrb_value *argv;
819
820 mrb_get_args(mrb, "i*!", &i, &argv, &argc);
821 return i;
822 }
823 }
824
825 /*
826 * call-seq:
827 * ary[index] -> obj or nil
828 * ary[start, length] -> new_ary or nil
829 * ary[range] -> new_ary or nil
830 * ary.slice(index) -> obj or nil
831 * ary.slice(start, length) -> new_ary or nil
832 * ary.slice(range) -> new_ary or nil
833 *
834 * Element Reference --- Returns the element at +index+, or returns a
835 * subarray starting at the +start+ index and continuing for +length+
836 * elements, or returns a subarray specified by +range+ of indices.
837 *
838 * Negative indices count backward from the end of the array (-1 is the last
839 * element). For +start+ and +range+ cases the starting index is just before
840 * an element. Additionally, an empty array is returned when the starting
841 * index for an element range is at the end of the array.
842 *
843 * Returns +nil+ if the index (or starting index) are out of range.
844 *
845 * a = [ "a", "b", "c", "d", "e" ]
846 * a[1] => "b"
847 * a[1,2] => ["b", "c"]
848 * a[1..-2] => ["b", "c", "d"]
849 *
850 */
851
852 static mrb_value
mrb_ary_aget(mrb_state * mrb,mrb_value self)853 mrb_ary_aget(mrb_state *mrb, mrb_value self)
854 {
855 struct RArray *a = mrb_ary_ptr(self);
856 mrb_int i, len, alen;
857 mrb_value index;
858
859 if (mrb_get_args(mrb, "o|i", &index, &len) == 1) {
860 switch (mrb_type(index)) {
861 /* a[n..m] */
862 case MRB_TT_RANGE:
863 if (mrb_range_beg_len(mrb, index, &i, &len, ARY_LEN(a), TRUE) == 1) {
864 return ary_subseq(mrb, a, i, len);
865 }
866 else {
867 return mrb_nil_value();
868 }
869 case MRB_TT_FIXNUM:
870 return mrb_ary_ref(mrb, self, mrb_fixnum(index));
871 default:
872 return mrb_ary_ref(mrb, self, aget_index(mrb, index));
873 }
874 }
875
876 i = aget_index(mrb, index);
877 alen = ARY_LEN(a);
878 if (i < 0) i += alen;
879 if (i < 0 || alen < i) return mrb_nil_value();
880 if (len < 0) return mrb_nil_value();
881 if (alen == i) return mrb_ary_new(mrb);
882 if (len > alen - i) len = alen - i;
883
884 return ary_subseq(mrb, a, i, len);
885 }
886
887 /*
888 * call-seq:
889 * ary[index] = obj -> obj
890 * ary[start, length] = obj or other_ary or nil -> obj or other_ary or nil
891 * ary[range] = obj or other_ary or nil -> obj or other_ary or nil
892 *
893 * Element Assignment --- Sets the element at +index+, or replaces a subarray
894 * from the +start+ index for +length+ elements, or replaces a subarray
895 * specified by the +range+ of indices.
896 *
897 * If indices are greater than the current capacity of the array, the array
898 * grows automatically. Elements are inserted into the array at +start+ if
899 * +length+ is zero.
900 *
901 * Negative indices will count backward from the end of the array. For
902 * +start+ and +range+ cases the starting index is just before an element.
903 *
904 * An IndexError is raised if a negative index points past the beginning of
905 * the array.
906 *
907 * See also Array#push, and Array#unshift.
908 *
909 * a = Array.new
910 * a[4] = "4"; #=> [nil, nil, nil, nil, "4"]
911 * a[0, 3] = [ 'a', 'b', 'c' ] #=> ["a", "b", "c", nil, "4"]
912 * a[1..2] = [ 1, 2 ] #=> ["a", 1, 2, nil, "4"]
913 * a[0, 2] = "?" #=> ["?", 2, nil, "4"]
914 * a[0..2] = "A" #=> ["A", "4"]
915 * a[-1] = "Z" #=> ["A", "Z"]
916 * a[1..-1] = nil #=> ["A", nil]
917 * a[1..-1] = [] #=> ["A"]
918 * a[0, 0] = [ 1, 2 ] #=> [1, 2, "A"]
919 * a[3, 0] = "B" #=> [1, 2, "A", "B"]
920 */
921
922 static mrb_value
mrb_ary_aset(mrb_state * mrb,mrb_value self)923 mrb_ary_aset(mrb_state *mrb, mrb_value self)
924 {
925 mrb_value v1, v2, v3;
926 mrb_int i, len;
927
928 mrb_ary_modify(mrb, mrb_ary_ptr(self));
929 if (mrb_get_args(mrb, "oo|o", &v1, &v2, &v3) == 2) {
930 /* a[n..m] = v */
931 switch (mrb_range_beg_len(mrb, v1, &i, &len, RARRAY_LEN(self), FALSE)) {
932 case 0: /* not range */
933 mrb_ary_set(mrb, self, aget_index(mrb, v1), v2);
934 break;
935 case 1: /* range */
936 mrb_ary_splice(mrb, self, i, len, v2);
937 break;
938 case 2: /* out of range */
939 mrb_raisef(mrb, E_RANGE_ERROR, "%S out of range", v1);
940 break;
941 }
942 return v2;
943 }
944
945 /* a[n,m] = v */
946 mrb_ary_splice(mrb, self, aget_index(mrb, v1), aget_index(mrb, v2), v3);
947 return v3;
948 }
949
950 static mrb_value
mrb_ary_delete_at(mrb_state * mrb,mrb_value self)951 mrb_ary_delete_at(mrb_state *mrb, mrb_value self)
952 {
953 struct RArray *a = mrb_ary_ptr(self);
954 mrb_int index;
955 mrb_value val;
956 mrb_value *ptr;
957 mrb_int len, alen;
958
959 mrb_get_args(mrb, "i", &index);
960 alen = ARY_LEN(a);
961 if (index < 0) index += alen;
962 if (index < 0 || alen <= index) return mrb_nil_value();
963
964 ary_modify(mrb, a);
965 ptr = ARY_PTR(a);
966 val = ptr[index];
967
968 ptr += index;
969 len = alen - index;
970 while (--len) {
971 *ptr = *(ptr+1);
972 ++ptr;
973 }
974 ARY_SET_LEN(a, alen-1);
975
976 ary_shrink_capa(mrb, a);
977
978 return val;
979 }
980
981 static mrb_value
mrb_ary_first(mrb_state * mrb,mrb_value self)982 mrb_ary_first(mrb_state *mrb, mrb_value self)
983 {
984 struct RArray *a = mrb_ary_ptr(self);
985 mrb_int size, alen;
986
987 if (mrb_get_argc(mrb) == 0) {
988 return (ARY_LEN(a) > 0)? ARY_PTR(a)[0]: mrb_nil_value();
989 }
990 mrb_get_args(mrb, "|i", &size);
991 if (size < 0) {
992 mrb_raise(mrb, E_ARGUMENT_ERROR, "negative array size");
993 }
994
995 alen = ARY_LEN(a);
996 if (size > alen) size = alen;
997 if (ARY_SHARED_P(a)) {
998 return ary_subseq(mrb, a, 0, size);
999 }
1000 return mrb_ary_new_from_values(mrb, size, ARY_PTR(a));
1001 }
1002
1003 static mrb_value
mrb_ary_last(mrb_state * mrb,mrb_value self)1004 mrb_ary_last(mrb_state *mrb, mrb_value self)
1005 {
1006 struct RArray *a = mrb_ary_ptr(self);
1007 mrb_int n, size, alen;
1008
1009 n = mrb_get_args(mrb, "|i", &size);
1010 alen = ARY_LEN(a);
1011 if (n == 0) {
1012 return (alen > 0) ? ARY_PTR(a)[alen - 1]: mrb_nil_value();
1013 }
1014
1015 if (size < 0) {
1016 mrb_raise(mrb, E_ARGUMENT_ERROR, "negative array size");
1017 }
1018 if (size > alen) size = alen;
1019 if (ARY_SHARED_P(a) || size > ARY_DEFAULT_LEN) {
1020 return ary_subseq(mrb, a, alen - size, size);
1021 }
1022 return mrb_ary_new_from_values(mrb, size, ARY_PTR(a) + alen - size);
1023 }
1024
1025 static mrb_value
mrb_ary_index_m(mrb_state * mrb,mrb_value self)1026 mrb_ary_index_m(mrb_state *mrb, mrb_value self)
1027 {
1028 mrb_value obj;
1029 mrb_int i;
1030
1031 mrb_get_args(mrb, "o", &obj);
1032 for (i = 0; i < RARRAY_LEN(self); i++) {
1033 if (mrb_equal(mrb, RARRAY_PTR(self)[i], obj)) {
1034 return mrb_fixnum_value(i);
1035 }
1036 }
1037 return mrb_nil_value();
1038 }
1039
1040 static mrb_value
mrb_ary_rindex_m(mrb_state * mrb,mrb_value self)1041 mrb_ary_rindex_m(mrb_state *mrb, mrb_value self)
1042 {
1043 mrb_value obj;
1044 mrb_int i, len;
1045
1046 mrb_get_args(mrb, "o", &obj);
1047 for (i = RARRAY_LEN(self) - 1; i >= 0; i--) {
1048 if (mrb_equal(mrb, RARRAY_PTR(self)[i], obj)) {
1049 return mrb_fixnum_value(i);
1050 }
1051 if (i > (len = RARRAY_LEN(self))) {
1052 i = len;
1053 }
1054 }
1055 return mrb_nil_value();
1056 }
1057
1058 MRB_API mrb_value
mrb_ary_splat(mrb_state * mrb,mrb_value v)1059 mrb_ary_splat(mrb_state *mrb, mrb_value v)
1060 {
1061 mrb_value a;
1062
1063 if (mrb_array_p(v)) {
1064 return v;
1065 }
1066
1067 if (!mrb_respond_to(mrb, v, mrb_intern_lit(mrb, "to_a"))) {
1068 return mrb_ary_new_from_values(mrb, 1, &v);
1069 }
1070
1071 a = mrb_funcall(mrb, v, "to_a", 0);
1072 if (mrb_nil_p(a)) {
1073 return mrb_ary_new_from_values(mrb, 1, &v);
1074 }
1075 mrb_ensure_array_type(mrb, a);
1076 return a;
1077 }
1078
1079 static mrb_value
mrb_ary_size(mrb_state * mrb,mrb_value self)1080 mrb_ary_size(mrb_state *mrb, mrb_value self)
1081 {
1082 struct RArray *a = mrb_ary_ptr(self);
1083
1084 return mrb_fixnum_value(ARY_LEN(a));
1085 }
1086
1087 MRB_API mrb_value
mrb_ary_clear(mrb_state * mrb,mrb_value self)1088 mrb_ary_clear(mrb_state *mrb, mrb_value self)
1089 {
1090 struct RArray *a = mrb_ary_ptr(self);
1091
1092 ary_modify(mrb, a);
1093 if (ARY_SHARED_P(a)) {
1094 mrb_ary_decref(mrb, a->as.heap.aux.shared);
1095 ARY_UNSET_SHARED_FLAG(a);
1096 }
1097 else if (!ARY_EMBED_P(a)){
1098 mrb_free(mrb, a->as.heap.ptr);
1099 }
1100 ARY_SET_EMBED_LEN(a, 0);
1101
1102 return self;
1103 }
1104
1105 static mrb_value
mrb_ary_clear_m(mrb_state * mrb,mrb_value self)1106 mrb_ary_clear_m(mrb_state *mrb, mrb_value self)
1107 {
1108 mrb_get_args(mrb, "");
1109 return mrb_ary_clear(mrb, self);
1110 }
1111
1112 static mrb_value
mrb_ary_empty_p(mrb_state * mrb,mrb_value self)1113 mrb_ary_empty_p(mrb_state *mrb, mrb_value self)
1114 {
1115 struct RArray *a = mrb_ary_ptr(self);
1116
1117 return mrb_bool_value(ARY_LEN(a) == 0);
1118 }
1119
1120 MRB_API mrb_value
mrb_ary_entry(mrb_value ary,mrb_int offset)1121 mrb_ary_entry(mrb_value ary, mrb_int offset)
1122 {
1123 if (offset < 0) {
1124 offset += RARRAY_LEN(ary);
1125 }
1126 if (offset < 0 || RARRAY_LEN(ary) <= offset) {
1127 return mrb_nil_value();
1128 }
1129 return RARRAY_PTR(ary)[offset];
1130 }
1131
1132 static mrb_value
join_ary(mrb_state * mrb,mrb_value ary,mrb_value sep,mrb_value list)1133 join_ary(mrb_state *mrb, mrb_value ary, mrb_value sep, mrb_value list)
1134 {
1135 mrb_int i;
1136 mrb_value result, val, tmp;
1137
1138 /* check recursive */
1139 for (i=0; i<RARRAY_LEN(list); i++) {
1140 if (mrb_obj_equal(mrb, ary, RARRAY_PTR(list)[i])) {
1141 mrb_raise(mrb, E_ARGUMENT_ERROR, "recursive array join");
1142 }
1143 }
1144
1145 mrb_ary_push(mrb, list, ary);
1146
1147 result = mrb_str_new_capa(mrb, 64);
1148
1149 for (i=0; i<RARRAY_LEN(ary); i++) {
1150 if (i > 0 && !mrb_nil_p(sep)) {
1151 mrb_str_cat_str(mrb, result, sep);
1152 }
1153
1154 val = RARRAY_PTR(ary)[i];
1155 switch (mrb_type(val)) {
1156 case MRB_TT_ARRAY:
1157 ary_join:
1158 val = join_ary(mrb, val, sep, list);
1159 /* fall through */
1160
1161 case MRB_TT_STRING:
1162 str_join:
1163 mrb_str_cat_str(mrb, result, val);
1164 break;
1165
1166 default:
1167 if (!mrb_immediate_p(val)) {
1168 tmp = mrb_check_string_type(mrb, val);
1169 if (!mrb_nil_p(tmp)) {
1170 val = tmp;
1171 goto str_join;
1172 }
1173 tmp = mrb_check_array_type(mrb, val);
1174 if (!mrb_nil_p(tmp)) {
1175 val = tmp;
1176 goto ary_join;
1177 }
1178 }
1179 val = mrb_obj_as_string(mrb, val);
1180 goto str_join;
1181 }
1182 }
1183
1184 mrb_ary_pop(mrb, list);
1185
1186 return result;
1187 }
1188
1189 MRB_API mrb_value
mrb_ary_join(mrb_state * mrb,mrb_value ary,mrb_value sep)1190 mrb_ary_join(mrb_state *mrb, mrb_value ary, mrb_value sep)
1191 {
1192 if (!mrb_nil_p(sep)) {
1193 sep = mrb_obj_as_string(mrb, sep);
1194 }
1195 return join_ary(mrb, ary, sep, mrb_ary_new(mrb));
1196 }
1197
1198 /*
1199 * call-seq:
1200 * ary.join(sep="") -> str
1201 *
1202 * Returns a string created by converting each element of the array to
1203 * a string, separated by <i>sep</i>.
1204 *
1205 * [ "a", "b", "c" ].join #=> "abc"
1206 * [ "a", "b", "c" ].join("-") #=> "a-b-c"
1207 */
1208
1209 static mrb_value
mrb_ary_join_m(mrb_state * mrb,mrb_value ary)1210 mrb_ary_join_m(mrb_state *mrb, mrb_value ary)
1211 {
1212 mrb_value sep = mrb_nil_value();
1213
1214 mrb_get_args(mrb, "|S!", &sep);
1215 return mrb_ary_join(mrb, ary, sep);
1216 }
1217
1218 static mrb_value
mrb_ary_eq(mrb_state * mrb,mrb_value ary1)1219 mrb_ary_eq(mrb_state *mrb, mrb_value ary1)
1220 {
1221 mrb_value ary2;
1222
1223 mrb_get_args(mrb, "o", &ary2);
1224 if (mrb_obj_equal(mrb, ary1, ary2)) return mrb_true_value();
1225 if (!mrb_array_p(ary2)) {
1226 return mrb_false_value();
1227 }
1228 if (RARRAY_LEN(ary1) != RARRAY_LEN(ary2)) return mrb_false_value();
1229
1230 return ary2;
1231 }
1232
1233 static mrb_value
mrb_ary_cmp(mrb_state * mrb,mrb_value ary1)1234 mrb_ary_cmp(mrb_state *mrb, mrb_value ary1)
1235 {
1236 mrb_value ary2;
1237
1238 mrb_get_args(mrb, "o", &ary2);
1239 if (mrb_obj_equal(mrb, ary1, ary2)) return mrb_fixnum_value(0);
1240 if (!mrb_array_p(ary2)) {
1241 return mrb_nil_value();
1242 }
1243
1244 return ary2;
1245 }
1246
1247 /* internal method to convert multi-value to single value */
1248 static mrb_value
mrb_ary_svalue(mrb_state * mrb,mrb_value ary)1249 mrb_ary_svalue(mrb_state *mrb, mrb_value ary)
1250 {
1251 mrb_get_args(mrb, "");
1252 switch (RARRAY_LEN(ary)) {
1253 case 0:
1254 return mrb_nil_value();
1255 case 1:
1256 return RARRAY_PTR(ary)[0];
1257 default:
1258 return ary;
1259 }
1260 }
1261
1262 void
mrb_init_array(mrb_state * mrb)1263 mrb_init_array(mrb_state *mrb)
1264 {
1265 struct RClass *a;
1266
1267 mrb->array_class = a = mrb_define_class(mrb, "Array", mrb->object_class); /* 15.2.12 */
1268 MRB_SET_INSTANCE_TT(a, MRB_TT_ARRAY);
1269
1270 mrb_define_class_method(mrb, a, "[]", mrb_ary_s_create, MRB_ARGS_ANY()); /* 15.2.12.4.1 */
1271
1272 mrb_define_method(mrb, a, "+", mrb_ary_plus, MRB_ARGS_REQ(1)); /* 15.2.12.5.1 */
1273 mrb_define_method(mrb, a, "*", mrb_ary_times, MRB_ARGS_REQ(1)); /* 15.2.12.5.2 */
1274 mrb_define_method(mrb, a, "<<", mrb_ary_push_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.3 */
1275 mrb_define_method(mrb, a, "[]", mrb_ary_aget, MRB_ARGS_ANY()); /* 15.2.12.5.4 */
1276 mrb_define_method(mrb, a, "[]=", mrb_ary_aset, MRB_ARGS_ANY()); /* 15.2.12.5.5 */
1277 mrb_define_method(mrb, a, "clear", mrb_ary_clear_m, MRB_ARGS_NONE()); /* 15.2.12.5.6 */
1278 mrb_define_method(mrb, a, "concat", mrb_ary_concat_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.8 */
1279 mrb_define_method(mrb, a, "delete_at", mrb_ary_delete_at, MRB_ARGS_REQ(1)); /* 15.2.12.5.9 */
1280 mrb_define_method(mrb, a, "empty?", mrb_ary_empty_p, MRB_ARGS_NONE()); /* 15.2.12.5.12 */
1281 mrb_define_method(mrb, a, "first", mrb_ary_first, MRB_ARGS_OPT(1)); /* 15.2.12.5.13 */
1282 mrb_define_method(mrb, a, "index", mrb_ary_index_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.14 */
1283 mrb_define_method(mrb, a, "initialize_copy", mrb_ary_replace_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.16 */
1284 mrb_define_method(mrb, a, "join", mrb_ary_join_m, MRB_ARGS_ANY()); /* 15.2.12.5.17 */
1285 mrb_define_method(mrb, a, "last", mrb_ary_last, MRB_ARGS_ANY()); /* 15.2.12.5.18 */
1286 mrb_define_method(mrb, a, "length", mrb_ary_size, MRB_ARGS_NONE()); /* 15.2.12.5.19 */
1287 mrb_define_method(mrb, a, "pop", mrb_ary_pop, MRB_ARGS_NONE()); /* 15.2.12.5.21 */
1288 mrb_define_method(mrb, a, "push", mrb_ary_push_m, MRB_ARGS_ANY()); /* 15.2.12.5.22 */
1289 mrb_define_method(mrb, a, "append", mrb_ary_push_m, MRB_ARGS_ANY());
1290 mrb_define_method(mrb, a, "replace", mrb_ary_replace_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.23 */
1291 mrb_define_method(mrb, a, "reverse", mrb_ary_reverse, MRB_ARGS_NONE()); /* 15.2.12.5.24 */
1292 mrb_define_method(mrb, a, "reverse!", mrb_ary_reverse_bang, MRB_ARGS_NONE()); /* 15.2.12.5.25 */
1293 mrb_define_method(mrb, a, "rindex", mrb_ary_rindex_m, MRB_ARGS_REQ(1)); /* 15.2.12.5.26 */
1294 mrb_define_method(mrb, a, "shift", mrb_ary_shift, MRB_ARGS_NONE()); /* 15.2.12.5.27 */
1295 mrb_define_method(mrb, a, "size", mrb_ary_size, MRB_ARGS_NONE()); /* 15.2.12.5.28 */
1296 mrb_define_method(mrb, a, "slice", mrb_ary_aget, MRB_ARGS_ANY()); /* 15.2.12.5.29 */
1297 mrb_define_method(mrb, a, "unshift", mrb_ary_unshift_m, MRB_ARGS_ANY()); /* 15.2.12.5.30 */
1298 mrb_define_method(mrb, a, "prepend", mrb_ary_unshift_m, MRB_ARGS_ANY());
1299
1300 mrb_define_method(mrb, a, "__ary_eq", mrb_ary_eq, MRB_ARGS_REQ(1));
1301 mrb_define_method(mrb, a, "__ary_cmp", mrb_ary_cmp, MRB_ARGS_REQ(1));
1302 mrb_define_method(mrb, a, "__ary_index", mrb_ary_index_m, MRB_ARGS_REQ(1)); /* kept for mruby-array-ext */
1303 mrb_define_method(mrb, a, "__svalue", mrb_ary_svalue, MRB_ARGS_NONE());
1304 }
1305