blob: a1c4b31f18184fdf20ace2370d4e3c27772afa0f (
plain) (
blame)
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
#pragma clang system_header
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you 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.
#pragma once
#include <unordered_map>
#include <utility>
#include "contrib/libs/apache/arrow_next/cpp/src/arrow/util/mutex.h"
namespace arrow20 {
namespace util {
template <typename K, typename V>
class ConcurrentMap {
public:
void Insert(const K& key, const V& value) {
auto lock = mutex_.Lock();
map_.insert({key, value});
}
template <typename ValueFunc>
V GetOrInsert(const K& key, ValueFunc&& compute_value_func) {
auto lock = mutex_.Lock();
auto it = map_.find(key);
if (it == map_.end()) {
auto pair = map_.emplace(key, compute_value_func());
it = pair.first;
}
return it->second;
}
void Erase(const K& key) {
auto lock = mutex_.Lock();
map_.erase(key);
}
void Clear() {
auto lock = mutex_.Lock();
map_.clear();
}
size_t size() const {
auto lock = mutex_.Lock();
return map_.size();
}
private:
std::unordered_map<K, V> map_;
mutable arrow20::util::Mutex mutex_;
};
} // namespace util
} // namespace arrow20
|
