x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
intrusive_ptr.cpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\luabind\examples\intrusive_ptr\intrusive_ptr.cpp
Girar
Efecto
Propiedad
Historial
#include
extern "C" { #include "lua.h" #include "lauxlib.h" #include "lualib.h" } bool dostring(lua_State* L, const char* str) { if (luaL_loadbuffer(L, str, std::strlen(str), str) || lua_pcall(L, 0, 0, 0)) { const char* a = lua_tostring(L, -1); std::cout << a << "\n"; lua_pop(L, 1); return true; } return false; } #include
#include
namespace luabind { namespace converters { // tell luabind that there is a converter for boost::intrusive_ptr
template
yes_t is_user_defined(by_value
>); template
yes_t is_user_defined(by_const_reference
>); // function used to destruct the object in lua template
struct decrement_ref_count { static void apply(void* ptr) { T* p = static_cast
(ptr); intrusive_ptr_release(p); } }; template
void convert_cpp_to_lua(lua_State* L, const boost::intrusive_ptr
& ptr) { if (!ptr) { lua_pushnil(L); return; } T* raw_ptr = ptr.get(); // add reference to object, this will be released when the object is collected intrusive_ptr_add_ref(raw_ptr); detail::class_registry* registry = luabind::detail::class_registry::get_registry(L); detail::class_rep* crep = registry->find_class(LUABIND_TYPEID(T)); assert(crep != 0 && "You are trying to convert an unregistered type"); // create the struct to hold the object void* obj = lua_newuserdata(L, sizeof(detail::object_rep)); // we send 0 as destructor since we know it will never be called new(obj) luabind::detail::object_rep(raw_ptr, crep, detail::object_rep::owner, decrement_ref_count
::apply); // set the meta table detail::getref(L, crep->metatable_ref()); lua_setmetatable(L, -2); } template
boost::intrusive_ptr
convert_lua_to_cpp(lua_State* L, by_const_reference
>, int index) { typename detail::default_policy::template generate_converter
::type converter; T* ptr = converter.apply(L, LUABIND_DECORATE_TYPE(T*), index); return boost::intrusive_ptr
(ptr); } template
boost::intrusive_ptr
convert_lua_to_cpp(lua_State* L, by_value
>, int index) { return convert_lua_to_cpp(L, by_const_reference
>(), index); } template
int match_lua_to_cpp(lua_State* L, by_value
>, int index) { typedef typename detail::default_policy::template generate_converter
::type converter_t; return converter_t::match(L, LUABIND_DECORATE_TYPE(T*), index); } template
int match_lua_to_cpp(lua_State* L, by_const_reference
>, int index) { typedef typename detail::default_policy::template generate_converter
::type converter_t; return converter_t::match(L, LUABIND_DECORATE_TYPE(T*), index); } } } struct A { A() : cnt(0) {} ~A() { std::cout << "free memory\n"; } int cnt; }; void intrusive_ptr_add_ref(A* ptr) { ++ptr->cnt; std::cout << "add ref\n"; } void intrusive_ptr_release(A* ptr) { --ptr->cnt; std::cout << "release\n"; if (ptr->cnt == 0) delete ptr; } void f(boost::intrusive_ptr
ptr) { std::cout << "count: " << ptr->cnt << "\n"; } boost::intrusive_ptr
factory() { return boost::intrusive_ptr
(new A()); } int main() { lua_State* L = lua_open(); lua_baselibopen(L); luabind::open(L); using namespace luabind; module(L) [ class_
("A") .def_readonly("cnt", &A::cnt), def("factory", &factory), def("f", &f) ]; dostring(L, "a = factory()"); dostring(L, "print('lua count: ' .. a.cnt)"); dostring(L, "f(a)"); lua_close(L); return 0; }
intrusive_ptr.cpp
Dirección de la página
Dirección del archivo
Anterior 1/3
Siguiente
Descargar
( 3 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.