6663b6c9
 adorian
projet complet av...
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
#include <poincare/matrix_transpose.h>
#include <poincare/matrix.h>
#include <poincare/complex.h>
#include <poincare/division.h>
extern "C" {
#include <assert.h>
}
#include <cmath>
namespace Poincare {
Expression::Type MatrixTranspose::type() const {
return Type::MatrixTranspose;
}
Expression * MatrixTranspose::clone() const {
MatrixTranspose * a = new MatrixTranspose(m_operands, true);
return a;
}
Expression * MatrixTranspose::shallowReduce(Context& context, AngleUnit angleUnit) {
Expression * e = Expression::shallowReduce(context, angleUnit);
if (e != this) {
return e;
}
Expression * op = editableOperand(0);
#if MATRIX_EXACT_REDUCING
if (op->type() == Type::Matrix) {
Matrix * transpose = static_cast<Matrix *>(op)->createTranspose();
return replaceWith(transpose, true);
}
if (!op->recursivelyMatches(Expression::IsMatrix)) {
return replaceWith(op, true);
}
return this;
#else
return replaceWith(op, true);
#endif
}
template<typename T>
Expression * MatrixTranspose::templatedApproximate(Context& context, AngleUnit angleUnit) const {
Expression * input = operand(0)->approximate<T>(context, angleUnit);
Expression * result = nullptr;
if (input->type() == Type::Complex) {
result = input->clone();
} else {
assert(input->type() == Type::Matrix);
result = static_cast<Matrix *>(input)->createTranspose();
}
delete input;
return result;
}
}
|