* Interface to GiNaC's ABC. */
/*
- * GiNaC Copyright (C) 1999-2006 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2008 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 <cstddef> // for size_t
#include <vector>
+#include <set>
#include <map>
+#include <typeinfo> // for typeid
// CINT needs <algorithm> to work properly with <vector>
#include <algorithm>
class print_context;
typedef std::vector<ex> exvector;
+typedef std::set<ex, ex_is_less> exset;
typedef std::map<ex, ex, ex_is_less> exmap;
// Define this to enable some statistical output for comparisons and hashing
// default constructor, destructor, copy constructor and assignment operator
protected:
- basic() : tinfo_key(&tinfo_static), flags(0) {}
+ basic() : flags(0) {}
public:
/** basic destructor, virtual because class ex will delete objects of
const basic & operator=(const basic & other);
protected:
- /** Constructor with specified tinfo_key (used by derived classes instead
- * of the default constructor to avoid assigning tinfo_key twice). */
- basic(tinfo_t ti) : tinfo_key(ti), flags(0) {}
-
// new virtual functions which can be overridden by derived classes
public: // only const functions please (may break reference counting)
virtual ex & operator[](size_t i);
// pattern matching
- virtual bool has(const ex & other) const;
- virtual bool match(const ex & pattern, lst & repl_lst) const;
+ virtual bool has(const ex & other, unsigned options = 0) const;
+ virtual bool match(const ex & pattern, exmap & repls) const;
protected:
virtual bool match_same_type(const basic & other) const;
public:
}
// degree/coeff
+ virtual bool is_polynomial(const ex & var) const;
virtual int degree(const ex & s) const;
virtual int ldegree(const ex & s) const;
virtual ex coeff(const ex & s, int n = 1) const;
// noncommutativity
virtual unsigned return_type() const;
- virtual const basic* return_type_tinfo() const;
+ virtual return_type_t return_type_tinfo() const;
- // complex conjugation
+ // functions for complex expressions
virtual ex conjugate() const;
+ virtual ex real_part() const;
+ virtual ex imag_part() const;
// functions that should be called from class ex only
protected:
void print_dispatch(const registered_class_info & ri, const print_context & c, unsigned level) const;
+ /** Save (serialize) the object into archive node.
+ *
+ * Losely speaking, this method turns an expression into a byte
+ * stream (which can be saved and restored later on, or sent via
+ * network, etc.)
+ */
+ virtual void archive(archive_node& n) const;
+ /** Load (deserialize) the object from an archive node.
+ *
+ * @note This method is essentially a constructor. However,
+ * constructors can't be virtual. So, if unarchiving routines
+ * are implemented as constructors one would need to define such
+ * a constructor in every class, even if all it does is simply
+ * calling constructor of a superclass.
+ */
+ virtual void read_archive(const archive_node& n, lst& syms); // no const
+
ex subs_one_level(const exmap & m, unsigned options) const;
ex diff(const symbol & s, unsigned nth = 1) const;
int compare(const basic & other) const;
}
}
- tinfo_t tinfo() const {return tinfo_key;}
-
/** Set some status_flags. */
const basic & setflag(unsigned f) const {flags |= f; return *this;}
// member variables
protected:
- tinfo_t tinfo_key; ///< type info
mutable unsigned flags; ///< of type status_flags
mutable unsigned hashvalue; ///< hash value
};
template <class T>
inline bool is_exactly_a(const basic & obj)
{
- return obj.tinfo() == &T::tinfo_static;
+ return typeid(T) == typeid(obj);
}
} // namespace GiNaC