#define SOL_CHECK_ARGUMENTS

#include <catch.hpp>

#include <sol.hpp>

#include <unordered_map>

#include <vector>

struct two_things {

int a;

bool b;

};

namespace sol {

// First, the expected size

// Specialization of a struct

template <>

struct lua_size<two_things> : std::integral_constant<int, 2> {};

// Now, specialize various stack structures

namespace stack {

template <>

struct checker<two_things> {

template <typename Handler>

static bool check(lua_State* L, int index, Handler&& handler, record& tracking) {

}

};

template <>

struct getter<two_things> {

static two_things get(lua_State* L, int index, record& tracking) {

}

};

template <>

struct pusher<two_things> {

static int push(lua_State* L, const two_things& things) {

}

};

}

}

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.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);

}