#include "debugmsg.h"
#include "utils.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(mul, expairseq)
{
debugmsg("mul constructor from ex,ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_mul;
- overall_coeff=_ex1();
+ overall_coeff = _ex1();
construct_from_2_ex(lh,rh);
GINAC_ASSERT(is_canonical());
}
{
debugmsg("mul constructor from exvector",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_mul;
- overall_coeff=_ex1();
+ overall_coeff = _ex1();
construct_from_exvector(v);
GINAC_ASSERT(is_canonical());
}
-/*
-mul::mul(const epvector & v, bool do_not_canonicalize)
-{
- debugmsg("mul constructor from epvector,bool",LOGLEVEL_CONSTRUCT);
- tinfo_key = TINFO_mul;
- if (do_not_canonicalize) {
- seq=v;
-#ifdef EXPAIRSEQ_USE_HASHTAB
- combine_same_terms(); // to build hashtab
-#endif // def EXPAIRSEQ_USE_HASHTAB
- } else {
- construct_from_epvector(v);
- }
- GINAC_ASSERT(is_canonical());
-}
-*/
-
mul::mul(const epvector & v)
{
debugmsg("mul constructor from epvector",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_mul;
- overall_coeff=_ex1();
+ overall_coeff = _ex1();
construct_from_epvector(v);
GINAC_ASSERT(is_canonical());
}
{
debugmsg("mul constructor from epvector,ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_mul;
- overall_coeff=oc;
+ overall_coeff = oc;
construct_from_epvector(v);
GINAC_ASSERT(is_canonical());
}
debugmsg("mul constructor from epvector *,ex",LOGLEVEL_CONSTRUCT);
tinfo_key = TINFO_mul;
GINAC_ASSERT(vp!=0);
- overall_coeff=oc;
+ overall_coeff = oc;
construct_from_epvector(*vp);
delete vp;
GINAC_ASSERT(is_canonical());
factors.push_back(lh);
factors.push_back(mh);
factors.push_back(rh);
- overall_coeff=_ex1();
+ overall_coeff = _ex1();
construct_from_exvector(factors);
GINAC_ASSERT(is_canonical());
}
return this->hold();
}
+ex mul::evalf(int level) const
+{
+ if (level==1)
+ return mul(seq,overall_coeff);
+
+ if (level==-max_recursion_level)
+ throw(std::runtime_error("max recursion level reached"));
+
+ epvector s;
+ s.reserve(seq.size());
+
+ --level;
+ for (epvector::const_iterator it=seq.begin(); it!=seq.end(); ++it) {
+ s.push_back(combine_ex_with_coeff_to_pair((*it).rest.evalf(level),
+ (*it).coeff));
+ }
+ return mul(s,overall_coeff.evalf(level));
+}
+
exvector mul::get_indices(void) const
{
// return union of indices of factors
// protected
+/** Implementation of ex::diff() for a product. It applies the product rule.
+ * @see ex::diff */
+ex mul::derivative(const symbol & s) const
+{
+ exvector new_seq;
+ new_seq.reserve(seq.size());
+
+ // D(a*b*c)=D(a)*b*c+a*D(b)*c+a*b*D(c)
+ for (unsigned i=0; i!=seq.size(); i++) {
+ epvector sub_seq=seq;
+ sub_seq[i] = split_ex_to_pair(sub_seq[i].coeff*
+ power(sub_seq[i].rest,sub_seq[i].coeff-1)*
+ sub_seq[i].rest.diff(s));
+ new_seq.push_back((new mul(sub_seq,overall_coeff))->setflag(status_flags::dynallocated));
+ }
+ return (new add(new_seq))->setflag(status_flags::dynallocated);
+}
+
int mul::compare_same_type(const basic & other) const
{
return inherited::compare_same_type(other);
intvector positions_of_adds;
intvector number_of_add_operands;
- epvector * expanded_seqp=expandchildren(options);
+ epvector * expanded_seqp = expandchildren(options);
const epvector & expanded_seq = expanded_seqp==0 ? seq : *expanded_seqp;
positions_of_adds.resize(expanded_seq.size());
number_of_add_operands.resize(expanded_seq.size());
- int number_of_adds=0;
- int number_of_expanded_terms=1;
+ int number_of_adds = 0;
+ int number_of_expanded_terms = 1;
- unsigned current_position=0;
- epvector::const_iterator last=expanded_seq.end();
+ unsigned current_position = 0;
+ epvector::const_iterator last = expanded_seq.end();
for (epvector::const_iterator cit=expanded_seq.begin(); cit!=last; ++cit) {
if (is_ex_exactly_of_type((*cit).rest,add)&&
(ex_to_numeric((*cit).coeff).is_equal(_num1()))) {
- positions_of_adds[number_of_adds]=current_position;
- const add & expanded_addref=ex_to_add((*cit).rest);
- unsigned addref_nops=expanded_addref.nops();
- number_of_add_operands[number_of_adds]=addref_nops;
+ positions_of_adds[number_of_adds] = current_position;
+ const add & expanded_addref = ex_to_add((*cit).rest);
+ unsigned addref_nops = expanded_addref.nops();
+ number_of_add_operands[number_of_adds] = addref_nops;
number_of_expanded_terms *= addref_nops;
number_of_adds++;
}
epvector * mul::expandchildren(unsigned options) const
{
- epvector::const_iterator last=seq.end();
- epvector::const_iterator cit=seq.begin();
+ epvector::const_iterator last = seq.end();
+ epvector::const_iterator cit = seq.begin();
while (cit!=last) {
- const ex & factor=recombine_pair_to_ex(*cit);
- const ex & expanded_factor=factor.expand(options);
+ const ex & factor = recombine_pair_to_ex(*cit);
+ const ex & expanded_factor = factor.expand(options);
if (!are_ex_trivially_equal(factor,expanded_factor)) {
// something changed, copy seq, eval and return it
s->reserve(seq.size());
// copy parts of seq which are known not to have changed
- epvector::const_iterator cit2=seq.begin();
+ epvector::const_iterator cit2 = seq.begin();
while (cit2!=cit) {
s->push_back(*cit2);
++cit2;
// protected
-unsigned mul::precedence=50;
+unsigned mul::precedence = 50;
//////////
//////////
const mul some_mul;
-const type_info & typeid_mul=typeid(some_mul);
+const type_info & typeid_mul = typeid(some_mul);
-#ifndef NO_GINAC_NAMESPACE
+#ifndef NO_NAMESPACE_GINAC
} // namespace GiNaC
-#endif // ndef NO_GINAC_NAMESPACE
+#endif // ndef NO_NAMESPACE_GINAC