if (fabs(m1 - m2) < DBL_EPSILON)
{
    //相等
}

string str = fmt::format("{:06.3f}", 0.23456);
// Output: 00.235

std::vector<int> v = {1, 2, 3};
str = fmt::format("{}", fmt::join(v, ", "));
// Output: "1, 2, 3"

// 发送队列锁
std::mutex m_mutex_write;
// 发送队列
std::queue< std::pair<std::shared_ptr<unsigned char[]>, DWORD> > m_queWrite;


std::shared_ptr<BYTE[]> spBuf(new BYTE[length]);
memcpy(spBuf.get(), data, length);

std::lock_guard<std::mutex> lock(m_mutex_write);
m_queWrite.push(make_pair(spBuf,length));

#include <filesystem>
using namespace std::filesystem;

// 这个坑货，快捷方式启动的时候，路径不对了
fs::path p = fs::current_path();

#include <lua/lua.hpp>

int LuaHelper::test(int x, int y)
{
	string strErr;
	lua_State* L = luaL_newstate();
	if (luaL_loadfile(L, "sum.lua") || lua_pcall(L, 0, 0, 0)) {
		strErr = "Error: failed to load sum.lua";
		return 0;
	}

	lua_getglobal(L, "sum");
	lua_pushnumber(L, x);
	lua_pushnumber(L, y);

	lua_pcall(L, 2, 1, 0);

	int result = (int)lua_tonumber(L, -1);
	lua_pop(L, 1);
	return result;
}

if (lua_istable(m_luaState,-1))
{
	// Push another reference to the table on top of the stack (so we know
	// where it is, and this function can work for negative, positive and
	// pseudo indices
	lua_pushvalue(m_luaState, -1);
	// stack now contains: -1 => table
	lua_pushnil(m_luaState);
	// stack now contains: -1 => nil; -2 => table
	while (lua_next(m_luaState, -2))
	{
		// stack now contains: -1 => value; -2 => key; -3 => table
		// copy the key so that lua_tostring does not modify the original
		lua_pushvalue(m_luaState, -2);
		// stack now contains: -1 => key; -2 => value; -3 => key; -4 => table
		string strKey = lua_tostring(m_luaState, -1);
		retVar = lua_tonumber(m_luaState, -2);
		// pop value + copy of key, leaving original key
		lua_pop(m_luaState, 2);
		// stack now contains: -1 => key; -2 => table
	}
	
}

// 建一个新表 栈高度+1, 栈顶元素是新table
// 创建一个新的table, 并把它放在栈顶. narr和nrec分别指定该table的array部分和hash部分的预分配元素数量
void lua_createtable (lua_State *L, int narr, int nrec)

// 用于设置table元素的方法
void lua_settable (lua_State *L, int index);
void lua_rawset (lua_State *L, int index);
 
void lua_setfield (lua_State *L, int index, const char *k);
void lua_rawseti (lua_State *L, int index, int n);

int lua_toboolean (lua_State *L, int index);
const char  *lua_tolstring (lua_State *L, int index, size_t *len);
lua_State   *lua_tothread (lua_State *L, int index);
lua_Number   lua_tonumber  (lua_State *L, int index);
lua_Integer  lua_tointeger (lua_State *L, int index);

int  lua_gettop    (lua_State *L);
void lua_settop    (lua_State *L, int index);
void lua_pushvalue (lua_State *L, int index);
void lua_rotate    (lua_State *L, int index, int n);
void lua_remove    (lua_State *L, int index);
void lua_insert    (lua_State *L, int index);
void lua_replace   (lua_State *L, int index);
void lua_copy      (lua_State *L, int fromidx, int toidx);

double LuaHelper::test_var()
{
	double result = 0;
	string strErr;

	/* opens Lua */
	lua_State* m_luaState = luaL_newstate();
	/* opens the standard libraries */
	luaL_openlibs(m_luaState);
	if (luaL_loadfile(m_luaState, "sum.lua") || lua_pcall(m_luaState, 0, 0, 0)) {
		strErr = lua_tostring(m_luaState, -1);
		lua_pop(m_luaState, 1);  /* pop error message from the stack */
	}
	else
	{
		double up_right1_min = 15.3456;
		double up_left1_max = 10.1324;
		double up_left1_mean = 10.12;
		double down_left1_mean = 7.12;

		lua_pushnumber(m_luaState, up_right1_min);
		lua_setglobal(m_luaState, "up_right1_min");
		lua_pushnumber(m_luaState, up_left1_max);
		lua_setglobal(m_luaState, "up_left1_max");


		// 获取函数，压入栈中  
		lua_getglobal(m_luaState, "solve_formula");
		// 调用函数，调用完成以后，会将返回值压入栈中，2表示参数个数，1表示返回结果个数。  
		int iRet = lua_pcall(m_luaState, 0, 1, 0);
		if (iRet)
		{
			// 调用出错 
			const char* pErrorMsg = lua_tostring(m_luaState, -1);

			lua_close(m_luaState);
			return -1;
		}
		if (lua_isnumber(m_luaState, -1))        //取值输出  
		{
			result = lua_tonumber(m_luaState, -1);
			string str = fmt::format("{}", result);
			lua_pop(m_luaState, 1);
		}

	}
	lua_close(m_luaState);
	return result;
}