#define SOL_CHECK_ARGUMENTS 1 #define SOL_ENABLE_INTEROP 1 #include #include #include #include struct two_things { int a; bool b; }; namespace sol { // First, the expected size // Specialization of a struct template <> struct lua_size : std::integral_constant {}; // Then, the expected type template <> struct lua_type_of : std::integral_constant {}; // Now, specialize various stack structures namespace stack { template <> struct checker { template static bool check(lua_State* L, int index, Handler&& handler, record& tracking) { // Check first and second second index for being the proper types bool success = stack::check(L, index, handler) && stack::check(L, index + 1, handler); tracking.use(2); return success; } }; template <> struct getter { static two_things get(lua_State* L, int index, record& tracking) { // Get the first element int a = stack::get(L, index); // Get the second element, // in the +1 position from the first bool b = stack::get(L, index + 1); // we use 2 slots, each of the previous takes 1 tracking.use(2); return two_things{ a, b }; } }; template <> struct pusher { static int push(lua_State* L, const two_things& things) { int amount = stack::push(L, things.a); amount += stack::push(L, things.b); // Return 2 things return amount; } }; } // namespace stack } // namespace sol TEST_CASE("customization/split struct", "using the newly documented customization points to handle different kinds of classes") { sol::state lua; // Create a pass-through style of function lua.safe_script("function f ( a, b, c ) return a + c, b end"); lua.set_function("g", [](int a, bool b, int c, double d) { return std::make_tuple(a + c, b, d + 2.5); }); // get the function out of Lua sol::function f = lua["f"]; sol::function g = lua["g"]; two_things thingsf = f(two_things{ 24, true }, 1); two_things thingsg; double d; sol::tie(thingsg, d) = g(two_things{ 25, false }, 2, 34.0); REQUIRE(thingsf.a == 25); REQUIRE(thingsf.b); REQUIRE(thingsg.a == 27); REQUIRE_FALSE(thingsg.b); REQUIRE(d == 36.5); }