21 ptr_hasht::const_iterator it=
ptr_hash.find(&irep.
read());
38 size_t result=p.size();
53 1+1+sub.size()+named_sub.size()*2+
54 (
full?comments.size()*2:0));
58 packed.push_back(sub.size());
60 packed.push_back(
number(*it));
62 packed.push_back(named_sub.size());
66 packed.push_back(
number(it->second));
71 packed.push_back(comments.size());
75 packed.push_back(
number(it->second));
std::vector< irept > subt
std::vector< size_t > packedt
#define forall_named_irep(it, irep)
const irep_idt & id() const
dstring_hash irep_id_hash
named_subt & get_comments()
Base class for tree-like data structures with sharing.
std::map< irep_namet, irept > named_subt
void pack(const irept &irep, packedt &)
named_subt & get_named_sub()
#define hash_combine(h1, h2)
size_t number(const irept &irep)
number_type number(const T &a)
size_t operator()(const packedt &p) const
#define forall_irep(it, irep)