/*

** array.c - Array class

**

** See Copyright Notice in mruby.h

*/

#include "mruby.h"

#include "mruby/array.h"

#include "mruby/class.h"

#include "mruby/string.h"

#include "mruby/range.h"

#include "value_array.h"

#define ARY_DEFAULT_LEN 4

#define ARY_SHRINK_RATIO 5 /* must be larger than 2 */

#define ARY_C_MAX_SIZE (SIZE_MAX / sizeof(mrb_value))

#define ARY_MAX_SIZE ((ARY_C_MAX_SIZE < (size_t)MRB_INT_MAX) ? (mrb_int)ARY_C_MAX_SIZE : MRB_INT_MAX-1)

static inline mrb_value

ary_elt(mrb_value ary, mrb_int offset)

{

if (RARRAY_LEN(ary) == 0) return mrb_nil_value();

if (offset < 0 || RARRAY_LEN(ary) <= offset) {

return mrb_nil_value();

}

return RARRAY_PTR(ary)[offset];

}

static struct RArray*

ary_new_capa(mrb_state *mrb, mrb_int capa)

{

struct RArray *a;

mrb_int blen;

if (capa > ARY_MAX_SIZE) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");

}

blen = capa * sizeof(mrb_value);

if (blen < capa) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");

}

a = (struct RArray*)mrb_obj_alloc(mrb, MRB_TT_ARRAY, mrb->array_class);

a->ptr = (mrb_value *)mrb_malloc(mrb, blen);

a->aux.capa = capa;

a->len = 0;

return a;

}

MRB_API mrb_value

mrb_ary_new_capa(mrb_state *mrb, mrb_int capa)

{

struct RArray *a = ary_new_capa(mrb, capa);

return mrb_obj_value(a);

}

MRB_API mrb_value

mrb_ary_new(mrb_state *mrb)

{

return mrb_ary_new_capa(mrb, 0);

}

/*

* to copy array, use this instead of memcpy because of portability

* * gcc on ARM may fail optimization of memcpy

* http://infocenter.arm.com/help/index.jsp?topic=/com.arm.doc.faqs/ka3934.html

* * gcc on MIPS also fail

* http://gcc.gnu.org/bugzilla/show_bug.cgi?id=39755

* * memcpy doesn't exist on freestanding environment

*

* If you optimize for binary size, use memcpy instead of this at your own risk

* of above portability issue.

*

* see also http://togetter.com/li/462898

*

*/

static inline void

array_copy(mrb_value *dst, const mrb_value *src, mrb_int size)

{

mrb_int i;

for (i = 0; i < size; i++) {

dst[i] = src[i];

}

}

MRB_API mrb_value

mrb_ary_new_from_values(mrb_state *mrb, mrb_int size, const mrb_value *vals)

{

mrb_value ary;

struct RArray *a;

ary = mrb_ary_new_capa(mrb, size);

a = mrb_ary_ptr(ary);

array_copy(a->ptr, vals, size);

a->len = size;

return ary;

}

MRB_API mrb_value

mrb_assoc_new(mrb_state *mrb, mrb_value car, mrb_value cdr)

{

struct RArray *a;

a = ary_new_capa(mrb, 2);

a->ptr[0] = car;

a->ptr[1] = cdr;

a->len = 2;

return mrb_obj_value(a);

}

static void

ary_fill_with_nil(mrb_value *ptr, mrb_int size)

{

mrb_value nil = mrb_nil_value();

while (size--) {

*ptr++ = nil;

}

}

static void

ary_modify(mrb_state *mrb, struct RArray *a)

{

if (ARY_SHARED_P(a)) {

mrb_shared_array *shared = a->aux.shared;

if (shared->refcnt == 1 && a->ptr == shared->ptr) {

a->ptr = shared->ptr;

a->aux.capa = a->len;

mrb_free(mrb, shared);

}

else {

mrb_value *ptr, *p;

mrb_int len;

p = a->ptr;

len = a->len * sizeof(mrb_value);

ptr = (mrb_value *)mrb_malloc(mrb, len);

if (p) {

array_copy(ptr, p, a->len);

}

a->ptr = ptr;

a->aux.capa = a->len;

mrb_ary_decref(mrb, shared);

}

ARY_UNSET_SHARED_FLAG(a);

}

}

