Lines Matching refs:Constraints
29 assert(!Constraints.empty() && in eliminateUsingFM()
31 unsigned NumVariables = Constraints[0].size(); in eliminateUsingFM()
34 unsigned NumConstraints = Constraints.size(); in eliminateUsingFM()
38 if (Constraints[R1][1] == 0) { in eliminateUsingFM()
40 NR.push_back(Constraints[R1][0]); in eliminateUsingFM()
42 NR.push_back(Constraints[R1][i]); in eliminateUsingFM()
54 if (Constraints[R2][1] == 0) in eliminateUsingFM()
57 if ((Constraints[R1][1] < 0 && Constraints[R2][1] < 0) || in eliminateUsingFM()
58 (Constraints[R1][1] > 0 && Constraints[R2][1] > 0)) in eliminateUsingFM()
63 if (Constraints[UpperR][1] < 0) in eliminateUsingFM()
72 if (MulOverflow(Constraints[UpperR][I], in eliminateUsingFM()
73 ((-1) * Constraints[LowerR][1] / GCD), M1)) in eliminateUsingFM()
75 if (MulOverflow(Constraints[LowerR][I], in eliminateUsingFM()
76 (Constraints[UpperR][1] / GCD), M2)) in eliminateUsingFM()
92 Constraints = std::move(NewSystem); in eliminateUsingFM()
99 while (!Constraints.empty() && Constraints[0].size() > 1) { in mayHaveSolutionImpl()
104 if (Constraints.empty() || Constraints[0].size() > 1) in mayHaveSolutionImpl()
107 return all_of(Constraints, [](auto &R) { return R[0] >= 0; }); in mayHaveSolutionImpl()
111 if (Constraints.empty()) in dump()
114 for (auto &Row : Constraints) { in dump()
132 for (unsigned i = 1; i < Constraints.back().size(); ++i) in dump()