3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-15 05:18:44 +00:00
z3/src/test/dl_table.cpp
Alex Horn bd57994f78 Merge branch 'unstable' of https://github.com/Z3Prover/z3 into minimum
Signed-off-by: Alex Horn <t-alexh@microsoft.com>

Conflicts:
	src/test/dl_table.cpp
2015-06-10 20:35:28 +01:00

175 lines
4.2 KiB
C++

/*++
Copyright (c) 2015 Microsoft Corporation
--*/
#if defined(_WINDOWS) || defined(_CYGWIN)
#include "dl_context.h"
#include "dl_table.h"
#include "dl_register_engine.h"
#include "dl_relation_manager.h"
typedef datalog::table_base* (*mk_table_fn)(datalog::relation_manager& m, datalog::table_signature& sig);
static datalog::table_base* mk_bv_table(datalog::relation_manager& m, datalog::table_signature& sig) {
datalog::table_plugin * p = m.get_table_plugin(symbol("bitvector"));
SASSERT(p);
return p->mk_empty(sig);
}
static void test_table(mk_table_fn mk_table) {
datalog::table_signature sig;
sig.push_back(2);
sig.push_back(4);
sig.push_back(8);
sig.push_back(4);
smt_params params;
ast_manager ast_m;
datalog::register_engine re;
datalog::context ctx(ast_m, re, params);
datalog::relation_manager & m = ctx.get_rel_context()->get_rmanager();
m.register_plugin(alloc(datalog::bitvector_table_plugin, m));
datalog::table_base* _tbl = mk_table(m, sig);
datalog::table_base& table = *_tbl;
datalog::table_fact row, row1, row2, row3;
row.push_back(1);
row.push_back(3);
row.push_back(7);
row.push_back(2);
row1 = row;
row[3] = 3;
row2 = row;
row[0] = 0;
row[3] = 1;
row3 = row;
table.add_fact(row1);
table.add_fact(row2);
table.display(std::cout);
datalog::table_base::iterator it = table.begin();
datalog::table_base::iterator end = table.end();
for (; it != end; ++it) {
it->get_fact(row);
for (unsigned j = 0; j < row.size(); ++j) {
std::cout << row[j] << " ";
}
std::cout << "\n";
}
SASSERT(table.contains_fact(row1));
SASSERT(table.contains_fact(row2));
SASSERT(!table.contains_fact(row3));
#if 0
table.remove_facts(1, &row1);
SASSERT(!table.contains_fact(row1));
#endif
table.add_fact(row1);
datalog::table_base* _tbl2 = mk_table(m, sig);
datalog::table_base& table2 = *_tbl2;
table2.add_fact(row2);
table2.add_fact(row3);
unsigned cols1[1] = { 1 };
unsigned cols2[1] = { 3 };
datalog::table_join_fn * j1 = m.mk_join_fn(table2, table, 1, cols1, cols2);
datalog::table_base* _tbl3 = (*j1)(table2,table);
_tbl3->display(std::cout);
datalog::table_join_fn * j2 = m.mk_join_fn(table2, table, 1, cols1, cols1);
datalog::table_base* _tbl4 = (*j2)(table2,table);
_tbl4->display(std::cout);
dealloc(j1);
dealloc(j2);
_tbl->deallocate();
(_tbl2->deallocate());
(_tbl3->deallocate());
(_tbl4->deallocate());
}
void test_dl_bitvector_table() {
test_table(mk_bv_table);
}
void test_table_min() {
std::cout << "----- test_table_min -----\n";
datalog::table_signature sig;
sig.push_back(2);
sig.push_back(4);
sig.push_back(8);
smt_params params;
ast_manager ast_m;
datalog::register_engine re;
datalog::context ctx(ast_m, re, params);
datalog::relation_manager & m = ctx.get_rel_context()->get_rmanager();
m.register_plugin(alloc(datalog::bitvector_table_plugin, m));
datalog::table_base* tbl = mk_bv_table(m, sig);
datalog::table_base& table = *tbl;
datalog::table_fact row, row1, row2, row3;
row.push_back(1);
row.push_back(2);
row.push_back(5);
// Group (1,2,*)
row1 = row;
row[2] = 6;
row2 = row;
row[2] = 5;
row3 = row;
table.add_fact(row1);
table.add_fact(row2);
table.add_fact(row3);
// Group (1,3,*)
row[1] = 3;
row1 = row;
row[2] = 7;
row2 = row;
row[2] = 4;
row3 = row;
table.add_fact(row1);
table.add_fact(row2);
table.add_fact(row3);
table.display(std::cout);
unsigned_vector group_by(2);
group_by[0] = 0;
group_by[1] = 1;
datalog::table_min_fn * min_fn = m.mk_min_fn(table, group_by, 2);
datalog::table_base * min_tbl = (*min_fn)(table);
min_tbl->display(std::cout);
row[1] = 2;
row[2] = 5;
SASSERT(min_tbl->contains_fact(row));
row[1] = 3;
row[2] = 4;
SASSERT(min_tbl->contains_fact(row));
dealloc(min_fn);
min_tbl->deallocate();
tbl->deallocate();
}
void tst_dl_table() {
test_dl_bitvector_table();
test_table_min();
}
#else
void tst_dl_table() {
}
#endif