* Implementation of GiNaC's ABC. */
/*
- * 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 "utils.h"
#include "debugmsg.h"
-#ifndef NO_NAMESPACE_GINAC
namespace GiNaC {
-#endif // ndef NO_NAMESPACE_GINAC
-GINAC_IMPLEMENT_REGISTERED_CLASS(basic, void)
+GINAC_IMPLEMENT_REGISTERED_CLASS_NO_CTORS(basic, void)
//////////
-// default constructor, destructor, copy constructor assignment operator and helpers
+// default ctor, dtor, copy ctor assignment operator and helpers
//////////
// public
-#ifndef INLINE_BASIC_CONSTRUCTORS
-basic::basic() : flags(0), refcount(0), tinfo_key(TINFO_BASIC)
+basic::basic(const basic & other) : tinfo_key(TINFO_basic), flags(0), refcount(0)
{
- debugmsg("basic default constructor", LOGLEVEL_CONSTRUCT);
- // nothing to do
-}
-
-basic::~basic()
-{
- debugmsg("basic destructor", LOGLEVEL_DESTRUCT);
- destroy(false);
- GINAC_ASSERT((!(flags & status_flags::dynallocated))||(refcount==0));
-}
-
-basic::basic(const basic & other) : flags(0), refcount(0), tinfo_key(TINFO_BASIC)
-{
- debugmsg("basic copy constructor", LOGLEVEL_CONSTRUCT);
+ debugmsg("basic copy ctor", LOGLEVEL_CONSTRUCT);
copy(other);
}
-#endif
const basic & basic::operator=(const basic & other)
{
// protected
-// none (all inlined)
+// none (all conditionally inlined)
//////////
-// other constructors
+// other ctors
//////////
-#ifndef INLINE_BASIC_CONSTRUCTORS
-basic::basic(unsigned ti) : flags(0), refcount(0), tinfo_key(ti)
-{
- debugmsg("basic constructor with tinfo_key", LOGLEVEL_CONSTRUCT);
- // nothing to do
-}
-#endif
+// none (all conditionally inlined)
//////////
// archiving
/** Construct object from archive_node. */
basic::basic(const archive_node &n, const lst &sym_lst) : flags(0), refcount(0)
{
- debugmsg("basic constructor from archive_node", LOGLEVEL_CONSTRUCT);
+ debugmsg("basic ctor from archive_node", LOGLEVEL_CONSTRUCT);
// Reconstruct tinfo_key from class name
std::string class_name;
// public
-/** Output to stream formatted to be useful as ginsh input. */
+/** Output to ostream formatted as parsable (as in ginsh) input.
+ * Generally, superfluous parenthesis should be avoided as far as possible. */
void basic::print(std::ostream & os, unsigned upper_precedence) const
{
debugmsg("basic print",LOGLEVEL_PRINT);
- os << "[basic object]";
+ os << "[" << class_name() << " object]";
}
-/** Output to stream in ugly raw format, so brave developers can have a look
- * at the underlying structure. */
+/** Output to ostream in ugly raw format, so brave developers can have a look
+ * at the underlying structure. */
void basic::printraw(std::ostream & os) const
{
debugmsg("basic printraw",LOGLEVEL_PRINT);
- os << "[basic object]";
+ os << "[" << class_name() << " object]";
}
-/** Output to stream formatted in tree- (indented-) form, so developers can
+/** Output to ostream formatted in tree- (indented-) form, so developers can
* have a look at the underlying structure. */
void basic::printtree(std::ostream & os, unsigned indent) const
{
}
}
-/** Output to stream formatted as C-source.
+/** Output to ostream formatted as C-source.
*
* @param os a stream for output
* @param type variable type (one of the csrc_types)
debugmsg("basic print csrc", LOGLEVEL_PRINT);
}
-/** Little wrapper arount print to be called within a debugger. */
+/** Little wrapper arount print to be called within a debugger.
+ * This is needed because you cannot call foo.print(cout) from within the
+ * debugger because it might not know what cout is. This method can be
+ * invoked with no argument and it will simply print to stdout.
+ *
+ * @see basic::print*/
void basic::dbgprint(void) const
{
- print(std::cerr);
+ this->print(std::cerr);
std::cerr << std::endl;
}
-/** Little wrapper arount printtree to be called within a debugger. */
+/** Little wrapper arount printtree to be called within a debugger.
+ *
+ * @see basic::dbgprint
+ * @see basic::printtree */
void basic::dbgprinttree(void) const
{
- printtree(std::cerr,0);
+ this->printtree(std::cerr,0);
}
+/** Create a new copy of this on the heap. One can think of this as simulating
+ * a virtual copy constructor which is needed for instance by the refcounted
+ * construction of an ex from a basic. */
basic * basic::duplicate() const
{
debugmsg("basic duplicate",LOGLEVEL_DUPLICATE);
* @see class info_flags */
bool basic::info(unsigned inf) const
{
- return false; // all possible properties are false for basic objects
+ // all possible properties are false for basic objects
+ return false;
}
/** Number of operands/members. */
}
/** Search ocurrences. An object 'has' an expression if it is the expression
- * itself or one of the children 'has' it. */
+ * itself or one of the children 'has' it. As a consequence (according to
+ * the definition of children) given e=x+y+z, e.has(x) is true but e.has(x+y)
+ * is false. */
bool basic::has(const ex & other) const
{
GINAC_ASSERT(other.bp!=0);
if (is_equal(*other.bp)) return true;
if (nops()>0) {
- for (unsigned i=0; i<nops(); i++) {
- if (op(i).has(other)) return true;
- }
+ for (unsigned i=0; i<nops(); i++)
+ if (op(i).has(other))
+ return true;
}
+
return false;
}
ex basic::collect(const symbol & s) const
{
ex x;
- int ldeg = this->ldegree(s);
- int deg = this->degree(s);
- for (int n=ldeg; n<=deg; n++) {
+ for (int n=this->ldegree(s); n<=this->degree(s); n++)
x += this->coeff(s,n)*power(s,n);
- }
+
return x;
}
-/* Perform automatic symbolic evaluations on expression. */
+/** Perform automatic non-interruptive symbolic evaluation on expression. */
ex basic::eval(int level) const
{
// There is nothing to do for basic objects:
return *this;
}
-/* Substitute a set of symbols. */
+/** Perform automatic symbolic evaluations on indexed expression that
+ * contains this object as the base expression. */
+ex basic::eval_indexed(const basic & i) const
+ // this function can't take a "const ex & i" because that would result
+ // in an infinite eval() loop
+{
+ // There is nothing to do for basic objects
+ return i.hold();
+}
+
+/** Add two indexed expressions. They are guaranteed to be of class indexed
+ * (or a subclass) and their indices are compatible. This function is used
+ * internally by simplify_indexed().
+ *
+ * @param self First indexed expression; it's base object is *this
+ * @param other Second indexed expression
+ * @return sum of self and other
+ * @see ex::simplify_indexed() */
+ex basic::add_indexed(const ex & self, const ex & other) const
+{
+ return self + other;
+}
+
+/** Try to contract two indexed expressions that appear in the same product.
+ * If a contraction exists, the function overwrites one or both of the
+ * expressions and returns true. Otherwise it returns false. It is
+ * guaranteed that both expressions are of class indexed (or a subclass)
+ * and that at least one dummy index has been found. This functions is
+ * used internally by simplify_indexed().
+ *
+ * @param self Pointer to first indexed expression; it's base object is *this
+ * @param other Pointer to second indexed expression
+ * @param v The complete vector of factors
+ * @return true if the contraction was successful, false otherwise
+ * @see ex::simplify_indexed() */
+bool basic::contract_with(exvector::iterator self, exvector::iterator other, exvector & v) const
+{
+ // Do nothing
+ return false;
+}
+
+/** Substitute a set of symbols by arbitrary expressions. The ex returned
+ * will already be evaluated. */
ex basic::subs(const lst & ls, const lst & lr) const
{
return *this;
return ndiff;
}
-exvector basic::get_indices(void) const
+/** Return a vector containing the free indices of an expression. */
+exvector basic::get_free_indices(void) const
{
return exvector(); // return an empty exvector
}
throw(std::logic_error("differentiation not supported by this type"));
}
-/** Returns order relation between two objects of same type. Needs to be
- * implemented by each class. */
+/** Returns order relation between two objects of same type. This needs to be
+ * implemented by each class. It may never return anything else than 0,
+ * signalling equality, or +1 and -1 signalling inequality and determining
+ * the canonical ordering. (Perl hackers will wonder why C++ doesn't feature
+ * the spaceship operator <=> for denoting just this.) */
int basic::compare_same_type(const basic & other) const
{
return compare_pointers(this, &other);
/** Returns true if two objects of same type are equal. Normally needs
* not be reimplemented as long as it wasn't overwritten by some parent
- * class, since it just calls complare_same_type(). */
+ * class, since it just calls compare_same_type(). The reason why this
+ * function exists is that sometimes it is easier to determine equality
+ * than an order relation and then it can be overridden. */
bool basic::is_equal_same_type(const basic & other) const
{
- return compare_same_type(other)==0;
+ return this->compare_same_type(other)==0;
}
unsigned basic::return_type(void) const
return tinfo();
}
+/** Compute the hash value of an object and if it makes sense to store it in
+ * the objects status_flags, do so. The method inherited from class basic
+ * computes a hash value based on the type and hash values of possible
+ * members. For this reason it is well suited for container classes but
+ * atomic classes should override this implementation because otherwise they
+ * would all end up with the same hashvalue. */
unsigned basic::calchash(void) const
{
- unsigned v=golden_ratio_hash(tinfo());
+ unsigned v = golden_ratio_hash(tinfo());
for (unsigned i=0; i<nops(); i++) {
- v=rotate_left_31(v);
+ v = rotate_left_31(v);
v ^= (const_cast<basic *>(this))->op(i).gethash();
}
-
- v = v & 0x7FFFFFFFU;
+
+ // mask out numeric hashes:
+ v &= 0x7FFFFFFFU;
// store calculated hash value only if object is already evaluated
if (flags & status_flags::evaluated) {
setflag(status_flags::hash_calculated);
- hashvalue=v;
+ hashvalue = v;
}
return v;
return subs(ls,lr);
}
-/** Compare objects to establish canonical order.
+/** Compare objects to establish canonical ordering.
* All compare functions return: -1 for *this less than other, 0 equal,
* 1 greater. */
int basic::compare(const basic & other) const
{
unsigned hash_this = gethash();
unsigned hash_other = other.gethash();
-
+
if (hash_this<hash_other) return -1;
if (hash_this>hash_other) return 1;
-
+
unsigned typeid_this = tinfo();
unsigned typeid_other = other.tinfo();
-
+
if (typeid_this<typeid_other) {
- /*
- cout << "hash collision, different types: "
- << *this << " and " << other << endl;
- this->printraw(cout);
- cout << " and ";
- other.printraw(cout);
- cout << endl;
- */
+// std::cout << "hash collision, different types: "
+// << *this << " and " << other << std::endl;
+// this->printraw(std::cout);
+// std::cout << " and ";
+// other.printraw(std::cout);
+// std::cout << std::endl;
return -1;
}
if (typeid_this>typeid_other) {
- /*
- cout << "hash collision, different types: "
- << *this << " and " << other << endl;
- this->printraw(cout);
- cout << " and ";
- other.printraw(cout);
- cout << endl;
- */
+// std::cout << "hash collision, different types: "
+// << *this << " and " << other << std::endl;
+// this->printraw(std::cout);
+// std::cout << " and ";
+// other.printraw(std::cout);
+// std::cout << std::endl;
return 1;
}
-
+
GINAC_ASSERT(typeid(*this)==typeid(other));
-
- int cmpval=compare_same_type(other);
- if ((cmpval!=0)&&(hash_this<0x80000000U)) {
- /*
- cout << "hash collision, same type: "
- << *this << " and " << other << endl;
- this->printraw(cout);
- cout << " and ";
- other.printraw(cout);
- cout << endl;
- */
- }
- return cmpval;
+
+// int cmpval = compare_same_type(other);
+// if ((cmpval!=0) && (hash_this<0x80000000U)) {
+// std::cout << "hash collision, same type: "
+// << *this << " and " << other << std::endl;
+// this->printraw(std::cout);
+// std::cout << " and ";
+// other.printraw(std::cout);
+// std::cout << std::endl;
+// }
+// return cmpval;
+
+ return compare_same_type(other);
}
-/** Test for equality. */
+/** Test for equality.
+ * This is only a quick test, meaning objects should be in the same domain.
+ * You might have to .expand(), .normal() objects first, depending on the
+ * domain of your computation, to get a more reliable answer.
+ *
+ * @see is_equal_same_type */
bool basic::is_equal(const basic & other) const
{
- unsigned hash_this = gethash();
- unsigned hash_other = other.gethash();
-
- if (hash_this!=hash_other) return false;
-
- unsigned typeid_this = tinfo();
- unsigned typeid_other = other.tinfo();
-
- if (typeid_this!=typeid_other) return false;
-
+ if (this->gethash()!=other.gethash())
+ return false;
+ if (this->tinfo()!=other.tinfo())
+ return false;
+
GINAC_ASSERT(typeid(*this)==typeid(other));
-
- return is_equal_same_type(other);
+
+ return this->is_equal_same_type(other);
}
// protected
/** Stop further evaluation.
+ *
* @see basic::eval */
const basic & basic::hold(void) const
{
- return setflag(status_flags::evaluated);
+ return this->setflag(status_flags::evaluated);
}
+/** Ensure the object may be modified without hurting others, throws if this
+ * is not the case. */
void basic::ensure_if_modifiable(void) const
{
- if (refcount>1) {
+ if (this->refcount>1)
throw(std::runtime_error("cannot modify multiply referenced object"));
- }
}
//////////
unsigned basic::precedence = 70;
unsigned basic::delta_indent = 4;
-//////////
-// global constants
-//////////
-
-const basic some_basic;
-const type_info & typeid_basic=typeid(some_basic);
-
//////////
// global variables
//////////
-int max_recursion_level=1024;
+int max_recursion_level = 1024;
-#ifndef NO_NAMESPACE_GINAC
} // namespace GiNaC
-#endif // ndef NO_NAMESPACE_GINAC
git://www.ginac.de / ginac.git / blobdiff