Files
adler32
backtrace
backtrace_sys
base64
bigtable
bitflags
byteorder
bytes
cfg_if
cookie
cookie_store
crc32fast
crossbeam_deque
crossbeam_epoch
crossbeam_queue
crossbeam_utils
curl
curl_sys
dtoa
either
encoding_rs
error_chain
failure
failure_derive
flate2
deflate
ffi
gz
zlib
fnv
foreign_types
foreign_types_shared
futures
future
sink
stream
and_then.rsbuffer_unordered.rsbuffered.rscatch_unwind.rschain.rschannel.rschunks.rscollect.rsconcat.rsempty.rsfilter.rsfilter_map.rsflatten.rsfold.rsfor_each.rsforward.rsfrom_err.rsfuse.rsfuture.rsfutures_ordered.rsfutures_unordered.rsinspect.rsinspect_err.rsiter.rsiter_ok.rsiter_result.rsmap.rsmap_err.rsmerge.rsmod.rsonce.rsor_else.rspeek.rspoll_fn.rsrepeat.rsselect.rsskip.rsskip_while.rssplit.rstake.rstake_while.rsthen.rsunfold.rswait.rszip.rs
sync
task_impl
unsync
futures_cpupool
goauth
h2
codec
frame
hpack
proto
http
http_body
httparse
hyper
body
client
common
proto
server
service
hyper_tls
idna
indexmap
iovec
itoa
lazy_static
libc
unix
libz_sys
lock_api
log
matches
maybe_uninit
memoffset
mime
mime_guess
miniz_oxide
mio
deprecated
net
sys
native_tls
net2
num_cpus
num_traits
openssl
openssl_probe
openssl_sys
parking_lot
parking_lot_core
percent_encoding
proc_macro2
protobuf
codegen
reflect
well_known_types
protobuf_json
publicsuffix
quote
rand
distributions
prng
rngs
seq
rand_chacha
rand_core
rand_hc
rand_isaac
rand_jitter
rand_os
rand_pcg
rand_xorshift
regex
literal
regex_syntax
ast
hir
unicode_tables
reqwest
rustc_demangle
rustc_serialize
ryu
scopeguard
serde
de
private
ser
serde_codegen_internals
serde_derive
serde_json
serde_urlencoded
slab
smallvec
smpl_jwt
socket2
string
syn
attr.rsbigint.rsbuffer.rscustom_keyword.rscustom_punctuation.rsdata.rsderive.rsdiscouraged.rserror.rsexport.rsexpr.rsext.rsgenerics.rsgroup.rsident.rslib.rslifetime.rslit.rslookahead.rsmac.rsmacros.rsop.rsparse.rsparse_macro_input.rsparse_quote.rspath.rsprint.rspunctuated.rssealed.rsspan.rsspanned.rsthread.rstoken.rstt.rsty.rs
synom
synstructure
time
tokio
executor
reactor
runtime
util
tokio_buf
tokio_current_thread
tokio_executor
tokio_io
_tokio_codec
codec
io
tokio_reactor
tokio_sync
tokio_tcp
tokio_threadpool
blocking
park
pool
task
worker
tokio_timer
clock
timer
wheel
try_from
try_lock
unicase
unicode_bidi
unicode_normalization
unicode_xid
url
uuid
want
>
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
// Copyright 2019 The Rust Project Developers. See the COPYRIGHT // file at the top-level directory of this distribution and at // http://rust-lang.org/COPYRIGHT. // // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your // option. This file may not be copied, modified, or distributed // except according to those terms. //! Support for lookups based on minimal perfect hashing. // This function is based on multiplication being fast and is "good enough". Also // it can share some work between the unsalted and salted versions. #[inline] fn my_hash(key: u32, salt: u32, n: usize) -> usize { let y = key.wrapping_add(salt).wrapping_mul(2654435769); let y = y ^ key.wrapping_mul(0x31415926); (((y as u64) * (n as u64)) >> 32) as usize } /// Do a lookup using minimal perfect hashing. /// /// The table is stored as a sequence of "salt" values, then a sequence of /// values that contain packed key/value pairs. The strategy is to hash twice. /// The first hash retrieves a salt value that makes the second hash unique. /// The hash function doesn't have to be very good, just good enough that the /// resulting map is unique. #[inline] pub(crate) fn mph_lookup<KV, V, FK, FV>(x: u32, salt: &[u16], kv: &[KV], fk: FK, fv: FV, default: V) -> V where KV: Copy, FK: Fn(KV) -> u32, FV: Fn(KV) -> V { let s = salt[my_hash(x, 0, salt.len())] as u32; let key_val = kv[my_hash(x, s, salt.len())]; if x == fk(key_val) { fv(key_val) } else { default } }