MRB_API void

mrb_ary_modify(mrb_state *mrb, struct RArray* a)

{

mrb_write_barrier(mrb, (struct RBasic*)a);

ary_modify(mrb, a);

}

static void

ary_make_shared(mrb_state *mrb, struct RArray *a)

{

if (!ARY_SHARED_P(a)) {

mrb_shared_array *shared = (mrb_shared_array *)mrb_malloc(mrb, sizeof(mrb_shared_array));

shared->refcnt = 1;

if (a->aux.capa > a->len) {

a->ptr = shared->ptr = (mrb_value *)mrb_realloc(mrb, a->ptr, sizeof(mrb_value)*a->len+1);

}

else {

shared->ptr = a->ptr;

}

shared->len = a->len;

a->aux.shared = shared;

ARY_SET_SHARED_FLAG(a);

}

}

static void

ary_expand_capa(mrb_state *mrb, struct RArray *a, mrb_int len)

{

mrb_int capa = a->aux.capa;

if (len > ARY_MAX_SIZE) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "array size too big");

}

if (capa == 0) {

capa = ARY_DEFAULT_LEN;

}

while (capa < len) {

capa *= 2;

}

if (capa > ARY_MAX_SIZE) capa = ARY_MAX_SIZE; /* len <= capa <= ARY_MAX_SIZE */

if (capa > a->aux.capa) {

mrb_value *expanded_ptr = (mrb_value *)mrb_realloc(mrb, a->ptr, sizeof(mrb_value)*capa);

a->aux.capa = capa;

a->ptr = expanded_ptr;

}

}

static void

ary_shrink_capa(mrb_state *mrb, struct RArray *a)

{

mrb_int capa = a->aux.capa;

if (capa < ARY_DEFAULT_LEN * 2) return;

if (capa <= a->len * ARY_SHRINK_RATIO) return;

do {

capa /= 2;

if (capa < ARY_DEFAULT_LEN) {

capa = ARY_DEFAULT_LEN;

break;

}

} while (capa > a->len * ARY_SHRINK_RATIO);

if (capa > a->len && capa < a->aux.capa) {

a->aux.capa = capa;

a->ptr = (mrb_value *)mrb_realloc(mrb, a->ptr, sizeof(mrb_value)*capa);

}

}

MRB_API mrb_value

mrb_ary_resize(mrb_state *mrb, mrb_value ary, mrb_int new_len)

{

mrb_int old_len;

struct RArray *a = mrb_ary_ptr(ary);

ary_modify(mrb, a);

old_len = RARRAY_LEN(ary);

if (old_len != new_len) {

a->len = new_len;

if (new_len < old_len) {

ary_shrink_capa(mrb, a);

}

else {

ary_expand_capa(mrb, a, new_len);

ary_fill_with_nil(a->ptr + old_len, new_len - old_len);

}

}

return ary;

}

static mrb_value

mrb_ary_s_create(mrb_state *mrb, mrb_value self)

{

mrb_value *vals;

mrb_int len;

mrb_get_args(mrb, "*", &vals, &len);

return mrb_ary_new_from_values(mrb, len, vals);

}

static void

ary_concat(mrb_state *mrb, struct RArray *a, mrb_value *ptr, mrb_int blen)

{

mrb_int len = a->len + blen;

ary_modify(mrb, a);

if (a->aux.capa < len) ary_expand_capa(mrb, a, len);

array_copy(a->ptr+a->len, ptr, blen);

mrb_write_barrier(mrb, (struct RBasic*)a);

a->len = len;

}

MRB_API void

mrb_ary_concat(mrb_state *mrb, mrb_value self, mrb_value other)

{

struct RArray *a2 = mrb_ary_ptr(other);

ary_concat(mrb, mrb_ary_ptr(self), a2->ptr, a2->len);

}

