diff --git a/parallel_hashmap/phmap.h b/parallel_hashmap/phmap.h index ffe68b2..eac882f 100644 --- a/parallel_hashmap/phmap.h +++ b/parallel_hashmap/phmap.h @@ -4131,7 +4131,6 @@ struct HashtableDebugAccess> // Its interface is similar to that of `std::unordered_set` with the // following notable differences: // -// * Requires keys that are CopyConstructible // * Supports heterogeneous lookup, through `find()`, `operator[]()` and // `insert()`, provided that the set is provided a compatible heterogeneous // hashing function and equality operator. @@ -4139,7 +4138,7 @@ struct HashtableDebugAccess> // `rehash()`. // * Contains a `capacity()` member function indicating the number of element // slots (open, deleted, and empty) within the hash set. -// * Returns `void` from the `erase(iterator)` overload. +// * Returns `void` from the `_erase(iterator)` overload. // ----------------------------------------------------------------------------- template // default values in phmap_fwd_decl.h class flat_hash_set @@ -4194,8 +4193,6 @@ public: // cases. Its interface is similar to that of `std::unordered_map` with // the following notable differences: // -// * Requires keys that are CopyConstructible -// * Requires values that are MoveConstructible // * Supports heterogeneous lookup, through `find()`, `operator[]()` and // `insert()`, provided that the map is provided a compatible heterogeneous // hashing function and equality operator. @@ -4203,7 +4200,7 @@ public: // `rehash()`. // * Contains a `capacity()` member function indicating the number of element // slots (open, deleted, and empty) within the hash map. -// * Returns `void` from the `erase(iterator)` overload. +// * Returns `void` from the `_erase(iterator)` overload. // ----------------------------------------------------------------------------- template // default values in phmap_fwd_decl.h class flat_hash_map : public phmap::container_internal::raw_hash_map<