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
|
/************************************************************************
************************************************************************
FAUST compiler
Copyright (C) 2003-2018 GRAME, Centre National de Creation Musicale
---------------------------------------------------------------------
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
#include "node.hh"
#include <stdlib.h>
#include "math.h"
using namespace std;
ostream& Node::print(ostream& fout) const ///< print a node on a stream
{
switch (fType) {
case kIntNode:
return fout << fData.i;
case kDoubleNode:
return fout << fData.f;
case kSymNode:
return fout << *(fData.s);
case kPointerNode:
return fout << "ptr:" << fData.p;
default:
return fout << "badnode";
}
}
//-----------------------------------------------------------------------------
// sameMagnitude(a,b) : true if the two nodes a and b represent numbers of same
// absolute value. Int promoted to double if needed.
bool sameMagnitude(const Node& a, const Node& b)
{
if (a.type() == kDoubleNode) {
if (b.type() == kDoubleNode) {
return fabs(a.getDouble()) == fabs(b.getDouble());
} else if (b.type() == kIntNode) {
return fabs(a.getDouble()) == fabs(double(b.getInt()));
} else {
return false;
}
} else if (a.type() == kIntNode) {
if (b.type() == kDoubleNode) {
return fabs(double(a.getInt())) == fabs(b.getDouble());
} else if (b.type() == kIntNode) {
return abs(a.getInt()) == abs(b.getInt());
} else {
return false;
}
} else {
return false;
}
}
|
