10 #ifndef CPROVER_UTIL_NUMBERING_H 11 #define CPROVER_UTIL_NUMBERING_H 15 #include <unordered_map> 29 std::pair<typename numberst::const_iterator, bool> result=
31 std::pair<T, number_type>
37 assert(this->size()==
numbers.size());
40 return (result.first)->second;
50 typename numberst::const_iterator it=
numbers.find(a);
66 typedef std::vector<T>
subt;
72 template <
typename T,
class hash_fkt>
82 std::pair<typename numberst::const_iterator, bool> result=
84 std::pair<T, number_type>
90 assert(this->size()==
numbers.size());
93 return (result.first)->second;
98 typename numberst::const_iterator it=
numbers.find(a);
116 typedef std::unordered_map<T, number_type, hash_fkt>
numberst;
120 #endif // CPROVER_UTIL_NUMBERING_H
number_type operator()(const T &a)
bool get_number(const T &a, number_type &n) const
bool get_number(const T &a, number_type &n) const
std::map< T, number_type > numberst
number_type number(const T &a)
std::unordered_map< T, number_type, hash_fkt > numberst
number_type number(const T &a)