openharmony/third_party_rust_rust-fnv
1
0
Fork 0
mirror of https://gitee.com/openharmony/third_party_rust_rust-fnv synced 2025-02-12 08:00:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix improperly formatted named links

Browse Source
This commit is contained in:
Corey Farwell 2016-01-23 20:53:58 -05:00
parent 62f062b683
commit b5c0961505
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -1,6 +1,6 @@
# rust-fnv
An implementation of the [Fowler–Noll–Vo hash function](chongo).
An implementation of the [Fowler–Noll–Vo hash function][chongo].
### [Read the documentation](http://doc.servo.org/fnv/)
@ -10,10 +10,10 @@ An implementation of the [Fowler–Noll–Vo hash function](chongo).
The FNV hash function is a custom `Hasher` implementation that is more
efficient for smaller hash keys.
[The Rust FAQ states that](faq) while the default `Hasher` implementation,
[The Rust FAQ states that][faq] while the default `Hasher` implementation,
SipHash, is good in many cases, it is notably slower than other algorithms
with short keys, such as when you have a map of integers to other values.
In cases like these, [FNV is demonstrably faster](graphs).
In cases like these, [FNV is demonstrably faster][graphs].
Its disadvantages are that it performs badly on larger inputs, and
provides no protection against collision attacks, where a malicious user

6
lib.rs
View File

@ -1,14 +1,14 @@
//! An implementation of the [Fowler–Noll–Vo hash function](chongo).
//! An implementation of the [Fowler–Noll–Vo hash function][chongo].
//!
//! ## About
//!
//! The FNV hash function is a custom `Hasher` implementation that is more
//! efficient for smaller hash keys.
//!
//! [The Rust FAQ states that](faq) while the default `Hasher` implementation,
//! [The Rust FAQ states that][faq] while the default `Hasher` implementation,
//! SipHash, is good in many cases, it is notably slower than other algorithms
//! with short keys, such as when you have a map of integers to other values.
//! In cases like these, [FNV is demonstrably faster](graphs).
//! In cases like these, [FNV is demonstrably faster][graphs].
//!
//! Its disadvantages are that it performs badly on larger inputs, and
//! provides no protection against collision attacks, where a malicious user