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
|
/************************************************************************
************************************************************************
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 General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
************************************************************************
************************************************************************/
/*****************************************************************************
******************************************************************************
NUM
Y. Orlarey, (c) Grame 2002
------------------------------------------------------------------------------
Nums are tagged unions of ints and floats. Nums are completly described by
this header file.
API:
----
num(10); : num with int content
num(3.14159); : num with double content
num op num : op is any C binary operator
type(num) : 0 = int, 1 = double
int(num); : int content of num or conversion
double(num); : double content of num or conversion
History :
---------
2002-02-08 : First version
******************************************************************************
*****************************************************************************/
#ifndef __NUM__
#define __NUM__
#include <math.h>
#include "garbageable.hh"
//-------------------------------------------------------------------------
// Class num = (type x (int + double))
// type 0 -> int
// type 1 -> double
//-------------------------------------------------------------------------
class num : public virtual Garbageable {
private:
int fType;
union {
int i;
double f;
} fData;
public:
// constructors
num(int x = 0) : fType(0) { fData.i = x; }
num(double x) : fType(1) { fData.f = x; }
num(const num& n) : fType(n.fType) { fData.i = n.fData.i; }
num& operator=(int n)
{
fType = 0;
fData.i = n;
return *this;
}
num& operator=(double n)
{
fType = 1;
fData.f = n;
return *this;
}
// accessors
int type() const { return fType; }
operator int() const { return (fType) ? int(fData.f) : fData.i; }
operator double() const { return (fType) ? fData.f : double(fData.i); }
// predicats
bool operator==(const num& n) const { return fType == n.fType && fData.i == n.fData.i; }
bool operator!=(const num& n) const { return fType != n.fType || fData.i != n.fData.i; }
};
inline int isfloat(const num& n)
{
return n.type();
}
inline const num operator+(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) + double(y)) : num(int(x) + int(y));
}
inline const num operator-(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) - double(y)) : num(int(x) - int(y));
}
inline const num operator*(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) * double(y)) : num(int(x) * int(y));
}
inline const num operator/(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) / double(y)) : num(int(x) / int(y));
}
inline const num operator%(const num& x, const num& y)
{
return num(int(x) % int(y));
}
// Bit shifting operations
inline const num operator<<(const num& x, const num& y)
{
return num(int(x) << int(y));
}
inline const num operator>>(const num& x, const num& y)
{
return num(int(x) >> int(y));
}
// Bitwise operations
inline const num operator&(const num& x, const num& y)
{
return num(int(x) & int(y));
}
inline const num operator|(const num& x, const num& y)
{
return num(int(x) | int(y));
}
inline const num operator^(const num& x, const num& y)
{
return num(int(x) ^ int(y));
}
// Comparaison operations
inline const num operator>(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) > double(y)) : num(int(x) > int(y));
}
inline const num operator<(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) < double(y)) : num(int(x) < int(y));
}
inline const num operator>=(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) >= double(y)) : num(int(x) >= int(y));
}
inline const num operator<=(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) <= double(y)) : num(int(x) <= int(y));
}
inline const num operator==(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) == double(y)) : num(int(x) == int(y));
}
inline const num operator!=(const num& x, const num& y)
{
return (isfloat(x) | isfloat(y)) ? num(double(x) != double(y)) : num(int(x) != int(y));
}
#endif
|