static mrb_value

mrb_ary_concat_m(mrb_state *mrb, mrb_value self)

{

mrb_value *ptr;

mrb_int blen;

mrb_get_args(mrb, "a", &ptr, &blen);

ary_concat(mrb, mrb_ary_ptr(self), ptr, blen);

return self;

}

static mrb_value

mrb_ary_plus(mrb_state *mrb, mrb_value self)

{

struct RArray *a1 = mrb_ary_ptr(self);

struct RArray *a2;

mrb_value ary;

mrb_value *ptr;

mrb_int blen;

mrb_get_args(mrb, "a", &ptr, &blen);

ary = mrb_ary_new_capa(mrb, a1->len + blen);

a2 = mrb_ary_ptr(ary);

array_copy(a2->ptr, a1->ptr, a1->len);

array_copy(a2->ptr + a1->len, ptr, blen);

a2->len = a1->len + blen;

return ary;

}

static void

ary_replace(mrb_state *mrb, struct RArray *a, mrb_value *argv, mrb_int len)

{

ary_modify(mrb, a);

if (a->aux.capa < len)

ary_expand_capa(mrb, a, len);

array_copy(a->ptr, argv, len);

mrb_write_barrier(mrb, (struct RBasic*)a);

a->len = len;

}

MRB_API void

mrb_ary_replace(mrb_state *mrb, mrb_value self, mrb_value other)

{

struct RArray *a2 = mrb_ary_ptr(other);

ary_replace(mrb, mrb_ary_ptr(self), a2->ptr, a2->len);

}

static mrb_value

mrb_ary_replace_m(mrb_state *mrb, mrb_value self)

{

mrb_value other;

mrb_get_args(mrb, "A", &other);

mrb_ary_replace(mrb, self, other);

return self;

}

static mrb_value

mrb_ary_times(mrb_state *mrb, mrb_value self)

{

struct RArray *a1 = mrb_ary_ptr(self);

struct RArray *a2;

mrb_value ary;

mrb_value *ptr;

mrb_int times;

mrb_get_args(mrb, "i", &times);

if (times < 0) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "negative argument");

}

if (times == 0) return mrb_ary_new(mrb);

ary = mrb_ary_new_capa(mrb, a1->len * times);

a2 = mrb_ary_ptr(ary);

ptr = a2->ptr;

while (times--) {

array_copy(ptr, a1->ptr, a1->len);

ptr += a1->len;

a2->len += a1->len;

}

return ary;

}

static mrb_value

mrb_ary_reverse_bang(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

if (a->len > 1) {

mrb_value *p1, *p2;

ary_modify(mrb, a);

p1 = a->ptr;

p2 = a->ptr + a->len - 1;

while (p1 < p2) {

mrb_value tmp = *p1;

*p1++ = *p2;

*p2-- = tmp;

}

}

return self;

}

static mrb_value

mrb_ary_reverse(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self), *b;

mrb_value ary;

ary = mrb_ary_new_capa(mrb, a->len);

b = mrb_ary_ptr(ary);

if (a->len > 0) {

mrb_value *p1, *p2, *e;

p1 = a->ptr;

e = p1 + a->len;

p2 = b->ptr + a->len - 1;

while (p1 < e) {

*p2-- = *p1++;

}

b->len = a->len;

}

return ary;

}

MRB_API void

mrb_ary_push(mrb_state *mrb, mrb_value ary, mrb_value elem)

{

struct RArray *a = mrb_ary_ptr(ary);

ary_modify(mrb, a);

if (a->len == a->aux.capa)

ary_expand_capa(mrb, a, a->len + 1);

a->ptr[a->len++] = elem;

mrb_field_write_barrier_value(mrb, (struct RBasic*)a, elem);

}

static mrb_value

mrb_ary_push_m(mrb_state *mrb, mrb_value self)

{

mrb_value *argv;

mrb_int len;

mrb_get_args(mrb, "*", &argv, &len);

while (len--) {

mrb_ary_push(mrb, self, *argv++);

}

return self;

}

