pub enum TreeNodeStore<N>{
Write(TreeWriteCache<N>),
Read(TreeReadCache<N>),
Traversal(TreeNodeProvider),
}
Variants§
Write(TreeWriteCache<N>)
caches every read nodes, and keeps track of updated and created nodes
Read(TreeReadCache<N>)
Uses an LRU cache to keep in memory the last node read
Traversal(TreeNodeProvider)
Read the nodes from the KV store without any cache
Implementations§
Source§impl<N> TreeNodeStore<N>
impl<N> TreeNodeStore<N>
pub fn new( keys: TreeNodeProvider, store_type: TreeStoreType, read_size: usize, ) -> Arc<Mutex<Self>>
Auto Trait Implementations§
impl<N> Freeze for TreeNodeStore<N>
impl<N> RefUnwindSafe for TreeNodeStore<N>where
N: RefUnwindSafe,
impl<N> Send for TreeNodeStore<N>where
N: Send,
impl<N> Sync for TreeNodeStore<N>where
N: Sync,
impl<N> Unpin for TreeNodeStore<N>where
N: Unpin,
impl<N> UnwindSafe for TreeNodeStore<N>where
N: UnwindSafe + RefUnwindSafe,
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<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§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