12 #ifndef CPROVER_UTIL_IREP_HASH_CONTAINER_H 13 #define CPROVER_UTIL_IREP_HASH_CONTAINER_H 44 return (std::size_t)p;
54 typedef std::unordered_map<const void *, irep_entryt, pointer_hasht>
95 template <
typename Key,
typename T>
99 using mapt = std::map<std::size_t, T>;
163 return map.emplace(i, value.second);
174 std::swap(
map, other.
map);
182 #endif // CPROVER_UTIL_IREP_HASH_CONTAINER_H
const_iterator find(const Key &key) const
iterator find(const Key &key)
T & operator[](const Key &key)
irep_hash_container_baset(bool _full)
std::unordered_map< const void *, irep_entryt, pointer_hasht > ptr_hasht
std::size_t operator()(const void *p) const
irep_full_hash_containert()
typename mapt::iterator iterator
std::map< std::size_t, T > mapt
std::vector< std::size_t > packedt
Base class for tree-like data structures with sharing.
void pack(const irept &irep, packedt &)
const_iterator end() const
std::pair< const Key, T > value_type
typename mapt::const_iterator const_iterator
std::size_t number(const irept &irep)
hash_numbering< packedt, vector_hasht > numberingt
const_iterator begin() const
std::size_t operator()(const packedt &p) const
void swap(irep_hash_mapt< Key, T > &other)
irep_hash_containert hash_container
std::pair< iterator, bool > insert(const value_type &value)