Struct polars_utils::hashing::BytesHash
source · pub struct BytesHash<'a> { /* private fields */ }
Expand description
Contains a byte slice and a precomputed hash for that string. During rehashes, we will rehash the hash instead of the string, that makes rehashing cheap and allows cache coherent small hash tables.
Implementations§
Trait Implementations§
source§impl<'a> PartialEq for BytesHash<'a>
impl<'a> PartialEq for BytesHash<'a>
impl<'a> Copy for BytesHash<'a>
impl<'a> Eq for BytesHash<'a>
impl<'a> StructuralEq for BytesHash<'a>
Auto Trait Implementations§
impl<'a> RefUnwindSafe for BytesHash<'a>
impl<'a> Send for BytesHash<'a>
impl<'a> Sync for BytesHash<'a>
impl<'a> Unpin for BytesHash<'a>
impl<'a> UnwindSafe for BytesHash<'a>
Blanket Implementations§
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.