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
|
#include "xtended.hh"
#include "Text.hh"
#include <math.h>
#include "floats.hh"
class PowPrim : public xtended
{
public:
PowPrim() : xtended("powf") {}
virtual unsigned int arity () { return 2; }
virtual bool needCache () { return true; }
virtual Type infereSigType (const vector<Type>& args)
{
assert (args.size() == arity());
//return castInterval(floatCast(args[0]|args[1]), interval()); // temporary !!!
return castInterval(args[0]|args[1], interval()); // temporary !!!
}
virtual void sigVisit (Tree sig, sigvisitor* visitor) {}
virtual int infereSigOrder (const vector<int>& args) {
assert (args.size() == arity());
return max(args[0], args[1]);
}
virtual Tree computeSigOutput (const vector<Tree>& args) {
num n,m;
assert (args.size() == arity());
if (isNum(args[0],n) & isNum(args[1],m)) {
return tree(pow(double(n), double(m)));
} else {
return tree(symbol(), args[0], args[1]);
}
}
virtual string generateCode (Klass* klass, const vector<string>& args, const vector<Type>& types)
{
assert (args.size() == arity());
assert (types.size() == arity());
if (types[1]->nature() == kInt) {
klass->rememberNeedPowerDef();
return subst("faustpower<$1>($0)", args[0], args[1]);
} else {
return subst("pow$2($0,$1)", args[0], args[1], isuffix());
}
}
virtual string generateLateq (Lateq* lateq, const vector<string>& args, const vector<Type>& types)
{
assert (args.size() == arity());
assert (types.size() == arity());
return subst("{$0}^{$1}", args[0], args[1]);
}
// power is now used as an infix binary operator, we return true to
// indicate that we want ^(n) to be equivalent to _^n
virtual bool isSpecialInfix() { return true; }
};
xtended* gPowPrim = new PowPrim();
|
