1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
// Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef BASE_CONTAINERS_CXX20_ERASE_UNORDERED_MAP_H_
#define BASE_CONTAINERS_CXX20_ERASE_UNORDERED_MAP_H_
#include <unordered_map>
#include "base/containers/cxx20_erase_internal.h"
namespace base {
// EraseIf is based on C++20's uniform container erasure API:
// - https://eel.is/c++draft/libraryindex#:erase
// - https://eel.is/c++draft/libraryindex#:erase_if
// They provide a generic way to erase elements from a container.
// The functions here implement these for the standard containers until those
// functions are available in the C++ standard.
// Note: there is no std::erase for standard associative containers so we don't
// have it either.
template <class Key,
class T,
class Hash,
class KeyEqual,
class Allocator,
class Predicate>
size_t EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container,
Predicate pred) {
return internal::IterateAndEraseIf(container, pred);
}
template <class Key,
class T,
class Hash,
class KeyEqual,
class Allocator,
class Predicate>
size_t EraseIf(
std::unordered_multimap<Key, T, Hash, KeyEqual, Allocator>& container,
Predicate pred) {
return internal::IterateAndEraseIf(container, pred);
}
} // namespace base
#endif // BASE_CONTAINERS_CXX20_ERASE_UNORDERED_MAP_H_
|
