ref: b749e23cb4ff42e06d9e1e75196745be4ca40a59
dir: /jsarray.c/
#include "jsi.h"
#include "jsvalue.h"
#include "jsbuiltin.h"
static unsigned int js_getlength(js_State *J, int idx)
{
unsigned int len;
js_getproperty(J, idx, "length");
len = js_touint32(J, -1);
js_pop(J, 1);
return len;
}
static void js_setlength(js_State *J, int idx, unsigned int len)
{
js_pushnumber(J, len);
js_setproperty(J, idx, "length");
}
int js_hasindex(js_State *J, int idx, unsigned int i)
{
char buf[32];
sprintf(buf, "%u", i);
return js_hasproperty(J, idx, buf);
}
void js_getindex(js_State *J, int idx, unsigned int i)
{
char buf[32];
sprintf(buf, "%u", i);
js_getproperty(J, idx, buf);
}
void js_setindex(js_State *J, int idx, unsigned int i)
{
char buf[32];
sprintf(buf, "%u", i);
js_setproperty(J, idx, buf);
}
void js_delindex(js_State *J, int idx, unsigned int i)
{
char buf[32];
sprintf(buf, "%u", i);
js_delproperty(J, idx, buf);
}
static int jsB_new_Array(js_State *J, int argc)
{
int i;
js_newarray(J);
if (argc == 1) {
if (js_isnumber(J, 1)) {
js_copy(J, 1);
js_setproperty(J, -2, "length");
} else {
js_copy(J, 1);
js_setindex(J, -2, 0);
}
} else {
for (i = 1; i <= argc; ++i) {
js_copy(J, i);
js_setindex(J, -2, i - 1);
}
}
return 1;
}
static int Ap_concat(js_State *J, int argc)
{
unsigned int n, len, i;
js_newarray(J);
n = 0;
for (i = 0; i <= argc; ++i) {
js_copy(J, i);
if (js_isarray(J, -1)) {
unsigned int k = 0;
len = js_getlength(J, -1);
while (k < len) {
if (js_hasindex(J, -1, k))
js_setindex(J, -3, n);
++k;
++n;
}
js_pop(J, 1);
} else {
js_setindex(J, -2, n);
++n;
}
}
return 1;
}
static int Ap_join(js_State *J, int argc)
{
char * volatile out = NULL;
const char *sep = ",";
const char *r;
unsigned int seplen = 1;
unsigned int k, n, len;
len = js_getlength(J, 0);
if (argc == 1 && !js_isundefined(J, 1)) {
sep = js_tostring(J, 1);
seplen = strlen(sep);
}
if (len == 0) {
js_pushliteral(J, "");
return 1;
}
if (js_try(J)) {
free(out);
js_throw(J);
}
n = 1;
for (k = 0; k < len; ++k) {
js_getindex(J, 0, k);
if (js_isundefined(J, -1) || js_isnull(J, -1))
r = "";
else
r = js_tostring(J, -1);
n += strlen(r);
if (k == 0) {
out = malloc(n);
strcpy(out, r);
} else {
n += seplen;
out = realloc(out, n);
strcat(out, sep);
strcat(out, r);
}
js_pop(J, 1);
}
js_pushstring(J, out);
js_endtry(J);
free(out);
return 1;
}
static int Ap_pop(js_State *J, int argc)
{
unsigned int n;
n = js_getlength(J, 0);
if (n > 0) {
js_getindex(J, 0, n - 1);
js_delindex(J, 0, n - 1);
js_setlength(J, 0, n - 1);
} else {
js_setlength(J, 0, 0);
js_pushundefined(J);
}
return 1;
}
static int Ap_push(js_State *J, int argc)
{
unsigned int n;
int i;
n = js_getlength(J, 0);
for (i = 1; i <= argc; ++i, ++n) {
js_copy(J, i);
js_setindex(J, 0, n);
}
js_setlength(J, 0, n);
js_pushnumber(J, n);
return 1;
}
static int Ap_reverse(js_State *J, int argc)
{
unsigned int len, middle, lower;
len = js_getlength(J, 0);
middle = len / 2;
lower = 0;
while (lower != middle) {
unsigned int upper = len - lower - 1;
int haslower = js_hasindex(J, 0, lower);
int hasupper = js_hasindex(J, 0, upper);
if (haslower && hasupper) {
js_setindex(J, 0, lower);
js_setindex(J, 0, upper);
} else if (hasupper) {
js_setindex(J, 0, lower);
js_delindex(J, 0, upper);
} else if (haslower) {
js_setindex(J, 0, upper);
js_delindex(J, 0, lower);
}
++lower;
}
js_copy(J, 0);
return 1;
}
static int Ap_shift(js_State *J, int argc)
{
unsigned int k, len;
len = js_getlength(J, 0);
if (len == 0) {
js_setlength(J, 0, 0);
js_pushundefined(J);
return 1;
}
js_getindex(J, 0, 0);
for (k = 1; k < len; ++k) {
if (js_hasindex(J, 0, k))
js_setindex(J, 0, k - 1);
else
js_delindex(J, 0, k - 1);
}
js_delindex(J, 0, len - 1);
js_setlength(J, 0, len - 1);
return 1;
}
static int Ap_slice(js_State *J, int argc)
{
unsigned int len;
int s, e, n;
js_newarray(J);
len = js_getlength(J, 0);
s = js_tointeger(J, 1);
e = argc > 1 ? js_tointeger(J, 2) : len;
if (s < 0) s = s + len;
if (e < 0) e = e + len;
s = s < 0 ? 0 : s > len ? len : s;
e = e < 0 ? 0 : e > len ? len : e;
for (n = 0; s < e; ++s, ++n)
if (js_hasindex(J, 0, s))
js_setindex(J, -2, n);
return 1;
}
static int compare(js_State *J, unsigned int x, unsigned int y, int *hasx, int *hasy, int hasfn)
{
const char *sx, *sy;
int c;
*hasx = js_hasindex(J, 0, x);
*hasy = js_hasindex(J, 0, y);
if (*hasx && *hasy) {
int unx = js_isundefined(J, -2);
int uny = js_isundefined(J, -1);
if (unx && uny) return 0;
if (unx) return 1;
if (uny) return -1;
if (hasfn) {
js_copy(J, 1); /* copy function */
js_pushglobal(J); /* set this object */
js_copy(J, -4); /* copy x */
js_copy(J, -4); /* copy y */
js_call(J, 2);
c = js_tonumber(J, -1);
js_pop(J, 1);
return c;
}
sx = js_tostring(J, -2);
sy = js_tostring(J, -1);
return strcmp(sx, sy);
}
if (*hasx) return -1;
if (*hasy) return 1;
return 0;
}
static int Ap_sort(js_State *J, int argc)
{
unsigned int len, i, k;
int hasx, hasy, hasfn;
len = js_getlength(J, 0);
hasfn = js_iscallable(J, 1);
for (i = 1; i < len; ++i) {
k = i;
while (k > 0 && compare(J, k - 1, k, &hasx, &hasy, hasfn) > 0) {
if (hasx && hasy) {
js_setindex(J, 0, k - 1);
js_setindex(J, 0, k);
} else if (hasx) {
js_delindex(J, 0, k - 1);
js_setindex(J, 0, k);
} else if (hasy) {
js_setindex(J, 0, k - 1);
js_delindex(J, 0, k);
}
--k;
}
}
js_copy(J, 0);
return 1;
}
static int Ap_splice(js_State *J, int argc)
{
unsigned int len;
int start, del, add, k;
js_newarray(J);
len = js_getlength(J, 0);
start = js_tointeger(J, 1);
if (start < 0) start = start + len;
start = start < 0 ? 0 : start > len ? len : start;
del = js_tointeger(J, 2);
del = del < 0 ? 0 : del > len - start ? len - start : del;
/* copy deleted items to return array */
for (k = 0; k < del; ++k)
if (js_hasindex(J, 0, start + k))
js_setindex(J, -2, k);
/* shift the tail to resize the hole left by deleted items */
add = argc - 2;
if (add < del) {
for (k = start; k < len - del; ++k) {
if (js_hasindex(J, 0, k + del))
js_setindex(J, 0, k + add);
else
js_delindex(J, 0, k + del);
}
for (k = len; k > len - del + add; --k)
js_delindex(J, 0, k - 1);
} else if (add > del) {
for (k = len - del; k > start; --k) {
if (js_hasindex(J, 0, k + del - 1))
js_setindex(J, 0, k + add - 1);
else
js_delindex(J, 0, k + add - 1);
}
}
/* copy new items into the hole */
for (k = 0; k < add; ++k) {
js_copy(J, 3 + k);
js_setindex(J, 0, start + k);
}
js_setlength(J, 0, len - del + add);
return 1;
}
static int Ap_unshift(js_State *J, int argc)
{
unsigned int k, len;
int i;
len = js_getlength(J, 0);
for (k = len; k > 0; --k) {
int from = k - 1;
int to = k + argc - 1;
if (js_hasindex(J, 0, from))
js_setindex(J, 0, to);
else
js_delindex(J, 0, to);
}
for (i = 1; i <= argc; ++i) {
js_copy(J, i);
js_setindex(J, 0, i - 1);
}
js_setlength(J, 0, len + argc);
js_pushnumber(J, len + argc);
return 1;
}
static int Ap_toString(js_State *J, int argc)
{
js_pop(J, argc);
return Ap_join(J, 0);
}
static int A_isArray(js_State *J, int argc)
{
if (js_isobject(J, 1)) {
js_Object *T = js_toobject(J, 1);
js_pushboolean(J, T->type == JS_CARRAY);
return 1;
}
js_pushboolean(J, 0);
return 1;
}
void jsB_initarray(js_State *J)
{
js_pushobject(J, J->Array_prototype);
{
jsB_propf(J, "toString", Ap_toString, 0);
jsB_propf(J, "concat", Ap_concat, 1);
jsB_propf(J, "join", Ap_join, 1);
jsB_propf(J, "pop", Ap_pop, 0);
jsB_propf(J, "push", Ap_push, 1);
jsB_propf(J, "reverse", Ap_reverse, 0);
jsB_propf(J, "shift", Ap_shift, 0);
jsB_propf(J, "slice", Ap_slice, 0);
jsB_propf(J, "sort", Ap_sort, 1);
jsB_propf(J, "splice", Ap_splice, 0);
jsB_propf(J, "unshift", Ap_unshift, 0);
}
js_newcconstructor(J, jsB_new_Array, jsB_new_Array, 1);
{
/* ES5 */
jsB_propf(J, "isArray", A_isArray, 1);
}
js_defglobal(J, "Array", JS_DONTENUM);
}