/******************************************************************************
	Project: 	MicroMacro
	Author: 	SolarStrike Software
	URL:		www.solarstrike.net
	License:	Modified BSD (see license.txt)
******************************************************************************/

#include "table_addon.h"
#include "error.h"
#include "strl.h"

#include <string.h>
#include <string>
#include <cmath>

extern "C"
{
	#include <lua.h>
	#include <lauxlib.h>
	#include <lualib.h>
}


int Table_addon::regmod(lua_State *L)
{
	lua_getglobal(L, TABLE_MODULE_NAME);

	lua_pushcfunction(L, Table_addon::copy);
	lua_setfield(L, -2, "copy");

	lua_pushcfunction(L, Table_addon::find);
	lua_setfield(L, -2, "find");

	lua_pushcfunction(L, Table_addon::print);
	lua_setfield(L, -2, "print");

	lua_pushcfunction(L, Table_addon::lists);
	lua_setfield(L, -2, "lists");

	lua_pop(L, 1); // Pop module off stack

	return MicroMacro::ERR_OK;
}

/*	table.copy(table orig)
	Returns:	table

	Actually does a full copy of a table, instead of referencing the original.
	This also recursively copies sub-tables.
*/
int Table_addon::copy(lua_State *L)
{
	int top = lua_gettop(L);

	lua_newtable(L);
	int newtab_index = lua_gettop(L);

	// Copy methods & variables
	lua_pushnil(L);
	while( lua_next(L, top) )
	{
		lua_pushvalue(L, -2); // Make a copy of key for next iteration
		lua_insert(L, -2); // Move our copy down the stack so it remains after the following

		if( lua_istable(L, -1) )
		{ // We need to copy this sub-table
			copy(L);
		}

		lua_settable(L, newtab_index); // We can just copy it directly
	}

	// Copy metatable
	lua_getmetatable(L, 1);
	lua_setmetatable(L, -2);

	return 1;
}

/*	table.find(table haystack, value)
	Returns (on success):	key
	Returns (on failure):	nil

	Checks table 'haystack' for anything that matches 'value'.
	If found, returns the table's key that contains the value.
	If no match is found, returns nil.
*/
int Table_addon::find(lua_State *L)
{
	int top = lua_gettop(L);
	if( top != 2 )
		wrongArgs(L);

	checkType(L, LT_TABLE, 1);
	// Index 2 can be anything

	int valtype = lua_type(L, 2);

	lua_pushnil(L);
	while( lua_next(L, 1) )
	{
		if( lua_type(L, -1) == valtype )
		{ // Types match, compare value
			bool found = false;
			switch( valtype )
			{
				case LUA_TNUMBER:
				{
					double usernum = lua_tonumber(L, 2);
					double tabnum = lua_tonumber(L, -1);
					if( fabs(usernum-tabnum) < DOUBLE_EPSILON ) // Compare values, make sure within EPSILON
						found = true;
				}
				break;
				case LUA_TSTRING:
				{
					const char *userstr = lua_tostring(L, 2);
					const char *tabstr = lua_tostring(L, -1);

					if( strcmp(userstr, tabstr) == 0 )
						found = true;
				}
				case LUA_TNIL:
				{ // Yes, this can occasionally happen if GC hasn't had a chance to remove nils
					if( lua_isnil(L, -1) )
						found = true;
				}
				break;
				default: // Not a number or string, just check pointer
				{
					int *userptr = (int *)lua_topointer(L, 2);
					int *tabptr = (int *)lua_topointer(L, -1);

					if( *userptr == *tabptr )
						found = true;
				}
				break;
			}

			if( found )
			{
				lua_pop(L, 1); // Pop value, return key
				return 1;
			}
		}

		lua_pop(L, 1); // Pop value, keep key for next iteration
	}

	return 0;
}

