mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-03 19:35:42 +00:00
Code Activity

change SASSERT to VERIFY

Browse source
This commit is contained in:
Chuyue Sun 2024-07-19 16:59:40 +00:00
parent dfac2b7857
commit 751ef0561b
1 changed files with 12 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

24
src/test/heap.cpp
View file

@ -38,7 +38,7 @@ static void tst1() {
for (int i = 0; i < N * 3; i++) { for (int i = 0; i < N * 3; i++) {
int val = heap_rand() % N; int val = heap_rand() % N;
if (!h.contains(val)) { if (!h.contains(val)) {
SASSERT(!t.contains(val)); VERIFY(!t.contains(val));
h.insert(val); h.insert(val);
t.insert(val); t.insert(val);
} }
@ -46,26 +46,26 @@ static void tst1() {
if (!t.contains(val)) { if (!t.contains(val)) {
for (int v : t) std::cout << v << "\n"; for (int v : t) std::cout << v << "\n";
} }
SASSERT(t.contains(val)); VERIFY(t.contains(val));
} }
} }
SASSERT(h.check_invariant()); VERIFY(h.check_invariant());
for (int v : t) { for (int v : t) {
SASSERT(h.contains(v)); VERIFY(h.contains(v));
} }
while (!h.empty()) { while (!h.empty()) {
int m1 = h.min_value(); int m1 = h.min_value();
int m2 = h.erase_min(); int m2 = h.erase_min();
(void)m1; (void)m1;
(void)m2; (void)m2;
SASSERT(m1 == m2); VERIFY(m1 == m2);
SASSERT(-1 < m2); VERIFY(-1 < m2);
} }
} }
int g_value[N]; int g_value[N];
struct lt_proc2 { bool operator()(int v1, int v2) const { SASSERT(v1 < N && v2 < N); return g_value[v1] < g_value[v2]; } }; struct lt_proc2 { bool operator()(int v1, int v2) const { VERIFY(v1 < N && v2 < N); return g_value[v1] < g_value[v2]; } };
typedef heap<lt_proc2> int_heap2; typedef heap<lt_proc2> int_heap2;
static void init_values() { static void init_values() {
@ -98,7 +98,7 @@ static void tst2() {
TRACE("heap", tout << "inserting: " << val << "\n";); TRACE("heap", tout << "inserting: " << val << "\n";);
h.insert(val); h.insert(val);
TRACE("heap", dump_heap(h, tout);); TRACE("heap", dump_heap(h, tout););
SASSERT(h.contains(val)); VERIFY(h.contains(val));
} }
} }
else if (cmd <= 6) { else if (cmd <= 6) {
@ -107,7 +107,7 @@ static void tst2() {
TRACE("heap", tout << "removing: " << val << "\n";); TRACE("heap", tout << "removing: " << val << "\n";);
h.erase(val); h.erase(val);
TRACE("heap", dump_heap(h, tout);); TRACE("heap", dump_heap(h, tout););
SASSERT(!h.contains(val)); VERIFY(!h.contains(val));
} }
} }
else if (cmd <= 8) { else if (cmd <= 8) {
@ -128,12 +128,12 @@ static void tst2() {
} }
} }
else { else {
SASSERT(h.check_invariant()); VERIFY(h.check_invariant());
} }
} }
SASSERT(h.check_invariant()); VERIFY(h.check_invariant());
h.reset(); h.reset();
SASSERT(h.check_invariant()); VERIFY(h.check_invariant());
} }
void tst_heap() { void tst_heap() {