#include<stdlib.h>
#include<math.h>
#include<string.h>
#include "general.h"
#include "vertex.h"
#include<stdio.h>

/* Argument je struktura vlist in stevilo vertexov, ki jih zelimo dati v
 * vlist je lahko NULL, N mora biti vecje od 0. Ce vlist obstaja, potem resizamo
 * vlist na stevilo N.
 */
ts_vertex **init_vertex_list(ts_uint N){	
	ts_int i;
    ts_vertex **vlist;
	if(N==0){
		err("Initialized vertex list with zero elements. Pointer set to NULL");
		vlist=NULL;
		return NULL;
	}
		vlist=(ts_vertex **)malloc(N*sizeof(ts_vertex *));
        if(vlist==NULL)
            fatal("Fatal error reserving memory space for vertex list! Could number of requsted vertices be too large?", 100);
        
        for(i=0;i<N;i++){
               vlist[i]=init_vertex(i); 
        }
	return vlist;
}

ts_vertex *init_vertex(ts_uint idx){
    ts_vertex *vtx;
    vtx=(ts_vertex *)malloc(sizeof(ts_vertex));
    if(vtx==NULL)
        fatal("Fatal error reserving memory space for ts_vertex! Memory full?", 100);
    vtx->idx=idx;
    return vtx;
}

/*
ts_bool vtx_set_global_values(ts_vertex **vlist, ts_vesicle *vesicle){
    ts_double xk=vesicle->bending_rigidity;
    ts_uint i;
    for(i=0;i<vesicle->vlist.n;i++){
        vlist[i]->xk=xk;
    }
    return TS_SUCCESS;
}
*/



ts_bool vtx_add_neighbour(ts_vertex **vtx, ts_vertex **nvtx){
    ts_uint i;
    /* no neighbour can be null! */
    if(vtx==NULL || nvtx==NULL) return TS_FAIL;
    
    /*if it is already a neighbour don't add it to the list */
    for(i=0; i<(*vtx)->neigh_no;i++){
        if((*vtx)->neigh[i]==nvtx) return TS_FAIL;
    }
    ts_uint nn=(*vtx)->neigh_no++;
    (*vtx)->neigh=(ts_vertex ***)realloc((*vtx)->neigh, nn*sizeof(ts_vertex **));
    (*vtx)->neigh[nn]=nvtx;

    /* pa se sosedu dodamo vertex */
    /*if it is already a neighbour don't add it to the list */
    for(i=0; i<(*nvtx)->neigh_no;i++){
        if((*nvtx)->neigh[i]==vtx) return TS_FAIL;
    } 
    nn=(*nvtx)->neigh_no++;
    (*nvtx)->neigh=(ts_vertex ***)realloc((*nvtx)->neigh, nn*sizeof(ts_vertex **));
    (*nvtx)->neigh[nn]=vtx;


/* Ustvari bond in doloci dolzino */

    return TS_SUCCESS;
}


ts_bool vtx_free(ts_vertex **vtx){
    if((*vtx)->neigh!=NULL)   free((*vtx)->neigh);
    if((*vtx)->tristar!=NULL) free((*vtx)->tristar);
    if((*vtx)->bond!=NULL)    free((*vtx)->bond);
    if((*vtx)->cell!=NULL)    free((*vtx)->cell);
    free(*vtx);
    return TS_SUCCESS;
}


inline ts_double vertex_distance_sq(ts_vertex **vtx1, ts_vertex **vtx2){
    ts_double dist;
#ifdef TS_DOUBLE_DOUBLE
    dist=pow((*vtx1)->x-(*vtx2)->x,2) + pow((*vtx1)->y-(*vtx2)->y,2) + pow((*vtx1)->z-(*vtx2)->z,2);
#endif
#ifdef TS_DOUBLE_LONGDOUBLE
    dist=powl((*vtx1)->x-(*vtx2)->x,2) + powl((*vtx1)->y-(*vtx2)->y,2) + powl((*vtx1)->z-(*vtx2)->z,2);
#endif
#ifdef TS_DOUBLE_FLOAT
    dist=powf((*vtx1)->x-(*vtx2)->x,2) + powf((*vtx1)->y-(*vtx2)->y,2) + powf((*vtx1)->z-(*vtx2)->z,2);
#endif
    return(dist);
}