Struct RawEntryBuilder
pub struct RawEntryBuilder<'a, K, V, S, A = Global>where
A: Allocator,{ /* private fields */ }
Available on crate features
dep_hashbrown
and alloc
only.Expand description
A builder for computing where in a HashMap
a key-value pair would be stored.
See the HashMap::raw_entry
docs for usage examples.
§Examples
use hashbrown::hash_map::{HashMap, RawEntryBuilder};
use core::hash::{BuildHasher, Hash};
let mut map = HashMap::new();
map.extend([(1, 10), (2, 20), (3, 30)]);
fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
use core::hash::Hasher;
let mut state = hash_builder.build_hasher();
key.hash(&mut state);
state.finish()
}
for k in 0..6 {
let hash = compute_hash(map.hasher(), &k);
let v = map.get(&k).cloned();
let kv = v.as_ref().map(|v| (&k, v));
println!("Key: {} and value: {:?}", k, v);
let builder: RawEntryBuilder<_, _, _> = map.raw_entry();
assert_eq!(builder.from_key(&k), kv);
assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
}
Implementations§
§impl<'a, K, V, S, A> RawEntryBuilder<'a, K, V, S, A>where
A: Allocator,
impl<'a, K, V, S, A> RawEntryBuilder<'a, K, V, S, A>where
A: Allocator,
pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)> ⓘ
pub fn from_key<Q>(self, k: &Q) -> Option<(&'a K, &'a V)> ⓘ
Access an immutable entry by key.
§Examples
use hashbrown::HashMap;
let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
let key = "a";
assert_eq!(map.raw_entry().from_key(&key), Some((&"a", &100)));
pub fn from_key_hashed_nocheck<Q>(
self,
hash: u64,
k: &Q,
) -> Option<(&'a K, &'a V)> ⓘwhere
Q: Equivalent<K> + ?Sized,
pub fn from_key_hashed_nocheck<Q>(
self,
hash: u64,
k: &Q,
) -> Option<(&'a K, &'a V)> ⓘwhere
Q: Equivalent<K> + ?Sized,
Access an immutable entry by a key and its hash.
§Examples
use core::hash::{BuildHasher, Hash};
use hashbrown::HashMap;
fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
use core::hash::Hasher;
let mut state = hash_builder.build_hasher();
key.hash(&mut state);
state.finish()
}
let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
let key = "a";
let hash = compute_hash(map.hasher(), &key);
assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &key), Some((&"a", &100)));
pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> ⓘ
pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)> ⓘ
Access an immutable entry by hash and matching function.
§Examples
use core::hash::{BuildHasher, Hash};
use hashbrown::HashMap;
fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
use core::hash::Hasher;
let mut state = hash_builder.build_hasher();
key.hash(&mut state);
state.finish()
}
let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
let key = "a";
let hash = compute_hash(map.hasher(), &key);
assert_eq!(map.raw_entry().from_hash(hash, |k| k == &key), Some((&"a", &100)));
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V, S, A> Freeze for RawEntryBuilder<'a, K, V, S, A>
impl<'a, K, V, S, A> RefUnwindSafe for RawEntryBuilder<'a, K, V, S, A>
impl<'a, K, V, S, A> Send for RawEntryBuilder<'a, K, V, S, A>
impl<'a, K, V, S, A> Sync for RawEntryBuilder<'a, K, V, S, A>
impl<'a, K, V, S, A> Unpin for RawEntryBuilder<'a, K, V, S, A>
impl<'a, K, V, S, A> UnwindSafe for RawEntryBuilder<'a, K, V, S, A>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
The alignment of this type in bytes.
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Returns the alignment of this type in bytes.
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Know whether dropping values of this type matters, in compile-time.
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Returns the alignment of the pointed-to value in bytes. Read more
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Returns the size of the pointed-to value in bytes. Read more
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
Returns
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
Forgets about
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
Available on crate feature
unsafe_layout
only.Returns the value of type
T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
Available on crate feature
unsafe_layout
only.Returns the value of type
T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
Available on crate feature
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
Returns the layout of the type.
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out
indicating that a T
is niched.