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
|
#include "xtended.hh"
#include "compatibility.hh"
#include "Text.hh"
#include <math.h>
#include "floats.hh"
#if defined(WIN32) && ! defined(__MINGW32__)
/* missing on Windows : see http://bugs.mysql.com/bug.php?id=15936 */
inline double rint(double nr)
{
double f = floor(nr);
double c = ceil(nr);
return (((c -nr) >= (nr - f)) ? f : c);
}
#endif
class RintPrim : public xtended
{
public:
RintPrim() : xtended("rint") {}
virtual unsigned int arity () { return 1; }
virtual bool needCache () { return true; }
virtual Type infereSigType (const vector<Type>& args)
{
assert (args.size() == arity());
interval i = args[0]->getInterval();
if (i.valid) {
return castInterval(floatCast(args[0]), interval(rint(i.lo), rint(i.hi)));
} else {
return floatCast(args[0]);
}
}
virtual void sigVisit (Tree sig, sigvisitor* visitor) {}
virtual int infereSigOrder (const vector<int>& args) {
assert (args.size() == arity());
return args[0];
}
virtual Tree computeSigOutput (const vector<Tree>& args) {
num n;
assert (args.size() == arity());
if (isNum(args[0],n)) {
return tree(rint(double(n)));
} else {
return tree(symbol(), args[0]);
}
}
virtual string generateCode (Klass* klass, const vector<string>& args, const vector<Type>& types)
{
assert (args.size() == arity());
assert (types.size() == arity());
return subst("rint$1($0)", args[0], isuffix());
}
virtual string generateLateq (Lateq* lateq, const vector<string>& args, const vector<Type>& types)
{
assert (args.size() == arity());
assert (types.size() == arity());
return subst("\\left[ {$0} \\right]", args[0]);
}
};
xtended* gRintPrim = new RintPrim();
|
