-
Notifications
You must be signed in to change notification settings - Fork 298
/
NFEquation.mo
1156 lines (1003 loc) · 28.4 KB
/
NFEquation.mo
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
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-2014, Open Source Modelica Consortium (OSMC),
* c/o Linköpings universitet, Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 LICENSE OR
* THIS OSMC PUBLIC LICENSE (OSMC-PL) VERSION 1.2.
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THE OSMC PUBLIC LICENSE OR THE GPL VERSION 3,
* ACCORDING TO RECIPIENTS CHOICE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from OSMC, either from the above address,
* from the URLs: http://www.ida.liu.se/projects/OpenModelica or
* http://www.openmodelica.org, and in the OpenModelica distribution.
* GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html.
*
* This program is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH
* IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS OF OSMC-PL.
*
* See the full OSMC Public License conditions for more details.
*
*/
encapsulated uniontype NFEquation
import Expression = NFExpression;
import Type = NFType;
import NFInstNode.InstNode;
import DAE;
import ComponentRef = NFComponentRef;
import NFPrefixes.Variability;
import ErrorTypes;
protected
import ElementSource;
import Equation = NFEquation;
import Error;
import IOStream;
import Util;
public
uniontype Branch
record BRANCH
Expression condition;
Variability conditionVar;
list<Equation> body;
end BRANCH;
record INVALID_BRANCH
Branch branch;
list<ErrorTypes.TotalMessage> errors;
end INVALID_BRANCH;
function mapExp
input output Branch branch;
input MapExpFn func;
input Boolean mapBody = true;
protected
Expression cond;
list<Equation> eql;
algorithm
branch := match branch
case Branch.BRANCH()
algorithm
cond := func(branch.condition);
if mapBody then
eql := list(Equation.mapExp(e, func) for e in branch.body);
else
eql := branch.body;
end if;
then
Branch.BRANCH(cond, branch.conditionVar, eql);
case Branch.INVALID_BRANCH()
algorithm
// The body of an invalid branch might not be safe to traverse, but
// the condition still needs to be valid and should be traversed.
branch.branch := mapExp(branch.branch, func, mapBody = false);
then
branch;
else branch;
end match;
end mapExp;
function toStream
input Branch branch;
input String indent;
input output IOStream.IOStream s;
algorithm
s := match branch
case BRANCH()
algorithm
s := IOStream.append(s, Expression.toString(branch.condition));
s := IOStream.append(s, " then\n");
s := toStreamList(branch.body, indent + " ", s);
then
s;
case INVALID_BRANCH()
then toStream(branch.branch, indent, s);
end match;
end toStream;
function toFlatStream
input Branch branch;
input String indent;
input output IOStream.IOStream s;
algorithm
s := match branch
case BRANCH()
algorithm
s := IOStream.append(s, Expression.toFlatString(branch.condition));
s := IOStream.append(s, " then\n");
s := toFlatStreamList(branch.body, indent + " ", s);
then
s;
case INVALID_BRANCH()
then toFlatStream(branch.branch, indent, s);
end match;
end toFlatStream;
function triggerErrors
input Branch branch;
algorithm
() := match branch
case INVALID_BRANCH()
algorithm
Error.addTotalMessages(branch.errors);
then
fail();
else ();
end match;
end triggerErrors;
end Branch;
record EQUALITY
Expression lhs "The left hand side expression.";
Expression rhs "The right hand side expression.";
Type ty;
DAE.ElementSource source;
end EQUALITY;
record CREF_EQUALITY
ComponentRef lhs;
ComponentRef rhs;
DAE.ElementSource source;
end CREF_EQUALITY;
record ARRAY_EQUALITY
Expression lhs;
Expression rhs;
Type ty;
DAE.ElementSource source;
end ARRAY_EQUALITY;
record CONNECT
Expression lhs;
Expression rhs;
DAE.ElementSource source;
end CONNECT;
record FOR
InstNode iterator;
Option<Expression> range;
list<Equation> body "The body of the for loop.";
DAE.ElementSource source;
end FOR;
record IF
list<Branch> branches;
DAE.ElementSource source;
end IF;
record WHEN
list<Branch> branches;
DAE.ElementSource source;
end WHEN;
record ASSERT
Expression condition "The assert condition.";
Expression message "The message to display if the assert fails.";
Expression level "Error or warning";
DAE.ElementSource source;
end ASSERT;
record TERMINATE
Expression message "The message to display if the terminate triggers.";
DAE.ElementSource source;
end TERMINATE;
record REINIT
Expression cref "The variable to reinitialize.";
Expression reinitExp "The new value of the variable.";
DAE.ElementSource source;
end REINIT;
record NORETCALL
Expression exp;
DAE.ElementSource source;
end NORETCALL;
function makeEquality
input Expression lhs;
input Expression rhs;
input Type ty;
input DAE.ElementSource src;
output Equation eq;
algorithm
eq := EQUALITY(lhs, rhs, ty, src);
annotation(__OpenModelica_EarlyInline=true);
end makeEquality;
function makeBranch
input Expression condition;
input list<Equation> body;
input Variability condVar = Variability.CONTINUOUS;
output Branch branch;
algorithm
branch := Branch.BRANCH(condition, condVar, body);
annotation(__OpenModelica_EarlyInline=true);
end makeBranch;
function makeIf
input list<Branch> branches;
input DAE.ElementSource src;
output Equation eq;
algorithm
eq := IF(branches, src);
annotation(__OpenModelica_EarlyInline=true);
end makeIf;
function source
input Equation eq;
output DAE.ElementSource source;
algorithm
source := match eq
case EQUALITY() then eq.source;
case CREF_EQUALITY() then eq.source;
case ARRAY_EQUALITY() then eq.source;
case CONNECT() then eq.source;
case FOR() then eq.source;
case IF() then eq.source;
case WHEN() then eq.source;
case ASSERT() then eq.source;
case TERMINATE() then eq.source;
case REINIT() then eq.source;
case NORETCALL() then eq.source;
end match;
end source;
function info
input Equation eq;
output SourceInfo info = ElementSource.getInfo(source(eq));
end info;
partial function ApplyFn
input Equation eq;
end ApplyFn;
function applyList
input list<Equation> eql;
input ApplyFn func;
algorithm
for eq in eql loop
apply(eq, func);
end for;
end applyList;
function apply
input Equation eq;
input ApplyFn func;
algorithm
() := match eq
case FOR()
algorithm
for e in eq.body loop
apply(e, func);
end for;
then
();
case IF()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
for e in b.body loop
apply(e, func);
end for;
then
();
else ();
end match;
end for;
then
();
case WHEN()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
for e in b.body loop
apply(e, func);
end for;
then
();
else ();
end match;
end for;
then
();
else ();
end match;
func(eq);
end apply;
partial function MapFn
input output Equation eq;
end MapFn;
function map
input output Equation eq;
input MapFn func;
algorithm
() := match eq
case FOR()
algorithm
eq.body := list(map(e, func) for e in eq.body);
then
();
case IF()
algorithm
eq.branches := list(
match b
case Branch.BRANCH()
algorithm
b.body := list(map(e, func) for e in b.body);
then
b;
else b;
end match
for b in eq.branches);
then
();
case WHEN()
algorithm
eq.branches := list(
match b
case Branch.BRANCH()
algorithm
b.body := list(map(e, func) for e in b.body);
then
b;
else b;
end match
for b in eq.branches);
then
();
else ();
end match;
eq := func(eq);
end map;
function applyExpList
input list<Equation> eq;
input ApplyFunc func;
partial function ApplyFunc
input Expression exp;
end ApplyFunc;
algorithm
for e in eq loop
applyExp(e, func);
end for;
end applyExpList;
function applyExp
input Equation eq;
input ApplyFunc func;
partial function ApplyFunc
input Expression exp;
end ApplyFunc;
algorithm
() := match eq
case Equation.EQUALITY()
algorithm
func(eq.lhs);
func(eq.rhs);
then
();
case Equation.ARRAY_EQUALITY()
algorithm
func(eq.lhs);
func(eq.rhs);
then
();
case Equation.CONNECT()
algorithm
func(eq.lhs);
func(eq.rhs);
then
();
case Equation.FOR()
algorithm
applyExpList(eq.body, func);
if isSome(eq.range) then
func(Util.getOption(eq.range));
end if;
then
();
case Equation.IF()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
func(b.condition);
applyExpList(b.body, func);
then
();
else ();
end match;
end for;
then
();
case Equation.WHEN()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
func(b.condition);
applyExpList(b.body, func);
then
();
else ();
end match;
end for;
then
();
case Equation.ASSERT()
algorithm
func(eq.condition);
func(eq.message);
func(eq.level);
then
();
case Equation.TERMINATE()
algorithm
func(eq.message);
then
();
case Equation.REINIT()
algorithm
func(eq.cref);
func(eq.reinitExp);
then
();
case Equation.NORETCALL()
algorithm
func(eq.exp);
then
();
else ();
end match;
end applyExp;
partial function MapExpFn
input output Expression MapExpFn;
end MapExpFn;
function mapExpList
input output list<Equation> eql;
input MapExpFn func;
algorithm
eql := list(mapExp(eq, func) for eq in eql);
end mapExpList;
function mapExp
input output Equation eq;
input MapExpFn func;
algorithm
eq := match eq
local
Expression e1, e2, e3;
case EQUALITY()
algorithm
e1 := func(eq.lhs);
e2 := func(eq.rhs);
then
if referenceEq(e1, eq.lhs) and referenceEq(e2, eq.rhs)
then eq else EQUALITY(e1, e2, eq.ty, eq.source);
case ARRAY_EQUALITY()
algorithm
e1 := func(eq.lhs);
e2 := func(eq.rhs);
then
if referenceEq(e1, eq.lhs) and referenceEq(e2, eq.rhs)
then eq else ARRAY_EQUALITY(e1, e2, eq.ty, eq.source);
case CONNECT()
algorithm
e1 := func(eq.lhs);
e2 := func(eq.rhs);
then
if referenceEq(e1, eq.lhs) and referenceEq(e2, eq.rhs)
then eq else CONNECT(e1, e2, eq.source);
case FOR()
algorithm
eq.body := list(mapExp(e, func) for e in eq.body);
eq.range := Util.applyOption(eq.range, func);
then
eq;
case IF()
algorithm
eq.branches := list(Branch.mapExp(b, func) for b in eq.branches);
then
eq;
case WHEN()
algorithm
eq.branches := list(Branch.mapExp(b, func) for b in eq.branches);
then
eq;
case ASSERT()
algorithm
e1 := func(eq.condition);
e2 := func(eq.message);
e3 := func(eq.level);
then
if referenceEq(e1, eq.condition) and referenceEq(e2, eq.message) and
referenceEq(e3, eq.level) then eq else ASSERT(e1, e2, e3, eq.source);
case TERMINATE()
algorithm
e1 := func(eq.message);
then
if referenceEq(e1, eq.message) then eq else TERMINATE(e1, eq.source);
case REINIT()
algorithm
e1 := func(eq.cref);
e2 := func(eq.reinitExp);
then
if referenceEq(e1, eq.cref) and referenceEq(e2, eq.reinitExp) then
eq else REINIT(e1, e2, eq.source);
case NORETCALL()
algorithm
e1 := func(eq.exp);
then
if referenceEq(e1, eq.exp) then eq else NORETCALL(e1, eq.source);
else eq;
end match;
end mapExp;
function foldExpList<ArgT>
input list<Equation> eq;
input FoldFunc func;
input output ArgT arg;
partial function FoldFunc
input Expression exp;
input output ArgT arg;
end FoldFunc;
algorithm
for e in eq loop
arg := foldExp(e, func, arg);
end for;
end foldExpList;
function foldExp<ArgT>
input Equation eq;
input FoldFunc func;
input output ArgT arg;
partial function FoldFunc
input Expression exp;
input output ArgT arg;
end FoldFunc;
algorithm
() := match eq
case Equation.EQUALITY()
algorithm
arg := func(eq.lhs, arg);
arg := func(eq.rhs, arg);
then
();
case Equation.ARRAY_EQUALITY()
algorithm
arg := func(eq.lhs, arg);
arg := func(eq.rhs, arg);
then
();
case Equation.CONNECT()
algorithm
arg := func(eq.lhs, arg);
arg := func(eq.rhs, arg);
then
();
case Equation.FOR()
algorithm
arg := foldExpList(eq.body, func, arg);
if isSome(eq.range) then
arg := func(Util.getOption(eq.range), arg);
end if;
then
();
case Equation.IF()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
arg := func(b.condition, arg);
arg := foldExpList(b.body, func, arg);
then
();
else ();
end match;
end for;
then
();
case Equation.WHEN()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
arg := func(b.condition, arg);
arg := foldExpList(b.body, func, arg);
then
();
else ();
end match;
end for;
then
();
case Equation.ASSERT()
algorithm
arg := func(eq.condition, arg);
arg := func(eq.message, arg);
arg := func(eq.level, arg);
then
();
case Equation.TERMINATE()
algorithm
arg := func(eq.message, arg);
then
();
case Equation.REINIT()
algorithm
arg := func(eq.cref, arg);
arg := func(eq.reinitExp, arg);
then
();
case Equation.NORETCALL()
algorithm
arg := func(eq.exp, arg);
then
();
else ();
end match;
end foldExp;
function contains
input Equation eq;
input PredFn func;
output Boolean res;
partial function PredFn
input Equation eq;
output Boolean res;
end PredFn;
algorithm
if func(eq) then
res := true;
return;
end if;
res := match eq
case FOR() then containsList(eq.body, func);
case IF()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
if containsList(b.body, func) then
res := true;
return;
end if;
then
();
else ();
end match;
end for;
then
false;
case WHEN()
algorithm
for b in eq.branches loop
() := match b
case Branch.BRANCH()
algorithm
if containsList(b.body, func) then
res := true;
return;
end if;
then
();
else ();
end match;
end for;
then
false;
else false;
end match;
end contains;
function containsList
input list<Equation> eql;
input PredFn func;
output Boolean res;
partial function PredFn
input Equation eq;
output Boolean res;
end PredFn;
algorithm
for eq in eql loop
if contains(eq, func) then
res := true;
return;
end if;
end for;
res := false;
end containsList;
function isConnect
input Equation eq;
output Boolean isConnect;
algorithm
isConnect := match eq
case CONNECT() then true;
else false;
end match;
end isConnect;
function toString
input Equation eq;
input String indent = "";
output String str;
protected
IOStream.IOStream s;
algorithm
s := IOStream.create(getInstanceName(), IOStream.IOStreamType.LIST());
s := toStream(eq, indent, s);
str := IOStream.string(s);
IOStream.delete(s);
end toString;
function toStringList
input list<Equation> eql;
input String indent = "";
output String str;
protected
IOStream.IOStream s;
algorithm
s := IOStream.create(getInstanceName(), IOStream.IOStreamType.LIST());
s := toStreamList(eql, indent, s);
str := IOStream.string(s);
IOStream.delete(s);
end toStringList;
function toStream
input Equation eq;
input String indent;
input output IOStream.IOStream s;
algorithm
s := IOStream.append(s, indent);
s := match eq
case EQUALITY()
algorithm
s := IOStream.append(s, Expression.toString(eq.lhs));
s := IOStream.append(s, " = ");
s := IOStream.append(s, Expression.toString(eq.rhs));
then
s;
case CREF_EQUALITY()
algorithm
s := IOStream.append(s, ComponentRef.toString(eq.lhs));
s := IOStream.append(s, " = ");
s := IOStream.append(s, ComponentRef.toString(eq.rhs));
then
s;
case ARRAY_EQUALITY()
algorithm
s := IOStream.append(s, Expression.toString(eq.lhs));
s := IOStream.append(s, " = ");
s := IOStream.append(s, Expression.toString(eq.rhs));
then
s;
case CONNECT()
algorithm
s := IOStream.append(s, "connect(");
s := IOStream.append(s, Expression.toString(eq.lhs));
s := IOStream.append(s, " = ");
s := IOStream.append(s, Expression.toString(eq.rhs));
s := IOStream.append(s, ")");
then
s;
case FOR()
algorithm
s := IOStream.append(s, "for ");
s := IOStream.append(s, InstNode.name(eq.iterator));
if isSome(eq.range) then
s := IOStream.append(s, " in ");
s := IOStream.append(s, Expression.toString(Util.getOption(eq.range)));
end if;
s := IOStream.append(s, " loop\n");
s := toStreamList(eq.body, indent + " ", s);
s := IOStream.append(s, indent);
s := IOStream.append(s, "end for");
then
s;
case IF()
algorithm
s := IOStream.append(s, "if ");
s := Branch.toStream(listHead(eq.branches), indent, s);
for b in listRest(eq.branches) loop
s := IOStream.append(s, indent);
s := IOStream.append(s, "elseif ");
s := Branch.toStream(b, indent, s);
end for;
s := IOStream.append(s, indent);
s := IOStream.append(s, "end if");
then
s;
case WHEN()
algorithm
s := IOStream.append(s, "when ");
s := Branch.toStream(listHead(eq.branches), indent, s);
for b in listRest(eq.branches) loop
s := IOStream.append(s, indent);
s := IOStream.append(s, "elsewhen ");
s := Branch.toStream(b, indent, s);
end for;
s := IOStream.append(s, indent);
s := IOStream.append(s, "end when");
then
s;
case ASSERT()
algorithm
s := IOStream.append(s, "assert(");
s := IOStream.append(s, Expression.toString(eq.condition));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toString(eq.message));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toString(eq.level));
s := IOStream.append(s, ")");
then
s;
case TERMINATE()
algorithm
s := IOStream.append(s, "terminate(");
s := IOStream.append(s, Expression.toString(eq.message));
s := IOStream.append(s, ")");
then
s;
case REINIT()
algorithm
s := IOStream.append(s, "reinit(");
s := IOStream.append(s, Expression.toString(eq.cref));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toString(eq.reinitExp));
s := IOStream.append(s, ")");
then
s;
case NORETCALL()
then IOStream.append(s, Expression.toString(eq.exp));
else IOStream.append(s, "#UNKNOWN EQUATION#");
end match;
end toStream;
function toStreamList
input list<Equation> eql;
input String indent;
input output IOStream.IOStream s;
protected
Boolean prev_multi_line = false, multi_line;
Boolean first = true;
algorithm
for eq in eql loop
multi_line := isMultiLine(eq);
// Improve human parsability by separating statements that spans multiple
// lines (like if-equations) with newlines.
if first then
first := false;
elseif prev_multi_line or multi_line then
s := IOStream.append(s, "\n");
end if;
prev_multi_line := multi_line;
s := toStream(eq, indent, s);
s := IOStream.append(s, ";\n");
end for;
end toStreamList;
function toFlatStream
input Equation eq;
input String indent;
input output IOStream.IOStream s;
algorithm
s := IOStream.append(s, indent);
s := match eq
case EQUALITY()
algorithm
s := IOStream.append(s, Expression.toFlatString(eq.lhs));
s := IOStream.append(s, " = ");