mirror of
https://github.com/Z3Prover/z3
synced 2025-05-08 00:05:46 +00:00
60 lines
1.4 KiB
C++
60 lines
1.4 KiB
C++
/*++
|
|
Copyright (c) 2021 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
polysat search state
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2021-03-19
|
|
Jakob Rath 2021-04-6
|
|
|
|
--*/
|
|
|
|
#include "math/polysat/search_state.h"
|
|
|
|
namespace polysat {
|
|
|
|
std::ostream& search_state::display(search_item const& item, std::ostream& out) const {
|
|
switch (item.kind()) {
|
|
case search_item_k::assignment:
|
|
return out << "v" << item.var() << " := " << value(item.var());
|
|
case search_item_k::boolean:
|
|
return out << item.lit();
|
|
}
|
|
UNREACHABLE();
|
|
return out;
|
|
}
|
|
|
|
std::ostream& search_state::display(std::ostream& out) const {
|
|
for (auto const& item : m_items)
|
|
display(item, out) << " ";
|
|
return out;
|
|
}
|
|
|
|
rational search_state::value(pvar v) const {
|
|
for (auto const& [p, r] : m_assignment)
|
|
if (v == p)
|
|
return r;
|
|
UNREACHABLE();
|
|
return rational::zero();
|
|
}
|
|
|
|
void search_state::push_assignment(pvar p, rational const& r) {
|
|
m_items.push_back(search_item::assignment(p));
|
|
m_assignment.push_back({p, r});
|
|
}
|
|
|
|
void search_state::push_boolean(sat::literal lit) {
|
|
m_items.push_back(search_item::boolean(lit));
|
|
}
|
|
|
|
void search_state::pop() {
|
|
auto const& item = m_items.back();
|
|
if (item.is_assignment())
|
|
m_assignment.pop_back();
|
|
m_items.pop_back();
|
|
}
|
|
|
|
}
|