pub struct PersistentHashMap<K: Invariant, V: Invariant, S = DefaultHashBuilder, A: Allocator = HashTableAlloc> { /* private fields */ }
Implementations§
Source§impl<K: Invariant, V: Invariant> PersistentHashMap<K, V, DefaultHashBuilder, HashTableAlloc>
impl<K: Invariant, V: Invariant> PersistentHashMap<K, V, DefaultHashBuilder, HashTableAlloc>
pub fn new() -> Result<Self>
pub fn new_persist() -> Result<Self>
pub fn with_builder( builder: ObjectBuilder<RawTable<(K, V), DefaultHashBuilder, HashTableAlloc>>, ) -> Result<Self>
Source§impl<K: Invariant, V: Invariant, S, A: Allocator> PersistentHashMap<K, V, S, A>
impl<K: Invariant, V: Invariant, S, A: Allocator> PersistentHashMap<K, V, S, A>
pub fn object(&self) -> &Object<RawTable<(K, V), S, A>>
pub fn into_object(self) -> Object<RawTable<(K, V), S, A>>
pub fn capacity(&self) -> usize
pub fn allocator(&self) -> &A
pub fn with_hasher_in( builder: ObjectBuilder<RawTable<(K, V), S, A>>, hasher: S, alloc: A, ) -> Result<Self>
pub fn from(value: Object<RawTable<(K, V), S, A>>) -> Self
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn ctx(&self) -> CarryCtx<'_>
pub fn clear(&mut self) -> Result<()>
pub fn iter(&self) -> Iter<'_, K, V> ⓘ
pub fn keys(&self) -> Keys<'_, K, V> ⓘ
pub fn values(&self) -> Values<'_, K, V> ⓘ
pub fn iter_mut(&mut self) -> Result<IterMut<'_, K, V>>
pub fn values_mut(&mut self) -> Result<ValuesMut<'_, K, V>>
Source§impl<K: Invariant + Eq + Hash, V: Invariant, S: BuildHasher, A: Allocator> PersistentHashMap<K, V, S, A>
impl<K: Invariant + Eq + Hash, V: Invariant, S: BuildHasher, A: Allocator> PersistentHashMap<K, V, S, A>
Source§impl<K: Invariant + Eq + Hash, V: Invariant, S: BuildHasher> PersistentHashMap<K, V, S, HashTableAlloc>
impl<K: Invariant + Eq + Hash, V: Invariant, S: BuildHasher> PersistentHashMap<K, V, S, HashTableAlloc>
Auto Trait Implementations§
impl<K, V, S, A> Freeze for PersistentHashMap<K, V, S, A>
impl<K, V, S = RandomState, A = HashTableAlloc> !ObjSafe for PersistentHashMap<K, V, S, A>
impl<K, V, S, A> RefUnwindSafe for PersistentHashMap<K, V, S, A>
impl<K, V, S, A> Send for PersistentHashMap<K, V, S, A>
impl<K, V, S = RandomState, A = HashTableAlloc> !StoreCopy for PersistentHashMap<K, V, S, A>
impl<K, V, S, A> Sync for PersistentHashMap<K, V, S, A>
impl<K, V, S, A> Unpin for PersistentHashMap<K, V, S, A>
impl<K, V, S, A> UnwindSafe for PersistentHashMap<K, V, S, 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