mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

clean up build warnings

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2023-02-19 10:08:31 -08:00
parent 9b6ac45e02
commit bc6037464d
2 changed files with 11 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

16
src/muz/spacer/spacer_convex_closure.cpp
View file

@ -22,21 +22,23 @@ Notes:
#include "ast/rewriter/th_rewriter.h"
namespace {
#ifdef Z3DEBUG
bool is_int_matrix(const spacer::spacer_matrix &matrix) {
rational val;
for (unsigned i = 0, rows = matrix.num_rows(); i < rows; i++) {
for (unsigned i = 0, rows = matrix.num_rows(); i < rows; i++)
for (unsigned j = 0, cols = matrix.num_cols(); j < cols; j++)
if (!matrix.get(i, j).is_int()) return false;
}
if (!matrix.get(i, j).is_int())
return false;
return true;
}
bool is_sorted(const vector<rational> &data) {
for (unsigned i = 0; i < data.size() - 1; i++) {
if (!(data[i] >= data[i + 1])) return false;
}
for (unsigned i = 0; i < data.size() - 1; i++)
if (!(data[i] >= data[i + 1]))
return false;
return true;
}
#endif
/// Check whether all elements of \p data are congruent modulo \p m
bool is_congruent_mod(const vector<rational> &data, const rational &m) {