2016-03-14 21:53:24 +08:00
|
|
|
// The MIT License (MIT)
|
2013-12-01 10:12:50 +08:00
|
|
|
|
2016-02-27 15:43:53 +08:00
|
|
|
// Copyright (c) 2013-2016 Rapptz, ThePhD and contributors
|
2013-12-01 10:12:50 +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.
|
|
|
|
|
|
|
|
#ifndef SOL_OBJECT_HPP
|
|
|
|
#define SOL_OBJECT_HPP
|
|
|
|
|
2013-12-14 13:05:14 +08:00
|
|
|
#include "reference.hpp"
|
2016-03-13 22:03:05 +08:00
|
|
|
#include "userdata.hpp"
|
2013-12-14 13:05:14 +08:00
|
|
|
#include "stack.hpp"
|
2016-04-17 14:18:34 +08:00
|
|
|
#include "variadic_args.hpp"
|
2013-12-01 10:12:50 +08:00
|
|
|
|
|
|
|
namespace sol {
|
2016-06-20 05:59:40 +08:00
|
|
|
template <typename base_t>
|
|
|
|
class basic_object : public base_t {
|
|
|
|
private:
|
|
|
|
template<typename T>
|
|
|
|
decltype(auto) as_stack(std::true_type) const {
|
|
|
|
return stack::get<T>(base_t::lua_state(), base_t::stack_index());
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
decltype(auto) as_stack(std::false_type) const {
|
|
|
|
base_t::push();
|
|
|
|
return stack::pop<T>(base_t::lua_state());
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
bool is_stack(std::true_type) const {
|
|
|
|
return stack::check<T>(base_t::lua_state(), base_t::stack_index(), no_panic);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
bool is_stack(std::false_type) const {
|
|
|
|
auto pp = stack::push_pop(*this);
|
|
|
|
return stack::check<T>(base_t::lua_state(), -1, no_panic);
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
basic_object() noexcept = default;
|
|
|
|
template <typename T, meta::enable<meta::neg<std::is_same<meta::unqualified_t<T>, basic_object>>, std::is_base_of<base_t, meta::unqualified_t<T>>> = meta::enabler>
|
|
|
|
basic_object(T&& r) : base_t(std::forward<T>(r)) {}
|
|
|
|
basic_object(nil_t r) : base_t(r) {}
|
|
|
|
basic_object(const basic_object&) = default;
|
|
|
|
basic_object(basic_object&&) = default;
|
|
|
|
basic_object& operator=(const basic_object&) = default;
|
|
|
|
basic_object& operator=(basic_object&&) = default;
|
|
|
|
basic_object(const stack_reference& r) noexcept : basic_object(r.lua_state(), r.stack_index()) {}
|
|
|
|
basic_object(stack_reference&& r) noexcept : basic_object(r.lua_state(), r.stack_index()) {}
|
|
|
|
basic_object(lua_State* L, int index = -1) noexcept : base_t(L, index) {}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
decltype(auto) as() const {
|
|
|
|
return as_stack<T>(std::is_same<base_t, stack_reference>());
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
bool is() const {
|
|
|
|
if (!base_t::valid())
|
|
|
|
return false;
|
|
|
|
return is_stack<T>(std::is_same<base_t, stack_reference>());
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2016-06-20 21:51:26 +08:00
|
|
|
template <typename R = reference, bool should_pop = !std::is_base_of<stack_reference, R>::value, typename T>
|
|
|
|
R make_reference(lua_State* L, T&& value) {
|
2016-06-20 05:59:40 +08:00
|
|
|
int backpedal = stack::push(L, std::forward<T>(value));
|
2016-06-20 21:51:26 +08:00
|
|
|
R r = stack::get<R>(L, -backpedal);
|
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
2016-06-20 05:59:40 +08:00
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2016-06-20 21:51:26 +08:00
|
|
|
template <typename T, typename R = reference, bool should_pop = !std::is_base_of<stack_reference, R>::value, typename... Args>
|
|
|
|
object make_reference(lua_State* L, Args&&... args) {
|
2016-06-20 05:59:40 +08:00
|
|
|
int backpedal = stack::push<T>(L, std::forward<Args>(args)...);
|
|
|
|
object r = stack::get<sol::object>(L, -backpedal);
|
2016-07-29 01:33:08 +08:00
|
|
|
if (should_pop) {
|
|
|
|
lua_pop(L, backpedal);
|
|
|
|
}
|
2016-06-20 05:59:40 +08:00
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
2016-06-20 21:51:26 +08:00
|
|
|
template <typename T>
|
|
|
|
object make_object(lua_State* L, T&& value) {
|
|
|
|
return make_reference<object, true>(L, std::forward<T>(value));
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T, typename... Args>
|
|
|
|
object make_object(lua_State* L, Args&&... args) {
|
|
|
|
return make_reference<T, object, true>(L, std::forward<Args>(args)...);
|
|
|
|
}
|
|
|
|
|
2016-06-20 05:59:40 +08:00
|
|
|
inline bool operator==(const object& lhs, const nil_t&) {
|
|
|
|
return !lhs.valid();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool operator==(const nil_t&, const object& rhs) {
|
|
|
|
return !rhs.valid();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool operator!=(const object& lhs, const nil_t&) {
|
|
|
|
return lhs.valid();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool operator!=(const nil_t&, const object& rhs) {
|
|
|
|
return rhs.valid();
|
|
|
|
}
|
2013-12-01 10:12:50 +08:00
|
|
|
} // sol
|
|
|
|
|
2014-05-29 14:57:11 +08:00
|
|
|
#endif // SOL_OBJECT_HPP
|