| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279 |
- // sol2
- // The MIT License (MIT)
- // Copyright (c) 2013-2022 Rapptz, ThePhD and contributors
- // Permission is hereby granted, free of charge, to any person obtaining a copy of
- // this software and associated documentation files (the "Software"), to deal in
- // the Software without restriction, including without limitation the rights to
- // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
- // the Software, and to permit persons to whom the Software is furnished to do so,
- // subject to the following conditions:
- // The above copyright notice and this permission notice shall be included in all
- // copies or substantial portions of the Software.
- // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
- // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
- // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
- // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
- // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- #ifndef SOL_STACK_FIELD_HPP
- #define SOL_STACK_FIELD_HPP
- #include <sol/stack_core.hpp>
- #include <sol/stack_push.hpp>
- #include <sol/stack_get.hpp>
- #include <sol/stack_check_get.hpp>
- namespace sol { namespace stack {
- namespace stack_detail {
- template <typename T, bool global, bool raw>
- inline constexpr bool is_get_direct_tableless_v = (global && !raw && meta::is_c_str_or_string_v<T>);
- template <typename T, bool global, bool raw>
- inline constexpr bool is_get_direct_v = (is_get_direct_tableless_v<T, global, raw>) // cf-hack
- || (!global && !raw && (meta::is_c_str_or_string_v<T> || meta::is_string_of_v<T, char>)) // cf-hack
- || (!global && raw && (std::is_integral_v<T> && !std::is_same_v<T, bool>))
- #if SOL_LUA_VERSION_I_ >= 503
- || (!global && !raw && (std::is_integral_v<T> && !std::is_same_v<T, bool>))
- #endif // integer keys 5.3 or better
- #if SOL_LUA_VERSION_I_ >= 502
- || (!global && raw && std::is_pointer_v<T> && std::is_void_v<std::remove_pointer_t<T>>)
- #endif // void pointer keys 5.2 or better
- ;
- template <typename T, bool global, bool raw>
- inline constexpr bool is_set_direct_tableless_v = (global && !raw && meta::is_c_str_or_string_v<T>);
- template <typename T, bool global, bool raw>
- inline constexpr bool is_set_direct_v = (is_set_direct_tableless_v<T, global, raw>) // cf-hack
- || (!global && !raw && (meta::is_c_str_or_string_v<T> || meta::is_string_of_v<T, char>)) // cf-hack
- || (!global && raw && (std::is_integral_v<T> && !std::is_same_v<T, bool>)) // cf-hack
- #if SOL_LUA_VERSION_I_ >= 503
- || (!global && !raw && (std::is_integral_v<T> && !std::is_same_v<T, bool>))
- #endif // integer keys 5.3 or better
- #if SOL_LUA_VERSION_I_ >= 502
- || (!global && raw && (std::is_pointer_v<T> && std::is_void_v<std::remove_pointer_t<T>>))
- #endif // void pointer keys 5.2 or better
- ;
- } // namespace stack_detail
- template <typename T, bool global, bool raw, typename>
- struct field_getter {
- static inline constexpr int default_table_index
- = meta::conditional_t<stack_detail::is_get_direct_v<T, global, raw>, std::integral_constant<int, -1>, std::integral_constant<int, -2>>::value;
- template <typename Key>
- void get(lua_State* L, Key&& key, int tableindex = default_table_index) {
- if constexpr (std::is_same_v<T, update_if_empty_t> || std::is_same_v<T, override_value_t> || std::is_same_v<T, create_if_nil_t>) {
- (void)L;
- (void)key;
- (void)tableindex;
- }
- else if constexpr (std::is_same_v<T, env_key_t>) {
- (void)key;
- #if SOL_LUA_VERSION_I_ < 502
- // Use lua_setfenv
- lua_getfenv(L, tableindex);
- #else
- // Use upvalues as explained in Lua 5.2 and beyond's manual
- if (lua_getupvalue(L, tableindex, 1) == nullptr) {
- push(L, lua_nil);
- }
- #endif
- }
- else if constexpr (std::is_same_v<T, metatable_key_t>) {
- (void)key;
- if (lua_getmetatable(L, tableindex) == 0)
- push(L, lua_nil);
- }
- else if constexpr (raw) {
- if constexpr (std::is_integral_v<T> && !std::is_same_v<bool, T>) {
- lua_rawgeti(L, tableindex, static_cast<lua_Integer>(key));
- }
- #if SOL_LUA_VERSION_I_ >= 502
- else if constexpr (std::is_pointer_v<T> && std::is_void_v<std::remove_pointer_t<T>>) {
- lua_rawgetp(L, tableindex, key);
- }
- #endif // Lua 5.2.x+
- else {
- push(L, std::forward<Key>(key));
- lua_rawget(L, tableindex);
- }
- }
- else {
- if constexpr (meta::is_c_str_or_string_v<T>) {
- if constexpr (global) {
- (void)tableindex;
- lua_getglobal(L, &key[0]);
- }
- else {
- lua_getfield(L, tableindex, &key[0]);
- }
- }
- else if constexpr (std::is_same_v<T, meta_function>) {
- const auto& real_key = to_string(key);
- lua_getfield(L, tableindex, &real_key[0]);
- }
- #if SOL_LUA_VERSION_I_ >= 503
- else if constexpr (std::is_integral_v<T> && !std::is_same_v<bool, T>) {
- lua_geti(L, tableindex, static_cast<lua_Integer>(key));
- }
- #endif // Lua 5.3.x+
- else {
- push(L, std::forward<Key>(key));
- lua_gettable(L, tableindex);
- }
- }
- }
- };
- template <typename... Args, bool b, bool raw, typename C>
- struct field_getter<std::tuple<Args...>, b, raw, C> {
- template <std::size_t... I, typename Keys>
- void apply(std::index_sequence<0, I...>, lua_State* L, Keys&& keys, int tableindex) {
- get_field<b, raw>(L, std::get<0>(std::forward<Keys>(keys)), tableindex);
- void(detail::swallow { (get_field<false, raw>(L, std::get<I>(std::forward<Keys>(keys))), 0)... });
- reference saved(L, -1);
- lua_pop(L, static_cast<int>(sizeof...(I)));
- saved.push();
- }
- template <typename Keys>
- void get(lua_State* L, Keys&& keys) {
- apply(std::make_index_sequence<sizeof...(Args)>(), L, std::forward<Keys>(keys), lua_absindex(L, -1));
- }
- template <typename Keys>
- void get(lua_State* L, Keys&& keys, int tableindex) {
- apply(std::make_index_sequence<sizeof...(Args)>(), L, std::forward<Keys>(keys), tableindex);
- }
- };
- template <typename A, typename B, bool b, bool raw, typename C>
- struct field_getter<std::pair<A, B>, b, raw, C> {
- template <typename Keys>
- void get(lua_State* L, Keys&& keys, int tableindex) {
- get_field<b, raw>(L, std::get<0>(std::forward<Keys>(keys)), tableindex);
- get_field<false, raw>(L, std::get<1>(std::forward<Keys>(keys)));
- reference saved(L, -1);
- lua_pop(L, static_cast<int>(2));
- saved.push();
- }
- template <typename Keys>
- void get(lua_State* L, Keys&& keys) {
- get_field<b, raw>(L, std::get<0>(std::forward<Keys>(keys)));
- get_field<false, raw>(L, std::get<1>(std::forward<Keys>(keys)));
- reference saved(L, -1);
- lua_pop(L, static_cast<int>(2));
- saved.push();
- }
- };
- template <typename T, bool global, bool raw, typename>
- struct field_setter {
- static constexpr int default_table_index
- = meta::conditional_t<stack_detail::is_set_direct_v<T, global, raw>, std::integral_constant<int, -2>, std::integral_constant<int, -3>>::value;
- template <typename Key, typename Value>
- void set(lua_State* L, Key&& key, Value&& value, int tableindex = default_table_index) {
- if constexpr (std::is_same_v<T, update_if_empty_t> || std::is_same_v<T, override_value_t>) {
- (void)L;
- (void)key;
- (void)value;
- (void)tableindex;
- }
- else if constexpr (std::is_same_v<T, metatable_key_t>) {
- (void)key;
- push(L, std::forward<Value>(value));
- lua_setmetatable(L, tableindex);
- }
- else if constexpr (raw) {
- if constexpr (std::is_integral_v<T> && !std::is_same_v<bool, T>) {
- push(L, std::forward<Value>(value));
- lua_rawseti(L, tableindex, static_cast<lua_Integer>(key));
- }
- #if SOL_LUA_VERSION_I_ >= 502
- else if constexpr (std::is_pointer_v<T> && std::is_void_v<std::remove_pointer_t<T>>) {
- push(L, std::forward<Value>(value));
- lua_rawsetp(L, tableindex, std::forward<Key>(key));
- }
- #endif // Lua 5.2.x
- else {
- push(L, std::forward<Key>(key));
- push(L, std::forward<Value>(value));
- lua_rawset(L, tableindex);
- }
- }
- else {
- if constexpr (meta::is_c_str_or_string_v<T>) {
- if constexpr (global) {
- push(L, std::forward<Value>(value));
- lua_setglobal(L, &key[0]);
- (void)tableindex;
- }
- else {
- push(L, std::forward<Value>(value));
- lua_setfield(L, tableindex, &key[0]);
- }
- }
- #if SOL_LUA_VERSION_I_ >= 503
- else if constexpr (std::is_integral_v<T> && !std::is_same_v<bool, T>) {
- push(L, std::forward<Value>(value));
- lua_seti(L, tableindex, static_cast<lua_Integer>(key));
- }
- #endif // Lua 5.3.x
- else {
- push(L, std::forward<Key>(key));
- push(L, std::forward<Value>(value));
- lua_settable(L, tableindex);
- }
- }
- }
- };
- template <typename... Args, bool b, bool raw, typename C>
- struct field_setter<std::tuple<Args...>, b, raw, C> {
- template <bool g, std::size_t I, typename Keys, typename Value>
- void apply(std::index_sequence<I>, lua_State* L, Keys&& keys, Value&& value, int tableindex) {
- I < 1 ? set_field<g, raw>(L, std::get<I>(std::forward<Keys>(keys)), std::forward<Value>(value), tableindex)
- : set_field<g, raw>(L, std::get<I>(std::forward<Keys>(keys)), std::forward<Value>(value));
- }
- template <bool g, std::size_t I0, std::size_t I1, std::size_t... I, typename Keys, typename Value>
- void apply(std::index_sequence<I0, I1, I...>, lua_State* L, Keys&& keys, Value&& value, int tableindex) {
- I0 < 1 ? get_field<g, raw>(L, std::get<I0>(std::forward<Keys>(keys)), tableindex)
- : get_field<g, raw>(L, std::get<I0>(std::forward<Keys>(keys)), -1);
- apply<false>(std::index_sequence<I1, I...>(), L, std::forward<Keys>(keys), std::forward<Value>(value), -1);
- }
- template <bool g, std::size_t I0, std::size_t... I, typename Keys, typename Value>
- void top_apply(std::index_sequence<I0, I...>, lua_State* L, Keys&& keys, Value&& value, int tableindex) {
- apply<g>(std::index_sequence<I0, I...>(), L, std::forward<Keys>(keys), std::forward<Value>(value), tableindex);
- lua_pop(L, static_cast<int>(sizeof...(I)));
- }
- template <typename Keys, typename Value>
- void set(lua_State* L, Keys&& keys, Value&& value, int tableindex = -3) {
- top_apply<b>(std::make_index_sequence<sizeof...(Args)>(), L, std::forward<Keys>(keys), std::forward<Value>(value), tableindex);
- }
- };
- template <typename A, typename B, bool b, bool raw, typename C>
- struct field_setter<std::pair<A, B>, b, raw, C> {
- template <typename Keys, typename Value>
- void set(lua_State* L, Keys&& keys, Value&& value, int tableindex = -1) {
- get_field<b, raw>(L, std::get<0>(std::forward<Keys>(keys)), tableindex);
- set_field<false, raw>(L, std::get<1>(std::forward<Keys>(keys)), std::forward<Value>(value), lua_gettop(L));
- lua_pop(L, 1);
- }
- };
- }} // namespace sol::stack
- #endif // SOL_STACK_FIELD_HPP
|