pub struct Value<I: NodeId, K, V> { /* private fields */ }Implementations§
Source§impl<I: NodeId, K: Decode + Debug, V: Fixed> Value<I, K, V>
impl<I: NodeId, K: Decode + Debug, V: Fixed> Value<I, K, V>
pub unsafe fn open(_: OpenConfig) -> Result<Self, OpenError>
pub fn search(&self, key: impl BufOrd<K> + Clone) -> Searched
pub unsafe fn buf_searched(&self, searched: &SearchedFound) -> BufConst<V>
pub unsafe fn buf_mut_searched(&mut self, searched: &SearchedFound) -> BufMut<V>
pub fn buf(&self, key: impl BufOrd<K> + Clone) -> Option<BufConst<V>>
pub fn buf_mut(&mut self, key: impl BufOrd<K> + Clone) -> Option<BufMut<V>>
pub unsafe fn add_searched(
&mut self,
search: &SearchedNotFound,
key: impl BufOrd<K> + Clone,
value: impl Readable<V>,
) -> Result<(), AddError>where
[(); Node<I, K, V>::LEN]:,
pub fn add(
&mut self,
key: impl BufOrd<K> + Clone,
value: impl Readable<V>,
) -> Result<bool, AddError>where
[(); Node<I, K, V>::LEN]:,
pub unsafe fn remove_searched( &mut self, searched: &SearchedFound, ) -> Result<(), RemoveError>
pub fn remove( &mut self, key: impl BufOrd<K> + Clone, ) -> Result<bool, RemoveError>
Auto Trait Implementations§
impl<I, K, V> Freeze for Value<I, K, V>
impl<I, K, V> RefUnwindSafe for Value<I, K, V>
impl<I, K, V> Send for Value<I, K, V>
impl<I, K, V> Sync for Value<I, K, V>
impl<I, K, V> Unpin for Value<I, K, V>
impl<I, K, V> UnwindSafe for Value<I, K, V>
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