pub async fn seek(&mut self, bound: Bound<&K>) -> Result<MergerIterator<'_, 'a, K, V>, Error> {
        let pending_iterators = self.iterators.iter_mut().rev().collect();
        let mut merger_iter = MergerIterator {
            merge_fn: self.merge_fn,
            pending_iterators,
            heap: BinaryHeap::new(),
            item: CurrentItem::None,
            must_use_advance_with_hint: false,
        };
        merger_iter.seek(bound).await?;
        Ok(merger_iter)
    }
/// Seek searches for |bound|.  If |bound| is Bound::Unbounded, the iterator is positioned on
/// the first item.  If |bound| is Bound::Included(key), the iterator is positioned on an item
/// such that item.key >= key.  In the latter case, a full merge might not occur; only the
/// layers that need to be consulted to satisfy the query will occur, and afterwards,
/// advance_with_hint must be used rather advance if there's a need to move on to the next
/// element.
Seek searches for |bound|.  If |bound| is Bound::Unbounded, the iterator is positioned on
the first item.  If |bound| is Bound::Included(key), the iterator is positioned on an item
such that item.key >= key.  In the latter case, a full merge might not occur; only the
layers that need to be consulted to satisfy the query will occur, and afterwards,
advance_with_hint must be used rather advance if there's a need to move on to the next
element.
Seek searches for |bound| . If |bound| is Bound :: Unbounded the iterator is positioned on the first item . If |bound| is Bound :: Included ( key ) the iterator is positioned on an item such that item . key > = key . In the latter case a full merge might not occur ; only the layers that need to be consulted to satisfy the query will occur and afterwards advance_with_hint must be used rather advance if there ' s a need to move on to the next element .
pub async fn seek(&mut self, bound: Bound<&K>) -> Result<MergerIterator<'_, 'a, K, V>, Error> {
        let pending_iterators = self.iterators.iter_mut().rev().collect();
        let mut merger_iter = MergerIterator {
            merge_fn: self.merge_fn,
            pending_iterators,
            heap: BinaryHeap::new(),
            item: CurrentItem::None,
            must_use_advance_with_hint: false,
        };
        merger_iter.seek(bound).await?;
        Ok(merger_iter)
    }
pub async fn seek ( & mut self , bound : Bound < & K > ) -> Result < MergerIterator < ' _ , ' a , K , V > , Error > { let pending_iterators = self . iterators . iter_mut ( ) . rev ( ) . collect ( ) ; let mut merger_iter = MergerIterator { merge_fn : self . merge_fn , pending_iterators , heap : BinaryHeap :: new ( ) , item : CurrentItem :: None , must_use_advance_with_hint : false , } ; merger_iter . seek ( bound ) . await ? ; Ok ( merger_iter ) }
Seek searches for |bound|.
Seek searches for |bound| .
&mut self
bound
Bound<&K>
&mut self
bound
Bound<&K>