* Implementation of relations between expressions */
/*
- * GiNaC Copyright (C) 1999-2000 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2001 Johannes Gutenberg University Mainz, Germany
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
#include "relational.h"
#include "numeric.h"
+#include "print.h"
#include "archive.h"
#include "utils.h"
#include "debugmsg.h"
-#ifndef NO_NAMESPACE_GINAC
namespace GiNaC {
-#endif // ndef NO_NAMESPACE_GINAC
GINAC_IMPLEMENT_REGISTERED_CLASS(relational, basic)
//////////
-// default constructor, destructor, copy constructor assignment operator and helpers
+// default ctor, dtor, copy ctor assignment operator and helpers
//////////
-// public
-
relational::relational() : basic(TINFO_relational)
{
- debugmsg("relational default constructor",LOGLEVEL_CONSTRUCT);
-}
-
-relational::~relational()
-{
- debugmsg("relational destructor",LOGLEVEL_DESTRUCT);
- destroy(false);
+ debugmsg("relational default ctor",LOGLEVEL_CONSTRUCT);
}
-relational::relational(const relational & other)
-{
- debugmsg("relational copy constructor",LOGLEVEL_CONSTRUCT);
- copy(other);
-}
-
-const relational & relational::operator=(const relational & other)
-{
- debugmsg("relational operator=",LOGLEVEL_ASSIGNMENT);
- if (this != &other) {
- destroy(true);
- copy(other);
- }
- return *this;
-}
-
-// protected
-
void relational::copy(const relational & other)
{
basic::copy(other);
o=other.o;
}
-void relational::destroy(bool call_parent)
-{
- if (call_parent) basic::destroy(call_parent);
-}
+DEFAULT_DESTROY(relational)
//////////
-// other constructors
+// other ctors
//////////
// public
relational::relational(const ex & lhs, const ex & rhs, operators oper) : basic(TINFO_relational)
{
- debugmsg("relational constructor ex,ex,operator",LOGLEVEL_CONSTRUCT);
+ debugmsg("relational ctor ex,ex,operator",LOGLEVEL_CONSTRUCT);
lh=lhs;
rh=rhs;
o=oper;
// archiving
//////////
-/** Construct object from archive_node. */
relational::relational(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
{
- debugmsg("relational constructor from archive_node", LOGLEVEL_CONSTRUCT);
+ debugmsg("relational ctor from archive_node", LOGLEVEL_CONSTRUCT);
unsigned int opi;
if (!(n.find_unsigned("op", opi)))
throw (std::runtime_error("unknown relational operator in archive"));
n.find_ex("rh", rh, sym_lst);
}
-/** Unarchive the object. */
-ex relational::unarchive(const archive_node &n, const lst &sym_lst)
-{
- return (new relational(n, sym_lst))->setflag(status_flags::dynallocated);
-}
-
-/** Archive the object. */
void relational::archive(archive_node &n) const
{
inherited::archive(n);
n.add_unsigned("op", o);
}
+DEFAULT_UNARCHIVE(relational)
+
//////////
-// functions overriding virtual functions from bases classes
+// functions overriding virtual functions from base classes
//////////
// public
-basic * relational::duplicate() const
-{
- debugmsg("relational duplicate",LOGLEVEL_DUPLICATE);
- return new relational(*this);
-}
-
-void relational::print(std::ostream & os, unsigned upper_precedence) const
+void relational::print(const print_context & c, unsigned level) const
{
debugmsg("relational print",LOGLEVEL_PRINT);
- if (precedence<=upper_precedence) os << "(";
- lh.print(os,precedence);
- switch (o) {
- case equal:
- os << "==";
- break;
- case not_equal:
- os << "!=";
- break;
- case less:
- os << "<";
- break;
- case less_or_equal:
- os << "<=";
- break;
- case greater:
- os << ">";
- break;
- case greater_or_equal:
- os << ">=";
- break;
- default:
- os << "(INVALID RELATIONAL OPERATOR)";
- }
- rh.print(os,precedence);
- if (precedence<=upper_precedence) os << ")";
-}
-void relational::printraw(std::ostream & os) const
-{
- debugmsg("relational printraw",LOGLEVEL_PRINT);
- os << "RELATIONAL(";
- lh.printraw(os);
- os << ",";
- rh.printraw(os);
- os << ",";
- switch (o) {
- case equal:
- os << "==";
- break;
- case not_equal:
- os << "!=";
- break;
- case less:
- os << "<";
- break;
- case less_or_equal:
- os << "<=";
- break;
- case greater:
- os << ">";
- break;
- case greater_or_equal:
- os << ">=";
- break;
- default:
- os << "(INVALID RELATIONAL OPERATOR)";
- }
- os << ")";
-}
+ if (is_of_type(c, print_tree)) {
-void relational::printcsrc(std::ostream & os, unsigned type, unsigned upper_precedence) const
-{
- debugmsg("relational print csrc", LOGLEVEL_PRINT);
- if (precedence<=upper_precedence)
- os << "(";
+ inherited::print(c, level);
- // Print left-hand expression
- lh.bp->printcsrc(os, type, precedence);
+ } else {
- // Print relational operator
- switch (o) {
+ if (precedence() <= level)
+ c.s << "(";
+ lh.print(c, precedence());
+ switch (o) {
case equal:
- os << "==";
+ c.s << "==";
break;
case not_equal:
- os << "!=";
+ c.s << "!=";
break;
case less:
- os << "<";
+ c.s << "<";
break;
case less_or_equal:
- os << "<=";
+ c.s << "<=";
break;
case greater:
- os << ">";
+ c.s << ">";
break;
case greater_or_equal:
- os << ">=";
+ c.s << ">=";
break;
default:
- os << "(INVALID RELATIONAL OPERATOR)";
- break;
+ c.s << "(INVALID RELATIONAL OPERATOR)";
+ }
+ rh.print(c, precedence());
+ if (precedence() <= level)
+ c.s << ")";
}
-
- // Print right-hand operator
- rh.bp->printcsrc(os, type, precedence);
-
- if (precedence <= upper_precedence)
- os << ")";
}
bool relational::info(unsigned inf) const
return i==0 ? lh : rh;
}
-
-ex relational::eval(int level) const
-{
- if (level==1) {
- return this->hold();
- }
- if (level == -max_recursion_level) {
- throw(std::runtime_error("max recursion level reached"));
- }
- return (new relational(lh.eval(level-1),rh.eval(level-1),o))->setflag(status_flags::dynallocated | status_flags::evaluated);
-}
-ex relational::evalf(int level) const
+ex relational::eval(int level) const
{
if (level==1)
- return *this;
+ return this->hold();
- if (level==-max_recursion_level)
+ if (level == -max_recursion_level)
throw(std::runtime_error("max recursion level reached"));
- return (new relational(lh.eval(level-1),rh.eval(level-1),o))->setflag(status_flags::dynallocated);
+ return (new relational(lh.eval(level-1),rh.eval(level-1),o))->setflag(status_flags::dynallocated | status_flags::evaluated);
}
ex relational::simplify_ncmul(const exvector & v) const
int relational::compare_same_type(const basic & other) const
{
GINAC_ASSERT(is_exactly_of_type(other, relational));
- const relational & oth=static_cast<const relational &>(const_cast<basic &>(other));
-
- int cmpval;
+ const relational &oth = static_cast<const relational &>(other);
if (o == oth.o) {
- cmpval = lh.compare(oth.lh);
- if (cmpval==0)
- return rh.compare(oth.rh);
- else
+ int cmpval = lh.compare(oth.lh);
+ if (cmpval)
return cmpval;
+ else
+ return rh.compare(oth.rh);
}
- if (o<oth.o)
- return -1;
- else
- return 1;
+ return (o < oth.o) ? -1 : 1;
+}
+
+bool relational::match_same_type(const basic & other) const
+{
+ GINAC_ASSERT(is_exactly_of_type(other, relational));
+ const relational &oth = static_cast<const relational &>(other);
+
+ return o == oth.o;
}
unsigned relational::return_type(void) const
// non-virtual functions in this class
//////////
+/** Cast the relational into a boolean, mainly for evaluation within an
+ * if-statement. Note that (a<b) == false does not imply (a>=b) == true in
+ * the general symbolic case. A false result means the comparison is either
+ * false or undecidable (except of course for !=, where true means either
+ * unequal or undecidable). */
relational::operator bool() const
{
- // please note that (a<b) == false does not imply (a>=b) == true
- // a false result means the comparison is either false or undecidable
- // (except for !=, where true means unequal or undecidable)
- ex df = lh-rh;
+ const ex df = lh-rh;
if (!is_ex_exactly_of_type(df,numeric))
// cannot decide on non-numerical results
return o==not_equal ? true : false;
- int cmpval = ex_to_numeric(df).compare(_num0());
switch (o) {
case equal:
- return cmpval==0;
+ return ex_to<numeric>(df).is_zero();
case not_equal:
- return cmpval!=0;
+ return !ex_to<numeric>(df).is_zero();
case less:
- return cmpval<0;
+ return ex_to<numeric>(df)<_num0();
case less_or_equal:
- return cmpval<=0;
+ return ex_to<numeric>(df)<=_num0();
case greater:
- return cmpval>0;
+ return ex_to<numeric>(df)>_num0();
case greater_or_equal:
- return cmpval>=0;
+ return ex_to<numeric>(df)>=_num0();
default:
throw(std::logic_error("invalid relational operator"));
}
}
-//////////
-// static member variables
-//////////
-
-// protected
-
-unsigned relational::precedence=20;
-
-//////////
-// global constants
-//////////
-
-const relational some_relational;
-const std::type_info & typeid_relational = typeid(some_relational);
-
-#ifndef NO_NAMESPACE_GINAC
} // namespace GiNaC
-#endif // ndef NO_NAMESPACE_GINAC
git://www.ginac.de / ginac.git / blobdiff