Пример #1
0
ex
ex_collect_to_ex(const ex_collect_t& ec, const exvector& vars)
{
	exvector ev;
	ev.reserve(ec.size());
	for (std::size_t i = 0; i < ec.size(); ++i) {
		exvector tv;
		tv.reserve(vars.size() + 1);
		for (std::size_t j = 0; j < vars.size(); ++j) {
			const exp_vector_t& exp_vector(ec[i].first);

			bug_on(exp_vector.size() != vars.size(),
				"expected " << vars.size() << " variables, "
				"expression has " << exp_vector.size() << " instead");

			if (exp_vector[j] != 0)
				tv.push_back(pow(vars[j], exp_vector[j]));
		}
		tv.push_back(ec[i].second);
		ex tmp = dynallocate<mul>(tv);
		ev.push_back(tmp);
	}
	ex ret = dynallocate<add>(ev);
	return ret;
}
Пример #2
0
exp_vector_t degree_vector(ex e, const exvector& vars)
{
	e = e.expand();
	exp_vector_t dvec(vars.size());
	for (std::size_t i = vars.size(); i-- != 0; ) {
		const int deg_i = e.degree(vars[i]);
		e = e.coeff(vars[i], deg_i);
		dvec[i] = deg_i;
	}
	return dvec;
}
Пример #3
0
static unsigned check_factorization(const exvector& factors)
{
	ex e = (new mul(factors))->setflag(status_flags::dynallocated);
	ex ef = factor(e.expand());
	if (ef.nops() != factors.size()) {
		clog << "wrong number of factors, expected " << factors.size() <<
			", got " << ef.nops();
		return 1;
	}
	for (size_t i = 0; i < ef.nops(); ++i) {
		if (find(factors.begin(), factors.end(), ef.op(i)) == factors.end()) {
			clog << "wrong factorization: term not found: " << ef.op(i);
			return 1;
		}
	}
	return 0;
}
Пример #4
0
static ex make_divide_expr(const exvector& args)
{
	exvector rest_args;
	rest_args.reserve(args.size() - 1);
	std::copy(args.begin() + 1, args.end(), std::back_inserter(rest_args));
	ex rest_base = (new mul(rest_args))->setflag(status_flags::dynallocated);
	ex rest = pow(rest_base, *_num_1_p);
	return (new mul(args[0], rest))->setflag(status_flags::dynallocated);
}
Пример #5
0
static void
collect_term(ex_collect_priv_t& ec, const ex& e, const exvector& vars)
{
	if (e.is_zero())
		return;
	static const ex ex1(1);
	exp_vector_t key(vars.size());
	ex pre_coeff = e;
	for (std::size_t i = 0; i < vars.size(); ++i) {
		const int var_i_pow = pre_coeff.degree(vars[i]);
		key[i] = var_i_pow;
		pre_coeff = pre_coeff.coeff(vars[i], var_i_pow);
	}
	auto i = ec.find(key);
	if (i != ec.end())
		i->second += pre_coeff;
	else
		ec.insert(ex_collect_priv_t::value_type(key, pre_coeff));
}
Пример #6
0
 GinacConstFunction::GinacConstFunction( const exvector& exs, const lst& params) 
     : Function( exs.size(), 0, params.nops()),
     exs_(exs), params_(params) {
         if(print__all){
         //std::cerr << "GinacConstFunction = ";					/**/
         //for(unsigned int i = 0; i < exs_.size(); i++ ){     /**/
         //    std::cerr << "[f("<<i<<") ="<<exs_[i] << "] " ; /**/
         //}													/**/
         //std::cerr << std::endl;								/**/
     	//}
     }
     
 void GinacConstFunction::eval(bool do_f, bool do_g, bool do_H){
     
     lst argsAndParams;
     lst::const_iterator params_it = params_.begin();
     
     for( unsigned int i = 0; params_it != params_.end(); params_it++, i++ ){
         argsAndParams.append( ex_to<symbol>(*params_it) == p(i));
     }
     //std::cerr << "NEXT FUNC"<< std::endl;           /**/
     
     if (do_f){
         for(unsigned int i = 0; i < exs_.size(); i++ ){
             f(i) = ex_to<numeric>(exs_[i].subs( argsAndParams )).to_double();
             //std::cerr << "f("<<i<<") ="<<f(i)<< std::endl; /**/
         }
     }
     
     if (do_g){
         clear_g();
     }
     
     if (do_H){
         clear_h();
     }
 }
Пример #7
0
static ex make_binop_expr(const int binop, const exvector& args)
{
	switch (binop) {
		case '+':
			return (new add(args))->setflag(status_flags::dynallocated);
		case '-':
			return make_minus_expr(args);
		case '*':
			return (new mul(args))->setflag(status_flags::dynallocated);
		case '/':
			return make_divide_expr(args);
		case '^':
			if (args.size() != 2)
				throw std::invalid_argument(
						std::string(__func__) 
						+ ": power should have exactly 2 operands");
			return pow(args[0], args[1]);
		default:
			throw std::invalid_argument(
					std::string(__func__) 
					+ ": invalid binary operation: " 
					+ char(binop));
	}
}