Test-Case-Generator/Polynomial.cpp at master · shriramch/Test-Case-Generator · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
# include "Polynomial.h"

// A constructor
Rpolynomial :: Rpolynomial()
{
	N = d = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random polynomial
void Rpolynomial :: generate(int n, Timer &t1, int l, int r)
{
	double f = (float)(rand() % 12);
	m.clear();
	discrete_distribution <int> d1{f, 24.0};
	uniform_int_distribution <int> distribution(l, r);
	for(int i = 0; i < n + 1; i++)
	{
		int x = d1(generator);
		if(x)
		{
			int coeff = distribution(generator);
			m[i] = coeff;
		}
		t1.time(1);
	}
	fout << m.size() << '\n';
	for(int i = 0; i < n + 1; i++)
	{
		if(m.find(i) != m.end())
		{
			fout << i << ' ' << m[i];
			if(d)
				fout << '\n';
			else
				fout << " \n"[i == n];
		}
		t1.time(1);
	}
}

// A function that generates polynomial test case files
void Rpolynomial :: setCase(string &s, int T, int t, int n, int l, int r, int sz, int D, string &folder_name)
{
	d = D;
	int pt = FileOp :: printT(t);
	cout << "Generating polynomial test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += (times[j] + 1);
		Timer t1(2 *tcnt);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << ' ';
			generate(times[j], t1, l, r);
		}
		fout.close();
	}
	cout << "polynomial generation completed." << '\n';
}

// A constructor
Rfpolynomial :: Rfpolynomial()
{
	N = d = 0;
	generator.seed(system_clock :: now().time_since_epoch().count());
}

// A function that generates a random floating point polynomial
void Rfpolynomial :: generate(int n, Timer &t1, float l, float r)
{
	double f = (float)(rand() % 12);
	m.clear();
	discrete_distribution <int> d1{f, 24.0};
	uniform_real_distribution <float> distribution(l, r);
	for(int i = 0; i < n + 1; i++)
	{
		int x = d1(generator);
		if(x)
		{
			float coeff = distribution(generator);
			m[i] = coeff;
		}
		t1.time(1);
	}
	fout << m.size() << '\n';
	for(int i = 0; i < n + 1; i++)
	{
		if(m.find(i) != m.end())
		{
			fout << i << ' ' << m[i];
			if(d)
				fout << '\n';
			else
				fout << " \n"[i == n];
		}
		t1.time(1);
	}
}

// A function that generates floating point polynomial test case files
void Rfpolynomial :: setCase(string &s, int T, int t, int n, float l, float r, int sz, int D, string &folder_name)
{
	d = D;
	int pt = FileOp :: printT(t);
	FileOp :: fixOutprecision(fout);
	cout << "Generating fpolynomial test files: " << '\n';
	for(int i = 0; i < T; i++)
	{
		FileOp :: setFile(folder_name, s, i, fout);
		vector <int> times = numOp :: giveRints(t, n, sz);
		N = times.size();
		if(pt)
			fout << N << '\n';
		int tcnt = 0;
		for(int j = 0; j < N; j++)
			tcnt += (times[j] + 1);
		Timer t1(2 *tcnt);
		for(int j = 0; j < N; j++)
		{
			fout << times[j] << ' ';
			generate(times[j], t1, l, r);
		}
		fout.close();
	}
	cout << "fpolynomial generation completed." << '\n';
}