/* * Copyright (C) 2014 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #ifndef ART_LIBARTBASE_BASE_HASH_MAP_H_ #define ART_LIBARTBASE_BASE_HASH_MAP_H_ #include #include "hash_set.h" namespace art { template class HashMapHashWrapper { public: size_t operator()(const Key& key) const { return hash_fn_(key); } size_t operator()(const std::pair& pair) const { return hash_fn_(pair.first); } private: HashFn hash_fn_; }; template class HashMapPredWrapper { public: bool operator()(const std::pair& a, const std::pair& b) const { return pred_fn_(a.first, b.first); } template bool operator()(const std::pair& a, const Element& element) const { return pred_fn_(a.first, element); } private: PredFn pred_fn_; }; template class DefaultMapEmptyFn { public: void MakeEmpty(std::pair& item) const { item = std::pair(); } bool IsEmpty(const std::pair& item) const { return item.first == Key(); } }; template , class HashFn = DefaultHashFn, class Pred = DefaultPred, class Alloc = std::allocator>> class HashMap : public HashSet, EmptyFn, HashMapHashWrapper, HashMapPredWrapper, Alloc> { private: using Base = HashSet, EmptyFn, HashMapHashWrapper, HashMapPredWrapper, Alloc>; public: // Inherit constructors. using Base::Base; // Used to insert a new mapping. typename Base::iterator Overwrite(const Key& k, const Value& v) { auto res = Base::insert({ k, v }).first; *res = { k, v }; return res; } }; } // namespace art #endif // ART_LIBARTBASE_BASE_HASH_MAP_H_