#include "header.h"

// Function for Optimization Function B
// {0,0,0} compute f, df, and ddf
// {0,0,1} compute f, and df only
// {0,1,1} compute f only
// {0,1,0} compute f, and ddf only

int fB(Vector x,float *f,Vector *df,Matrix *ddf,Int3 spec)
{
	int i,j;
	float ans=0.0, tmp=0.0;
	int n=x.n;

	if(spec.f==0)           // spec.f==0 calculate function value f(x)
	{
		for(i=1;i<n-1;i++)
		{
			ans+=(float)sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]));
		}
		*f=ans;
		printf("f(x)=%f\n\n",*f);
	}

	if(spec.df==0)           // spec.df==0 calculate derivarive function value df(x)
	{
		for(i=0;i<n;i++)
		{
		    tmp=0;	
		    if(i>2) tmp+=(float)cos(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1];
		    if(i>1 & i<n-1) tmp+=(float)cos(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]));
		    if (i<n-2) tmp+=(float)cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(-sin(x.fp[i]-x.fp[i+1]));
		    (*df).fp[i]=tmp;	
		}
	(*df).n=n;
	printf("df(x)=\n");
	PrintVector(*df);
	printf("\n");
	}

	if(spec.ddf==0)           // spec.ddf==0 calculate derivative of derivarive function value ddf(x)
	{
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{		
				tmp=0;
				if(j==i-2)
				{
					if(i>2) tmp=sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*sin(x.fp[i-2]-x.fp[i-1]);
				}
				else if(j==i+2)
				{
					if(i<n-2) tmp=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*x.fp[i+1]*sin(x.fp[i]-x.fp[i+1]);
				}
				else if(j==i-1)
				{
					if(i>2) tmp+=-sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*(x.fp[i-1]+sin(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1]+cos(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]));
					if(i>1 & i<n-1) tmp+=sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*sin(x.fp[i-1]-x.fp[i]);
				}
				else if(j==i+1)
				{
					if(i>1 & i<n-1) tmp+=-sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*x.fp[i];
					if(i<n-2)	  tmp+=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(x.fp[i+2]+sin(x.fp[i]-x.fp[i+1]))*sin(x.fp[i]-x.fp[i+1])+cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*cos(x.fp[i]-x.fp[i+1]);
				}
				else if(j==i)
				{
					if(i>2)	tmp+=-sin(x.fp[i-1]*x.fp[i]+cos(x.fp[i-2]-x.fp[i-1]))*x.fp[i-1];
					if(i>1 & i<n-1) tmp+=-sin(x.fp[i]*x.fp[i+1]+cos(x.fp[i-1]-x.fp[i]))*(x.fp[i+1]+sin(x.fp[i-1]-x.fp[i]));
					if(i<n-2) tmp+=sin(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*sin(x.fp[i]-x.fp[i+1])*(-sin(x.fp[i]-x.fp[i+1]))+cos(x.fp[i+1]*x.fp[i+2]+cos(x.fp[i]-x.fp[i+1]))*(-cos(x.fp[i]-x.fp[i+1]));		
				}
				else tmp=0;
				(*ddf).fp[i*n+j]=tmp;	
			}
		}
	(*ddf).n=n;
	(*ddf).m=n;
	printf("ddf(x)=\n");
	PrintMatrix(*ddf);
	printf("\n");

	}
	return 0;
}