task7

#include "stdafx.h"
#pragma once
#include <ppl.h>
#define _USE_MATH_DEFINES
#include <iostream>
#include <cmath>
#include <time.h>


using namespace std;

using namespace concurrency;

typedef double(*Double_Func_Double)(double);
double Simps(double a, double b, int N, Double_Func_Double);
double Concurrent_Simps(double a, double b, int N, Double_Func_Double);

namespace MethodCall {
	static void *ObjAddr = nullptr;

	template <class Ty>
	double Sub_Int_Func(double x) {
		return (*((Ty*)ObjAddr))(x);
	}
	template <class Ty>
	double Simpson(double a, double b, int N, Ty const &Obj) {
		ObjAddr = (void *)&Obj;
		return Simps(a, b, N, Sub_Int_Func<Ty>);
	}
	template <class Ty>
	double Concurrent_Simpson(double a, double b, int N, Ty const &Obj) {
		ObjAddr = (void*)&Obj;
		return Concurrent_Simps(a, b, N, Sub_Int_Func<Ty>);
	}
};


double Simps(double a, double b, int N, Double_Func_Double Func) {
	double h = (b - a) / (2 * N);
	double S1 = 0, S2 = 0;
	for (int k = 1; k < N; k++) {
		double Tmp = a + (2 * k - 1) * h;
		S1 += Func(Tmp);
		S2 += Func(Tmp + h);
	}
	S1 += Func(b - h);
	return h * (Func(a) + Func(b) + 4.0 * S1 + 2.0 * S2) / 3.0;
}

double Concurrent_Simps(double a, double b, int N, Double_Func_Double Func) {
	double h = (b - a) / (2 * N);
	combinable<double> CS1([]() {return 0.0; }), CS2([]() {return 0.0; });
	parallel_for(1, N, [a, h, Func, &CS1, &CS2](int k) {
		double Tmp = a + (2 * k - 1) * h;
		CS1.local() += Func(Tmp);
		CS2.local() += Func(Tmp + h); });
	double S1 = CS1.combine([](double x, double y) {return x + y; });
	double S2 = CS2.combine([](double x, double y) {return x + y; });
	S1 += Func(b - h);
	return h * (Func(a) + Func(b) + 4.0 * S1 + 2.0 * S2) / 3.0;
}


class My_Class {
private:
	double y;
	const int NNN = 200000;
	const double _Inf = 5000.0;
public:
	My_Class(double _y = 0.0) { y = _y; }

	double Sub_Int_Func(double x) {
		double Tmp = 15 * log(10.0) + log(abs(x)) - sqrt(x);
		int N = Tmp > 0 ? ceil(Tmp * Tmp + 1) : 1;
		double P = 1 / (exp(-sqrt(abs(x))) + exp(sqrt(abs(x))));
		double Tmp2 = y * y + x * x;
		for (int k = 0; k <= N; k++)
			P *= cos(x / (Tmp2 + exp(sqrt((double)k))));
		return P;
	}

	double Quad() {
		return MethodCall::Simpson(0.0, _Inf, NNN, [this](double x) {return Sub_Int_Func(x); });
	}

	double Concurrent_Quad()
	{
		return MethodCall::Concurrent_Simpson(0.0, _Inf, NNN, [this](double x) {return Sub_Int_Func(x); });
	}
};

int main(void)
{
	double y;
	cout << "y = "; cin >> y;
	My_Class TObj(y);
	double Tms = clock();
	double F = TObj.Quad();
	Tms = (clock() - Tms) / CLOCKS_PER_SEC;
	cout.precision(8);
	cout << endl << "F = " << F << endl << "Time = " << Tms << "sec" << endl << endl;
	Tms = clock();
	F = TObj.Concurrent_Quad();
	Tms = (clock() - Tms) / CLOCKS_PER_SEC;
	cout << "F = " << F << endl << "Time = " << Tms << "sec" << endl;
	return 0;
}