提交 4920721f 编写于 作者: D djzin

update docs with new syntax

上级 60bab567
......@@ -656,11 +656,11 @@ pub fn append(&mut self, other: &mut Self) {
}
/// Constructs a double-ended iterator over a sub-range of elements in the map.
/// The simplest way is to use the range synax `min..max`, thus `range(..)` will
/// yield the whole collection.
/// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
/// yield elements from min (inclusive) to max (exclusive).
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range from 4 to 10.
///
/// # Examples
///
......@@ -748,11 +748,11 @@ pub fn range<T: ?Sized, R>(&self, range: R) -> Range<K, V>
}
/// Constructs a mutable double-ended iterator over a sub-range of elements in the map.
/// The simplest way is to use the range synax `min..max`, thus `range(..)` will
/// yield the whole collection.
/// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
/// yield elements from min (inclusive) to max (exclusive).
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range from 4 to 10.
///
/// # Examples
///
......
......@@ -208,11 +208,11 @@ pub fn iter(&self) -> Iter<T> {
impl<T: Ord> BTreeSet<T> {
/// Constructs a double-ended iterator over a sub-range of elements in the set.
/// The simplest way is to use the range synax `min..max`, thus `range(..)` will
/// yield the whole collection.
/// The simplest way is to use the range synax `min..max`, thus `range(min..max)` will
/// yield elements from min (inclusive) to max (exclusive).
/// The range may also be entered as `(Bound<T>, Bound<T>)`, so for example
/// `range((Excluded(4), Included(10)))` will yield a left-exclusive, right-inclusive
/// range.
/// range from 4 to 10.
///
/// # Examples
///
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册