mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-07-18 02:16:40 +00:00
Code Activity

other components

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2012-10-02 11:48:48 -07:00
parent e9eab22e5c
commit 68269c43a6
250 changed files with 70871 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

150
test/uint_set.cpp Normal file
View file

@ -0,0 +1,150 @@
/*++
Copyright (c) 2006 Microsoft Corporation
Module Name:
uint_set.cpp
Abstract:
Test sets of unsigned integers.
Author:
Leonardo de Moura (leonardo) 2006-12-07.
Revision History:
--*/
#include"uint_set.h"
#include"vector.h"
static void tst1(unsigned n) {
uint_set s1;
svector<bool> s2(n, false);
unsigned size = 0;
unsigned num_op = rand()%1000;
for (unsigned i = 0; i < num_op; i++) {
unsigned op = rand()%3;
if (op < 2) {
unsigned idx = rand() % n;
if (!s2[idx]) {
size++;
}
s2[idx] = true;
s1.insert(idx);
}
else {
unsigned idx = rand() % n;
if (s2[idx]) {
size--;
}
s2[idx] = false;
s1.remove(idx);
}
SASSERT(s1.num_elems() == size);
SASSERT((size == 0) == s1.empty());
for (unsigned idx = 0; idx < n; idx++) {
SASSERT(s2[idx] == s1.contains(idx));
}
}
}
static void tst2(unsigned n) {
uint_set s;
SASSERT(s.empty());
unsigned val = rand()%n;
s.insert(val);
SASSERT(!s.empty());
SASSERT(s.num_elems() == 1);
for (unsigned i = 0; i < 100; i++) {
unsigned val2 = rand()%n;
if (val != val2) {
SASSERT(!s.contains(val2));
}
}
s.remove(val);
SASSERT(s.num_elems() == 0);
SASSERT(s.empty());
}
static void tst3(unsigned n) {
SASSERT(n > 10);
uint_set s1;
uint_set s2;
SASSERT(s1 == s2);
s1.insert(3);
SASSERT(s1.num_elems() == 1);
SASSERT(s2.num_elems() == 0);
SASSERT(s1 != s2);
s2.insert(5);
SASSERT(s2.num_elems() == 1);
SASSERT(s1 != s2);
SASSERT(!s1.subset_of(s2));
s2 |= s1;
SASSERT(s1.subset_of(s2));
SASSERT(s2.num_elems() == 2);
SASSERT(s1 != s2);
s1 |= s2;
SASSERT(s1.subset_of(s2));
SASSERT(s2.subset_of(s1));
SASSERT(s1.num_elems() == 2);
SASSERT(s2.num_elems() == 2);
SASSERT(s1 == s2);
s1.insert(9);
SASSERT(s1.num_elems() == 3);
SASSERT(s2.num_elems() == 2);
s1.insert(9);
SASSERT(s1.num_elems() == 3);
SASSERT(s2.num_elems() == 2);
SASSERT(s2.subset_of(s1));
SASSERT(!s1.subset_of(s2));
SASSERT(s1 != s2);
uint_set s3(s1);
SASSERT(s1 == s3);
SASSERT(s1.subset_of(s3));
SASSERT(s3.subset_of(s1));
SASSERT(s2 != s3);
uint_set s4(s2);
SASSERT(s2 == s4);
SASSERT(s2.subset_of(s4));
SASSERT(s4.subset_of(s2));
SASSERT(s2 != s3);
for (unsigned i = 0; i < n; i++) {
uint_set s5;
s5.insert(i);
SASSERT(s1.contains(i) == s5.subset_of(s1));
}
}
static void tst4() {
uint_set s;
s.insert(32);
SASSERT(s.contains(32));
SASSERT(!s.contains(31));
SASSERT(!s.contains(0));
s.remove(32);
SASSERT(!s.contains(32));
SASSERT(!s.contains(31));
SASSERT(!s.contains(0));
}
void tst_uint_set() {
for (unsigned i = 0; i < 100; i++) {
tst1(1 + rand()%31);
tst1(1 + rand()%100);
}
for (unsigned i = 0; i < 1000; i++) {
tst2(1);
tst2(10);
tst2(31);
tst2(32);
tst2(100);
}
tst3(12);
tst3(100);
tst4();
}