libpoly/test/polyxx/test_polynomial.cpp at 4e2b911250a9d06f6838cfbd6fc1ffd7e0749fb5 · Ovascos/libpoly · 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include <polyxx.h>

#include "doctest.h"

using namespace poly;

TEST_CASE("polynomial::properties") {
  Variable x("x");
  Variable y("y");
  Polynomial p1;
  Polynomial p2(Integer(5));
  Polynomial p3 = 3*x;
  Polynomial p4 = 3*x*y*y + 7*x;

  CHECK(is_zero(p1));
  CHECK_FALSE(is_zero(p2));
  CHECK_FALSE(is_zero(p3));
  CHECK_FALSE(is_zero(p4));

  CHECK(is_constant(p1));
  CHECK(is_constant(p2));
  CHECK_FALSE(is_constant(p3));
  CHECK_FALSE(is_constant(p4));

  CHECK_FALSE(is_linear(p1));
  CHECK_FALSE(is_linear(p2));
  CHECK(is_linear(p3));
  CHECK_FALSE(is_linear(p4));

  CHECK(is_lc_constant(p1));
  CHECK(is_lc_constant(p2));
  CHECK(is_lc_constant(p3));
  CHECK_FALSE(is_lc_constant(p4));

  CHECK(degree(p1) == 0);
  CHECK(degree(p2) == 0);
  CHECK(degree(p3) == 1);
  CHECK(degree(p4) == 2);

  CHECK(is_univariate(p3));
}

TEST_CASE("polynomial::resultant") {
  Variable y("y");
  Variable x("x");
  Polynomial p = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  Polynomial q = 7 * pow(x, 5) + 5 * pow(x, 4);
  Polynomial r = resultant(p, q);
  CHECK(r == 28588707 * pow(y, 5) - 49925970 * pow(y, 4) + 34802730 * pow(y, 3) - 12107160 * pow(y, 2) + 2102235 * y - 145774);
}

TEST_CASE("polynomial::discriminant") {
  Variable y("y");
  Variable x("x");
  Polynomial p = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  Polynomial d = discriminant(p);
  CHECK(d == 11337408 * pow(y, 5) - 35095680 * pow(y, 4) + 34197120 * pow(y, 3) - 14999040 * pow(y, 2) + 3099840 * y - 246656);
}
TEST_CASE("polynomial::psc") {
  Variable y("y");
  Variable x("x");
  Polynomial p = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  Polynomial q = 7 * pow(x, 5) + 5 * pow(x, 4);
  auto tmp = psc(p, q);

  CHECK(tmp.size() == 6);
  CHECK(tmp[0] == 28588707 * pow(y, 5) - 49925970 * pow(y, 4) + 34802730 * pow(y, 3) - 12107160 * pow(y, 2) + 2102235 * y - 145774);
  CHECK(tmp[1] == 416745 * y * y * y - 416745 * y * y + 138915 * y - 15435);
  CHECK(tmp[2] == Integer(0));
  CHECK(tmp[3] == Integer(0));
  CHECK(tmp[4] == Integer(-45));
  CHECK(tmp[5] == Integer(7));
}

TEST_CASE("polynomial::operator<<") {
  Variable y("y");
  Variable x("x");
  Polynomial p = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  std::stringstream out;
  out << p;
  CHECK(out.str() == "1*x^6 + 2*x^5 + (3*y - 1)");
}

TEST_CASE("polynomial::constructor") {
  Variable y("y");
  Variable x("x");
  Polynomial p = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  lp_polynomial_t* ptr = p.get_internal();

  Polynomial p_cp(p);
  Polynomial p_mv(std::move(p));
  CHECK(ptr == p_mv.get_internal());
  CHECK(ptr != p_cp.get_internal());
  CHECK(p_cp == p_mv);

  Polynomial p_mv_a, p_cp_a;
  p_cp_a = p_cp;
  p_mv_a = std::move(p_mv);
  CHECK(p_cp == p_cp_a);
  CHECK(ptr == p_mv_a.get_internal());
}

TEST_CASE("polynomial::evaluate") {
  Variable x("x");
  Variable y("y");
  Polynomial p1 = 1 * pow(x, 6) + 2 * pow(x, 5) + 3 * y - 1;
  Polynomial p2 = 1 * y * pow(x + 1, 4);

  // full assignment
  Assignment a;
  a.set(x, -1);
  a.set(y, 2);
  CHECK(a.has(x));
  CHECK(a.has(y));

  CHECK(evaluate(p1, a) == Value(4));
  CHECK(evaluate_constraint(p1, a, SignCondition::GE) == true);
  CHECK(evaluate_constraint(p1, a, SignCondition::LT) == false);
  CHECK(evaluate_constraint(p1, a, SignCondition::EQ) == false);
  CHECK(evaluate_constraint_subs(p1, a, SignCondition::GE) == 1);
  CHECK(evaluate_constraint_subs(p1, a, SignCondition::LT) == 0);
  CHECK(evaluate_constraint_subs(p1, a, SignCondition::EQ) == 0);

  CHECK(evaluate(p2, a) == Value(0));
  CHECK(evaluate_constraint(p2, a, SignCondition::GE) == true);
  CHECK(evaluate_constraint(p2, a, SignCondition::LT) == false);
  CHECK(evaluate_constraint(p2, a, SignCondition::EQ) == true);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::GE) == 1);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::LT) == 0);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::EQ) == 1);

  // partial assignment
  a.unset(y);
  CHECK(a.has(x));
  CHECK(!a.has(y));

  CHECK(evaluate_constraint_subs(p1, a, SignCondition::GE) == -1);
  CHECK(evaluate_constraint_subs(p1, a, SignCondition::LT) == -1);
  CHECK(evaluate_constraint_subs(p1, a, SignCondition::EQ) == -1);

  CHECK(evaluate_constraint(p2, a, SignCondition::GE) == true);
  CHECK(evaluate_constraint(p2, a, SignCondition::LT) == false);
  CHECK(evaluate_constraint(p2, a, SignCondition::EQ) == true);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::GE) == 1);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::LT) == 0);
  CHECK(evaluate_constraint_subs(p2, a, SignCondition::EQ) == 1);
}