-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtex_out.cpp
More file actions
382 lines (286 loc) · 9.29 KB
/
Copy pathtex_out.cpp
File metadata and controls
382 lines (286 loc) · 9.29 KB
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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
#include "headers/tex_out.h"
#include "headers/input_output.h"
#include "headers/DSL.h"
#include "..\UDL.h"
#include "..\err_codes.h"
#include "headers/stack.h"
#include <stdlib.h>
#include <time.h>
#include <string.h>
struct vars
{
char** data = NULL;
size_t capacity = 0;
size_t qant = 0;
};
static err copy_file (const char* to, const char* from, const char* mode);
static err derivative_tex (FILE* out, Node* tree, const char* part);
static void equation_tex (FILE* out, Node* tree, Data* data);
static char* equation_tex__ (Node* tree, int* br, Stack* mem_stk);
static char* equation_tex_ (Node* tree, Stack* mem_stk);
static void dump_vars (vars* vars);
static void add_var (vars* vars, char* var);
static void create_vars (vars* vars, int capacity);
static void find_vars (Node* tree ,vars* vars);
static void full_der (FILE* out, Node* tree, vars* vars, Data* data);
static void full_diff (FILE* out, Node* tree, char* part, Data* data);
static void tex_random_phrase (FILE* tex, Data* data);
static void clear_data (Data* data);
static void tex_teylor (FILE* out, Node* tree, vars* vars, Data* data, int accuracy);
char* equation_tex_ (Node* tree, Stack* mem_stk)
{
int br = 0;
return equation_tex__(tree, &br, mem_stk);
}
char* equation_tex__ (Node* tree, int* br, Stack* mem_stk)
{
int buf_size = 10000;
char* buf = (char*)calloc(buf_size, sizeof(char));
stack_push(mem_stk, &buf);
if (tree->data.operand == MUL || tree->data.operand == DIV)
*br = 1;
if (tree->type == OPERAND)
{
if (tree->data.operand == DIV)
{
SPRINTF(buf, buf_size, "\\cfrac {%s} {%s}", equation_tex__(tree->left, br, mem_stk), equation_tex__(tree->right, br, mem_stk));
}
else if (*br == 1 && (tree->data.operand == ADD || tree->data.operand == SUB))
{
SPRINTF(buf, buf_size, "(%s %c %s) ", equation_tex__(tree->left, br, mem_stk), tree->data.operand, equation_tex__(tree->right, br, mem_stk));
*br = 0;
}
else if (tree->data.operand == '^')
{
SPRINTF(buf, buf_size, "%s %c {%s} ", equation_tex__(tree->left, br, mem_stk), tree->data.operand, equation_tex__(tree->right, br, mem_stk));
}
else
{
SPRINTF(buf, buf_size, "%s %c %s ", equation_tex__(tree->left, br, mem_stk), tree->data.operand, equation_tex__(tree->right, br, mem_stk));
}
return buf;
}
else if (tree->type == FUNCTION)
{
*br = 0;
SPRINTF(buf, buf_size, "%s(%s) ", tree->data.function, equation_tex__(tree->right, br, mem_stk));
return buf;
}
else if (tree->type == NUM)
{
if ((tree->data.value - (int)tree->data.value) == 0)
{
SPRINTF(buf, buf_size, "%d", (int)tree->data.value);
}
else
{
SPRINTF(buf, buf_size, "%lf", tree->data.value);
}
return buf;
}
else if (tree->type == VAR)
{
SPRINTF(buf, buf_size, "%s", tree->data.var);
return buf;
}
return (char*)"UNKNOWN";
}
err copy_file (const char* to, const char* from, const char* mode)
{
FOPEN(out, to, mode);
FOPEN(in, from, "rb");
int fsize = GetFileSize(in);
char* buffer = NULL;
fill_buffer(in, &buffer);
fwrite(buffer, sizeof(char), fsize, out);
fclose(in);
fclose(out);
return SUCCESS;
}
err derivative_tex (FILE* out, Node* tree, const char* part)
{
Node* Diff = diff(tree, part);
simplifier(Diff);
Stack mem_stk = {};
stack_ctor(&mem_stk, 1);
fprintf(out, "\n\n%s", "\\begin{dmath}");
fprintf(out, "\n \\cfrac {d} {d %s}(%s) = %s", part, equation_tex_(tree, &mem_stk), equation_tex_(Diff, &mem_stk));
fprintf(out, "\n%s\n\n", "\\end{dmath}");
stack_dtor(&mem_stk);
return SUCCESS;
}
void equation_tex (FILE* out, Node* tree, Data* data)
{
Stack mem_stk = {};
stack_ctor(&mem_stk, 1);
tex_random_phrase(out, data);
fprintf(out, "\n\n%s", "\\begin{dmath}");
fprintf(out, "\n%s", equation_tex_(tree, &mem_stk));
fprintf(out, "\n%s\n\n", "\\end{dmath}");
stack_dtor(&mem_stk);
}
err diff_tex (Node* tree)
{
copy_file("tex/equation.tex", "tex/preambule_article.tex", "wb");
copy_file("tex/equation.tex", "tex/title.tex", "ab");
Data data = input_data("tex/phrases.txt");
FOPEN(out, "tex/equation.tex", "ab");
fprintf(out, "Âû÷èñëèì ïðîèçâîäíóþ ñëóäóþùåãî âûðàæåíèÿ:\n");
equation_tex(out, tree, &data);
vars vars = {};
create_vars(&vars, 3);
find_vars(tree, &vars);
for (int i = 0; i < vars.qant; i++)
{
fprintf(out, "Ïðîèçâîäíàÿ ïî %s\n", vars.data[i]);
full_diff(out, tree, vars.data[i], &data);
}
full_der(out, tree, &vars, &data);
tex_teylor(out, tree, &vars, &data, 3);
fclose(out);
copy_file("tex/equation.tex", "tex/end.tex", "ab");
return SUCCESS;
}
void full_diff (FILE* out, Node* tree, char* part, Data* data)
{
if (tree->left != NULL && tree->left->type != DEFUALT)
full_diff(out, tree->left, part, data);
if (tree->right != NULL && tree->right->type != DEFUALT)
full_diff(out, tree->right, part, data);
tex_random_phrase(out, data);
derivative_tex(out, tree, part);
}
void full_der (FILE* out, Node* tree, vars* vars, Data* data)
{
Node* Diff = NULL;
Stack mem_stk = {};
stack_ctor(&mem_stk, 1);
fprintf(out, "Ïîëíûé äèôôåðåíöèàë: \n");
fprintf(out, "\n\n%s", "\\begin{dmath}");
fprintf(out, "\n d(%s) = ", equation_tex_(tree, &mem_stk));
stack_dtor(&mem_stk);
// printf("vars.qant - %d\n", vars->qant);
for (int i = 0; i < vars->qant; i++)
{
Diff = diff(tree, vars->data[i]);
simplifier(Diff);
stack_ctor(&mem_stk, 1);
tex_random_phrase(out, data);
fprintf(out, "(%s)d%s", equation_tex_(Diff, &mem_stk), vars->data[i]);
stack_dtor(&mem_stk);
if (i != vars->qant - 1)
fprintf(out, " + ");
}
fprintf(out, "\n%s\n\n", "\\end{dmath}");
}
void tex_teylor (FILE* out, Node* tree, vars* vars, Data* data, int accuracy)
{
Node* Diff = NULL;
Stack mem_stk = {};
for (int j = 0; j < vars->qant; j++)
{
Diff = tree;
stack_ctor(&mem_stk, 1);
fprintf(out, "Ðàçëîæåíèå â ðÿä òåéëîðà ñ òî÷íîñòüþ äî %dîãî ÷ëåíà ïðè %s -> 0: \n", accuracy, vars->data[j]);
fprintf(out, "\n\n%s", "\\begin{dmath}");
fprintf(out, "\n %s = %s", equation_tex_(Diff, &mem_stk), equation_tex_(Diff, &mem_stk));
stack_dtor(&mem_stk);
for (int i = 1; i < accuracy; i++)
{
fprintf(out, " + ");
Diff = diff(Diff, vars->data[j]);
simplifier(Diff);
stack_ctor(&mem_stk, 1);
fprintf(out, "(%s)", equation_tex_(Diff, &mem_stk));
stack_dtor(&mem_stk);
}
fprintf(out, "\n + o(x^%d)", accuracy);
fprintf(out, "\n%s\n\n", "\\end{dmath}");
}
}
void find_vars (Node* tree ,vars* vars)
{
if (tree->type == VAR)
{
add_var(vars, tree->data.var);
}
if (tree->left != NULL && tree->left->type != DEFUALT)
find_vars(tree->left, vars);
if (tree->right != NULL && tree->right->type != DEFUALT)
find_vars(tree->right, vars);
}
void create_vars (vars* vars, int capacity)
{
vars->capacity = capacity;
vars->qant = 0;
vars->data = (char**)calloc(capacity, sizeof(char*));
}
void add_var (vars* vars, char* var)
{
for (int i = 0; i < vars->qant; i++)
if (strcmp(vars->data[i], var) == 0)
return;
if (vars->qant == vars->capacity)
{
vars->capacity *= 2;
vars->data = (char**)realloc(vars->data, sizeof(char*) * vars->capacity);
}
vars->data[vars->qant] = strdup(var);
vars->qant++;
}
void dump_vars (vars* vars)
{
printf("capacity - %d\n", vars->capacity);
printf("qant - %d\n", vars->qant);
for (int i = 0; i < vars->qant; i++)
printf("%s ", vars->data[i]);
}
Data input_data (const char* file_name)
{
srand( (unsigned)time(NULL) );
FILE* input = fopen(file_name, "rb");
int fsize = GetFileSize(input);
char* buffer = NULL;
fill_buffer(input, &buffer);
char* buffer_cp = buffer;
// printf ("Buffer: \n %s", buffer);
fclose(input);
Data data = {};
for (int i = 0; i < fsize + 1; i++)
if (buffer[i] == '\n' && buffer[i - 1] == '\r')
{
data.quant += 1;
buffer[i] = '\0';
buffer[i - 1] = '\0';
}
data.lines = (line*)calloc(data.quant, sizeof(line));
if (buffer[fsize - 1] != '\n')
data.quant += 1;
for (int i = 0; i < data.quant; i++)
{
data.lines[i].str = strdup(buffer);
data.lines[i].len = strlen(buffer);
buffer += strlen(buffer);
while (*buffer == '\0')
buffer++;
}
free(buffer_cp);
return data;
}
void tex_random_phrase (FILE* tex, Data* data)
{
fprintf(tex, "\n%s\n", data->lines[rand() % data->quant].str);
}
void clear_data (Data* data)
{
for (int i = 0; i < data->quant; i++)
free(data->lines[i].str);
free(data->lines);
free(data);
}
void dump_data (Data* data)
{
printf ("qant - %d \n", data->quant);
for (int i = 0; i < data->quant; i++)
printf("%s \n", data->lines[i].str);
}