33 degree = d > degree ? d : degree;
40 bool Subtraction::needParenthesisWithParent(
const Expression * e)
const {
42 return e->isOfType(types, 6);
51 Matrix * opposite = computeOnMatrixAndComplex(m,
c);
52 if (opposite ==
nullptr) {
57 const Complex<T> * entry =
static_cast<const Complex<T> *
>(opposite->
operand(i));
66 Expression * Subtraction::shallowReduce(Context& context, AngleUnit angleUnit) {
67 Expression * e = Expression::shallowReduce(context, angleUnit);
74 m->shallowReduce(context, angleUnit);
76 return a->shallowReduce(context, angleUnit);
int numberOfColumns() const
static Complex< T > Cartesian(T a, T b)
Expression * replaceWith(Expression *newOperand, bool deleteAfterReplace=true)
Expression * clone() const override
const Expression *const * operands() const override
Type type() const override
int polynomialDegree(char symbolName) const override
const Expression * m_operands[T]
friend class Multiplication
static Complex< T > compute(const Complex< T > c, const Complex< T > d)
int numberOfOperands() const override
int numberOfOperands() const override
const Expression * operand(int i) const
virtual int polynomialDegree(char symbolName) const