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/bounded_static_hierarchy.h>
#include <poincare/expression_array.h>
extern "C" {
#include <assert.h>
}
namespace Poincare {
template<int T>
BoundedStaticHierarchy<T>::BoundedStaticHierarchy() :
StaticHierarchy<T>(),
m_numberOfOperands(0)
{
}
template<int T>
BoundedStaticHierarchy<T>::BoundedStaticHierarchy(const Expression * const * operands, int numberOfOperands, bool cloneOperands) :
m_numberOfOperands(numberOfOperands)
{
StaticHierarchy<T>::build(operands, numberOfOperands, cloneOperands);
}
template<>
BoundedStaticHierarchy<2>::BoundedStaticHierarchy(const Expression * e1, const Expression * e2, bool cloneOperands) :
BoundedStaticHierarchy(ExpressionArray(e1, e2).array(), 2, cloneOperands)
{
}
template<>
BoundedStaticHierarchy<2>::BoundedStaticHierarchy(const Expression * e, bool cloneOperands) :
BoundedStaticHierarchy((Expression **)&e, 1, cloneOperands)
{
}
template<int T>
void BoundedStaticHierarchy<T>::setArgument(ListData * listData, int numberOfOperands, bool clone) {
StaticHierarchy<T>::setArgument(listData, numberOfOperands, clone);
m_numberOfOperands = listData->numberOfOperands();
}
template<int T>
bool BoundedStaticHierarchy<T>::hasValidNumberOfOperands(int numberOfOperands) const {
return numberOfOperands >= 1 && numberOfOperands <= T;
}
template class Poincare::BoundedStaticHierarchy<2>;
}
|