10 #ifndef CPROVER_UTIL_MERGE_IREP_H
11 #define CPROVER_UTIL_MERGE_IREP_H
13 #include <unordered_set>
35 return reinterpret_cast<std::size_t
>(&
read());
56 {
return irep.
hash(); }
64 std::size_t
hash()
const;
79 {
return irep.
hash(); }
94 typedef std::unordered_set<to_be_merged_irept, to_be_merged_irep_hash>
123 typedef std::unordered_set<irept, irep_full_hash, irep_full_eq>
irep_storet;
There are a large number of kinds of tree structured or tree-like data in CPROVER.
std::unordered_set< irept, irep_full_hash, irep_full_eq > irep_storet
const irept & merged(const irept &irep)
const irept & merged(const irept &irep)
std::unordered_set< irept, irep_hash > irep_storet
std::unordered_set< merged_irept, merged_irep_hash > merged_irep_storet
to_be_merged_irep_storet to_be_merged_irep_store
const merged_irept & merged(const irept &)
const merged_irept & operator()(const irept &src)
std::unordered_set< to_be_merged_irept, to_be_merged_irep_hash > to_be_merged_irep_storet
merged_irep_storet merged_irep_store
merged_irept(const irept &src)
merged_irept(const merged_irept &_src)
bool operator<(const merged_irept &other) const
bool operator==(const merged_irept &other) const
to_be_merged_irept(const irept &src)
bool operator==(const to_be_merged_irept &other) const
std::size_t operator()(const merged_irept &irep) const
std::size_t operator()(const to_be_merged_irept &irep) const