* Implementation of relations between expressions */
/*
- * GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2000 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 "archive.h"
+#include "utils.h"
#include "debugmsg.h"
-#ifndef NO_GINAC_NAMESPACE
+#ifndef NO_NAMESPACE_GINAC
namespace GiNaC {
-#endif // ndef NO_GINAC_NAMESPACE
+#endif // ndef NO_NAMESPACE_GINAC
+
+GINAC_IMPLEMENT_REGISTERED_CLASS(relational, basic)
//////////
// default constructor, destructor, copy constructor assignment operator and helpers
destroy(0);
}
-relational::relational(relational const & other)
+relational::relational(const relational & other)
{
debugmsg("relational copy constructor",LOGLEVEL_CONSTRUCT);
copy(other);
}
-relational const & relational::operator=(relational const & other)
+const relational & relational::operator=(const relational & other)
{
debugmsg("relational operator=",LOGLEVEL_ASSIGNMENT);
if (this != &other) {
// protected
-void relational::copy(relational const & other)
+void relational::copy(const relational & other)
{
basic::copy(other);
lh=other.lh;
// public
-relational::relational(ex const & lhs, ex const & rhs, operators oper) : basic(TINFO_relational)
+relational::relational(const ex & lhs, const ex & rhs, operators oper) : basic(TINFO_relational)
{
debugmsg("relational constructor ex,ex,operator",LOGLEVEL_CONSTRUCT);
lh=lhs;
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);
+ unsigned int opi;
+ if (!(n.find_unsigned("op", opi)))
+ throw (std::runtime_error("unknown relational operator in archive"));
+ o = (operators)opi;
+ n.find_ex("lh", lh, sym_lst);
+ 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_ex("lh", lh);
+ n.add_ex("rh", rh);
+ n.add_unsigned("op", o);
+}
+
//////////
// functions overriding virtual functions from bases classes
//////////
return new relational(*this);
}
+void relational::print(ostream & os, unsigned upper_precedence) 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(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 << ")";
+}
+
+void relational::printcsrc(ostream & os, unsigned type, unsigned upper_precedence) const
+{
+ debugmsg("relational print csrc", LOGLEVEL_PRINT);
+ if (precedence<=upper_precedence)
+ os << "(";
+
+ // Print left-hand expression
+ lh.bp->printcsrc(os, type, precedence);
+
+ // Print relational operator
+ 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)";
+ break;
+ }
+
+ // Print right-hand operator
+ rh.bp->printcsrc(os, type, precedence);
+
+ if (precedence <= upper_precedence)
+ os << ")";
+}
+
bool relational::info(unsigned inf) const
{
switch (inf) {
return 0;
}
-int relational::nops() const
+unsigned relational::nops() const
{
return 2;
}
-ex & relational::let_op(int const i)
+ex & relational::let_op(int i)
{
GINAC_ASSERT(i>=0);
GINAC_ASSERT(i<2);
setflag(status_flags::dynallocated);
}
-ex relational::simplify_ncmul(exvector const & v) const
+ex relational::simplify_ncmul(const exvector & v) const
{
return lh.simplify_ncmul(v);
}
// protected
-int relational::compare_same_type(basic const & other) const
+int relational::compare_same_type(const basic & other) const
{
GINAC_ASSERT(is_exactly_of_type(other, relational));
- relational const & oth=static_cast<relational const &>(const_cast<basic &>(other));
+ const relational & oth=static_cast<const relational &>(const_cast<basic &>(other));
int cmpval;
// new virtual functions which can be overridden by derived classes
//////////
-// none
+/** Left hand side of relational. */
+ex relational::lhs(void) const
+{
+ return lh;
+}
+
+/** Right hand side of relational. */
+ex relational::rhs(void) const
+{
+ return rh;
+}
//////////
// non-virtual functions in this class
if (!is_ex_exactly_of_type(df,numeric)) {
return o==not_equal ? true : false; // cannot decide on non-numerical results
}
- int cmpval=ex_to_numeric(df).compare(numZERO());
+ int cmpval=ex_to_numeric(df).compare(_num0());
switch (o) {
case equal:
return cmpval==0;
//////////
const relational some_relational;
-type_info const & typeid_relational=typeid(some_relational);
+const type_info & typeid_relational=typeid(some_relational);
-#ifndef NO_GINAC_NAMESPACE
+#ifndef NO_NAMESPACE_GINAC
} // namespace GiNaC
-#endif // ndef NO_GINAC_NAMESPACE
+#endif // ndef NO_NAMESPACE_GINAC