/// ```
#[unstable(feature = "btree_range",
reason = "matches collection reform specification, waiting for dust to settle")]
- pub fn range<'a>(&'a self, min: Bound<&K>, max: Bound<&K>) -> Range<'a, K, V> {
+ pub fn range<Min: ?Sized + Ord = K, Max: ?Sized + Ord = K>(&self, min: Bound<&Min>,
+ max: Bound<&Max>)
+ -> Range<K, V> where
+ K: Borrow<Min> + Borrow<Max>,
+ {
range_impl!(&self.root, min, max, as_slices_internal, iter, Range, edges, [])
}
/// let mut map: BTreeMap<&str, i32> = ["Alice", "Bob", "Carol", "Cheryl"].iter()
/// .map(|&s| (s, 0))
/// .collect();
- /// for (_, balance) in map.range_mut(Included(&"B"), Excluded(&"Cheryl")) {
+ /// for (_, balance) in map.range_mut(Included("B"), Excluded("Cheryl")) {
/// *balance += 100;
/// }
/// for (name, balance) in &map {
/// ```
#[unstable(feature = "btree_range",
reason = "matches collection reform specification, waiting for dust to settle")]
- pub fn range_mut<'a>(&'a mut self, min: Bound<&K>, max: Bound<&K>) -> RangeMut<'a, K, V> {
+ pub fn range_mut<Min: ?Sized + Ord = K, Max: ?Sized + Ord = K>(&mut self, min: Bound<&Min>,
+ max: Bound<&Max>)
+ -> RangeMut<K, V> where
+ K: Borrow<Min> + Borrow<Max>,
+ {
range_impl!(&mut self.root, min, max, as_slices_internal_mut, iter_mut, RangeMut,
edges_mut, [mut])
}
}
/// Returns a sub-slice with elements starting with `min_key`.
- pub fn slice_from(self, min_key: &K) -> $NodeSlice<'a, K, V> {
+ pub fn slice_from<Q: ?Sized + Ord>(self, min_key: &Q) -> $NodeSlice<'a, K, V> where
+ K: Borrow<Q>,
+ {
// _______________
// |_1_|_3_|_5_|_7_|
// | | | | |
}
/// Returns a sub-slice with elements up to and including `max_key`.
- pub fn slice_to(self, max_key: &K) -> $NodeSlice<'a, K, V> {
+ pub fn slice_to<Q: ?Sized + Ord>(self, max_key: &Q) -> $NodeSlice<'a, K, V> where
+ K: Borrow<Q>,
+ {
// _______________
// |_1_|_3_|_5_|_7_|
// | | | | |
/// ```
#[unstable(feature = "btree_range",
reason = "matches collection reform specification, waiting for dust to settle")]
- pub fn range<'a>(&'a self, min: Bound<&T>, max: Bound<&T>) -> Range<'a, T> {
+ pub fn range<'a, Min: ?Sized + Ord = T, Max: ?Sized + Ord = T>(&'a self, min: Bound<&Min>,
+ max: Bound<&Max>)
+ -> Range<'a, T> where
+ T: Borrow<Min> + Borrow<Max>,
+ {
fn first<A, B>((a, _): (A, B)) -> A { a }
let first: fn((&'a T, &'a ())) -> &'a T = first; // coerce to fn pointer