Struct radarbase::binarytree::BinarytreeRangeIter
source · pub struct BinarytreeRangeIter<'a, T: RangeBounds<&'a [u8]>, K: RadbKey + ?Sized> {
last: Option<RangeIterState<'a>>,
table_id: u64,
query_range: T,
reversed: bool,
manager: &'a PageManager,
_key_type: PhantomData<K>,
}
Fields§
§last: Option<RangeIterState<'a>>
§table_id: u64
§query_range: T
§reversed: bool
§manager: &'a PageManager
§_key_type: PhantomData<K>
Implementations§
source§impl<'a, T: RangeBounds<&'a [u8]>, K: RadbKey + ?Sized> BinarytreeRangeIter<'a, T, K>
impl<'a, T: RangeBounds<&'a [u8]>, K: RadbKey + ?Sized> BinarytreeRangeIter<'a, T, K>
pub(crate) fn new( root_page: Option<Page<'a>>, table_id: u64, query_range: T, manager: &'a PageManager ) -> Self
pub(crate) fn new_reversed( root_page: Option<Page<'a>>, table_id: u64, query_range: T, manager: &'a PageManager ) -> Self
pub fn next(&mut self) -> Option<EntryAccessor<'_>>
Auto Trait Implementations§
impl<'a, T, K> !RefUnwindSafe for BinarytreeRangeIter<'a, T, K>
impl<'a, T, K> !Send for BinarytreeRangeIter<'a, T, K>
impl<'a, T, K> !Sync for BinarytreeRangeIter<'a, T, K>
impl<'a, T, K: ?Sized> Unpin for BinarytreeRangeIter<'a, T, K>
impl<'a, T, K> !UnwindSafe for BinarytreeRangeIter<'a, T, K>
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