thirdpartymirrors/RingRacers
1
0
Fork 0
mirror of https://github.com/KartKrewDev/RingRacers.git synced 2026-04-26 20:11:47 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

node.children now also takes "right" and "left" as fields, as alternatives to integers 0 and 1

Browse source 
in other words node.children[0] == node.children.right and node.children[1] == node.children.left
This commit is contained in:
Monster Iestyn 2016-08-04 19:20:34 +01:00
parent 6ac84687d3
commit ebb1fd1470
1 changed files with 13 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

22
src/lua_maplib.c
View file

@ -1083,23 +1083,28 @@ static int nodechildren_get(lua_State *L)
lua_settop(L, 2); lua_settop(L, 2);
if (!lua_isnumber(L, 2)) if (!lua_isnumber(L, 2))
{ {
int field = luaL_checkoption(L, 2, NULL, valid_opt); enum nodechild_e field = luaL_checkoption(L, 2, nodechild_opt[0], nodechild_opt);
if (!children) if (!children)
{ {
if (field == 0) { if (field == nodechild_valid) {
lua_pushboolean(L, 0); lua_pushboolean(L, 0);
return 1; return 1;
} }
return luaL_error(L, "accessed node_t doesn't exist anymore."); return luaL_error(L, "accessed node_t doesn't exist anymore.");
} else if (field == 0) { } else if (field == nodechild_valid) {
lua_pushboolean(L, 1); lua_pushboolean(L, 1);
return 1; return 1;
} else switch (field) {
case nodechild_right: i = 0; break;
case nodechild_left: i = 1; break;
default: return 0;
} }
} }
else {
i = lua_tointeger(L, 2); i = lua_tointeger(L, 2);
if (i < 0 || i > 1) if (i < 0 || i > 1)
return 0; return 0;
}
lua_pushinteger(L, children[i]); lua_pushinteger(L, children[i]);
return 1; return 1;
} }
@ -1124,8 +1129,7 @@ static int bbox_get(lua_State *L)
} else if (field == bbox_valid) { } else if (field == bbox_valid) {
lua_pushboolean(L, 1); lua_pushboolean(L, 1);
return 1; return 1;
} } else switch (field) {
else switch (field) {
case bbox_top: i = BOXTOP; break; case bbox_top: i = BOXTOP; break;
case bbox_bottom: i = BOXBOTTOM; break; case bbox_bottom: i = BOXBOTTOM; break;
case bbox_left: i = BOXLEFT; break; case bbox_left: i = BOXLEFT; break;