* Implementation of GiNaC's non-commutative products of 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 "ex.h"
#include "add.h"
#include "mul.h"
+#include "archive.h"
#include "debugmsg.h"
+#include "utils.h"
+#ifndef NO_GINAC_NAMESPACE
namespace GiNaC {
+#endif // ndef NO_GINAC_NAMESPACE
+
+GINAC_IMPLEMENT_REGISTERED_CLASS(ncmul, exprseq)
//////////
// default constructor, destructor, copy constructor assignment operator and helpers
void ncmul::copy(ncmul const & other)
{
- exprseq::copy(other);
+ inherited::copy(other);
}
void ncmul::destroy(bool call_parent)
{
- if (call_parent) exprseq::destroy(call_parent);
+ if (call_parent) inherited::destroy(call_parent);
}
//////////
// public
ncmul::ncmul(ex const & lh, ex const & rh) :
- exprseq(lh,rh)
+ inherited(lh,rh)
{
debugmsg("ncmul constructor from ex,ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
ncmul::ncmul(ex const & f1, ex const & f2, ex const & f3) :
- exprseq(f1,f2,f3)
+ inherited(f1,f2,f3)
{
debugmsg("ncmul constructor from 3 ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
ncmul::ncmul(ex const & f1, ex const & f2, ex const & f3,
- ex const & f4) : exprseq(f1,f2,f3,f4)
+ ex const & f4) : inherited(f1,f2,f3,f4)
{
debugmsg("ncmul constructor from 4 ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
ncmul::ncmul(ex const & f1, ex const & f2, ex const & f3,
- ex const & f4, ex const & f5) : exprseq(f1,f2,f3,f4,f5)
+ ex const & f4, ex const & f5) : inherited(f1,f2,f3,f4,f5)
{
debugmsg("ncmul constructor from 5 ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
ncmul::ncmul(ex const & f1, ex const & f2, ex const & f3,
ex const & f4, ex const & f5, ex const & f6) :
- exprseq(f1,f2,f3,f4,f5,f6)
+ inherited(f1,f2,f3,f4,f5,f6)
{
debugmsg("ncmul constructor from 6 ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
-ncmul::ncmul(exvector const & v, bool discardable) : exprseq(v,discardable)
+ncmul::ncmul(exvector const & v, bool discardable) : inherited(v,discardable)
{
debugmsg("ncmul constructor from exvector,bool",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
-ncmul::ncmul(exvector * vp) : exprseq(vp)
+ncmul::ncmul(exvector * vp) : inherited(vp)
{
debugmsg("ncmul constructor from exvector *",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_ncmul;
}
+
+//////////
+// archiving
+//////////
+
+/** Construct object from archive_node. */
+ncmul::ncmul(const archive_node &n, const lst &sym_lst) : inherited(n, sym_lst)
+{
+ debugmsg("ncmul constructor from archive_node", LOGLEVEL_CONSTRUCT);
+}
+
+/** Unarchive the object. */
+ex ncmul::unarchive(const archive_node &n, const lst &sym_lst)
+{
+ return (new ncmul(n, sym_lst))->setflag(status_flags::dynallocated);
+}
+
+/** Archive the object. */
+void ncmul::archive(archive_node &n) const
+{
+ inherited::archive(n);
+}
+
//////////
// functions overriding virtual functions from bases classes
return new ncmul(*this);
}
+void ncmul::print(ostream & os, unsigned upper_precedence) const
+{
+ debugmsg("ncmul print",LOGLEVEL_PRINT);
+ printseq(os,'(','%',')',precedence,upper_precedence);
+}
+
+void ncmul::printraw(ostream & os) const
+{
+ debugmsg("ncmul printraw",LOGLEVEL_PRINT);
+
+ os << "%(";
+ for (exvector::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
+ (*it).bp->printraw(os);
+ os << ",";
+ }
+ os << ",hash=" << hashvalue << ",flags=" << flags;
+ os << ")";
+}
+
+void ncmul::printcsrc(ostream & os, unsigned upper_precedence) const
+{
+ debugmsg("ncmul print csrc",LOGLEVEL_PRINT);
+ exvector::const_iterator it;
+ exvector::const_iterator itend = seq.end()-1;
+ os << "ncmul(";
+ for (it=seq.begin(); it!=itend; ++it) {
+ (*it).bp->printcsrc(os,precedence);
+ os << ",";
+ }
+ (*it).bp->printcsrc(os,precedence);
+ os << ")";
+}
+
bool ncmul::info(unsigned inf) const
{
throw(std::logic_error("which flags have to be implemented in ncmul::info()?"));
exvector term;
term=expanded_seq;
for (l=0; l<number_of_adds; l++) {
- ASSERT(is_ex_exactly_of_type(expanded_seq[positions_of_adds[l]],add));
+ GINAC_ASSERT(is_ex_exactly_of_type(expanded_seq[positions_of_adds[l]],add));
add const & addref=ex_to_add(expanded_seq[positions_of_adds[l]]);
term[positions_of_adds[l]]=addref.recombine_pair_to_ex(addref.seq[k[l]]);
}
if (coeff_found) return (new ncmul(coeffseq,1))->setflag(status_flags::dynallocated);
- return exZERO();
+ return _ex0();
}
unsigned ncmul::count_factors(ex const & e) const
if ((is_ex_exactly_of_type(e,mul)&&(e.return_type()!=return_types::commutative))||
(is_ex_exactly_of_type(e,ncmul))) {
unsigned factors=0;
- for (int i=0; i<e.nops(); i++) {
+ for (unsigned i=0; i<e.nops(); i++)
factors += count_factors(e.op(i));
- }
+
return factors;
}
return 1;
{
if ((is_ex_exactly_of_type(e,mul)&&(e.return_type()!=return_types::commutative))||
(is_ex_exactly_of_type(e,ncmul))) {
- for (int i=0; i<e.nops(); i++) {
+ for (unsigned i=0; i<e.nops(); i++)
append_factors(v,e.op(i));
- }
+
return;
}
v.push_back(e);
if (assocseq.size()==1) return *(seq.begin());
// ncmul() -> 1
- if (assocseq.size()==0) return exONE();
+ if (assocseq.size()==0) return _ex1();
// determine return types
unsignedvector rettypes;
}
++i;
}
- ASSERT(count_commutative+count_noncommutative+count_noncommutative_composite==assocseq.size());
+ GINAC_ASSERT(count_commutative+count_noncommutative+count_noncommutative_composite==assocseq.size());
// ncmul(...,c1,...,c2,...) ->
// *(c1,c2,ncmul(...)) (pull out commutative elements)
if (count_noncommutative_composite==0) {
// there are neither commutative nor noncommutative_composite
// elements in assocseq
- ASSERT(count_commutative==0);
+ GINAC_ASSERT(count_commutative==0);
exvectorvector evv;
unsignedvector rttinfos;
}
}
-#ifdef DOASSERT
- ASSERT(evv.size()==rttinfos.size());
- ASSERT(evv.size()>0);
+#ifdef DO_GINAC_ASSERT
+ GINAC_ASSERT(evv.size()==rttinfos.size());
+ GINAC_ASSERT(evv.size()>0);
unsigned s=0;
for (i=0; i<evv.size(); ++i) {
s += evv[i].size();
}
- ASSERT(s==assocseq.size());
-#endif // def DOASSERT
+ GINAC_ASSERT(s==assocseq.size());
+#endif // def DO_GINAC_ASSERT
// if all elements are of same type, simplify the string
if (evv.size()==1) {
int ncmul::compare_same_type(basic const & other) const
{
- return exprseq::compare_same_type(other);
+ return inherited::compare_same_type(other);
}
unsigned ncmul::return_type(void) const
}
}
// all factors checked
- ASSERT(!all_commutative); // not all factors should commute, because this is a ncmul();
+ GINAC_ASSERT(!all_commutative); // not all factors should commute, because this is a ncmul();
return all_commutative ? return_types::commutative : return_types::noncommutative;
}
ex simplified_ncmul(exvector const & v)
{
if (v.size()==0) {
- return exONE();
+ return _ex1();
} else if (v.size()==1) {
return v[0];
}
status_flags::evaluated);
}
+#ifndef NO_GINAC_NAMESPACE
} // namespace GiNaC
+#endif // ndef NO_GINAC_NAMESPACE
git://www.ginac.de / ginac.git / blobdiff