/*	table.print(table tab [, number depth])
	Returns:	nil

	Recursively dump the table to the standard output.
	When called from Lua, you probably shouldn't include the depth...
*/
int Table_addon::print(lua_State *L)
{
	int depth = 0;
	if( lua_gettop(L) >= 2 && lua_isnumber(L, -1) )
	{
		depth = lua_tointeger(L, -1);
		lua_pop(L, 1); // We can pop depth; don't need it
	}
	else
		depth = 0;

	int tabIndex = lua_gettop(L);
	checkType(L, LT_TABLE, tabIndex);

	// Now iterate this table
	lua_pushnil(L);
	while( lua_next(L, tabIndex) )
	{
		// Print descriptor
		std::string depthStr = std::string(depth, '\t');

		std::string key;
		if( lua_isnumber(L, -2) )
		{
			// We need to convert this to a string, but DO NOT CALL lua_tostring()!
			// Doing so will modify the key on stack and confuse lua_next()
			int index = lua_tointeger(L, -2);
			char buffer[32];
			slprintf(buffer, sizeof(buffer)-1, "%d", index);
			key = buffer;
		}
		else
			key = lua_tostring(L, -2);

		if( lua_istable(L, -1) && depth < TABLE_PRINT_MAXDEPTH )
		{
			printf("%s%s:\ttable: 0x%p\n", depthStr.c_str(), key.c_str(), lua_topointer(L, -1));

			if( lua_topointer(L, -1) != lua_topointer(L, tabIndex) )
			{
				// Recurse
				lua_pushinteger(L, depth+1); // Push depth
				print(L);
			}
		}
		else if( lua_isfunction(L, -1) )
			printf("%s%s:\tfunction: 0x%p\n", depthStr.c_str(), key.c_str(), lua_topointer(L, -1));
		else if( lua_isuserdata(L, -1) )
			printf("%s%s:\tuserdata: 0x%p\n", depthStr.c_str(), key.c_str(), lua_topointer(L, -1));
		else if( lua_isboolean(L, -1) )
		{
			char *strValue;
			if( lua_toboolean(L, -1) )
				strValue = "true";
			else
				strValue = "false";
			printf("%s%s:\t\%s\n", depthStr.c_str(), key.c_str(), strValue);
		}
		else if( lua_isnumber(L, -1) )
			printf("%s%s:\t\%s\n", depthStr.c_str(), key.c_str(), lua_tostring(L, -1));
		else if( lua_isstring(L, -1) )
			printf("%s%s:\t\"%s\"\n", depthStr.c_str(), key.c_str(), lua_tostring(L, -1));
		else
			printf("%s%s:\t%s\n", depthStr.c_str(), key.c_str(), (char *)lua_tostring(L, -1));

		// Pop value, keep key
		lua_pop(L, 1);
	}


	return 0;
}

/*	table.lists(table tab, string key[, string value])
	Returns:	table

	Return a new table (plain array or dictionary) based on the input
	table and requested key/value. 'tab' must be a table of tables!

	If only 'key' is given, the returned table will be an array of
	just the contents of subvalues of keys.

	If 'key' and 'value' are given, a new dictionary is returned, where
	the new key is the value of 'key' and the new value is the value of 'value'.

	That makes absolutely no sense, so just look at this example instead:
	local tab = {
		[1] = { name = "Bob", age = 30, id = 123456 },
		[2] = { name = "Jane", age = 27, id = 654321 },
		...
	}


	local newTab = table.lists(tab, 'name');
	'newTab' would now contain:
	{
		[1] = "Bob",
		[2] = "Jane",
	}

	local newTab = table.lists(tab, 'id', 'name');
	'newTab' would now contain:
	{
		[123456] = "Bob",
		[654321] = "Jane",
	}
*/
int Table_addon::lists(lua_State *L)
{
	int top = lua_gettop(L);
	if( top != 2 && top != 3 )
		wrongArgs(L);

	checkType(L, LT_STRING, 2);
	if( top > 2 )
		checkType(L, LT_STRING, 3);

	const char *keyName = lua_tostring(L, 2);

	lua_newtable(L);
	int newtab_index = lua_gettop(L);
	int indexCount = 0;

	// Iterate over original table
	lua_pushnil(L);
	while( lua_next(L, 1) )
	{
		if( lua_istable(L, -1) )
		{
			if( top == 2 )
			{
				lua_pushinteger(L, ++indexCount);		// Push new key

				lua_pushstring(L, keyName);				// Look up the value inside this table.
				lua_gettable(L, -3);
			}
			else
			{
				lua_pushstring(L, keyName);				// Look up new key from table
				lua_gettable(L, -2);					// Push it.

				lua_pushstring(L, lua_tostring(L, 3));	// Look up the value inside this table.
				lua_gettable(L, -3);
			}

			lua_settable(L, newtab_index);				// Now set it to our new table
		}

		lua_pop(L, 1); // Pop old value; our index needs to be on top of the stack (so we can lua_next)
	}

	return 1;
}
