Implementation of xxHash in Rust
Each algorithm is implemented via feature, allowing precise control over code size.
```rust use xxhashrust::constxxh3::xxh364 as constxxh3; use xxhashrust::xxh3::xxh364;
const TEST: u64 = const_xxh3(b"TEST");
fn testinput(text: &str) -> bool { match xxh364(text.as_bytes()) { TEST => true, _ => false } }
assert!(!testinput("tEST")); assert!(testinput("TEST")); ```
By default all features are off.
xxh32
- Enables 32bit algorithm. Suitable for x86 targetsconst_xxh32
- const fn
version of xxh32
algorithmxxh64
- Enables 64 algorithm. Suitable for x86_64 targetsconst_xxh64
- const fn
version of xxh64
algorithmxxh3
- Enables xxh3
family of algorithms, superior to xxh32
and xxh64
in terms of performance.const_xxh3
- const fn
version of xxh3
algorithmSimilar to reference implementation, crate implements various SIMDs in xxh3
depending on provided flags.
All checks are performed only at compile time, hence user is encouraged to enable these accelerations (for example via -C target_cpu=native
)
Used SIMD acceleration:
x86_64
targets.For performance reasons one-shot version of algorithm does not re-use streaming version. Unless needed, user is advised to use one-shot version which tends to be more optimal.
cosnt fn
versionWhile const fn
provides compile time implementation, it does so at performance cost.
Hence you should only use it at compile time.
To guarantee that something is computed at compile time make sure to initialize hash output
as const
or static
variable, otherwise it is possible function is executed at runtime, which
would be worse than regular algorithm.
const fn
is implemented in best possible way while conforming to limitations of Rust const
fn
, but these limitations are quite strict making any high performance code impossible.
0.8.2
corresponds to C's 0.8.0
0.8.3
, 0.8.5
and 0.8.4
corresponds to C's 0.8.1
In order to keep up with original implementation version I'm not planning to bump major/minor until C implementation does so.
Refer to my comment