#include "globals.h"

WORD ConvertHotKeyToControl(WORD HK)
{
	WORD R = 0;
	if ((HK & MOD_CONTROL) == MOD_CONTROL) R = R | HOTKEYF_CONTROL;
	if ((HK & MOD_ALT) == MOD_ALT) R = R | HOTKEYF_ALT;
	if ((HK & MOD_SHIFT) == MOD_SHIFT) R = R | HOTKEYF_SHIFT;
	return R;
}

WORD ConvertControlToHotKey(WORD HK)
{
	WORD R = 0;
	if ((HK & HOTKEYF_CONTROL) == HOTKEYF_CONTROL) R = R | MOD_CONTROL;
	if ((HK & HOTKEYF_ALT) == HOTKEYF_ALT) R = R | MOD_ALT;
	if ((HK & HOTKEYF_SHIFT) == HOTKEYF_SHIFT) R = R | MOD_SHIFT;
	return R;
}

void FreeSettingBlob(WORD pSize,void *pbBlob)
{
	DBVARIANT dbv = {0};
	dbv.type = DBVT_BLOB;
	dbv.cpbVal = pSize;
	dbv.pbVal = (BYTE*)pbBlob;
	db_free(&dbv);
}

void ReadSettingBlob(MCONTACT hContact, char *ModuleName, char *SettingName, WORD *pSize, void **pbBlob)
{
	DBVARIANT dbv = {0};
	dbv.type = DBVT_BLOB;
	if ( db_get(hContact, ModuleName, SettingName, &dbv)) {
		*pSize = 0;
		*pbBlob = NULL;
	}
	else {
		*pSize = LOWORD(dbv.cpbVal);
		*pbBlob = (int*)dbv.pbVal;
	}
}

void WriteSettingIntArray(MCONTACT hContact,char *ModuleName,char *SettingName,const int *Value, int Size)
{
	db_set_blob(hContact, ModuleName, SettingName, (void*)Value, sizeof(int)*Size);
}

bool ReadSettingIntArray(MCONTACT hContact,char *ModuleName,char *SettingName,int *Value, int Size)
{
	WORD sz = 4096;
	int *pData;
	ReadSettingBlob(hContact, ModuleName, SettingName, &sz, (void**)&pData);
	if (!pData)
		return false;

	bool bResult = false;

	if (sz == sizeof(int)*Size) {
		memcpy(Value, pData, sizeof(int)*Size);
		bResult = true;
	}

	FreeSettingBlob(sz,pData);
	return bResult;
}

void TreeAdd(TREEELEMENT **root, void *Data)
{
	TREEELEMENT *NTE = (TREEELEMENT*)malloc(sizeof(TREEELEMENT));
	if (NTE) {
		NTE->ptrdata = Data;
		NTE->next = *root;
		*root = NTE;
	}
}

void TreeAddSorted(TREEELEMENT **root,void *Data,int (*CompareCb)(TREEELEMENT*,TREEELEMENT*))
{
	if (!*root) {
		// list empty, just add normally
		TreeAdd(root,Data);
		return;
	}

	TREEELEMENT *NTE = (TREEELEMENT*)malloc(sizeof(TREEELEMENT));
	if (!NTE)
		return;

	NTE->ptrdata = Data;
	NTE->next = NULL;

	// insert sorted

	TREEELEMENT *Prev = NULL;
	TREEELEMENT *TTE = *root;

	while (TTE) {
		if (CompareCb(NTE, TTE) < 0) {
			if (Prev) {
				Prev->next = NTE;
				NTE->next = TTE;
			}
			else {
				// first in list
				NTE->next = TTE;
				*root = NTE;
			}
			return;
		}

		Prev = TTE;
		TTE = (TREEELEMENT*)TTE->next;
	}

	// add last
	Prev->next = NTE;
}

void TreeDelete(TREEELEMENT **root,void *iItem)
{
	TREEELEMENT *TTE = *root, *Prev = NULL;
	if (!TTE)
		return;

	while ((TTE) && (TTE->ptrdata != iItem)) {
		Prev = TTE;
		TTE = (TREEELEMENT*)TTE->next;
	}
	if (TTE) {
		if (Prev)
			Prev->next = TTE->next;
		else 
			*root = (TREEELEMENT*)TTE->next;
		SAFE_FREE((void**)&TTE);
	}
}

void *TreeGetAt(TREEELEMENT *root, int iItem)
{
	if (!root)
		return NULL;

	TREEELEMENT *TTE = root;
	int i = 0;
	while ((TTE) && (i != iItem)) {
		TTE = (TREEELEMENT*)TTE->next;
		i++;
	}
	return (!TTE) ? NULL : TTE->ptrdata;
}

int TreeGetCount(TREEELEMENT *root)
{
	if (!root)
		return 0;
	
	int i = 0;
	TREEELEMENT *TTE = root;
	while (TTE) {
		TTE = (TREEELEMENT*)TTE->next;
		i++;
	}
	return i;
}