/* Named variable manager V0.31 25/8/04
   See nvar.h for docs
   Copyright 2008 Jeffrey Lee
   This file is part of WOUM.
   WOUM 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.
   WOUM 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 WOUM.  If not, see <http://www.gnu.org/licenses/>.
*/

#ifndef _NVAR_C
#define _NVAR_C

#include <stdlib.h>
#include <string.h>

#include "nvar.h"

typedef struct {
	nvar_type *type;
	void *data;
	char name[0];
} nvar;

nvars *nvar_new()
{
	return fbll_new(64);
}

void nvar_delete(nvars *n)
{
	nvar *v;
	if (n)
		while (fbll_size(n))
		{
			v = fbll_head(n);
			(v->type->remove)(n,v->data);
			free(v);
			fbll_removehead(n);
		}
	fbll_delete(n);
}

int nvar_add(nvars *n,char *name,nvar_type *type,...)
{
	nvar *v;
	va_list l;
	if ((n == 0) || (name == 0) || (type == 0))
		return -1;
	v = malloc(sizeof(nvar)+strlen(name)+1);
	if (v == 0)
		return -1;
	v->type = type;
	strcpy(v->name,name);
	if (fbll_addhead(n,v))
	{
		free(v);
		return -1;
	}
	va_start(l,type);
	v->data = (type->add)(n,l);
	return fbll_size(n)-1; /* The index of the item, relative to the tail */
}

int nvar_find(nvars *n,char *name)
{
	int i;
	if ((n == 0) || (name == 0))
		return -1;
	for (i=fbll_size(n)-1;i>=0;i--)
		if (strcmp(((nvar *) fbll_peektail(n,i))->name,name) == 0)
			return i;
	return -1;
}

void *nvar_read(nvars *n,int i)
{
	nvar *v;
	if ((n == 0) || (i < 0) || (i >= fbll_size(n)))
		return 0;
	v = fbll_peektail(n,i);
	if (v->type->read)
		return (v->type->read)(n,&v->data);
	else
		return 0;
}

int nvar_set(nvars *n,int i,...)
{
	nvar *v;
	va_list l;
	if ((n == 0) || (i < 0) || (i >= fbll_size(n)))
		return 1;
	v = fbll_peektail(n,i);
	va_start(l,i);
	if (v->type->set)
		return (v->type->set)(n,&v->data,l);
	else
	{
		va_end(l);
		return 1;
	}
}

int nvar_size(nvars *n)
{
	if (n == 0)
		return 0;
	return fbll_size(n);
}

char *nvar_getname(nvars *n,int i)
{
	nvar *v;
	if ((n == 0) || (i < 0) || (i >= fbll_size(n)))
		return 0;
	v = fbll_peektail(n,i);
	return v->name;
}

nvar_type *nvar_gettype(nvars *n,int i)
{
	nvar *v;
	if ((n == 0) || (i < 0) || (i >= fbll_size(n)))
		return 0;
	v = fbll_peektail(n,i);
	return v->type;
}

static int nvar_cmp(const void *a,const void *b)
{
	nvar *aa,*bb;
	aa = *((nvar **) a);
	bb = *((nvar **) b);
	return strcmp(aa->name,bb->name);
}

void nvar_sort(nvars *n)
{
	nvar **vars;
	int i,num;
	/* Sort the variables into alphabetical order, so a binary search can be used */
	vars = malloc(4*fbll_size(n));
	num = fbll_size(n);
	for (i=0;i<num;i++)
	{
		vars[i] = fbll_tail(n);
		fbll_removetail(n);
	}
	qsort(vars,i,4,nvar_cmp);
	for (i=0;i<num;i++)
		fbll_addhead(n,vars[i]); /* nvar_read(n,0) will return the first one alphabetically */
	free(vars);
}                                          
                                           
int nvar_bfind(nvars *n,char *name)        
{                                          
	/* Do a binary search */
	int min,max,pos,cmp;
	min = 0;
	max = fbll_size(n);
	while (max != min)
	{                                  
		pos = (min+max)/2;
		cmp = strcmp(((nvar *) fbll_peektail(n,pos))->name,name);
		if (cmp == 0)
			return pos; /* Got a hit */
		if (cmp > 0)
			max = pos; /* Go down */
		else
			min = pos+1; /* Go up */
	}
	return -1; /* Not found */
}

void nvar_remove(nvars *n,int i)
{
	nvars **vars;
	int j,num;
	if ((n == 0) || (i < 0) || (i >= fbll_size(n)))
		return;
	vars = malloc(4*fbll_size(n));
	num = fbll_size(n);
	for (j=0;j<num;j++)
	{
		vars[j] = fbll_tail(n);
		fbll_removetail(n);
	}
	for (j=0;j<num;j++)
		if (i != j)
			fbll_addhead(n,vars[j]);
	free(vars);
}

#endif
