30 template <class T>
33   void MakeEmpty(T& item) const {  in MakeEmpty()
34     item = T();  in MakeEmpty()
36   bool IsEmpty(const T& item) const {  in IsEmpty()
37     return item == T();  in IsEmpty()
41 template <class T>
42 class DefaultEmptyFn<T*> {
44   void MakeEmpty(T*& item) const {  in MakeEmpty()
47   bool IsEmpty(const T*& item) const {  in IsEmpty()
55 template <class T, class EmptyFn = DefaultEmptyFn<T>, class HashFn = std::hash<T>,
56     class Pred = std::equal_to<T>, class Alloc = std::allocator<T>>
84     T& operator*() {
88     const T& operator*() const {
92     T* operator->() {
95     const T* operator->() const {
190       T& next_element = ElementForIndex(next_index);  in Erase()
240       T& slot = ElementForIndex(index);  in FindWithHash()
251   void Insert(const T& element) {  in Insert()
254   void InsertWithHash(const T& element, size_t hash) {  in InsertWithHash()
275       const T& element = ElementForIndex(i);  in TotalProbeDistance()
295       T& element = data_[i];  in Verify()
297         T temp;  in Verify()
312   T& ElementForIndex(size_t index) {  in ElementForIndex()
317   const T& ElementForIndex(size_t index) const {  in ElementForIndex()
371     T* old_data = data_;  in Resize()
376       T& element = old_data[i];  in Resize()
398   T* data_;  // Backing storage.