mirror of
https://github.com/ThePhD/sol2.git
synced 2024-03-22 13:10:44 +08:00
bd4492b85b
sol::object had a few reference leaks in the way it retrieved values: it now does it properly without leaving the stack at +1 item
sol::stack was drastically cleaned up, with the following key change:
* sol::stack::push now returns an integer of the number of things its pushed (usually 1, but can be more) (Thanks, @PrincessNyanara!)
* sol::stack::call now calls functions flexibly, and getting is done more reliably
* due to the innovation of stack::call and using absolute indices, we no longer have to use reverse_call style programming to deal with lua
* sol::reference::get_type is now const-correct
* sol::state and sol::table now have a cleaned up `get` implementation since it is no longer held back by the ugliness of VC++'s incapability to handle templates
* the name `sol::userdata` now belongs to a type that actually encapsualtes a void* with a pusher/getter than gets a userdata void* value (TODO: give it a template to make it static_cast to that type on get?)
* lightuserdata_t -> light_userdata, upvalue_t -> upvalue as type names (mostly details)
* pushers for various types were updated to return integers
72 lines
2.3 KiB
C++
72 lines
2.3 KiB
C++
// The MIT License (MIT)
|
|
|
|
// Copyright (c) 2013 Danny Y., Rapptz
|
|
|
|
// 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
|
|
|
|
#include "reference.hpp"
|
|
#include "stack.hpp"
|
|
|
|
namespace sol {
|
|
class object : public reference {
|
|
public:
|
|
object(lua_State* L, int index = -1): reference(L, index) {}
|
|
object() = default;
|
|
|
|
template<typename T>
|
|
auto as() const -> decltype(stack::get<T>(state())) {
|
|
push();
|
|
type actual = stack::get<type>(state());
|
|
type_assert(state(), -1, type_of<T>(), actual);
|
|
return stack::pop<T>(state());
|
|
}
|
|
|
|
template<typename T>
|
|
bool is() const {
|
|
auto expected = type_of<T>();
|
|
auto actual = get_type();
|
|
return (expected == actual) || (expected == type::poly);
|
|
}
|
|
|
|
explicit operator bool() const {
|
|
return !is<nil_t>();
|
|
}
|
|
};
|
|
|
|
inline bool operator==(const object& lhs, const nil_t&) {
|
|
return lhs.is<nil_t>();
|
|
}
|
|
|
|
inline bool operator==(const nil_t&, const object& rhs) {
|
|
return rhs.is<nil_t>();
|
|
}
|
|
|
|
inline bool operator!=(const object& lhs, const nil_t&) {
|
|
return !lhs.is<nil_t>();
|
|
}
|
|
|
|
inline bool operator!=(const nil_t&, const object& rhs) {
|
|
return !rhs.is<nil_t>();
|
|
}
|
|
} // sol
|
|
|
|
#endif // SOL_OBJECT_HPP
|