#include "history.h"
#include "util.h"

#include <string.h>
#include <wchar.h>

void
history_init(struct history *history)
{
	list_init(&history->list);
	history->input = inputln_alloc();
	history->sel = history->input;
}

void
history_submit(struct history *history)
{
	/* if chose from history free input */
	if (history->sel != history->input) {
		link_pop(LINK(history->input));
		inputln_free(history->input);
	}

	/* pop first in case already in history */
	link_pop(LINK(history->sel));
	history_add(history, history->sel);

	/* create new input buf and add to hist */
	history->input = inputln_alloc();
	history->sel = history->input;
	history_add(history, history->sel);
}

void
history_free(struct history *history)
{
	struct link *iter, *next;
	struct link *ln;

	ln = link_pop(LINK(history->input));
	inputln_free(UPCAST(ln, struct inputln));

	list_free(&history->list, (link_free_func) inputln_free,
		LINK_OFFSET(struct inputln));

	history->input = NULL;
	history->sel = NULL;
}

struct inputln *
history_list_prev(struct inputln *cur, const wchar_t *search)
{
	struct link *iter;
	struct inputln *ln;

	for (iter = cur->link.prev; iter && iter->prev; iter = iter->prev) {
		ln = UPCAST(iter, struct inputln);
		if (!search || !*search || wcsstr(ln->buf, search))
			return ln;
	}

	return cur;
}

struct inputln *
history_list_next(struct inputln *cur, const wchar_t *search)
{
	struct link *iter;
	struct inputln *ln;

	for (iter = cur->link.next; iter; iter = iter->next) {
		ln = UPCAST(iter, struct inputln);
		if (!search || !*search || wcsstr(ln->buf, search))
			return ln;
	}

	return cur;
}

void
history_prev(struct history *history)
{
	history->sel = history_list_prev(history->sel, history->input->buf);
}

void
history_next(struct history *history)
{
	history->sel = history_list_next(history->sel, history->input->buf);
}

void
history_add(struct history *history, struct inputln *line)
{
	struct inputln *ln;
	struct link *back;

	if (list_len(&history->list) == HISTORY_MAX) {
		/* pop last item to make space */
		back = list_pop_back(&history->list);
		inputln_free(UPCAST(back, struct inputln));
	}

	list_push_front(&history->list, LINK(line));
}

void
inputln_init(struct inputln *ln)
{
	ln->buf = NULL;
	ln->len = 0;
	ln->cap = 0;
	ln->cur = 0;
	ln->link = LINK_EMPTY;
}

struct inputln *
inputln_alloc(void)
{
	struct inputln *ln;

	ln = malloc(sizeof(struct inputln));
	ASSERT(ln != NULL);
	inputln_init(ln);
	inputln_resize(ln, 128);

	return ln;
}

void
inputln_free(struct inputln *ln)
{
	free(ln->buf);
	free(ln);
}

void
inputln_left(struct inputln *ln)
{
	ln->cur = MAX(0, ln->cur-1);
}

void
inputln_right(struct inputln *ln)
{
	ln->cur = MIN(ln->len, ln->cur+1);
}

void
inputln_addch(struct inputln *line, wchar_t c)
{
	int i;

	if (line->len + 1 >= line->cap) {
		line->cap *= 2;
		line->buf = realloc(line->buf,
			line->cap * sizeof(wchar_t));
	}

	for (i = line->len; i > line->cur; i--)
		line->buf[i] = line->buf[i-1];
	line->buf[line->cur] = c;

	line->len++;
	line->cur++;

	line->buf[line->len] = '\0';
}

void
inputln_del(struct inputln *line, int n)
{
	int i;

	if (!line->cur) return;

	n = MIN(n, line->cur);
	for (i = line->cur; i <= line->len; i++)
		line->buf[i-n] = line->buf[i];

	for (i = line->len - n; i <= line->len; i++)
		line->buf[i] = 0;

	line->len -= n;
	line->cur -= n;
}

void
inputln_copy(struct inputln *dst, struct inputln *src)
{
	if (dst->buf) {
		free(dst->buf);
		dst->buf = NULL;
	}
	dst->len = src->len;
	dst->buf = wcsdup(src->buf);
	ASSERT(dst->buf != NULL);
	dst->cap = src->len + 1;
	dst->cur = dst->len;
}

void
inputln_replace(struct inputln *line, const wchar_t *str)
{
	free(line->buf);
	line->buf = wcsdup(str);
	ASSERT(line->buf != NULL);
	line->len = wcslen(str);
	line->cap = line->len + 1;
	line->cur = line->len;
}

void
inputln_resize(struct inputln *ln, size_t size)
{
	ASSERT(size != 0);

	ln->cap = size;
	ln->buf = realloc(ln->buf, ln->cap * sizeof(wchar_t));
	ASSERT(ln->buf != NULL);
	ln->len = MIN(ln->len, ln->cap-1);
	ln->buf[ln->len] = '\0';
}