-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathusolver.pas
More file actions
434 lines (393 loc) · 9.68 KB
/
Copy pathusolver.pas
File metadata and controls
434 lines (393 loc) · 9.68 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
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
(******************************************************************************)
(* *)
(* Author : Uwe Schächterle (Corpsman) *)
(* *)
(* This file is part of FIR IIR *)
(* *)
(* See the file license.md, located under: *)
(* https://github.com/PascalCorpsman/Software_Licenses/blob/main/license.md *)
(* for details about the license. *)
(* *)
(* It is not allowed to change or remove this text from any *)
(* source file of the project. *)
(* *)
(******************************************************************************)
Unit usolver;
{$MODE objfpc}{$H+}
Interface
Uses
Classes, SysUtils, ugenmathcalc, utokenizer, uncommenter, math;
Const
// Minimal für Single ca. 6.0E-8
EpsilonKugel = 1.0E-6; // Zwei Zahlen die sich um Weniger als EpsilonKugel unterscheiden werden als Gleich betrachtet
Type
// TDatatype = Single;
TDatatype = double;
PDatatype = ^TDatatype;
{ TSolver }
TSolver = Class
private
ftokenizer: TTokenizer;
fCalculator: TGenMathCalc;
funcommenter: TUnCommenter;
fFormula: PCalcTree;
f_X: TDatatype;
fVarlist: TVarlist;
public
Constructor create;
Destructor destroy; override;
Function Create_Formula(Value: String): Boolean;
Function EvalFormula(X: TDatatype): TDatatype;
End;
Var
defFormat: TFormatSettings;
Implementation
{ TSolver }
Function Creater(Value: String): Pointer;
Var
res: PDatatype;
Begin
new(res);
If lowercase(value) = 'pi' Then Begin
res^ := Pi;
End
Else If lowercase(value) = 'e' Then Begin
res^ := 2.7182818284590452353602874713526624977572470936999595749669;
End
Else
res^ := StrToFloatDef(value, 0, defFormat);
result := res;
End;
Procedure Freeer(Value: Pointer);
Var
tmp: PDatatype;
Begin
If assigned(value) Then Begin
tmp := value;
dispose(tmp);
End;
End;
Function Mul_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := PDatatype(value1)^ * PDatatype(value2)^;
result := res;
End;
Function Add_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := PDatatype(value1)^ + PDatatype(value2)^;
result := res;
End;
Function Sub_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := PDatatype(value1)^ - PDatatype(value2)^;
result := res;
End;
Function Sub_u(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := -PDatatype(value1)^;
result := res;
End;
Function Add_u(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := PDatatype(value1)^;
result := res;
End;
Function div_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If PDatatype(value2)^ <> 0 Then
res^ := PDatatype(value1)^ / PDatatype(value2)^
Else
res^ := 0;
result := res;
End;
Function Power_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := Power(PDatatype(value1)^, PDatatype(value2)^);
result := res;
End;
Function Min_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := min(PDatatype(value1)^, PDatatype(value2)^);
result := res;
End;
Function Max_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := Max(PDatatype(value1)^, PDatatype(value2)^);
result := res;
End;
Function isssame(v1, v2: TDatatype): boolean;
Begin
result := abs(v1 - v2) <= EpsilonKugel;
End;
Function Eq_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If isssame(PDatatype(value1)^, PDatatype(value2)^) Then
res^ := 1
Else
res^ := 0;
result := res;
End;
Function nEq_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If isssame(PDatatype(value1)^, PDatatype(value2)^) Then
res^ := 0
Else
res^ := 1;
result := res;
End;
Function lt_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If PDatatype(value1)^ < PDatatype(value2)^ Then
res^ := 1
Else
res^ := 0;
result := res;
End;
Function lteq_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If PDatatype(value1)^ <= PDatatype(value2)^ Then
res^ := 1
Else
res^ := 0;
result := res;
End;
Function gt_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If PDatatype(value1)^ > PDatatype(value2)^ Then
res^ := 1
Else
res^ := 0;
result := res;
End;
Function gteq_(Value1, Value2: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If PDatatype(value1)^ >= PDatatype(value2)^ Then
res^ := 1
Else
res^ := 0;
result := res;
End;
Function abs_(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := abs(PDatatype(value1)^);
result := res;
End;
Function sin_(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := sin(PDatatype(value1)^);
result := res;
End;
Function cos_(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := cos(PDatatype(value1)^);
result := res;
End;
Function sqrt_(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
If (PDatatype(value1)^ < 0) Then Begin
res^ := 0;
End
Else Begin
res^ := sqrt(PDatatype(value1)^);
End;
result := res;
End;
Function sqr_(Value1: Pointer): Pointer;
Var
res: PDatatype;
Begin
new(res);
res^ := sqr(PDatatype(value1)^);
result := res;
End;
Constructor TSolver.create;
Begin
Inherited create;
fFormula := Nil;
setlength(fVarlist, 1);
fVarlist[0].Name := 'x';
fVarlist[0].Value := @f_x;
// Der Unkommenter
funcommenter := TUnCommenter.Create;
funcommenter.CaseSensitive := false;
funcommenter.AddRule('//', '', true);
funcommenter.AddRule('{', '}', false);
funcommenter.DellEmptyLines := true;
funcommenter.NumberLines := false;
// Tokenizer
ftokenizer := TTokenizer.Create;
ftokenizer.CaseSensitive := false;
ftokenizer.AddSeperator(' '); // Leerzeichen
ftokenizer.AddSeperator(#13); // Cr
ftokenizer.AddSeperator(#10); // Rt
ftokenizer.AddSeperator(#9); // Tab
ftokenizer.AddOperator('(');
ftokenizer.AddOperator(')');
ftokenizer.AddOperator('abs');
ftokenizer.AddOperator('sqrt');
ftokenizer.AddOperator('sqr');
ftokenizer.AddOperator('sin');
ftokenizer.AddOperator('cos');
ftokenizer.AddOperator('min');
ftokenizer.AddOperator('=');
ftokenizer.AddOperator('<>');
ftokenizer.AddOperator('<');
ftokenizer.AddOperator('<=');
ftokenizer.AddOperator('>');
ftokenizer.AddOperator('>=');
// ftokenizer.AddOperator('tan');
ftokenizer.AddOperator('^');
ftokenizer.AddOperator('/');
ftokenizer.AddOperator('*');
ftokenizer.AddOperator('-');
ftokenizer.AddOperator('+');
// ftokenizer.AddOperator('Pi');
// ftokenizer.AddOperator('x');
// ftokenizer.AddOperator('e');
// Solver
fCalculator := TGenMathCalc.Create;
fCalculator.OnCreateValue := @Creater;
fCalculator.OnFreeValue := @Freeer;
fCalculator.AddUnOP('-', @Sub_u);
fCalculator.AddUnOP('+', @Add_u);
fCalculator.AddUnOP('abs', @Abs_);
fCalculator.AddUnOP('sqrt', @Sqrt_);
fCalculator.AddUnOP('sqr', @Sqr_);
fCalculator.AddUnOP('sin', @Sin_);
fCalculator.AddUnOP('cos', @Cos_);
fCalculator.AddBinOP('^', @Power_);
fCalculator.AddBinOP('/', @Div_);
fCalculator.AddBinOP('*', @Mul_);
fCalculator.AddBinOP('-', @Sub_);
fCalculator.AddBinOP('+', @Add_);
fCalculator.AddBinOP('max', @max_);
fCalculator.AddBinOP('min', @min_);
fCalculator.AddBinOP('=', @eq_);
fCalculator.AddBinOP('<>', @neq_);
fCalculator.AddBinOP('<', @lt_);
fCalculator.AddBinOP('<=', @lteq_);
fCalculator.AddBinOP('>', @gt_);
fCalculator.AddBinOP('>=', @gteq_);
End;
Destructor TSolver.destroy;
Begin
If Assigned(fFormula) Then Begin
fCalculator.FreeCalcTree(FFormula);
FFormula := Nil;
End;
setlength(fVarlist, 0);
ftokenizer.free;
fCalculator.free;
funcommenter.free;
End;
Function TSolver.Create_Formula(Value: String): Boolean;
Var
tokens: TTokenarray;
Begin
Try
// Freigeben alter Daten
If Assigned(fFormula) Then Begin
fCalculator.FreeCalcTree(FFormula);
FFormula := Nil;
End;
// Entfernen aller Kommentare
value := funcommenter.Uncomment(value);
// Tokenliste Erzeugen
tokens := ftokenizer.Scan(value + ' '); // Workaround um Bug in TTokenzier
// Abschneiden des letzten evtl. Falschen Tokens
If high(tokens) <> 0 Then Begin
If trim(tokens[high(tokens)].Value) = '' Then Begin
setlength(tokens, high(tokens));
End;
End;
// Rechenbaum Erstellen
fFormula := fCalculator.Parse(tokens, fVarlist);
// Freigeben temporärer daten
setlength(tokens, 0);
result := true;
Except
fFormula := Nil; // Wenn was nicht stimmt
result := false;
End;
End;
Function TSolver.EvalFormula(X: TDatatype): TDatatype;
Var
Freeerg: Boolean;
erg: PDatatype;
Begin
If assigned(fFormula) Then Begin
// Übernehmen von X
f_X := x;
// Berechnen des Ergebnisses
erg := fCalculator.Calc(fFormula, freeerg);
// Übernehmen des Ergebnisses
If assigned(erg) Then Begin
result := erg^;
End
Else
result := 0;
// Freigeben falls notwendig
freeerg := Not freeerg;
If Freeerg Then dispose(erg);
End
Else
result := 0;
End;
End.