// The MIT License (MIT) // Copyright (c) 2013-2016 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_FUNCTION_HPP #define SOL_FUNCTION_HPP #include "reference.hpp" #include "stack.hpp" #include "resolve.hpp" #include "function_result.hpp" #include "function_types.hpp" #include #include #include namespace sol { class function : public reference { private: void luacall( std::ptrdiff_t argcount, std::ptrdiff_t resultcount ) const { lua_callk( lua_state( ), static_cast( argcount ), static_cast( resultcount ), 0, nullptr ); } template auto invoke( types, std::index_sequence, std::ptrdiff_t n ) const { luacall( n, sizeof...( Ret ) ); return stack::pop>( lua_state( ) ); } template Ret invoke(types, std::index_sequence, std::ptrdiff_t n ) const { luacall( n, 1 ); return stack::pop( lua_state( ) ); } template void invoke(types, std::index_sequence, std::ptrdiff_t n) const { luacall( n, 0 ); } function_result invoke(types<>, std::index_sequence<>, std::ptrdiff_t n ) const { int stacksize = lua_gettop( lua_state( ) ); int firstreturn = std::max( 1, stacksize - static_cast( n ) ); luacall(n, LUA_MULTRET); int poststacksize = lua_gettop( lua_state( ) ); int returncount = poststacksize - (firstreturn - 1); return function_result( lua_state( ), firstreturn, returncount ); } public: function() = default; function(const function&) = default; function& operator=(const function&) = default; function( function&& ) = default; function& operator=( function&& ) = default; function(lua_State* L, int index = -1): reference(L, index) { #ifdef SOL_CHECK_ARGUMENTS type_assert(L, index, type::function); #endif // Safety } template function_result operator()( Args&&... args ) const { return call<>( std::forward( args )... ); } template decltype(auto) operator()( types, Args&&... args ) const { return call( std::forward( args )... ); } template decltype(auto) call( Args&&... args ) const { push( ); int pushcount = stack::multi_push( lua_state( ), std::forward( args )... ); return invoke( types( ), std::make_index_sequence(), pushcount ); } }; namespace stack { template struct getter> { typedef meta::bind_traits fx_t; typedef typename fx_t::args_type args_types; typedef meta::tuple_types return_types; template static std::function get_std_func(types, types, lua_State* L, int index = -1) { sol::function f(L, index); auto fx = [f, L, index](Args&&... args) -> meta::return_type_t { return f.call(std::forward(args)...); }; return std::move(fx); } template static std::function get_std_func(types, types, lua_State* L, int index = -1) { sol::function f(L, index); auto fx = [f, L, index](FxArgs&&... args) -> void { f(std::forward(args)...); }; return std::move(fx); } template static std::function get_std_func(types<>, types t, lua_State* L, int index = -1) { return get_std_func(types(), t, L, index); } static std::function get(lua_State* L, int index) { return get_std_func(return_types(), args_types(), L, index); } }; } // stack } // sol #endif // SOL_FUNCTION_HPP