Inheritance diagram for MinPrim:

Collaboration diagram for MinPrim:

Public Member Functions
	MinPrim ()

virtual unsigned int	arity ()

virtual bool	needCache ()

virtual Type	infereSigType (const vector< Type > &types)

virtual void	sigVisit (Tree sig, sigvisitor *visitor)

virtual int	infereSigOrder (const vector< int > &args)

virtual Tree	computeSigOutput (const vector< Tree > &args)

virtual string	generateCode (Klass *klass, const vector< string > &args, const vector< Type > &types)

virtual string	generateLateq (Lateq *lateq, const vector< string > &args, const vector< Type > &types)

Public Member Functions inherited from xtended
	xtended (const char *name)

virtual	~xtended ()

Sym	symbol ()

const char *	name ()

Tree	box ()

virtual bool	isSpecialInfix ()
	generaly false, but true for binary op # such that #(x) == _::x More...

Detailed Description

Definition at line 8 of file minprim.cpp.

Constructor & Destructor Documentation

MinPrim::MinPrim ( )

inline

Definition at line 13 of file minprim.cpp.

13 : xtended("min") {}

xtended::xtended

xtended(const char *name)

Definition: xtended.hh:18

Member Function Documentation

virtual unsigned int MinPrim::arity ( )

inlinevirtual

Implements xtended.

Definition at line 15 of file minprim.cpp.

Referenced by computeSigOutput(), generateCode(), generateLateq(), infereSigOrder(), and infereSigType().

15 { return 2; }

Here is the caller graph for this function:

virtual Tree MinPrim::computeSigOutput ( const vector< Tree > & args )

inlinevirtual

Implements xtended.

Definition at line 36 of file minprim.cpp.

References arity(), isDouble(), isInt(), min(), xtended::symbol(), and tree().

     {
         double f,g; int i,j;
         
         assert (args.size() == arity());
         
         if (isDouble(args[0]->node(),&f)) {
         
             if (isDouble(args[1]->node(), &g)) {
                 return tree(min(f, g));
             } else if (isInt(args[1]->node(),&j)) {
                 return tree(min(f, double(j)));
             } else {
                 return tree(symbol(), args[0], args[1]);
             }
                 
         } else if (isInt(args[0]->node(),&i)) {
         
             if (isDouble(args[1]->node(), &g)) {
                 return tree(min(double(i), g));
             } else if (isInt(args[1]->node(),&j)) {
                 return tree(min(i, j));
             } else {
                 return tree(symbol(), args[0], args[1]);
             }
                 
         } else {
         
             return tree(symbol(), args[0], args[1]);
         }
     }

Here is the call graph for this function:

virtual string MinPrim::generateCode	(	Klass *	klass,
		const vector< string > &	args,
		const vector< Type > &	types
	)

inlinevirtual

Implements xtended.

Definition at line 94 of file minprim.cpp.

References arity(), icast(), kBool, kInt, kNum, kReal, and subst().

     {
         assert (args.size() == arity());
         assert (types.size() == arity());
 
         // generates code compatible with overloaded min
         int n0 = types[0]->nature();
         int n1 = types[1]->nature();
         if (n0==kReal) {
             if (n1==kReal) {
                 // both are floats, no need to cast
                 return subst("min($0, $1)", args[0], args[1]);
             } else {
                 assert(n1==kInt); // second argument is not float, cast it to float
                 return subst("min($0, $2$1)", args[0], args[1], icast());
             }
         } else if (n1==kReal) {
             assert(n0==kInt); // first not float but second is, cast first to float
             return subst("min($2$0, $1)", args[0], args[1], icast());
         } else {
             assert(n0==kInt);  assert(n1==kInt);   // both are integers, check for booleans
             int b0 = types[0]->boolean();
             int b1 = types[1]->boolean();
             if (b0==kNum) {
                 if (b1==kNum) {
                     // both are integers, no need to cast
                     return subst("min($0, $1)", args[0], args[1]);
                 } else {
                     assert(b1==kBool);    // second is boolean, cast to int
                     return subst("min($0, (int)$1)", args[0], args[1]);
                 }
             } else if (b1==kNum) {
                 assert(b0==kBool);    // first is boolean, cast to int
                 return subst("min((int)$0, $1)", args[0], args[1], icast());
             } else {
                 assert(b0==kBool); assert(b1==kBool);   // both are booleans, no need to cast
                 return subst("min((int)$0, (int)$1)", args[0], args[1]);
             }
         }
     }

Here is the call graph for this function:

virtual string MinPrim::generateLateq	(	Lateq *	lateq,
		const vector< string > &	args,
		const vector< Type > &	types
	)

inlinevirtual

Implements xtended.

Definition at line 135 of file minprim.cpp.

References arity(), infereSigType(), and subst().

     {
         assert (args.size() == arity());
         assert (types.size() == arity());
         
         Type t = infereSigType(types);
         return subst("\\min\\left( $0, $1 \\right)", args[0], args[1]);             
     }

Here is the call graph for this function:

virtual int MinPrim::infereSigOrder ( const vector< int > & args )

inlinevirtual

Implements xtended.

Definition at line 29 of file minprim.cpp.

References arity(), and max().

     {
         assert (args.size() == arity());
         return max(args[0], args[1]);
     }

Here is the call graph for this function:

virtual Type MinPrim::infereSigType ( const vector< Type > & types )

inlinevirtual

Implements xtended.

Definition at line 19 of file minprim.cpp.

References arity(), castInterval(), and min().

Referenced by generateLateq().

     {
         assert (types.size() == arity());
         interval i = types[0]->getInterval();
         interval j = types[1]->getInterval();
         return castInterval(types[0]|types[1], min(i,j));
     }