MRB_API mrb_value

mrb_ary_pop(mrb_state *mrb, mrb_value ary)

{

struct RArray *a = mrb_ary_ptr(ary);

if (a->len == 0) return mrb_nil_value();

return a->ptr[--a->len];

}

#define ARY_SHIFT_SHARED_MIN 10

MRB_API mrb_value

mrb_ary_shift(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_value val;

if (a->len == 0) return mrb_nil_value();

if (ARY_SHARED_P(a)) {

L_SHIFT:

val = a->ptr[0];

a->ptr++;

a->len--;

return val;

}

if (a->len > ARY_SHIFT_SHARED_MIN) {

ary_make_shared(mrb, a);

goto L_SHIFT;

}

else {

mrb_value *ptr = a->ptr;

mrb_int size = a->len;

val = *ptr;

while (--size) {

*ptr = *(ptr+1);

++ptr;

}

--a->len;

}

return val;

}

/* self = [1,2,3]

item = 0

self.unshift item

p self #=> [0, 1, 2, 3] */

MRB_API mrb_value

mrb_ary_unshift(mrb_state *mrb, mrb_value self, mrb_value item)

{

struct RArray *a = mrb_ary_ptr(self);

if (ARY_SHARED_P(a)

&& a->aux.shared->refcnt == 1 /* shared only referenced from this array */

&& a->ptr - a->aux.shared->ptr >= 1) /* there's room for unshifted item */ {

a->ptr--;

a->ptr[0] = item;

}

else {

ary_modify(mrb, a);

if (a->aux.capa < a->len + 1)

ary_expand_capa(mrb, a, a->len + 1);

value_move(a->ptr + 1, a->ptr, a->len);

a->ptr[0] = item;

}

a->len++;

mrb_field_write_barrier_value(mrb, (struct RBasic*)a, item);

return self;

}

static mrb_value

mrb_ary_unshift_m(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_value *vals;

mrb_int len;

mrb_get_args(mrb, "*", &vals, &len);

if (ARY_SHARED_P(a)

&& a->aux.shared->refcnt == 1 /* shared only referenced from this array */

&& a->ptr - a->aux.shared->ptr >= len) /* there's room for unshifted item */ {

a->ptr -= len;

}

else {

ary_modify(mrb, a);

if (len == 0) return self;

if (a->aux.capa < a->len + len)

ary_expand_capa(mrb, a, a->len + len);

value_move(a->ptr + len, a->ptr, a->len);

}

array_copy(a->ptr, vals, len);

a->len += len;

while (len--) {

mrb_field_write_barrier_value(mrb, (struct RBasic*)a, vals[len]);

}

return self;

}

MRB_API mrb_value

mrb_ary_ref(mrb_state *mrb, mrb_value ary, mrb_int n)

{

struct RArray *a = mrb_ary_ptr(ary);

/* range check */

if (n < 0) n += a->len;

if (n < 0 || a->len <= n) return mrb_nil_value();

return a->ptr[n];

}

MRB_API void

mrb_ary_set(mrb_state *mrb, mrb_value ary, mrb_int n, mrb_value val)

{

struct RArray *a = mrb_ary_ptr(ary);

ary_modify(mrb, a);

/* range check */

if (n < 0) {

n += a->len;

if (n < 0) {

mrb_raisef(mrb, E_INDEX_ERROR, "index %S out of array", mrb_fixnum_value(n - a->len));

}

}

if (a->len <= n) {

if (a->aux.capa <= n)

ary_expand_capa(mrb, a, n + 1);

ary_fill_with_nil(a->ptr + a->len, n + 1 - a->len);

a->len = n + 1;

}

a->ptr[n] = val;

mrb_field_write_barrier_value(mrb, (struct RBasic*)a, val);

}

MRB_API mrb_value

mrb_ary_splice(mrb_state *mrb, mrb_value ary, mrb_int head, mrb_int len, mrb_value rpl)

