mirror of
https://github.com/ThePhD/sol2.git
synced 2024-03-22 13:10:44 +08:00
486086ffe0
notably, test normal + single + generated + Lua 5.3.5 only once, then only run the runtime_test and compile_test for normal for all other permutations to help increase text matrix throughput
55 lines
1.3 KiB
C++
55 lines
1.3 KiB
C++
#define SOL_CHECK_ARGUMENTS 1
|
|
#include <sol/sol.hpp>
|
|
|
|
#include <iostream>
|
|
#include <assert.hpp>
|
|
|
|
int main() {
|
|
std::cout << "=== namespacing ===" << std::endl;
|
|
|
|
struct my_class {
|
|
int b = 24;
|
|
|
|
int f() const {
|
|
return 24;
|
|
}
|
|
|
|
void g() {
|
|
++b;
|
|
}
|
|
};
|
|
|
|
sol::state lua;
|
|
lua.open_libraries();
|
|
|
|
// "bark" namespacing in Lua
|
|
// namespacing is just putting things in a table
|
|
// forces creation if it does not exist
|
|
auto bark = lua["bark"].get_or_create<sol::table>();
|
|
// equivalent-ish:
|
|
//sol::table bark = lua["bark"].force(); // forces table creation
|
|
// equivalent, and more flexible:
|
|
//sol::table bark = lua["bark"].get_or_create<sol::table>(sol::new_table());
|
|
// equivalent, but less efficient/ugly:
|
|
//sol::table bark = lua["bark"] = lua.get_or("bark", lua.create_table());
|
|
bark.new_usertype<my_class>("my_class",
|
|
"f", &my_class::f,
|
|
"g", &my_class::g); // the usual
|
|
|
|
// can add functions, as well (just like the global table)
|
|
bark.set_function("print_my_class", [](my_class& self) { std::cout << "my_class { b: " << self.b << " }" << std::endl; });
|
|
|
|
// this works
|
|
lua.script("obj = bark.my_class.new()");
|
|
lua.script("obj:g()");
|
|
|
|
// calling this function also works
|
|
lua.script("bark.print_my_class(obj)");
|
|
my_class& obj = lua["obj"];
|
|
c_assert(obj.b == 25);
|
|
|
|
std::cout << std::endl;
|
|
|
|
return 0;
|
|
}
|