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
|
#include <poincare/product.h>
#include <poincare/multiplication.h>
#include "layout/product_layout.h"
extern "C" {
#include <assert.h>
#include <stdlib.h>
}
#include <cmath>
namespace Poincare {
Product::Product() :
Sequence("product")
{
}
Expression::Type Product::type() const {
return Type::Product;
}
Expression * Product::cloneWithDifferentOperands(Expression** newOperands,
int numberOfOperands, bool cloneOperands) const {
assert(newOperands != nullptr);
Product * p = new Product();
p->setArgument(newOperands, numberOfOperands, cloneOperands);
return p;
}
int Product::emptySequenceValue() const {
return 1;
}
ExpressionLayout * Product::createSequenceLayoutWithArgumentLayouts(ExpressionLayout * subscriptLayout, ExpressionLayout * superscriptLayout, ExpressionLayout * argumentLayout) const {
return new ProductLayout(subscriptLayout, superscriptLayout, argumentLayout);
}
template<typename T>
Evaluation<T> * Product::templatedEvaluateWithNextTerm(Evaluation<T> * a, Evaluation<T> * b) const {
if (a->numberOfOperands() == 1 && b->numberOfOperands() == 1) {
return new Complex<T>(Multiplication::compute(*(a->complexOperand(0)), *(b->complexOperand(0))));
}
if (a->numberOfOperands() == 1) {
return Multiplication::computeOnComplexAndMatrix(a->complexOperand(0), b);
}
return Multiplication::computeOnMatrices(a, b);
}
}
|