|
using | baset = tree_implementationt |
using | dt |
using | subt |
using | named_subt |
using | tree_implementationt |
| Used to refer to this class from derived classes.
|
| irept (const irep_idt &_id) |
| irept (const irep_idt &_id, const named_subt &_named_sub, const subt &_sub) |
| irept ()=default |
bool | is_nil () const |
bool | is_not_nil () const |
| irept (const irep_idt &_id) |
| irept (const irep_idt &_id, const named_subt &_named_sub, const subt &_sub) |
| irept ()=default |
const irep_idt & | id () const |
const std::string & | id_string () const |
void | id (const irep_idt &_data) |
const irept & | find (const irep_idt &name) const |
irept & | add (const irep_idt &name) |
irept & | add (const irep_idt &name, irept irep) |
const std::string & | get_string (const irep_idt &name) const |
const irep_idt & | get (const irep_idt &name) const |
bool | get_bool (const irep_idt &name) const |
signed int | get_int (const irep_idt &name) const |
std::size_t | get_size_t (const irep_idt &name) const |
long long | get_long_long (const irep_idt &name) const |
void | set (const irep_idt &name, const irep_idt &value) |
void | set (const irep_idt &name, irept irep) |
void | set (const irep_idt &name, const long long value) |
void | set_size_t (const irep_idt &name, const std::size_t value) |
void | remove (const irep_idt &name) |
void | move_to_sub (irept &irep) |
void | move_to_named_sub (const irep_idt &name, irept &irep) |
bool | operator== (const irept &other) const |
bool | operator!= (const irept &other) const |
void | swap (irept &irep) |
bool | operator< (const irept &other) const |
| defines ordering on the internal representation
|
bool | ordering (const irept &other) const |
| defines ordering on the internal representation
|
int | compare (const irept &i) const |
| defines ordering on the internal representation comments are ignored
|
void | clear () |
void | make_nil () |
subt & | get_sub () |
const subt & | get_sub () const |
named_subt & | get_named_sub () |
const named_subt & | get_named_sub () const |
std::size_t | hash () const |
std::size_t | full_hash () const |
bool | full_eq (const irept &other) const |
std::string | pretty (unsigned indent=0, unsigned max_indent=0) const |
void | detach () |
| sharing_treet (irep_idt _id) |
sharing_treet & | operator= (const sharing_treet &irep) |
| ~sharing_treet () |
const dt & | read () const |
dt & | write () |
static bool | is_comment (const irep_idt &name) |
static std::size_t | number_of_non_comments (const named_subt &) |
| count the number of named_sub elements that are not comments
|
static void | remove_ref (dt *old_data) |
static void | nonrecursive_destructor (dt *old_data) |
| Does the same as remove_ref, but using an explicit stack instead of recursion.
|
dt * | data |
static dt | empty_d |
| storert () |
static irept | upcast (smt_check_sat_response_kindt check_sat_response_kind) |
static const smt_check_sat_response_kindt & | downcast (const irept &) |
Definition at line 87 of file smt_responses.h.