// sol2 // The MIT License (MIT) // Copyright (c) 2013-2021 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_CHECK_UNQUALIFIED_GET_HPP #define SOL_STACK_CHECK_UNQUALIFIED_GET_HPP #include #include #include #include #include #include #include #if SOL_IS_ON(SOL_STD_VARIANT_I_) #include #endif // variant shenanigans (thanks, Mac OSX) namespace sol { namespace stack { template struct unqualified_check_getter { typedef decltype(stack_detail::unchecked_unqualified_get(nullptr, -1, std::declval())) R; template static Optional get_using(lua_State* L, int index, Handler&& handler, record& tracking) { if constexpr (!meta::meta_detail::is_adl_sol_lua_check_v && !meta::meta_detail::is_adl_sol_lua_get_v) { if constexpr (is_lua_reference_v) { if constexpr (is_global_table_v) { (void)L; (void)index; (void)handler; tracking.use(1); return true; } else { // actually check if it's none here, otherwise // we'll have a none object inside an optional! bool success = lua_isnoneornil(L, index) == 0 && stack::check(L, index, &no_panic); if (!success) { // expected type, actual type tracking.use(static_cast(success)); handler(L, index, type::poly, type_of(L, index), ""); return detail::associated_nullopt_v; } return stack_detail::unchecked_get(L, index, tracking); } } else if constexpr ((std::is_integral_v || std::is_same_v)&&!std::is_same_v) { #if SOL_LUA_VESION_I_ >= 503 if (lua_isinteger(L, index) != 0) { tracking.use(1); return static_cast(lua_tointeger(L, index)); } #endif int isnum = 0; const lua_Number value = lua_tonumberx(L, index, &isnum); if (isnum != 0) { #if SOL_IS_ON(SOL_NUMBER_PRECISION_CHECKS_I_) const auto integer_value = llround(value); if (static_cast(integer_value) == value) { tracking.use(1); return static_cast(integer_value); } #else tracking.use(1); return static_cast(value); #endif } const type t = type_of(L, index); tracking.use(static_cast(t != type::none)); handler(L, index, type::number, t, "not an integer"); return detail::associated_nullopt_v; } else if constexpr (std::is_floating_point_v || std::is_same_v) { int isnum = 0; lua_Number value = lua_tonumberx(L, index, &isnum); if (isnum == 0) { type t = type_of(L, index); tracking.use(static_cast(t != type::none)); handler(L, index, type::number, t, "not a valid floating point number"); return detail::associated_nullopt_v; } tracking.use(1); return static_cast(value); } else if constexpr (std::is_enum_v && !meta::any_same_v) { int isnum = 0; lua_Integer value = lua_tointegerx(L, index, &isnum); if (isnum == 0) { type t = type_of(L, index); tracking.use(static_cast(t != type::none)); handler(L, index, type::number, t, "not a valid enumeration value"); return detail::associated_nullopt_v; } tracking.use(1); return static_cast(value); } else { if (!unqualified_check(L, index, std::forward(handler))) { tracking.use(static_cast(!lua_isnone(L, index))); return detail::associated_nullopt_v; } return stack_detail::unchecked_unqualified_get(L, index, tracking); } } else { if (!unqualified_check(L, index, std::forward(handler))) { tracking.use(static_cast(!lua_isnone(L, index))); return detail::associated_nullopt_v; } return stack_detail::unchecked_unqualified_get(L, index, tracking); } } template static optional get(lua_State* L, int index, Handler&& handler, record& tracking) { return get_using>(L, index, std::forward(handler), tracking); } }; #if SOL_IS_ON(SOL_STD_VARIANT_I_) template struct unqualified_check_getter, C> { typedef std::variant V; typedef std::variant_size V_size; typedef std::integral_constant V_is_empty; template static optional get_empty(std::true_type, lua_State*, int, Handler&&, record&) { return nullopt; } template static optional get_empty(std::false_type, lua_State* L, int index, Handler&& handler, record&) { // This should never be reached... // please check your code and understand what you did to bring yourself here // maybe file a bug report, or 5 handler( L, index, type::poly, type_of(L, index), "this variant code should never be reached: if it has, you have done something so terribly wrong"); return nullopt; } template static optional get_one(std::integral_constant, lua_State* L, int index, Handler&& handler, record& tracking) { return get_empty(V_is_empty(), L, index, std::forward(handler), tracking); } template static optional get_one(std::integral_constant, lua_State* L, int index, Handler&& handler, record& tracking) { typedef std::variant_alternative_t T; if (stack::check(L, index, &no_panic, tracking)) { return V(std::in_place_index, stack::get(L, index)); } return get_one(std::integral_constant(), L, index, std::forward(handler), tracking); } template static optional get(lua_State* L, int index, Handler&& handler, record& tracking) { return get_one(std::integral_constant(), L, index, std::forward(handler), tracking); } }; #endif // standard variant }} // namespace sol::stack #endif // SOL_STACK_CHECK_UNQUALIFIED_GET_HPP