pub fn find<'a, L>(&'a self, location: &'a L) -> AnnotMapIterator<'a, R, T>
    where
        L: Loc<RefID = R>,
    {
        if let Some(itree) = self.refid_itrees.get(location.refid()) {
            let interval = location.start()..(location.start() + (location.length() as isize));
            let itree_iter = itree.find(interval);
            AnnotMapIterator {
                itree_iter: Some(itree_iter),
                refid: location.refid(),
            }
        } else {
            AnnotMapIterator {
                itree_iter: None,
                refid: location.refid(),
            }
        }
    }
/// Create an `Iterator` that will visit all entries that overlap
/// a query location.
Create an `Iterator` that will visit all entries that overlap
a query location.
Create an ` Iterator ` that will visit all entries that overlap a query location .
pub fn find<'a, L>(&'a self, location: &'a L) -> AnnotMapIterator<'a, R, T>
    where
        L: Loc<RefID = R>,
    {
        if let Some(itree) = self.refid_itrees.get(location.refid()) {
            let interval = location.start()..(location.start() + (location.length() as isize));
            let itree_iter = itree.find(interval);
            AnnotMapIterator {
                itree_iter: Some(itree_iter),
                refid: location.refid(),
            }
        } else {
            AnnotMapIterator {
                itree_iter: None,
                refid: location.refid(),
            }
        }
    }
pub fn find < ' a , L > ( & ' a self , location : & ' a L ) -> AnnotMapIterator < ' a , R , T > where L : Loc < RefID = R > , { if let Some ( itree ) = self . refid_itrees . get ( location . refid ( ) ) { let interval = location . start ( ) .. ( location . start ( ) + ( location . length ( ) as isize ) ) ; let itree_iter = itree . find ( interval ) ; AnnotMapIterator { itree_iter : Some ( itree_iter ) , refid : location . refid ( ) , } } else { AnnotMapIterator { itree_iter : None , refid : location . refid ( ) , } } }
Create an `Iterator` that will visit all entries that overlap
a query location.
Create an ` Iterator ` that will visit all entries that overlap a query location .
&'a self
location
&'a L
&'a self
location
&'a L