38 out << pair.first <<
"=" << pair.second.get_value(
prop) <<
'\n';
46 std::pair<mappingt::iterator, bool> result=
47 mapping.insert(std::pair<irep_idt, map_entryt>(
57 for(std::size_t bit = 0; bit < width; ++bit)
62 std::cout <<
"NEW: " << identifier <<
":" << bit <<
"="
70 "number of literals in the literal map shall equal the bitvector width");
80 std::pair<mappingt::iterator, bool> result =
87 map_entry.
type = type;
89 for(
const auto &literal : literals)
93 "variable number of non-constant literals shall be within bounds");
100 for(
auto it = literals.begin(); it != literals.end(); ++it)
106 "variable number of non-constant literals shall be within bounds");
108 const std::size_t bit = it - literals.begin();
111 bit < map_entry.
literal_map.size(),
"bit index shall be within bounds");
std::string get_value(const propt &) const
void erase_literals(const irep_idt &identifier, const typet &type)
void set_literals(const irep_idt &identifier, const typet &type, const bvt &literals)
void show(std::ostream &out) const
const bvt & get_literals(const irep_idt &identifier, const typet &type, std::size_t width)
dstringt has one field, an unsigned integer no which is an index into a static table of strings.
virtual size_t no_variables() const =0
virtual void set_equal(literalt a, literalt b)
asserts a==b in the propositional formula
virtual literalt new_variable()=0
virtual tvt l_get(literalt a) const =0
The type of an expression, extends irept.
std::vector< literalt > bvt