lua/ltablib.c

336 lines
8.8 KiB
C
Raw Normal View History

/*
** $Id: ltablib.c,v 1.54 2010/01/13 19:59:10 roberto Exp roberto $
** Library for Table Manipulation
** See Copyright Notice in lua.h
*/
#include <stddef.h>
2002-12-04 20:38:31 +03:00
#define ltablib_c
#define LUA_LIB
2002-12-04 20:38:31 +03:00
#include "lua.h"
#include "lauxlib.h"
#include "lualib.h"
#define aux_getn(L,n) (luaL_checktype(L, n, LUA_TTABLE), lua_rawlen(L, n))
2002-07-01 23:25:28 +04:00
2004-12-07 21:31:16 +03:00
static int foreachi (lua_State *L) {
2002-07-01 23:25:28 +04:00
int n = aux_getn(L, 1);
2009-03-23 17:26:12 +03:00
int i;
if (lua_getctx(L, &i) == LUA_YIELD) goto poscall;
2002-11-14 18:41:38 +03:00
luaL_checktype(L, 2, LUA_TFUNCTION);
2009-03-23 17:26:12 +03:00
for (i = 1; i <= n; i++) {
lua_pushvalue(L, 2); /* function */
lua_pushinteger(L, i); /* 1st argument */
lua_rawgeti(L, 1, i); /* 2nd argument */
2009-03-23 17:26:12 +03:00
lua_callk(L, 2, 1, i, foreachi);
poscall:
if (!lua_isnil(L, -1))
return 1;
lua_pop(L, 1); /* remove nil result */
}
return 0;
}
static int foreachcont (lua_State *L) {
for (;;) {
if (!lua_isnil(L, -1))
return 1;
lua_pop(L, 2); /* remove value and result */
if (lua_next(L, 1) == 0) /* no more elements? */
return 0;
lua_pushvalue(L, 2); /* function */
lua_pushvalue(L, -3); /* key */
lua_pushvalue(L, -3); /* value */
2009-03-23 17:26:12 +03:00
lua_callk(L, 2, 1, 0, foreachcont);
}
}
static int foreach (lua_State *L) {
luaL_checktype(L, 1, LUA_TTABLE);
luaL_checktype(L, 2, LUA_TFUNCTION);
lua_pushnil(L); /* first key */
lua_pushnil(L); /* first value */
lua_pushnil(L); /* first "return" */
return foreachcont(L);
2005-09-20 21:56:47 +04:00
}
2009-11-26 20:35:13 +03:00
#if defined(LUA_COMPAT_MAXN)
2005-09-20 21:56:47 +04:00
static int maxn (lua_State *L) {
lua_Number max = 0;
luaL_checktype(L, 1, LUA_TTABLE);
lua_pushnil(L); /* first key */
while (lua_next(L, 1)) {
lua_pop(L, 1); /* remove value */
if (lua_type(L, -1) == LUA_TNUMBER) {
lua_Number v = lua_tonumber(L, -1);
if (v > max) max = v;
}
}
lua_pushnumber(L, max);
return 1;
}
2009-11-26 20:35:13 +03:00
#else
static int maxn (lua_State *L) {
return luaL_error(L, "function 'maxn' is deprecated");
}
#endif
2004-12-07 21:31:16 +03:00
static int getn (lua_State *L) {
lua_pushinteger(L, aux_getn(L, 1));
2002-07-01 23:25:28 +04:00
return 1;
}
2004-12-07 21:31:16 +03:00
static int tinsert (lua_State *L) {
2005-03-28 21:17:53 +04:00
int e = aux_getn(L, 1) + 1; /* first empty element */
2002-07-01 23:25:28 +04:00
int pos; /* where to insert new element */
switch (lua_gettop(L)) {
case 2: { /* called with only 2 arguments */
pos = e; /* insert new element at the end */
break;
}
case 3: {
int i;
pos = luaL_checkint(L, 2); /* 2nd argument is the position */
if (pos > e) e = pos; /* `grow' array if necessary */
for (i = e; i > pos; i--) { /* move up elements */
lua_rawgeti(L, 1, i-1);
lua_rawseti(L, 1, i); /* t[i] = t[i-1] */
}
break;
}
default: {
return luaL_error(L, "wrong number of arguments to " LUA_QL("insert"));
2005-03-16 19:58:41 +03:00
}
}
lua_rawseti(L, 1, pos); /* t[pos] = v */
return 0;
}
2004-12-07 21:31:16 +03:00
static int tremove (lua_State *L) {
2005-03-28 21:17:53 +04:00
int e = aux_getn(L, 1);
int pos = luaL_optint(L, 2, e);
if (!(1 <= pos && pos <= e)) /* position is outside bounds? */
return 0; /* nothing to remove */
lua_rawgeti(L, 1, pos); /* result = t[pos] */
for ( ;pos<e; pos++) {
lua_rawgeti(L, 1, pos+1);
2002-07-01 23:25:28 +04:00
lua_rawseti(L, 1, pos); /* t[pos] = t[pos+1] */
}
lua_pushnil(L);
lua_rawseti(L, 1, e); /* t[e] = nil */
return 1;
}
static void addfield (lua_State *L, luaL_Buffer *b, int i) {
lua_rawgeti(L, 1, i);
if (!lua_isstring(L, -1))
luaL_error(L, "invalid value (%s) at index %d in table for "
LUA_QL("concat"), luaL_typename(L, -1), i);
luaL_addvalue(b);
}
2005-07-11 22:48:02 +04:00
static int tconcat (lua_State *L) {
2002-07-01 23:25:28 +04:00
luaL_Buffer b;
size_t lsep;
int i, last;
2002-11-14 18:41:38 +03:00
const char *sep = luaL_optlstring(L, 2, "", &lsep);
luaL_checktype(L, 1, LUA_TTABLE);
i = luaL_optint(L, 3, 1);
last = luaL_opt(L, luaL_checkint, 4, (int)lua_rawlen(L, 1));
2002-07-01 23:25:28 +04:00
luaL_buffinit(L, &b);
for (; i < last; i++) {
addfield(L, &b, i);
luaL_addlstring(&b, sep, lsep);
2002-07-01 23:25:28 +04:00
}
if (i == last) /* add last value (if interval was not empty) */
addfield(L, &b, i);
2002-07-01 23:25:28 +04:00
luaL_pushresult(&b);
return 1;
}
2009-12-07 18:50:27 +03:00
/*
** {======================================================
** Pack/unpack
2009-12-07 18:50:27 +03:00
** =======================================================
*/
static int pack (lua_State *L) {
int top = lua_gettop(L);
lua_createtable(L, top, 1); /* create result table */
lua_pushinteger(L, top); /* number of elements */
lua_setfield(L, -2, "n"); /* t.n = number of elements */
if (top > 0) { /* at least one element? */
lua_pushvalue(L, 1);
lua_rawseti(L, -2, 1); /* insert first element */
lua_replace(L, 1); /* move table into its position (index 1) */
for (; top >= 2; top--) /* assign other elements */
lua_rawseti(L, 1, top);
}
2009-12-07 18:50:27 +03:00
return 1;
}
static int unpack (lua_State *L) {
int i, e, n;
luaL_checktype(L, 1, LUA_TTABLE);
i = luaL_optint(L, 2, 1);
e = luaL_opt(L, luaL_checkint, 3, (int)lua_rawlen(L, 1));
if (i > e) return 0; /* empty range */
n = e - i + 1; /* number of elements */
if (n <= 0 || !lua_checkstack(L, n)) /* n <= 0 means arith. overflow */
return luaL_error(L, "too many results to unpack");
lua_rawgeti(L, 1, i); /* push arg[i] (avoiding overflow problems) */
while (i++ < e) /* push arg[i + 1...e] */
lua_rawgeti(L, 1, i);
return n;
}
2009-12-07 18:50:27 +03:00
/* }====================================================== */
/*
** {======================================================
** Quicksort
** (based on `Algorithms in MODULA-3', Robert Sedgewick;
** Addison-Wesley, 1993.)
2009-12-07 18:50:27 +03:00
** =======================================================
*/
static void set2 (lua_State *L, int i, int j) {
lua_rawseti(L, 1, i);
lua_rawseti(L, 1, j);
}
static int sort_comp (lua_State *L, int a, int b) {
2002-07-01 23:25:28 +04:00
if (!lua_isnil(L, 2)) { /* function? */
int res;
lua_pushvalue(L, 2);
lua_pushvalue(L, a-1); /* -1 to compensate function */
lua_pushvalue(L, b-2); /* -2 to compensate function and `a' */
2002-06-25 23:18:49 +04:00
lua_call(L, 2, 1);
res = lua_toboolean(L, -1);
lua_pop(L, 1);
return res;
}
else /* a < b? */
return lua_compare(L, a, b, LUA_OPLT);
}
static void auxsort (lua_State *L, int l, int u) {
while (l < u) { /* for tail recursion */
int i, j;
/* sort elements a[l], a[(l+u)/2] and a[u] */
lua_rawgeti(L, 1, l);
lua_rawgeti(L, 1, u);
if (sort_comp(L, -1, -2)) /* a[u] < a[l]? */
set2(L, l, u); /* swap a[l] - a[u] */
else
lua_pop(L, 2);
if (u-l == 1) break; /* only 2 elements */
i = (l+u)/2;
lua_rawgeti(L, 1, i);
lua_rawgeti(L, 1, l);
if (sort_comp(L, -2, -1)) /* a[i]<a[l]? */
set2(L, i, l);
else {
lua_pop(L, 1); /* remove a[l] */
lua_rawgeti(L, 1, u);
if (sort_comp(L, -1, -2)) /* a[u]<a[i]? */
set2(L, i, u);
else
lua_pop(L, 2);
}
if (u-l == 2) break; /* only 3 elements */
lua_rawgeti(L, 1, i); /* Pivot */
lua_pushvalue(L, -1);
lua_rawgeti(L, 1, u-1);
set2(L, i, u-1);
/* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */
i = l; j = u-1;
for (;;) { /* invariant: a[l..i] <= P <= a[j..u] */
/* repeat ++i until a[i] >= P */
while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {
if (i>=u) luaL_error(L, "invalid order function for sorting");
lua_pop(L, 1); /* remove a[i] */
}
/* repeat --j until a[j] <= P */
while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {
if (j<=l) luaL_error(L, "invalid order function for sorting");
lua_pop(L, 1); /* remove a[j] */
}
if (j<i) {
lua_pop(L, 3); /* pop pivot, a[i], a[j] */
break;
}
set2(L, i, j);
}
lua_rawgeti(L, 1, u-1);
lua_rawgeti(L, 1, i);
set2(L, u-1, i); /* swap pivot (a[u-1]) with a[i] */
/* a[l..i-1] <= a[i] == P <= a[i+1..u] */
/* adjust so that smaller half is in [j..i] and larger one in [l..u] */
if (i-l < u-i) {
j=l; i=i-1; l=i+2;
}
else {
j=i+1; i=u; u=j-2;
}
auxsort(L, j, i); /* call recursively the smaller one */
} /* repeat the routine for the larger one */
}
2004-12-07 21:31:16 +03:00
static int sort (lua_State *L) {
2002-07-01 23:25:28 +04:00
int n = aux_getn(L, 1);
2002-11-14 18:41:38 +03:00
luaL_checkstack(L, 40, ""); /* assume array is smaller than 2^40 */
2002-06-05 20:59:21 +04:00
if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */
2002-11-14 18:41:38 +03:00
luaL_checktype(L, 2, LUA_TFUNCTION);
lua_settop(L, 2); /* make sure there is two arguments */
2005-03-28 21:17:53 +04:00
auxsort(L, 1, n);
return 0;
}
/* }====================================================== */
2005-08-26 21:36:32 +04:00
static const luaL_Reg tab_funcs[] = {
2005-07-11 22:48:02 +04:00
{"concat", tconcat},
2004-12-07 21:31:16 +03:00
{"foreach", foreach},
{"foreachi", foreachi},
{"getn", getn},
2005-09-20 21:56:47 +04:00
{"maxn", maxn},
2004-12-07 21:31:16 +03:00
{"insert", tinsert},
2009-12-07 18:50:27 +03:00
{"pack", pack},
{"unpack", unpack},
2004-12-07 21:31:16 +03:00
{"remove", tremove},
{"sort", sort},
{NULL, NULL}
};
LUAMOD_API int luaopen_table (lua_State *L) {
luaL_register(L, LUA_TABLIBNAME, tab_funcs);
#if defined(LUA_COMPAT_UNPACK)
/* _G.unpack = table.unpack */
lua_getfield(L, -1, "unpack");
lua_setglobal(L, "unpack");
#endif
2002-12-20 13:26:33 +03:00
return 1;
}