/******************************************************************************
*   This file is part of TinTin++                                             *
*                                                                             *
*   Copyright 2004-2020 Igor van den Hoven                                    *
*                                                                             *
*   TinTin++ is free software; you can redistribute it and/or modify          *
*   it under the terms of the GNU General Public License as published by      *
*   the Free Software Foundation; either version 3 of the License, or         *
*   (at your option) any later version.                                       *
*                                                                             *
*   This program is distributed in the hope that it will be useful,           *
*   but WITHOUT ANY WARRANTY; without even the implied warranty of            *
*   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the             *
*   GNU General Public License for more details.                              *
*                                                                             *
*   You should have received a copy of the GNU General Public License         *
*   along with TinTin++.  If not, see https://www.gnu.org/licenses.           *
******************************************************************************/

/******************************************************************************
*                               T I N T I N + +                               *
*                                                                             *
*                      coded by Igor van den Hoven 2019                       *
******************************************************************************/

#include "tintin.h"

#include "dict.h"

int dictionary_search(char **array, int array_size, char *key)
{
        // Copyright 2014-2020 Igor van den Hoven

	register int mid, i, bot;
	register char val;

	bot = 0;
	i = array_size - 1;
	mid = i / 2;

	while (mid)
	{
		val = strcmp(key, array[i - mid]);

		if (val < 0)
		{
			i -= mid + 1;
		}
		else if (val > 0)
		{
			bot = i - mid;
		}
		else
		{
			return i - mid;
		}
		mid = (i - bot) / 2;
	}

	if (i > bot)
	{
		val = strcmp(key, array[i]);

		if (val > 0)
		{
			return -1;
		}
		else if (val < 0)
		{
			--i;
		}
		else
		{
			return i;
		}
	}

	if (!strcmp(key, array[i]))
	{
		return i;
	}
	return -1;
}

void dictionary_lowerstring(char *in, char *out)
{
	char *pti, *pto;

	pti = in;
	pto = out;

	while (*pti)
	{
		if (isalpha(*pti))
		{
			*pto++ = tolower(*pti++);
		}
		else
		{
			pti++;
		}
	}
	*pto = 0;
}

int spellcheck_count(struct session *ses, char *in)
{
	char *arg, arg1[BUFFER_SIZE], arg2[BUFFER_SIZE];
	int cnt, hash, index;

	cnt = 0;
	arg = in;

	while (*arg)
	{
		arg = get_arg_in_braces(ses, arg, arg1, GET_ONE);

		dictionary_lowerstring(arg1, arg2);

		if (isalpha(*arg2))
		{
			hash = *arg2 - 'a';

			index = dictionary_search(wordlist[hash], wordlist_size[hash], arg2 + 1);

			if (index == -1)
			{
				cnt++;
			}
		}

		if (*arg == COMMAND_SEPARATOR)
		{
			arg++;
		}
	}
	return cnt;
}

DO_COMMAND(do_dictionary)
{
	char arg1[BUFFER_SIZE], arg2[BUFFER_SIZE], arg3[BUFFER_SIZE];
	int hash, size, index;

	sub_arg_in_braces(ses, arg, arg1, GET_ALL, SUB_VAR|SUB_FUN);

	if (*arg1 == 0 || !isalpha(*arg1))
	{
		show_message(ses, LIST_COMMAND, "#SYNTAX: #DICTIONARY {WORD}");

		return ses;
	}

	arg = arg1;

	while (*arg)
	{
		arg = get_arg_in_braces(ses, arg, arg2, GET_ONE);

		dictionary_lowerstring(arg2, arg3);

		if (isalpha(*arg3))
		{
			hash = *arg3 - 'a';

			size = wordlist_size[hash];

			index = dictionary_search(wordlist[hash], size, arg3 + 1);

			if (index == -1)
			{
				tintin_printf2(ses, "\e[1;31m%s", arg2);
			}
			else
			{
				tintin_printf2(ses, "\e[1;32m%s", arg2);
			}
		}

		if (*arg == COMMAND_SEPARATOR)
		{
			arg++;
		}
	}
	return ses;
}