{

struct RArray *a = mrb_ary_ptr(ary);

mrb_int tail, size;

const mrb_value *argv;

mrb_int i, argc;

ary_modify(mrb, a);

/* len check */

if (len < 0) mrb_raisef(mrb, E_INDEX_ERROR, "negative length (%S)", mrb_fixnum_value(len));

/* range check */

if (head < 0) {

head += a->len;

if (head < 0) {

mrb_raise(mrb, E_INDEX_ERROR, "index is out of array");

}

}

if (a->len < len || a->len < head + len) {

len = a->len - head;

}

tail = head + len;

/* size check */

if (mrb_array_p(rpl)) {

argc = RARRAY_LEN(rpl);

argv = RARRAY_PTR(rpl);

}

else {

argc = 1;

argv = &rpl;

}

size = head + argc;

if (tail < a->len) size += a->len - tail;

if (size > a->aux.capa)

ary_expand_capa(mrb, a, size);

if (head > a->len) {

ary_fill_with_nil(a->ptr + a->len, head - a->len);

}

else if (head < a->len) {

value_move(a->ptr + head + argc, a->ptr + tail, a->len - tail);

}

for (i = 0; i < argc; i++) {

*(a->ptr + head + i) = *(argv + i);

mrb_field_write_barrier_value(mrb, (struct RBasic*)a, argv[i]);

}

a->len = size;

return ary;

}

void

mrb_ary_decref(mrb_state *mrb, mrb_shared_array *shared)

{

shared->refcnt--;

if (shared->refcnt == 0) {

mrb_free(mrb, shared->ptr);

mrb_free(mrb, shared);

}

}

static mrb_value

ary_subseq(mrb_state *mrb, struct RArray *a, mrb_int beg, mrb_int len)

{

struct RArray *b;

ary_make_shared(mrb, a);

b = (struct RArray*)mrb_obj_alloc(mrb, MRB_TT_ARRAY, mrb->array_class);

b->ptr = a->ptr + beg;

b->len = len;

b->aux.shared = a->aux.shared;

b->aux.shared->refcnt++;

ARY_SET_SHARED_FLAG(b);

return mrb_obj_value(b);

}

static mrb_int

aget_index(mrb_state *mrb, mrb_value index)

{

if (mrb_fixnum_p(index)) {

return mrb_fixnum(index);

}

else {

mrb_int i;

mrb_get_args(mrb, "i", &i);

return i;

}

}

/*

* call-seq:

* ary[index] -> obj or nil

* ary[start, length] -> new_ary or nil

* ary[range] -> new_ary or nil

* ary.slice(index) -> obj or nil

* ary.slice(start, length) -> new_ary or nil

* ary.slice(range) -> new_ary or nil

*

* Element Reference --- Returns the element at +index+, or returns a

* subarray starting at the +start+ index and continuing for +length+

* elements, or returns a subarray specified by +range+ of indices.

*

* Negative indices count backward from the end of the array (-1 is the last

* element). For +start+ and +range+ cases the starting index is just before

* an element. Additionally, an empty array is returned when the starting

* index for an element range is at the end of the array.

*

* Returns +nil+ if the index (or starting index) are out of range.

*

* a = [ "a", "b", "c", "d", "e" ]

* a[1] => "b"

* a[1,2] => ["b", "c"]

* a[1..-2] => ["b", "c", "d"]

*

*/

static mrb_value

mrb_ary_aget(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_int i, len;

mrb_value index;

if (mrb_get_args(mrb, "o|i", &index, &len) == 1) {

switch (mrb_type(index)) {

/* a[n..m] */

case MRB_TT_RANGE:

if (mrb_range_beg_len(mrb, index, &i, &len, a->len)) {

return ary_subseq(mrb, a, i, len);

}

else {

return mrb_nil_value();

}

case MRB_TT_FIXNUM:

return mrb_ary_ref(mrb, self, mrb_fixnum(index));

default:

return mrb_ary_ref(mrb, self, aget_index(mrb, index));

}

}

i = aget_index(mrb, index);

if (i < 0) i += a->len;

if (i < 0 || a->len < i) return mrb_nil_value();

if (len < 0) return mrb_nil_value();

if (a->len == i) return mrb_ary_new(mrb);

if (len > a->len - i) len = a->len - i;

return ary_subseq(mrb, a, i, len);

}

