12 #ifndef CPROVER_UTIL_IREP_HASH_CONTAINER_H 13 #define CPROVER_UTIL_IREP_HASH_CONTAINER_H 50 typedef std::unordered_map<const void *, size_t, pointer_hasht>
91 #endif // CPROVER_UTIL_IREP_HASH_CONTAINER_H
size_t operator()(const void *p) const
std::vector< size_t > packedt
irep_hash_container_baset(bool _full)
std::unordered_map< const void *, size_t, pointer_hasht > ptr_hasht
irep_full_hash_containert()
Base class for tree-like data structures with sharing.
void pack(const irept &irep, packedt &)
size_t number(const irept &irep)
hash_numbering< packedt, vector_hasht > numberingt
size_t operator()(const packedt &p) const