Poly/Term.cpp at master · liamw1/Poly · GitHub

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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include "Term.h"
#include <iostream>

template<unsigned int N>
Term<N>::Term() {}

template<unsigned int N>
Term<N>::Term(double iniC, const std::array<unsigned int, N>& iniAlpha)
{
  c = iniC;
  alpha = iniAlpha;
}

template<unsigned int N>
unsigned int Term<N>::operator()(unsigned int index) const
{
  return alpha[index];
}

template<unsigned int N>
unsigned int& Term<N>::operator[](unsigned int index)
{
  return alpha[index];
}

template<unsigned int N>
Term<N> Term<N>::operator*(const Term<N>& t) const
{
  std::array<unsigned int, N> gamma;
  for (int i = 0; i < N; ++i)
    gamma[i] = alpha[i] + t(i);
  return Term(c * t.c, gamma);
}

template<unsigned int N>
Term<N> Term<N>::operator/(const Term<N>& t) const
{
  std::array<unsigned int, N> gamma;
  for (int i = 0; i < N; ++i)
    gamma[i] = alpha[i] - t(i);
  return Term(c / t.c, gamma);
}

template<unsigned int N>
std::array<unsigned int, N> Term<N>::degree() const
{
  return alpha;
}

template<unsigned int N>
unsigned int Term<N>::totalOrder() const
{
  unsigned int totalOrder = 0;
  for (int i = 0; i < N; ++i)
    totalOrder += alpha[i];
  return totalOrder;
}

template<unsigned int N>
bool Term<N>::divides(const Term<N>& t) const
{
  for (int i = 0; i < N; ++i)
  {
    if (alpha[i] > t(i))
      return false;
  }
  return true;
}

template class Term<3>;
template class Term<26>;