1 #ifndef VCSN_MISC_UNORDERED_MAP_HH
2 # define VCSN_MISC_UNORDERED_MAP_HH
4 # include <unordered_map>
10 template <
typename Key,
typename T,
11 typename Hash,
typename KeyEqual,
typename Alloc>
17 for (
size_t i = 0; i < m.bucket_count(); ++i)
18 res += m.bucket_size(i);
23 template <
typename Key,
typename T,
24 typename Hash,
typename KeyEqual,
typename Alloc>
27 has(
const std::unordered_map<Key, T, Hash, KeyEqual, Alloc>& m,
30 return m.find(k) != std::end(m);
35 #endif // !VCSN_MISC_UNORDERED_MAP_HH
size_t collision_count(const std::unordered_map< Key, T, Hash, KeyEqual, Alloc > &m)
Sum of bucket sizes.
bool has(const std::map< Key, Value, Compare, Alloc > &s, const Key &e)