3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-28 00:48:45 +00:00

ensure that assertions within the unit tests are exercised in all build modes, remove special handling of SASSERT for release mode #1163

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2017-07-26 20:28:55 -07:00
parent 3f8b63f5a8
commit b1298d7bde
67 changed files with 1277 additions and 1285 deletions

View file

@ -37,16 +37,16 @@ static void display(T const & beg, T const & end) {
static void tst1() {
int_table t;
t.insert(10);
SASSERT(t.contains(10));
ENSURE(t.contains(10));
t.insert(20);
SASSERT(t.contains(20));
ENSURE(t.contains(20));
t.insert(30);
SASSERT(t.contains(30));
SASSERT(t.size() == 3);
ENSURE(t.contains(30));
ENSURE(t.size() == 3);
display(t.begin(), t.end());
t.erase(20);
SASSERT(!t.contains(20));
SASSERT(t.size() == 2);
ENSURE(!t.contains(20));
ENSURE(t.size() == 2);
}
struct dummy_hash {
@ -61,54 +61,54 @@ static void tst2() {
dint_table t;
t.insert(10);
t.insert(12);
SASSERT(t.used_slots() == 1);
ENSURE(t.used_slots() == 1);
display(t.begin(), t.end());
t.insert(13);
display(t.begin(), t.end());
SASSERT(t.used_slots() == 2);
ENSURE(t.used_slots() == 2);
t.insert(14);
SASSERT(t.used_slots() == 2);
SASSERT(t.size() == 4);
ENSURE(t.used_slots() == 2);
ENSURE(t.size() == 4);
display(t.begin(), t.end());
t.erase(12);
SASSERT(!t.contains(12));
SASSERT(t.size() == 3);
SASSERT(t.contains(10));
SASSERT(!t.contains(12));
SASSERT(t.contains(14));
SASSERT(t.contains(13));
ENSURE(!t.contains(12));
ENSURE(t.size() == 3);
ENSURE(t.contains(10));
ENSURE(!t.contains(12));
ENSURE(t.contains(14));
ENSURE(t.contains(13));
t.insert(16);
SASSERT(t.size() == 4);
ENSURE(t.size() == 4);
t.insert(18);
SASSERT(t.size() == 5);
SASSERT(t.used_slots() == 2);
ENSURE(t.size() == 5);
ENSURE(t.used_slots() == 2);
display(t.begin(), t.end());
t.erase(10);
display(t.begin(), t.end());
SASSERT(!t.contains(10));
SASSERT(!t.contains(12));
SASSERT(t.contains(14));
SASSERT(t.contains(13));
SASSERT(t.contains(16));
SASSERT(t.contains(18));
ENSURE(!t.contains(10));
ENSURE(!t.contains(12));
ENSURE(t.contains(14));
ENSURE(t.contains(13));
ENSURE(t.contains(16));
ENSURE(t.contains(18));
}
static void tst3() {
dint_table t;
t.insert(10);
t.insert(12);
SASSERT(t.used_slots() == 1);
SASSERT(t.contains(10));
SASSERT(t.contains(12));
ENSURE(t.used_slots() == 1);
ENSURE(t.contains(10));
ENSURE(t.contains(12));
t.erase(12);
t.erase(10);
SASSERT(t.size() == 0);
SASSERT(t.empty());
SASSERT(t.used_slots() == 0);
ENSURE(t.size() == 0);
ENSURE(t.empty());
ENSURE(t.used_slots() == 0);
t.insert(10);
SASSERT(t.used_slots() == 1);
SASSERT(t.contains(10));
SASSERT(t.size() == 1);
ENSURE(t.used_slots() == 1);
ENSURE(t.contains(10));
ENSURE(t.size() == 1);
}
typedef int_hashtable<int_hash, default_eq<int> > int_set;
@ -123,29 +123,29 @@ static void tst4(unsigned num, unsigned N) {
TRACE("chashtable", tout << "erase " << v << "\n";);
s.erase(v);
t.erase(v);
SASSERT(!t.contains(v));
ENSURE(!t.contains(v));
}
else {
TRACE("chashtable", tout << "insert " << v << "\n";);
s.insert(v);
t.insert(v);
SASSERT(t.contains(v));
ENSURE(t.contains(v));
}
SASSERT(s.size() == t.size());
SASSERT(s.empty() == t.empty());
ENSURE(s.size() == t.size());
ENSURE(s.empty() == t.empty());
}
std::cout << "size: " << s.size() << " " << t.size() << "\n";
int_set::iterator it1 = s.begin();
int_set::iterator end1 = s.end();
for(; it1 != end1; ++it1) {
SASSERT(t.contains(*it1));
ENSURE(t.contains(*it1));
}
typename T::iterator it2 = t.begin();
typename T::iterator end2 = t.end();
for(; it2 != end2; ++it2) {
SASSERT(s.contains(*it2));
SASSERT(t.contains(*it2));
ENSURE(s.contains(*it2));
ENSURE(t.contains(*it2));
}
}
@ -164,10 +164,10 @@ static void tst5() {
static void tst6() {
int_map m;
m.insert(10, 4);
SASSERT(m.contains(10));
ENSURE(m.contains(10));
DEBUG_CODE({
int r;
SASSERT(m.find(10, r) && r == 4);
ENSURE(m.find(10, r) && r == 4);
});
}