2021-03-06 23:14:48 +08:00
|
|
|
// sol2
|
2017-12-20 17:58:32 +08:00
|
|
|
|
2017-09-13 14:46:56 +08:00
|
|
|
// The MIT License (MIT)
|
2017-07-10 00:00:57 +08:00
|
|
|
|
2021-03-06 14:03:23 +08:00
|
|
|
// Copyright (c) 2013-2021 Rapptz, ThePhD and contributors
|
2017-07-10 00:00:57 +08:00
|
|
|
|
|
|
|
// 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.
|
|
|
|
|
2018-09-28 13:27:38 +08:00
|
|
|
#ifndef SOL_MAKE_REFERENCE_HPP
|
|
|
|
#define SOL_MAKE_REFERENCE_HPP
|
2017-07-10 00:00:57 +08:00
|
|
|
|
2020-08-10 05:17:06 +08:00
|
|
|
#include <sol/reference.hpp>
|
|
|
|
#include <sol/stack.hpp>
|
2017-07-10 00:00:57 +08:00
|
|
|
|
|
|
|
namespace sol {
|
2018-09-28 13:27:38 +08:00
|
|
|
|
2019-05-21 14:27:02 +08:00
|
|
|
template <typename R = reference, bool should_pop = !is_stack_based_v<R>, typename T>
|
2018-09-28 13:27:38 +08:00
|
|
|
R make_reference(lua_State* L, T&& value) {
|
|
|
|
int backpedal = stack::push(L, std::forward<T>(value));
|
|
|
|
R r = stack::get<R>(L, -backpedal);
|
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2019-05-21 14:27:02 +08:00
|
|
|
template <typename T, typename R = reference, bool should_pop = !is_stack_based_v<R>, typename... Args>
|
2018-09-28 13:27:38 +08:00
|
|
|
R make_reference(lua_State* L, Args&&... args) {
|
|
|
|
int backpedal = stack::push<T>(L, std::forward<Args>(args)...);
|
|
|
|
R r = stack::get<R>(L, -backpedal);
|
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
|
|
|
return r;
|
2017-07-10 00:00:57 +08:00
|
|
|
}
|
|
|
|
|
2020-01-25 08:58:12 +08:00
|
|
|
template <typename R = reference, bool should_pop = !is_stack_based_v<R>, typename T>
|
|
|
|
R make_reference_userdata(lua_State* L, T&& value) {
|
|
|
|
int backpedal = stack::push_userdata(L, std::forward<T>(value));
|
|
|
|
R r = stack::get<R>(L, -backpedal);
|
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T, typename R = reference, bool should_pop = !is_stack_based_v<R>, typename... Args>
|
|
|
|
R make_reference_userdata(lua_State* L, Args&&... args) {
|
|
|
|
int backpedal = stack::push_userdata<T>(L, std::forward<Args>(args)...);
|
|
|
|
R r = stack::get<R>(L, -backpedal);
|
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2017-09-13 14:46:56 +08:00
|
|
|
} // namespace sol
|
2017-07-10 00:00:57 +08:00
|
|
|
|
2018-09-28 13:27:38 +08:00
|
|
|
#endif // SOL_MAKE_REFERENCE_HPP
|