@@ -64,12 +64,12 @@ use vec::Vec;
64
64
/// println!("{}: {}", key, value);
65
65
/// }
66
66
///
67
- /// // Print 1, 2, 3
67
+ /// // Prints 1, 2, 3
68
68
/// for key in map.keys() {
69
69
/// println!("{}", key);
70
70
/// }
71
71
///
72
- /// // Print `foo`, `bar`, `quux`
72
+ /// // Prints `foo`, `bar`, `quux`
73
73
/// for key in map.values() {
74
74
/// println!("{}", key);
75
75
/// }
@@ -108,7 +108,7 @@ use vec::Vec;
108
108
/// // Implement `Ord` and sort trolls by level.
109
109
/// impl<'a> Ord for Troll<'a> {
110
110
/// fn cmp(&self, other: &Troll) -> Ordering {
111
- /// // If we swap `self` and `other`, we get descended ordering.
111
+ /// // If we swap `self` and `other`, we get descending ordering.
112
112
/// self.level.cmp(&other.level)
113
113
/// }
114
114
/// }
@@ -290,7 +290,6 @@ impl<K: Ord, V> TreeMap<K, V> {
290
290
}
291
291
292
292
/// Get a lazy iterator over the key-value pairs in the map, in ascending order.
293
- /// Requires that it be frozen (immutable).
294
293
///
295
294
/// # Example
296
295
///
@@ -316,7 +315,6 @@ impl<K: Ord, V> TreeMap<K, V> {
316
315
}
317
316
318
317
/// Get a lazy reverse iterator over the key-value pairs in the map, in descending order.
319
- /// Requires that it be frozen (immutable).
320
318
///
321
319
/// # Example
322
320
///
@@ -972,7 +970,7 @@ impl<'a, T> Iterator<&'a T> for RevSetItems<'a, T> {
972
970
/// // Implement `Ord` and sort trolls by level.
973
971
/// impl<'a> Ord for Troll<'a> {
974
972
/// fn cmp(&self, other: &Troll) -> Ordering {
975
- /// // If we swap `self` and `other`, we get descended ordering.
973
+ /// // If we swap `self` and `other`, we get descending ordering.
976
974
/// self.level.cmp(&other.level)
977
975
/// }
978
976
/// }
0 commit comments