Upsilon/poincare/src/matrix_dimension.cpp

#include <poincare/matrix_dimension.h>
#include <poincare/matrix.h>
extern "C" {
#include <assert.h>
}
#include <cmath>

namespace Poincare {

Expression::Type MatrixDimension::type() const {
  return Type::MatrixDimension;
}

Expression * MatrixDimension::clone() const {
  MatrixDimension * a = new MatrixDimension(m_operands, true);
  return a;
}

Expression MatrixDimension::shallowReduce(Context& context, Preferences::AngleUnit angleUnit) {
  Expression * e = Expression::shallowReduce(context, angleUnit);
  if (e != this) {
    return e;
  }
#if MATRIX_EXACT_REDUCING
  Expression * op = editableOperand(0);
  if (op->type() == Type::Matrix) {
    Matrix * m = static_cast<Matrix *>(op);
    const Expression * newOperands[2] = {new Rational(m->numberOfRows()), new Rational(m->numberOfColumns())};
    return replaceWith(new Matrix(newOperands, 1, 2, false), true);
  }
  if (!op->recursivelyMatches(Expression::IsMatrix)) {
    const Expression * newOperands[2] = {RationalReference(1), RationalReference(1)};
    return replaceWith(new Matrix(newOperands, 1, 2, false), true);
  }
  return this;
#else
  const Expression * newOperands[2] = {RationalReference(1), RationalReference(1)};
  return replaceWith(new Matrix(newOperands, 1, 2, false), true);
#endif
}

template<typename T>
Evaluation<T> MatrixDimension::templatedApproximate(Context& context, Preferences::AngleUnit angleUnit) const {
  Evaluation<T> * input = operand(0)->privateApproximate(T(), context, angleUnit);
  std::complex<T> operands[2];
  if (input->type() == Evaluation<T>::Type::MatrixComplex) {
    operands[0] = std::complex<T>(static_cast<MatrixComplex<T> *>(input)->numberOfRows());
    operands[1] = std::complex<T>(static_cast<MatrixComplex<T> *>(input)->numberOfColumns());
  } else {
    operands[0] = std::complex<T>(1.0);
    operands[1] = std::complex<T>(1.0);
  }
  delete input;
  return new MatrixComplex<T>(operands, 1, 2);
}


}