broom-unordered-map.h

Go to the documentation of this file.

#pragma once
 
#include <unordered_map>
 
#include "broom.h"
#include "impl/broom-containers.h"
 
#define UNORDERED_MAP_METHODS(X_) \
  CPP11_UNORDERED_MAP_METHODS(X_) \
  CPP14_UNORDERED_MAP_METHODS(X_) \
  CPP17_UNORDERED_MAP_METHODS(X_) \
  CPP20_UNORDERED_MAP_METHODS(X_) \
  CPP23_UNORDERED_MAP_METHODS(X_)
 
namespace broom {
// XXX(gc): Implement via forwarding instead?
template <typename Key, typename T, typename Hash = std::hash<Key>,
          typename KeyEqual = std::equal_to<Key>,
          typename Allocator = std::allocator<std::pair<const Key, T>>>
class unordered_map
    : private std::unordered_map<Key, T, Hash, KeyEqual, Allocator>,
      public BroomValue {
  using Base = std::unordered_map<Key, T, Hash, KeyEqual, Allocator>;
 
 public:
  // TODO(gc): We probably need some more explicit constructors to make this
  // work in all cases.
  DEF_TYPES();
  DEF_CONSTRUCTOR(unordered_map)
  unordered_map(std::initializer_list<std::pair<const Key, T>> il)
      : Base(il), BroomValue() {}
  unordered_map(std::initializer_list<std::pair<const Key, T>> il,
                typename Base::size_type bucket_count,
                const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(),
                const Allocator& alloc = Allocator())
      : Base(il, bucket_count, hash, equal, alloc), BroomValue() {}
  DEF_METHODS(unordered_map)
  UNORDERED_MAP_METHODS(USE_METHODS)
  virtual void Visit(Visitor* visitor) const {
    for (const auto& [k, v] : *this) {
      VISIT_HELPER(k, Key);
      VISIT_HELPER(v, T);
    }
  }
};
}  // namespace broom
 
#undef UNORDERED_MAP_METHODS
 
#include "impl/broom-undef.h"