unordered_map.hh

Go to the documentation of this file.

#pragma once

#include <unordered_map>

namespace vcsn
{

  template <typename Key, typename T,
            typename Hash, typename KeyEqual, typename Alloc>
  inline
  size_t
  collision_count(const std::unordered_map<Key, T, Hash, KeyEqual, Alloc>& m)
  {
    size_t res = 0;
    for (size_t i = 0; i < m.bucket_count(); ++i)
      res += m.bucket_size(i);
    return res;
  }

  template <typename Key, typename T,
            typename Hash, typename KeyEqual, typename Alloc>
  inline
  bool
  has(const std::unordered_map<Key, T, Hash, KeyEqual, Alloc>& m,
      const Key& k)
  {
    return m.find(k) != std::end(m);
  }
}