* Interface to GiNaC's light-weight expression handles. */
/*
- * 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
#define __GINAC_EX_H__
#include <iostream>
-#include <ginac/basic.h>
-#include <ginac/operators.h>
+#include "basic.h"
+#include "operators.h"
+#ifndef NO_NAMESPACE_GINAC
namespace GiNaC {
+#endif // ndef NO_NAMESPACE_GINAC
class ex;
class expand_options;
class symbol;
class lst;
-typedef vector<ex> exvector;
+// Sorry, this is the only constant to pollute the global scope, the other ones
+// are defined in utils.h and not visible from outside.
+extern const ex & _ex0(void); // single ex(numeric(0))
-// enum definitions
-
-ex const & exZERO(void);
-ex const & exONE(void);
-ex const & exTWO(void);
-ex const & exTHREE(void);
-ex const & exMINUSONE(void);
-ex const & exHALF(void);
-ex const & exMINUSHALF(void);
+// typedef vector<ex> exvector;
#define INLINE_EX_CONSTRUCTORS
-/** Lightweight interface to GiNaC's symbolic objects. Basically all it does is
+/** Lightweight wrapper for GiNaC's symbolic objects. Basically all it does is
* to hold a pointer to the other objects, manage the reference counting and
* provide methods for manipulation of these objects. */
class ex
public:
ex()
#ifdef INLINE_EX_CONSTRUCTORS
- : bp(exZERO().bp)
+ : bp(_ex0().bp)
{
- ASSERT(exZERO().bp!=0);
- ASSERT(exZERO().bp->flags & status_flags::dynallocated);
- ASSERT(bp!=0);
+ GINAC_ASSERT(_ex0().bp!=0);
+ GINAC_ASSERT(_ex0().bp->flags & status_flags::dynallocated);
+ GINAC_ASSERT(bp!=0);
++bp->refcount;
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
}
#else
;
~ex()
#ifdef INLINE_EX_CONSTRUCTORS
{
- ASSERT(bp!=0);
- ASSERT(bp->flags & status_flags::dynallocated);
+ GINAC_ASSERT(bp!=0);
+ GINAC_ASSERT(bp->flags & status_flags::dynallocated);
if (--bp->refcount == 0) {
delete bp;
}
;
#endif // def INLINE_EX_CONSTRUCTORS
- ex(ex const & other)
+ ex(const ex & other)
#ifdef INLINE_EX_CONSTRUCTORS
: bp(other.bp)
{
- ASSERT(bp!=0);
- ASSERT((bp->flags) & status_flags::dynallocated);
+ GINAC_ASSERT(bp!=0);
+ GINAC_ASSERT((bp->flags) & status_flags::dynallocated);
++bp->refcount;
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
}
#else
;
#endif // def INLINE_EX_CONSTRUCTORS
- ex const & operator=(ex const & other)
+ const ex & operator=(const ex & other)
#ifdef INLINE_EX_CONSTRUCTORS
{
- ASSERT(bp!=0);
- ASSERT(bp->flags & status_flags::dynallocated);
- ASSERT(other.bp!=0);
- ASSERT(other.bp->flags & status_flags::dynallocated);
+ GINAC_ASSERT(bp!=0);
+ GINAC_ASSERT(bp->flags & status_flags::dynallocated);
+ GINAC_ASSERT(other.bp!=0);
+ GINAC_ASSERT(other.bp->flags & status_flags::dynallocated);
++other.bp->refcount;
basic * tmpbp=other.bp;
if (--bp->refcount==0) {
delete bp;
}
bp=tmpbp;
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
return *this;
}
#else
;
#endif // def INLINE_EX_CONSTRUCTORS
+#ifdef CINT_CONVERSION_WORKAROUND
+ // workaround to fix the missing automatic derived->basic->ex conversion
+ const ex & operator=(const basic & other)
+ {
+ return *this=ex(other);
+ }
+#endif // def CINT_CONVERSION_WORKAROUND
+
// other constructors
public:
- ex(basic const & other)
+ ex(const basic & other)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_basic(other);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
+ ex(int i)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_int(i);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
+ ex(unsigned int i)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_uint(i);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
+ ex(long i)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_long(i);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
+ ex(unsigned long i)
#ifdef INLINE_EX_CONSTRUCTORS
- {
- construct_from_basic(other);
- }
+ {
+ construct_from_ulong(i);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
#else
;
#endif // def INLINE_EX_CONSTRUCTORS
- ex(int const i);
- ex(unsigned int const i);
- ex(long const i);
- ex(unsigned long const i);
- ex(double const d);
+ ex(double const d)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_double(d);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
// functions overriding virtual functions from bases classes
// none
void dbgprint(void) const;
void dbgprinttree(void) const;
bool info(unsigned inf) const;
- int nops() const;
+ unsigned nops() const;
ex expand(unsigned options=0) const;
- bool has(ex const & other) const;
- int degree(symbol const & s) const;
- int ldegree(symbol const & s) const;
- ex coeff(symbol const & s, int const n=1) const;
- ex lcoeff(symbol const & s) const { return coeff(s, degree(s)); }
- ex tcoeff(symbol const & s) const { return coeff(s, ldegree(s)); }
- ex numer(bool normalize = true) const;
- ex denom(bool normalize = true) const;
+ bool has(const ex & other) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ bool has(basic const & other) const { return has(ex(other)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ int degree(const symbol & s) const;
+ int ldegree(const symbol & s) const;
+ ex coeff(const symbol & s, int n=1) const;
+ ex lcoeff(const symbol & s) const { return coeff(s, degree(s)); }
+ ex tcoeff(const symbol & s) const { return coeff(s, ldegree(s)); }
+ ex numer(void) const;
+ ex denom(void) const;
ex unit(const symbol &x) const;
ex content(const symbol &x) const;
numeric integer_content(void) const;
ex primpart(const symbol &x) const;
ex primpart(const symbol &x, const ex &cont) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex primpart(const symbol &x, const basic &cont) const { return primpart(x,ex(cont)); }
+#endif // def CINT_CONVERSION_WORKAROUND
ex normal(int level = 0) const;
ex smod(const numeric &xi) const;
numeric max_coefficient(void) const;
- ex collect(symbol const & s) const;
+ ex collect(const symbol & s) const;
ex eval(int level = 0) const;
ex evalf(int level = 0) const;
- ex diff(symbol const & s, unsigned nth = 1) const;
- ex series(symbol const & s, ex const & point, int order = 6) const;
- ex subs(lst const & ls, lst const & lr) const;
- ex subs(ex const & e) const;
+ ex diff(const symbol & s, unsigned nth = 1) const;
+ ex series(const symbol & s, const ex & point, int order = 6) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex series(const symbol & s, const basic & point, int order = 6) const { return series(s,ex(point),order); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ ex subs(const lst & ls, const lst & lr) const;
+ ex subs(const ex & e) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex subs(const basic & e) const { return subs(ex(e)); }
+#endif // def CINT_CONVERSION_WORKAROUND
exvector get_indices(void) const;
- ex simplify_ncmul(exvector const & v) const;
- ex operator[](ex const & index) const;
- ex operator[](int const i) const;
- ex op(int const i) const;
- ex & let_op(int const i);
- int compare(ex const & other) const
+ ex simplify_ncmul(const exvector & v) const;
+ ex operator[](const ex & index) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex operator[](const basic & index) const { return operator[](ex(index)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ ex operator[](int i) const;
+ ex op(int i) const;
+ ex & let_op(int i);
+ ex lhs(void) const;
+ ex rhs(void) const;
+ int compare(const ex & other) const
#ifdef INLINE_EX_CONSTRUCTORS
{
- ASSERT(bp!=0);
- ASSERT(other.bp!=0);
+ GINAC_ASSERT(bp!=0);
+ GINAC_ASSERT(other.bp!=0);
if (bp==other.bp) {
// special case: both expression point to same basic, trivially equal
return 0;
#else
;
#endif // def INLINE_EX_CONSTRUCTORS
- bool is_equal(ex const & other) const
+#ifdef CINT_CONVERSION_WORKAROUND
+ int compare(const basic & other) const { return compare(ex(other)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ bool is_equal(const ex & other) const
#ifdef INLINE_EX_CONSTRUCTORS
{
- ASSERT(bp!=0);
- ASSERT(other.bp!=0);
+ GINAC_ASSERT(bp!=0);
+ GINAC_ASSERT(other.bp!=0);
if (bp==other.bp) {
// special case: both expression point to same basic, trivially equal
return true;
#else
;
#endif // def INLINE_EX_CONSTRUCTORS
- bool is_zero(void) const {return compare(exZERO()) == 0;};
+#ifdef CINT_CONVERSION_WORKAROUND
+ bool is_equal(const basic & other) const { return is_equal(ex(other)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ bool is_zero(void) const {return compare(_ex0())==0;};
unsigned return_type(void) const;
unsigned return_type_tinfo(void) const;
unsigned gethash(void) const;
- ex exadd(ex const & rh) const;
- ex exmul(ex const & rh) const;
- ex exncmul(ex const & rh) const;
+ ex exadd(const ex & rh) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex exadd(const basic & rh) const { return exadd(ex(rh)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ ex exmul(const ex & rh) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex exmul(const basic & rh) const { return exmul(ex(rh)); }
+#endif // def CINT_CONVERSION_WORKAROUND
+ ex exncmul(const ex & rh) const;
+#ifdef CINT_CONVERSION_WORKAROUND
+ ex exncmul(const basic & rh) const { return exncmul(ex(rh)); }
+#endif // def CINT_CONVERSION_WORKAROUND
private:
- void construct_from_basic(basic const & other);
+ void construct_from_basic(const basic & other);
+ void construct_from_int(int i);
+ void construct_from_uint(unsigned int i);
+ void construct_from_long(long i);
+ void construct_from_ulong(unsigned long i);
+ void construct_from_double(double d);
void makewriteable();
+#ifdef OBSCURE_CINT_HACK
+public:
+ static bool last_created_or_assigned_bp_can_be_converted_to_ex(void)
+ {
+ if (last_created_or_assigned_bp==0) return false;
+ if ((last_created_or_assigned_bp->flags &
+ status_flags::dynallocated)==0) return false;
+ if ((last_created_or_assigned_bp->flags &
+ status_flags::evaluated)==0) return false;
+ return true;
+ }
+protected:
+ void update_last_created_or_assigned_bp(void)
+ {
+ if (last_created_or_assigned_bp!=0) {
+ if (--last_created_or_assigned_bp->refcount == 0) {
+ delete last_created_or_assigned_bp;
+ }
+ }
+ last_created_or_assigned_bp=bp;
+ ++last_created_or_assigned_bp->refcount;
+ last_created_or_assigned_exp=(long)(void *)(this);
+ }
+#endif // def OBSCURE_CINT_HACK
+
// member variables
public:
basic *bp;
+#ifdef OBSCURE_CINT_HACK
+ static basic * last_created_or_assigned_bp;
+ static basic * dummy_bp;
+ static long last_created_or_assigned_exp;
+#endif // def OBSCURE_CINT_HACK
};
// utility functions
}
// wrapper functions around member functions
-inline int nops(ex const & thisex)
+inline unsigned nops(const ex & thisex)
{ return thisex.nops(); }
-inline ex expand(ex const & thisex, unsigned options = 0)
+inline ex expand(const ex & thisex, unsigned options = 0)
{ return thisex.expand(options); }
-inline bool has(ex const & thisex, ex const & other)
+inline bool has(const ex & thisex, const ex & other)
{ return thisex.has(other); }
-inline int degree(ex const & thisex, symbol const & s)
+inline int degree(const ex & thisex, const symbol & s)
{ return thisex.degree(s); }
-inline int ldegree(ex const & thisex, symbol const & s)
+inline int ldegree(const ex & thisex, const symbol & s)
{ return thisex.ldegree(s); }
-inline ex coeff(ex const & thisex, symbol const & s, int const n=1)
+inline ex coeff(const ex & thisex, const symbol & s, int n=1)
{ return thisex.coeff(s, n); }
-inline ex numer(ex const & thisex, bool normalize = true)
-{ return thisex.numer(normalize); }
+inline ex numer(const ex & thisex)
+{ return thisex.numer(); }
-inline ex denom(ex const & thisex, bool normalize = true)
-{ return thisex.denom(normalize); }
+inline ex denom(const ex & thisex)
+{ return thisex.denom(); }
-inline ex normal(ex const & thisex, int level=0)
+inline ex normal(const ex & thisex, int level=0)
{ return thisex.normal(level); }
-inline ex collect(ex const & thisex, symbol const & s)
+inline ex collect(const ex & thisex, const symbol & s)
{ return thisex.collect(s); }
-inline ex eval(ex const & thisex, int level = 0)
+inline ex eval(const ex & thisex, int level = 0)
{ return thisex.eval(level); }
-inline ex evalf(ex const & thisex, int level = 0)
+inline ex evalf(const ex & thisex, int level = 0)
{ return thisex.evalf(level); }
-inline ex diff(ex const & thisex, symbol const & s, unsigned nth = 1)
+inline ex diff(const ex & thisex, const symbol & s, unsigned nth = 1)
{ return thisex.diff(s, nth); }
-inline ex subs(ex const & thisex, ex const & e)
+inline ex series(const ex & thisex, const symbol & s, const ex & point, int order = 6)
+{ return thisex.series(s, point, order); }
+
+inline ex subs(const ex & thisex, const ex & e)
{ return thisex.subs(e); }
-inline ex subs(ex const & thisex, lst const & ls, lst const & lr)
+inline ex subs(const ex & thisex, const lst & ls, const lst & lr)
{ return thisex.subs(ls, lr); }
+inline ex op(const ex & thisex, int i)
+{ return thisex.op(i); }
+
+inline ex lhs(const ex & thisex)
+{ return thisex.lhs(); }
+
+inline ex rhs(const ex & thisex)
+{ return thisex.rhs(); }
+
+inline bool is_zero(const ex & thisex)
+{ return thisex.is_zero(); }
+
inline void swap(ex & e1, ex & e2)
{ e1.swap(e2); }
+#ifndef NO_NAMESPACE_GINAC
} // namespace GiNaC
+#endif // ndef NO_NAMESPACE_GINAC
#endif // ndef __GINAC_EX_H__
+
git://www.ginac.de / ginac.git / blobdiff