+++ /dev/null
-/*\r
-** $Id: ltablib.c,v 1.65.1.1 2013/04/12 18:48:47 roberto Exp $\r
-** Library for Table Manipulation\r
-** See Copyright Notice in lua.h\r
-*/\r
-\r
-\r
-#include <stddef.h>\r
-\r
-#define ltablib_c\r
-#define LUA_LIB\r
-\r
-#include "lua.h"\r
-\r
-#include "lauxlib.h"\r
-#include "lualib.h"\r
-\r
-\r
-#define aux_getn(L,n) (luaL_checktype(L, n, LUA_TTABLE), luaL_len(L, n))\r
-\r
-\r
-\r
-#if defined(LUA_COMPAT_MAXN)\r
-static int maxn (lua_State *L) {\r
- lua_Number max = 0;\r
- luaL_checktype(L, 1, LUA_TTABLE);\r
- lua_pushnil(L); /* first key */\r
- while (lua_next(L, 1)) {\r
- lua_pop(L, 1); /* remove value */\r
- if (lua_type(L, -1) == LUA_TNUMBER) {\r
- lua_Number v = lua_tonumber(L, -1);\r
- if (v > max) max = v;\r
- }\r
- }\r
- lua_pushnumber(L, max);\r
- return 1;\r
-}\r
-#endif\r
-\r
-\r
-static int tinsert (lua_State *L) {\r
- int e = aux_getn(L, 1) + 1; /* first empty element */\r
- int pos; /* where to insert new element */\r
- switch (lua_gettop(L)) {\r
- case 2: { /* called with only 2 arguments */\r
- pos = e; /* insert new element at the end */\r
- break;\r
- }\r
- case 3: {\r
- int i;\r
- pos = luaL_checkint(L, 2); /* 2nd argument is the position */\r
- luaL_argcheck(L, 1 <= pos && pos <= e, 2, "position out of bounds");\r
- for (i = e; i > pos; i--) { /* move up elements */\r
- lua_rawgeti(L, 1, i-1);\r
- lua_rawseti(L, 1, i); /* t[i] = t[i-1] */\r
- }\r
- break;\r
- }\r
- default: {\r
- return luaL_error(L, "wrong number of arguments to " LUA_QL("insert"));\r
- }\r
- }\r
- lua_rawseti(L, 1, pos); /* t[pos] = v */\r
- return 0;\r
-}\r
-\r
-\r
-static int tremove (lua_State *L) {\r
- int size = aux_getn(L, 1);\r
- int pos = luaL_optint(L, 2, size);\r
- if (pos != size) /* validate 'pos' if given */\r
- luaL_argcheck(L, 1 <= pos && pos <= size + 1, 1, "position out of bounds");\r
- lua_rawgeti(L, 1, pos); /* result = t[pos] */\r
- for ( ; pos < size; pos++) {\r
- lua_rawgeti(L, 1, pos+1);\r
- lua_rawseti(L, 1, pos); /* t[pos] = t[pos+1] */\r
- }\r
- lua_pushnil(L);\r
- lua_rawseti(L, 1, pos); /* t[pos] = nil */\r
- return 1;\r
-}\r
-\r
-\r
-static void addfield (lua_State *L, luaL_Buffer *b, int i) {\r
- lua_rawgeti(L, 1, i);\r
- if (!lua_isstring(L, -1))\r
- luaL_error(L, "invalid value (%s) at index %d in table for "\r
- LUA_QL("concat"), luaL_typename(L, -1), i);\r
- luaL_addvalue(b);\r
-}\r
-\r
-\r
-static int tconcat (lua_State *L) {\r
- luaL_Buffer b;\r
- size_t lsep;\r
- int i, last;\r
- const char *sep = luaL_optlstring(L, 2, "", &lsep);\r
- luaL_checktype(L, 1, LUA_TTABLE);\r
- i = luaL_optint(L, 3, 1);\r
- last = luaL_opt(L, luaL_checkint, 4, luaL_len(L, 1));\r
- luaL_buffinit(L, &b);\r
- for (; i < last; i++) {\r
- addfield(L, &b, i);\r
- luaL_addlstring(&b, sep, lsep);\r
- }\r
- if (i == last) /* add last value (if interval was not empty) */\r
- addfield(L, &b, i);\r
- luaL_pushresult(&b);\r
- return 1;\r
-}\r
-\r
-\r
-/*\r
-** {======================================================\r
-** Pack/unpack\r
-** =======================================================\r
-*/\r
-\r
-static int pack (lua_State *L) {\r
- int n = lua_gettop(L); /* number of elements to pack */\r
- lua_createtable(L, n, 1); /* create result table */\r
- lua_pushinteger(L, n);\r
- lua_setfield(L, -2, "n"); /* t.n = number of elements */\r
- if (n > 0) { /* at least one element? */\r
- int i;\r
- lua_pushvalue(L, 1);\r
- lua_rawseti(L, -2, 1); /* insert first element */\r
- lua_replace(L, 1); /* move table into index 1 */\r
- for (i = n; i >= 2; i--) /* assign other elements */\r
- lua_rawseti(L, 1, i);\r
- }\r
- return 1; /* return table */\r
-}\r
-\r
-\r
-static int unpack (lua_State *L) {\r
- int i, e, n;\r
- luaL_checktype(L, 1, LUA_TTABLE);\r
- i = luaL_optint(L, 2, 1);\r
- e = luaL_opt(L, luaL_checkint, 3, luaL_len(L, 1));\r
- if (i > e) return 0; /* empty range */\r
- n = e - i + 1; /* number of elements */\r
- if (n <= 0 || !lua_checkstack(L, n)) /* n <= 0 means arith. overflow */\r
- return luaL_error(L, "too many results to unpack");\r
- lua_rawgeti(L, 1, i); /* push arg[i] (avoiding overflow problems) */\r
- while (i++ < e) /* push arg[i + 1...e] */\r
- lua_rawgeti(L, 1, i);\r
- return n;\r
-}\r
-\r
-/* }====================================================== */\r
-\r
-\r
-\r
-/*\r
-** {======================================================\r
-** Quicksort\r
-** (based on `Algorithms in MODULA-3', Robert Sedgewick;\r
-** Addison-Wesley, 1993.)\r
-** =======================================================\r
-*/\r
-\r
-\r
-static void set2 (lua_State *L, int i, int j) {\r
- lua_rawseti(L, 1, i);\r
- lua_rawseti(L, 1, j);\r
-}\r
-\r
-static int sort_comp (lua_State *L, int a, int b) {\r
- if (!lua_isnil(L, 2)) { /* function? */\r
- int res;\r
- lua_pushvalue(L, 2);\r
- lua_pushvalue(L, a-1); /* -1 to compensate function */\r
- lua_pushvalue(L, b-2); /* -2 to compensate function and `a' */\r
- lua_call(L, 2, 1);\r
- res = lua_toboolean(L, -1);\r
- lua_pop(L, 1);\r
- return res;\r
- }\r
- else /* a < b? */\r
- return lua_compare(L, a, b, LUA_OPLT);\r
-}\r
-\r
-static void auxsort (lua_State *L, int l, int u) {\r
- while (l < u) { /* for tail recursion */\r
- int i, j;\r
- /* sort elements a[l], a[(l+u)/2] and a[u] */\r
- lua_rawgeti(L, 1, l);\r
- lua_rawgeti(L, 1, u);\r
- if (sort_comp(L, -1, -2)) /* a[u] < a[l]? */\r
- set2(L, l, u); /* swap a[l] - a[u] */\r
- else\r
- lua_pop(L, 2);\r
- if (u-l == 1) break; /* only 2 elements */\r
- i = (l+u)/2;\r
- lua_rawgeti(L, 1, i);\r
- lua_rawgeti(L, 1, l);\r
- if (sort_comp(L, -2, -1)) /* a[i]<a[l]? */\r
- set2(L, i, l);\r
- else {\r
- lua_pop(L, 1); /* remove a[l] */\r
- lua_rawgeti(L, 1, u);\r
- if (sort_comp(L, -1, -2)) /* a[u]<a[i]? */\r
- set2(L, i, u);\r
- else\r
- lua_pop(L, 2);\r
- }\r
- if (u-l == 2) break; /* only 3 elements */\r
- lua_rawgeti(L, 1, i); /* Pivot */\r
- lua_pushvalue(L, -1);\r
- lua_rawgeti(L, 1, u-1);\r
- set2(L, i, u-1);\r
- /* a[l] <= P == a[u-1] <= a[u], only need to sort from l+1 to u-2 */\r
- i = l; j = u-1;\r
- for (;;) { /* invariant: a[l..i] <= P <= a[j..u] */\r
- /* repeat ++i until a[i] >= P */\r
- while (lua_rawgeti(L, 1, ++i), sort_comp(L, -1, -2)) {\r
- if (i>=u) luaL_error(L, "invalid order function for sorting");\r
- lua_pop(L, 1); /* remove a[i] */\r
- }\r
- /* repeat --j until a[j] <= P */\r
- while (lua_rawgeti(L, 1, --j), sort_comp(L, -3, -1)) {\r
- if (j<=l) luaL_error(L, "invalid order function for sorting");\r
- lua_pop(L, 1); /* remove a[j] */\r
- }\r
- if (j<i) {\r
- lua_pop(L, 3); /* pop pivot, a[i], a[j] */\r
- break;\r
- }\r
- set2(L, i, j);\r
- }\r
- lua_rawgeti(L, 1, u-1);\r
- lua_rawgeti(L, 1, i);\r
- set2(L, u-1, i); /* swap pivot (a[u-1]) with a[i] */\r
- /* a[l..i-1] <= a[i] == P <= a[i+1..u] */\r
- /* adjust so that smaller half is in [j..i] and larger one in [l..u] */\r
- if (i-l < u-i) {\r
- j=l; i=i-1; l=i+2;\r
- }\r
- else {\r
- j=i+1; i=u; u=j-2;\r
- }\r
- auxsort(L, j, i); /* call recursively the smaller one */\r
- } /* repeat the routine for the larger one */\r
-}\r
-\r
-static int sort (lua_State *L) {\r
- int n = aux_getn(L, 1);\r
- luaL_checkstack(L, 40, ""); /* assume array is smaller than 2^40 */\r
- if (!lua_isnoneornil(L, 2)) /* is there a 2nd argument? */\r
- luaL_checktype(L, 2, LUA_TFUNCTION);\r
- lua_settop(L, 2); /* make sure there is two arguments */\r
- auxsort(L, 1, n);\r
- return 0;\r
-}\r
-\r
-/* }====================================================== */\r
-\r
-\r
-static const luaL_Reg tab_funcs[] = {\r
- {"concat", tconcat},\r
-#if defined(LUA_COMPAT_MAXN)\r
- {"maxn", maxn},\r
-#endif\r
- {"insert", tinsert},\r
- {"pack", pack},\r
- {"unpack", unpack},\r
- {"remove", tremove},\r
- {"sort", sort},\r
- {NULL, NULL}\r
-};\r
-\r
-\r
-LUAMOD_API int luaopen_table (lua_State *L) {\r
- luaL_newlib(L, tab_funcs);\r
-#if defined(LUA_COMPAT_UNPACK)\r
- /* _G.unpack = table.unpack */\r
- lua_getfield(L, -1, "unpack");\r
- lua_setglobal(L, "unpack");\r
-#endif\r
- return 1;\r
-}\r
-\r
projects / mirror_edk2.git / blobdiff