pub fn range<Q: ?Sized, R>(&self, range: R) -> Range<'_, K, V>
    where
        R: RangeBounds<Q>,
        Q: Ord,
        K: Borrow<Q>,
    {
        Range {
            imp: if let Some(root) = self.root.as_ref() {
                let root_node = root.reborrow();
                search::IterImpl::range(root_node, range)
            } else {
                search::IterImpl::none()
            },
        }
    }
/// Returns an iterator over a sub-range of entries in the map.
///
/// # Panics
///
/// Panics if range `start > end`.
/// Panics if range `start == end` and both bounds are `Excluded`.
///
/// # Examples
///
/// ```
/// use bptree::BpTreeMap;
///
/// let map = BpTreeMap::from([(2, "Two"), (6, "Six"), (11, "Eleven")]);
/// assert_eq!(map.range(2..).next(), Some((&2, &"Two")));
/// assert_eq!(map.range(..6).next(), Some((&2, &"Two")));
/// ```
Returns an iterator over a sub-range of entries in the map.
Returns an iterator over a sub - range of entries in the map .
pub fn range<Q: ?Sized, R>(&self, range: R) -> Range<'_, K, V>
    where
        R: RangeBounds<Q>,
        Q: Ord,
        K: Borrow<Q>,
    {
        Range {
            imp: if let Some(root) = self.root.as_ref() {
                let root_node = root.reborrow();
                search::IterImpl::range(root_node, range)
            } else {
                search::IterImpl::none()
            },
        }
    }
pub fn range < Q : ? Sized , R > ( & self , range : R ) -> Range < ' _ , K , V > where R : RangeBounds < Q > , Q : Ord , K : Borrow < Q > , { Range { imp : if let Some ( root ) = self . root . as_ref ( ) { let root_node = root . reborrow ( ) ; search :: IterImpl :: range ( root_node , range ) } else { search :: IterImpl :: none ( ) } , } }
Returns an iterator over a sub-range of entries in the map.
Returns an iterator over a sub - range of entries in the map .
&self
range
R
&self
range
R
panics
Panics if range `start > end`.
Panics if range `start == end` and both bounds are `Excluded`.
Panics if range ` start > end ` . Panics if range ` start == end ` and both bounds are ` Excluded ` .
examples
```
use bptree::BpTreeMap.


` ` ` use bptree :: BpTreeMap .