RemainderPrim Class Reference

Inheritance diagram for RemainderPrim:

Collaboration diagram for RemainderPrim:

List of all members.

Public Member Functions
	RemainderPrim ()
virtual unsigned int	arity ()
virtual bool	needCache ()
virtual Type	infereSigType (const vector< Type > &args)
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)

---

Detailed Description

Definition at line 8 of file remainderprim.cpp.

---

Constructor & Destructor Documentation

RemainderPrim::RemainderPrim

(

)

[inline]

Definition at line 13 of file remainderprim.cpp.

: xtended("remainder") {}

---

Member Function Documentation

virtual unsigned int RemainderPrim::arity

(

)

[inline, virtual]

Implements xtended.

Definition at line 15 of file remainderprim.cpp.

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

{ return 2; }

Here is the caller graph for this function:

virtual Tree RemainderPrim::computeSigOutput

(

const vector< Tree > &

args

)

[inline, virtual]

Implements xtended.

Definition at line 33 of file remainderprim.cpp.

References arity(), isNum(), xtended::symbol(), and tree().

                                                                {
        num n,m;
        assert (args.size() == arity());
        if (isNum(args[0],n) & isNum(args[1],m)) {
            return tree(remainder(double(n), double(m)));
        } else {
            return tree(symbol(), args[0], args[1]);
        }
    }

Here is the call graph for this function:

virtual string RemainderPrim::generateCode	(	Klass *	klass,
		const vector< string > &	args,
		const vector< Type > &	types
	)		[inline, virtual]

Implements xtended.

Definition at line 43 of file remainderprim.cpp.

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

    {
        assert (args.size() == arity());
        assert (types.size() == arity());
        
        return subst("remainder$2($0,$1)", args[0], args[1], isuffix());
    }

Here is the call graph for this function:

virtual string RemainderPrim::generateLateq	(	Lateq *	lateq,
		const vector< string > &	args,
		const vector< Type > &	types
	)		[inline, virtual]

Implements xtended.

Definition at line 51 of file remainderprim.cpp.

References arity(), and subst().

    {
        assert (args.size() == arity());
        assert (types.size() == arity());
        
        return subst("$0\\pmod{$1}", args[0], args[1]); // Same as fmodprim.cpp.
    }

Here is the call graph for this function:

virtual int RemainderPrim::infereSigOrder

(

const vector< int > &

args

)

[inline, virtual]

Implements xtended.

Definition at line 27 of file remainderprim.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 RemainderPrim::infereSigType

(

const vector< Type > &

args

)

[inline, virtual]

Implements xtended.

Definition at line 19 of file remainderprim.cpp.

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

    {
        assert (args.size() == arity());
        return castInterval(floatCast(args[0]|args[1]), interval());   // temporary rule !!!
    }

Here is the call graph for this function:

virtual bool RemainderPrim::needCache

(

)

[inline, virtual]

Implements xtended.

Definition at line 17 of file remainderprim.cpp.

{ return true; }

virtual void RemainderPrim::sigVisit	(	Tree	sig,
		sigvisitor *	visitor
	)		[inline, virtual]

Definition at line 25 of file remainderprim.cpp.

{}  

---

The documentation for this class was generated from the following file:

• remainderprim.cpp