3#ifndef CPROVER_SOLVERS_SMT2_INCREMENTAL_SMT_INDEX_H
4#define CPROVER_SOLVERS_SMT2_INCREMENTAL_SMT_INDEX_H
25 template <
typename sub_
classt>
48template <
typename derivedt>
52 std::is_base_of<irept, derivedt>::value &&
53 std::is_base_of<storert<derivedt>,
derivedt>::value,
54 "Only irept based classes need to upcast smt_sortt to store it.");
57template <
typename derivedt>
60 return static_cast<irept &&
>(std::move(index));
63template <
typename derivedt>
73 std::size_t
value()
const;
ait supplies three of the four components needed: an abstract interpreter (in this case handling func...
dstringt has one field, an unsigned integer no which is an index into a static table of strings.
There are a large number of kinds of tree structured or tree-like data in CPROVER.
std::string pretty(unsigned indent=0, unsigned max_indent=0) const
virtual void visit(const smt_symbol_indext &)=0
virtual void visit(const smt_numeral_indext &)=0
Class for adding the ability to up and down cast smt_indext to and from irept.
static irept upcast(smt_indext index)
static const smt_indext & downcast(const irept &)
For implementation of indexed identifiers.
bool operator!=(const smt_indext &) const
const sub_classt * cast() const &
bool operator==(const smt_indext &) const
void accept(smt_index_const_downcast_visitort &) const
std::size_t value() const
irep_idt identifier() const