Lines Matching refs:Constraints
28 assert(!Constraints.empty() && in eliminateUsingFM()
30 unsigned NumVariables = Constraints[0].size(); in eliminateUsingFM()
33 unsigned NumConstraints = Constraints.size(); in eliminateUsingFM()
37 if (Constraints[R1][1] == 0) { in eliminateUsingFM()
39 NR.push_back(Constraints[R1][0]); in eliminateUsingFM()
41 NR.push_back(Constraints[R1][i]); in eliminateUsingFM()
53 if (Constraints[R2][1] == 0) in eliminateUsingFM()
56 if ((Constraints[R1][1] < 0 && Constraints[R2][1] < 0) || in eliminateUsingFM()
57 (Constraints[R1][1] > 0 && Constraints[R2][1] > 0)) in eliminateUsingFM()
62 if (Constraints[UpperR][1] < 0) in eliminateUsingFM()
71 if (MulOverflow(Constraints[UpperR][I], in eliminateUsingFM()
72 ((-1) * Constraints[LowerR][1] / GCD), M1)) in eliminateUsingFM()
74 if (MulOverflow(Constraints[LowerR][I], in eliminateUsingFM()
75 (Constraints[UpperR][1] / GCD), M2)) in eliminateUsingFM()
91 Constraints = std::move(NewSystem); in eliminateUsingFM()
98 while (!Constraints.empty() && Constraints[0].size() > 1) { in mayHaveSolutionImpl()
103 if (Constraints.empty() || Constraints[0].size() > 1) in mayHaveSolutionImpl()
106 return all_of(Constraints, [](auto &R) { return R[0] >= 0; }); in mayHaveSolutionImpl()
110 if (Constraints.empty()) in dump()
113 for (const auto &Row : Constraints) { in dump()
131 for (unsigned i = 1; i < Constraints.back().size(); ++i) in dump()