/*

* call-seq:

* ary[index] = obj -> obj

* ary[start, length] = obj or other_ary or nil -> obj or other_ary or nil

* ary[range] = obj or other_ary or nil -> obj or other_ary or nil

*

* Element Assignment --- Sets the element at +index+, or replaces a subarray

* from the +start+ index for +length+ elements, or replaces a subarray

* specified by the +range+ of indices.

*

* If indices are greater than the current capacity of the array, the array

* grows automatically. Elements are inserted into the array at +start+ if

* +length+ is zero.

*

* Negative indices will count backward from the end of the array. For

* +start+ and +range+ cases the starting index is just before an element.

*

* An IndexError is raised if a negative index points past the beginning of

* the array.

*

* See also Array#push, and Array#unshift.

*

* a = Array.new

* a[4] = "4"; #=> [nil, nil, nil, nil, "4"]

* a[0, 3] = [ 'a', 'b', 'c' ] #=> ["a", "b", "c", nil, "4"]

* a[1..2] = [ 1, 2 ] #=> ["a", 1, 2, nil, "4"]

* a[0, 2] = "?" #=> ["?", 2, nil, "4"]

* a[0..2] = "A" #=> ["A", "4"]

* a[-1] = "Z" #=> ["A", "Z"]

* a[1..-1] = nil #=> ["A", nil]

* a[1..-1] = [] #=> ["A"]

* a[0, 0] = [ 1, 2 ] #=> [1, 2, "A"]

* a[3, 0] = "B" #=> [1, 2, "A", "B"]

*/

static mrb_value

mrb_ary_aset(mrb_state *mrb, mrb_value self)

{

mrb_value v1, v2, v3;

mrb_int i, len;

if (mrb_get_args(mrb, "oo|o", &v1, &v2, &v3) == 2) {

switch (mrb_type(v1)) {

/* a[n..m] = v */

case MRB_TT_RANGE:

if (mrb_range_beg_len(mrb, v1, &i, &len, RARRAY_LEN(self))) {

mrb_ary_splice(mrb, self, i, len, v2);

}

break;

/* a[n] = v */

case MRB_TT_FIXNUM:

mrb_ary_set(mrb, self, mrb_fixnum(v1), v2);

break;

default:

mrb_ary_set(mrb, self, aget_index(mrb, v1), v2);

break;

}

return v2;

}

/* a[n,m] = v */

mrb_ary_splice(mrb, self, aget_index(mrb, v1), aget_index(mrb, v2), v3);

return v3;

}

static mrb_value

mrb_ary_delete_at(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_int index;

mrb_value val;

mrb_value *ptr;

mrb_int len;

mrb_get_args(mrb, "i", &index);

if (index < 0) index += a->len;

if (index < 0 || a->len <= index) return mrb_nil_value();

ary_modify(mrb, a);

val = a->ptr[index];

ptr = a->ptr + index;

len = a->len - index;

while (--len) {

*ptr = *(ptr+1);

++ptr;

}

--a->len;

ary_shrink_capa(mrb, a);

return val;

}

static mrb_value

mrb_ary_first(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_int size;

if (mrb_get_args(mrb, "|i", &size) == 0) {

return (a->len > 0)? a->ptr[0]: mrb_nil_value();

}

if (size < 0) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "negative array size");

}

if (size > a->len) size = a->len;

if (ARY_SHARED_P(a)) {

return ary_subseq(mrb, a, 0, size);

}

return mrb_ary_new_from_values(mrb, size, a->ptr);

}

static mrb_value

mrb_ary_last(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

mrb_int size;

if (mrb_get_args(mrb, "|i", &size) == 0)

return (a->len > 0)? a->ptr[a->len - 1]: mrb_nil_value();

if (size < 0) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "negative array size");

}

