saberbud/parallel-hashmap
1
0
Fork 0
mirror of https://github.com/greg7mdp/parallel-hashmap.git synced 2026-08-30 00:50:38 +08:00
Code Issues Packages Projects Releases Wiki Activity

allow easy default to absl::Hash framework

Browse Source
This commit is contained in:
greg
2019-03-30 14:38:38 -04:00
parent e5c4e46bd5
commit 2836a43989
2 changed files with 11 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
Vendored
+2 -2
View File
@@ -96,8 +96,8 @@ The full types with template parameters can be found in the [parallel_hashmap/ph
## Changes to Abseil's hashmaps
- The default hash framework is std::hash, not absl::Hash
- The `erase(iterator)` and `erase(const_iterator)` both return an iterator to the element following the removed element, as the do the std::unordered_map. A non-standard `void _erase(iterator)` is provided in case the return value is not needed.
- The default hash framework is std::hash, not absl::Hash. However, if you prefer the default to be the Abseil hash framework, include the Abseil headers before `phmap.h` and define the preprocessor macro `PHMAP_USE_ABSL_HASHEQ`.
- The `erase(iterator)` and `erase(const_iterator)` both return an iterator to the element following the removed element, as does the std::unordered_map. A non-standard `void _erase(iterator)` is provided in case the return value is not needed.
- No new types, such as `absl::string_view`, are provided. `std::string_view` is supported by phmap tables when built with a stdlib providing this type.