--- /dev/null
+#include "xtended.hh"
+#include "Text.hh"
+#include <math.h>
+#include "sigtyperules.hh"
+
+#include "floats.hh"
+
+class AbsPrim : public xtended
+{
+
+ public:
+
+ AbsPrim() : xtended("abs") {}
+
+ virtual unsigned int arity () { return 1; }
+
+ virtual bool needCache () { return true; }
+
+ virtual Type infereSigType (const vector<Type>& types)
+ {
+ assert (types.size() == arity());
+ Type t = types[0];
+ return castInterval(t, abs(t->getInterval()));
+ return t;
+ }
+
+ 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)
+ {
+ double f; int i;
+
+ assert (args.size() == arity());
+
+ if (isDouble(args[0]->node(),&f)) {
+ return tree(fabs(f));
+
+ } else if (isInt(args[0]->node(),&i)) {
+ return tree(abs(i));
+
+ } 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());
+
+ Type t = infereSigType(types);
+ if (t->nature() == kReal) {
+ return subst("fabs$1($0)", args[0], isuffix());
+ } else {
+ return subst("abs($0)", args[0]);
+ }
+ }
+
+ virtual string generateLateq (Lateq* lateq, const vector<string>& args, const vector<Type>& types)
+ {
+ assert (args.size() == arity());
+ assert (types.size() == arity());
+
+ Type t = infereSigType(types);
+ return subst("\\left\\lvert{$0}\\right\\rvert", args[0]);
+ }
+};
+
+
+xtended* gAbsPrim = new AbsPrim();
+
+