File tree Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Expand file tree Collapse file tree 1 file changed +1
-1
lines changed Original file line number Diff line number Diff line change @@ -10,7 +10,7 @@ The hash map is implemented as an array of hash buckets.
10
10
Each hash bucket is a single linked list of hash nodes and has a mutex associated with it.
11
11
Multiple threads can read from the same bucket simulatenously, but only one thread can write
12
12
into the same bucket. Since the mutex is per bucket, if multiple threads try to write into different
13
- buckets simulatenously, they will be allowed to do so. This allows some level of concurrency for the hash map.
13
+ buckets simulatenously, they will be allowed to do so.This allows some level of concurrency for the hash map.
14
14
15
15
The mutex is implemented as "std::shared_timed_mutex" from C++14 and uses "std::unique_lock" from C++11 for writes
16
16
and "std::shared_lock" from C++14 for reading from a bucket.
You can’t perform that action at this time.
0 commit comments