@@ -22,7 +22,6 @@ use super::Recover;
22
22
/// to any other item, as determined by the [`Ord`] trait, changes while it is in the set. This is
23
23
/// normally only possible through [`Cell`], [`RefCell`], global state, I/O, or unsafe code.
24
24
///
25
- /// [`BTreeMap`]: struct.BTreeMap.html
26
25
/// [`Ord`]: ../../std/cmp/trait.Ord.html
27
26
/// [`Cell`]: ../../std/cell/struct.Cell.html
28
27
/// [`RefCell`]: ../../std/cell/struct.RefCell.html
@@ -78,8 +77,7 @@ impl<T: Clone> Clone for BTreeSet<T> {
78
77
/// This `struct` is created by the [`iter`] method on [`BTreeSet`].
79
78
/// See its documentation for more.
80
79
///
81
- /// [`BTreeSet`]: struct.BTreeSet.html
82
- /// [`iter`]: struct.BTreeSet.html#method.iter
80
+ /// [`iter`]: BTreeSet::iter
83
81
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
84
82
pub struct Iter < ' a , T : ' a > {
85
83
iter : Keys < ' a , T , ( ) > ,
@@ -97,8 +95,7 @@ impl<T: fmt::Debug> fmt::Debug for Iter<'_, T> {
97
95
/// This `struct` is created by the [`into_iter`] method on [`BTreeSet`]
98
96
/// (provided by the `IntoIterator` trait). See its documentation for more.
99
97
///
100
- /// [`BTreeSet`]: struct.BTreeSet.html
101
- /// [`into_iter`]: struct.BTreeSet.html#method.into_iter
98
+ /// [`into_iter`]: BTreeSet#method.into_iter
102
99
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
103
100
#[ derive( Debug ) ]
104
101
pub struct IntoIter < T > {
@@ -110,8 +107,7 @@ pub struct IntoIter<T> {
110
107
/// This `struct` is created by the [`range`] method on [`BTreeSet`].
111
108
/// See its documentation for more.
112
109
///
113
- /// [`BTreeSet`]: struct.BTreeSet.html
114
- /// [`range`]: struct.BTreeSet.html#method.range
110
+ /// [`range`]: BTreeSet::range
115
111
#[ derive( Debug ) ]
116
112
#[ stable( feature = "btree_range" , since = "1.17.0" ) ]
117
113
pub struct Range < ' a , T : ' a > {
@@ -194,8 +190,7 @@ where
194
190
/// This `struct` is created by the [`difference`] method on [`BTreeSet`].
195
191
/// See its documentation for more.
196
192
///
197
- /// [`BTreeSet`]: struct.BTreeSet.html
198
- /// [`difference`]: struct.BTreeSet.html#method.difference
193
+ /// [`difference`]: BTreeSet::difference
199
194
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
200
195
pub struct Difference < ' a , T : ' a > {
201
196
inner : DifferenceInner < ' a , T > ,
@@ -227,8 +222,7 @@ impl<T: fmt::Debug> fmt::Debug for Difference<'_, T> {
227
222
/// This `struct` is created by the [`symmetric_difference`] method on
228
223
/// [`BTreeSet`]. See its documentation for more.
229
224
///
230
- /// [`BTreeSet`]: struct.BTreeSet.html
231
- /// [`symmetric_difference`]: struct.BTreeSet.html#method.symmetric_difference
225
+ /// [`symmetric_difference`]: BTreeSet::symmetric_difference
232
226
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
233
227
pub struct SymmetricDifference < ' a , T : ' a > ( MergeIterInner < Iter < ' a , T > > ) ;
234
228
@@ -244,8 +238,7 @@ impl<T: fmt::Debug> fmt::Debug for SymmetricDifference<'_, T> {
244
238
/// This `struct` is created by the [`intersection`] method on [`BTreeSet`].
245
239
/// See its documentation for more.
246
240
///
247
- /// [`BTreeSet`]: struct.BTreeSet.html
248
- /// [`intersection`]: struct.BTreeSet.html#method.intersection
241
+ /// [`intersection`]: BTreeSet::intersection
249
242
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
250
243
pub struct Intersection < ' a , T : ' a > {
251
244
inner : IntersectionInner < ' a , T > ,
@@ -277,8 +270,7 @@ impl<T: fmt::Debug> fmt::Debug for Intersection<'_, T> {
277
270
/// This `struct` is created by the [`union`] method on [`BTreeSet`].
278
271
/// See its documentation for more.
279
272
///
280
- /// [`BTreeSet`]: struct.BTreeSet.html
281
- /// [`union`]: struct.BTreeSet.html#method.union
273
+ /// [`union`]: BTreeSet::union
282
274
#[ stable( feature = "rust1" , since = "1.0.0" ) ]
283
275
pub struct Union < ' a , T : ' a > ( MergeIterInner < Iter < ' a , T > > ) ;
284
276
0 commit comments