ElementAttributesProxy.cpp 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /*
  2. * This source file is part of libRocket, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://www.librocket.com
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this software and associated documentation files (the "Software"), to deal
  10. * in the Software without restriction, including without limitation the rights
  11. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  12. * copies of the Software, and to permit persons to whom the Software is
  13. * furnished to do so, subject to the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  23. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  24. * THE SOFTWARE.
  25. *
  26. */
  27. #include "precompiled.h"
  28. #include "ElementAttributesProxy.h"
  29. #include <Rocket/Core/Variant.h>
  30. #include <Rocket/Core/Lua/Utilities.h>
  31. namespace Rocket {
  32. namespace Core {
  33. namespace Lua {
  34. template<> void ExtraInit<ElementAttributesProxy>(lua_State* L, int metatable_index)
  35. {
  36. lua_pushcfunction(L,ElementAttributesProxy__index);
  37. lua_setfield(L,metatable_index,"__index");
  38. lua_pushcfunction(L,ElementAttributesProxy__pairs);
  39. lua_setfield(L,metatable_index,"__pairs");
  40. lua_pushcfunction(L,ElementAttributesProxy__ipairs);
  41. lua_setfield(L,metatable_index,"__ipairs");
  42. }
  43. int ElementAttributesProxy__index(lua_State* L)
  44. {
  45. /*the table obj and the missing key are currently on the stack(index 1 & 2) as defined by the Lua language*/
  46. int keytype = lua_type(L,2);
  47. if(keytype == LUA_TSTRING) //only valid key types
  48. {
  49. ElementAttributesProxy* obj = LuaType<ElementAttributesProxy>::check(L,1);
  50. LUACHECKOBJ(obj);
  51. const char* key = lua_tostring(L,2);
  52. Variant* attr = obj->owner->GetAttribute(key);
  53. PushVariant(L,attr); //Utilities.h
  54. return 1;
  55. }
  56. else
  57. return LuaType<ElementAttributesProxy>::index(L);
  58. }
  59. //[1] is the object, [2] is the key that was used previously, [3] is the userdata
  60. int ElementAttributesProxy__pairs(lua_State* L)
  61. {
  62. ElementAttributesProxy* obj = LuaType<ElementAttributesProxy>::check(L,1);
  63. LUACHECKOBJ(obj);
  64. int* pindex = (int*)lua_touserdata(L,3);
  65. if((*pindex) == -1)
  66. *pindex = 0;
  67. String key = "";
  68. Variant* val;
  69. if(obj->owner->IterateAttributes((*pindex),key,val))
  70. {
  71. lua_pushstring(L,key.CString());
  72. PushVariant(L,val);
  73. }
  74. else
  75. {
  76. lua_pushnil(L);
  77. lua_pushnil(L);
  78. }
  79. return 2;
  80. }
  81. //Doesn't index by integer, so don't return anything
  82. int ElementAttributesProxy__ipairs(lua_State* L)
  83. {
  84. lua_pushnil(L);
  85. lua_pushnil(L);
  86. return 2;
  87. }
  88. RegType<ElementAttributesProxy> ElementAttributesProxyMethods[] =
  89. {
  90. { NULL, NULL },
  91. };
  92. luaL_reg ElementAttributesProxyGetters[] =
  93. {
  94. { NULL, NULL },
  95. };
  96. luaL_reg ElementAttributesProxySetters[] =
  97. {
  98. { NULL, NULL },
  99. };
  100. LUACORETYPEDEFINE(ElementAttributesProxy,false)
  101. }
  102. }
  103. }