if (size > a->len) size = a->len;

if (ARY_SHARED_P(a) || size > ARY_DEFAULT_LEN) {

return ary_subseq(mrb, a, a->len - size, size);

}

return mrb_ary_new_from_values(mrb, size, a->ptr + a->len - size);

}

static mrb_value

mrb_ary_index_m(mrb_state *mrb, mrb_value self)

{

mrb_value obj;

mrb_int i;

mrb_get_args(mrb, "o", &obj);

for (i = 0; i < RARRAY_LEN(self); i++) {

if (mrb_equal(mrb, RARRAY_PTR(self)[i], obj)) {

return mrb_fixnum_value(i);

}

}

return mrb_nil_value();

}

static mrb_value

mrb_ary_rindex_m(mrb_state *mrb, mrb_value self)

{

mrb_value obj;

mrb_int i;

mrb_get_args(mrb, "o", &obj);

for (i = RARRAY_LEN(self) - 1; i >= 0; i--) {

if (mrb_equal(mrb, RARRAY_PTR(self)[i], obj)) {

return mrb_fixnum_value(i);

}

}

return mrb_nil_value();

}

MRB_API mrb_value

mrb_ary_splat(mrb_state *mrb, mrb_value v)

{

if (mrb_array_p(v)) {

return v;

}

if (mrb_respond_to(mrb, v, mrb_intern_lit(mrb, "to_a"))) {

return mrb_funcall(mrb, v, "to_a", 0);

}

else {

return mrb_ary_new_from_values(mrb, 1, &v);

}

}

static mrb_value

mrb_ary_size(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

return mrb_fixnum_value(a->len);

}

MRB_API mrb_value

mrb_ary_clear(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

if (ARY_SHARED_P(a)) {

mrb_ary_decref(mrb, a->aux.shared);

ARY_UNSET_SHARED_FLAG(a);

}

else {

mrb_free(mrb, a->ptr);

}

a->len = 0;

a->aux.capa = 0;

a->ptr = 0;

return self;

}

static mrb_value

mrb_ary_empty_p(mrb_state *mrb, mrb_value self)

{

struct RArray *a = mrb_ary_ptr(self);

return mrb_bool_value(a->len == 0);

}

MRB_API mrb_value

mrb_check_array_type(mrb_state *mrb, mrb_value ary)

{

return mrb_check_convert_type(mrb, ary, MRB_TT_ARRAY, "Array", "to_ary");

}

MRB_API mrb_value

mrb_ary_entry(mrb_value ary, mrb_int offset)

{

if (offset < 0) {

offset += RARRAY_LEN(ary);

}

return ary_elt(ary, offset);

}

static mrb_value

join_ary(mrb_state *mrb, mrb_value ary, mrb_value sep, mrb_value list)

{

mrb_int i;

mrb_value result, val, tmp;

/* check recursive */

for (i=0; i<RARRAY_LEN(list); i++) {

if (mrb_obj_equal(mrb, ary, RARRAY_PTR(list)[i])) {

mrb_raise(mrb, E_ARGUMENT_ERROR, "recursive array join");

}

}

mrb_ary_push(mrb, list, ary);

result = mrb_str_buf_new(mrb, 64);

for (i=0; i<RARRAY_LEN(ary); i++) {

if (i > 0 && !mrb_nil_p(sep)) {

mrb_str_cat_str(mrb, result, sep);

}

val = RARRAY_PTR(ary)[i];

switch (mrb_type(val)) {

case MRB_TT_ARRAY:

ary_join:

val = join_ary(mrb, val, sep, list);

/* fall through */

case MRB_TT_STRING:

str_join:

mrb_str_cat_str(mrb, result, val);

break;

default:

tmp = mrb_check_string_type(mrb, val);

if (!mrb_nil_p(tmp)) {

val = tmp;

goto str_join;

}

tmp = mrb_check_convert_type(mrb, val, MRB_TT_ARRAY, "Array", "to_ary");

if (!mrb_nil_p(tmp)) {

val = tmp;

goto ary_join;