* Interface to sequences of expression pairs. */
/*
- * GiNaC Copyright (C) 1999-2015 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2016 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
size_t nops() const override;
ex op(size_t i) const override;
ex map(map_function & f) const override;
- ex eval(int level=0) const override;
+ ex eval() const override;
ex to_rational(exmap & repl) const override;
ex to_polynomial(exmap & repl) const override;
bool match(const ex & pattern, exmap& repl_lst) const override;
protected:
void do_print(const print_context & c, unsigned level) const;
void do_print_tree(const print_tree & c, unsigned level) const;
- void construct_from_2_ex_via_exvector(const ex & lh, const ex & rh);
void construct_from_2_ex(const ex & lh, const ex & rh);
void construct_from_2_expairseq(const expairseq & s1,
const expairseq & s2);
void combine_same_terms_sorted_seq();
bool is_canonical() const;
epvector expandchildren(unsigned options) const;
- epvector evalchildren(int level) const;
+ epvector evalchildren() const;
epvector subschildren(const exmap & m, unsigned options = 0) const;
// member variables
return x;
sort(dummies_of_factor.begin(), dummies_of_factor.end(), ex_is_less());
ex new_factor = rename_dummy_indices_uniquely(used_indices,
- dummies_of_factor, x);
+ dummies_of_factor, x);
combine_indices(dummies_of_factor);
return new_factor;
}
{
exvector new_dummy_indices;
set_union(used_indices.begin(), used_indices.end(),
- dummies_of_factor.begin(), dummies_of_factor.end(),
- std::back_insert_iterator<exvector>(new_dummy_indices), ex_is_less());
+ dummies_of_factor.begin(), dummies_of_factor.end(),
+ std::back_insert_iterator<exvector>(new_dummy_indices), ex_is_less());
used_indices.swap(new_dummy_indices);
}
bool do_renaming;