File tree Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Expand file tree Collapse file tree 1 file changed +3
-3
lines changed Original file line number Diff line number Diff line change @@ -13,8 +13,8 @@ The original C++ version of SwissTable can be found [here], and this
13
13
[ CppCon talk] gives an overview of how the algorithm works.
14
14
15
15
Since Rust 1.36, this is now the ` HashMap ` implementation for the Rust standard
16
- library. All benchmarks and features below are compared to the previous hash
17
- table implementation in the Rust standard library .
16
+ library. However you may still want to use this crate instead since it works
17
+ in environments without ` std ` , such as embedded systems and kernels .
18
18
19
19
[ SwissTable ] : https://abseil.io/blog/20180927-swisstables
20
20
[ here ] : https://github.com/abseil/abseil-cpp/blob/master/absl/container/internal/raw_hash_set.h
@@ -34,7 +34,7 @@ table implementation in the Rust standard library.
34
34
35
35
## Performance
36
36
37
- Compared to the previous HashDoS-resistant implementation of ` std::collections::HashMap ` (Rust 1.35).
37
+ Compared to the previous implementation of ` std::collections::HashMap ` (Rust 1.35).
38
38
39
39
With the hashbrown default AHash hasher (not HashDoS-resistant):
40
40
You can’t perform that action at this time.
0 commit comments